Course Hero

Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

3 Pages

NVL

Course: COMP 2400, Fall 2009
School: Allan Hancock College
Rating:
 
 
 
 
 

Word Count: 161

Document Preview

set SQL> pagesize 250 SQL> select nvl(soldto, 'No-one'), movieid 2 from video; NVL(SOLDTO MOVIEID ---------- ---------- No-one 1 No-one 2 No-one 3 No-one 5 No-one 7 2001/00002 11 2001/00002 13 2001/00002 17 2001/00002 19 2001/00003 23 2001/00003 26 2001/00003 12 2001/00001...

Register Now
Search

Unformatted Document Excerpt

Coursehero >> California >> Allan Hancock College >> COMP 2400

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
set SQL> pagesize 250 SQL> select nvl(soldto, 'No-one'), movieid 2 from video; NVL(SOLDTO MOVIEID ---------- ---------- No-one 1 No-one 2 No-one 3 No-one 5 No-one 7 2001/00002 11 2001/00002 13 2001/00002 17 2001/00002 19 2001/00003 23 2001/00003 26 2001/00003 12 2001/00001 4 No-one 6 No-one 6 No-one 200 No-one 200 No-one 200 No-one 200 No-one 200 2001/00001 30 No-one 6 No-one 6 No-one 201 No-one 201 No-one 125 No-one 125 No-one 124 2001/00005 44 2001/00002 4 2002/00042 44 2002/00001 125 2002/00001 125 2002/00001 124 2002/00001 4 2002/00001 4 2001/00003 44 37 rows selected. SQL> select nvl(soldto, 0), movieid 2 from video; NVL(SOLDTO MOVIEID ---------- ---------- 0 1 0 2 0 3 0 5 0 7 2001/00002 11 2001/00002 13 2001/00002 17 2001/00002 19 2001/00003 23 2001/00003 26 2001/00003 12 2001/00001 4 0 6 0 6 0 200 0 200 0 200 0 200 0 200 2001/00001 30 0 6 0 6 0 201 0 201 0 125 0 125 0 124 2001/00005 44 2001/00002 4 2002/00042 44 2002/00001 125 2002/00001 124 2002/00001 125 2002/00001 4 2002/00001 4 2001/00003 44 37 rows selected. SQL> select coursecode, studentid, nvl(mark, 0) 2 from comp2400.enrolment; COURSECO STUDENTID NVL(MARK,0) -------- ---------- ----------- COMP1100 2010001 67 COMP1110 2010001 0 COMP2400 2010001 0 MATH1003 2010001 81 MATH1003 2010035 55 COMP1100 2010035 61 COMP1110 2010035 58 COMP2400 2010035 0 INFS2004 2010035 0 BUSN1001 2010035 66 MATH1003 2010018 79 BUSN1001 2010052 44 COMP1100 2010052 0 BUSN1001 2010052 53 COMP1100 2010052 0 COMP1110 2010052 0 COMP1100 2010069 78 COMP3100 2010069 70 COMP2400 2010069 76 19 rows selected. SQL> select coursecode, studentid, nvl(mark, 'None') 2 from comp2400.enrolment; select coursecode, studentid, nvl(mark, 'None') * ERROR at li...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Allan Hancock College - COMP - 2031
0 1 2 3 4 5 6 7 -19 3 5 6 2 -12 3 -10 -1
Allan Hancock College - COMP - 2300
2006 COMP2300 Exam Q2 (C Programming)[20 marks](a) Write a function int palindrome(char *str, int len) which for thegiven input string str of length len determines if it is a palindrome ornot. A palindrome is defined as a sequence of charact
Allan Hancock College - COMP - 2300
COMP2300-2006-CourseAdminThe Australian National University1Faculty of Engineering & Information TechnologyDepartment of Computer Science COMP2300-2006-CourseAdmin 2006 Course Administration1 PreambleThis document gives a brief description o
Allan Hancock College - COMP - 2300
COMP2300-2007-CourseAdminThe Australian National University1Faculty of Engineering & Information TechnologyDepartment of Computer Science COMP2300-2007-CourseAdmin 2007 Course Administration1 PreambleThis document gives a brief description o
Allan Hancock College - COMP - 2300
Data Representationq Refs: O'H&Bryant sect 2.1,2.4, Null&Lobur sect 2.52.7, Tanembaum appendix B,related web linksq bit, byte and word q characters and strings, ASCII q big-endian, little-endian q representing real numbersCOMP2300 D2: Data Rep
Allan Hancock College - COMP - 2300
PeANUt Module OverviewPeANUt The Basicsq a simple microprocessor simulator for teaching purposes q main topics: s s s sPeANUt architecture, machine and assembly language programming branches and conditions, loops, input/output, traps, macros p
Allan Hancock College - COMP - 2300
From Physical Memory To Virtual Memory: Understanding the Memory HierarchyAlistair RendellMemory Chips: DRAM Alternative to SRAM 1 capacitor and 1 transistorData off line Capacitor stores (10-15F) Just 40,000 electrons!Address LineTransi
Allan Hancock College - COMP - 2300
THE AUSTRALIAN NATIONAL UNIVERSITY Mid Semester Examination, April 2007 COMP2300 (Introduction to Computer Systems ) Writing Period: 1 hour duration Study Period: 0 minutes duration Permitted Materials: One A4 page with notes on both sides. NO calcul
Allan Hancock College - COMP - 2300
PeANUt Module Overviewq a simple microprocessor simulator for teaching purposes q main topics: s s s sPeANUt architecture, machine language and assembler programming branches and conditions, loops, input/output, traps, macros procedures and functi
Allan Hancock College - COMP - 2300
Allan Hancock College - COMP - 2300
Consider ( x 1)( x 7) y= ( x 11)With x = 10 we may proceed as (10-1) = 9 (10-7) = 3 Writing (9*3) = 27 intermediates on paper (10-11) = -1 27/(-1) = -27A Stack A Last In First Out (LIFO) data structure Consider a pile of paper we can pu
Allan Hancock College - COMP - 2300
COMP2300: OS and VM-related exam questions, 2007Q4(b) In both paging and set-associative caches, the least recently used(LRU), first-in-first-out (FIFO) and random replacement policies may beused. In general, which of these performs best and wh
Allan Hancock College - C - 2300
#include <stdio.h>int main(){ int i, total; total=0; for (i=0; i<20; i+) { if (i < 8 ){ continue; } else if (i > 4 & i < 12){ total=total+i; } else if (i > 10) { break; } else { tota
Allan Hancock College - COMP - 2300
#include <stdio.h>int main(){ int i, total; total=0; for (i=0; i<20; i+) { if (i < 8 ){ continue; } else if (i > 4 & i < 12){ total=total+i; } else if (i > 10) { break; } else { tota
Allan Hancock College - COMP - 2300
Assembly Level Machine OrganisationLecture 4Procedures in PeANUt Number systems (bases) in .mli les Procedure / function calls Nested procedures The stack Stack pointer Stack addressing mode Stack frame Reference: Specication of the PeANU
Allan Hancock College - COMP - 2300
Assembly Level Machine OrganisationLecture 9Bit operations and traps in PeANUt Bitwise operations Traps Trap concept PeANUt traps Trap handler and trap table Debugging References: Specification of the PeANUt computer (2.8.3 and Appendix B
Allan Hancock College - COMP - 2300
Module 2: The C programming languageLecture 4Various C assert(.) Multi-module programs #dene (Macros) Compilation and linking revisited The last word on C1COMP2300, 2006Module 2: The C programming languageLecture 4assert(.) assert
Allan Hancock College - COMP - 2300
Assembly Level Machine OrganisationLecture 1PeANUt Module Overview A simple microprocessor simulator for teaching purposes Main topics PeANUt architecture, machine language and assembly programming Branches and conditions, loops, input/outpu
Allan Hancock College - COMP - 2300
Assembly Level Machine OrganisationLecture 7Some announcements Assignment 1 is due next Wednesday 5th April at 12:00 (noon) Assignment 2 will be released towards the end of next week (draft version rst) (due in week 11, Wednesday 17th May) Lab
Allan Hancock College - COMP - 2300
Welcome to COMP2300 Introduction to Computer SystemsUltraSPARC III Cu processor layout(a rather advanced computer system!)COMP2300 2006 Lecture 1: Introduction20061Course Contactq Course web site: http:/cs.anu.edu.au/Student/comp23
Allan Hancock College - COMP - 2300
Examination Preparation LectureFinal examination Saturday, 17 June, 9:15 am 12:30 am, Sports Hall Please verify date, time and location 15 minutes reading time (9:15-9:30) Permitted material: A4 page (one sheet) with notes on both sides (no a
Allan Hancock College - COMP - 2300
Memory Systems and Modern MachinesLecture 2Announcements Assignment 1 will be returned in labs this week and marks will become available in StReaMS tomorrow (Tuesday) Some students will not see any marks (but will receive an e-mail.) :-( Lab 5
Allan Hancock College - COMP - 2300
#include<stdio.h> int main(void) { FILE *fp; int i; fp = fopen("myfile.txt","r+");
Allan Hancock College - C - 2300
#include <stdio.h>int main(void) { short int *x; /* x is a pointer to a variable of type int */ short int a = 2; printf(" sizeof(a) = %d\n",sizeof(a); printf(" sizeof(x) = %d\n",sizeof(x); x = &a; /* The address of a is assigned to
Allan Hancock College - COMP - 2300
#include <stdio.h>int main(void) { short int *x; /* x is a pointer to a variable of type int */ short int a = 2; printf(" sizeof(a) = %d\n",sizeof(a); printf(" sizeof(x) = %d\n",sizeof(x); x = &a; /* The address of a is assigned to
Allan Hancock College - C - 2300
#include <stdio.h> void next_year(int *y); int main(void) { int this_year; this_year = 1981; next_year(&this_year); printf("Year: %d\n", this_year); return 0;}void next_year(int *y) {
Allan Hancock College - COMP - 2300
#include <stdio.h> void next_year(int *y); int main(void) { int this_year; this_year = 1981; next_year(&this_year); printf("Year: %d\n", this_year); return 0;}void next_year(int *y) {
Allan Hancock College - COMP - 2300
Welcome to COMP2300 Introduction to Computer SystemsUltraSPARC III Cu processor layout(a rather advanced computer system!)COMP2300 Lecture 1: Introduction20071Course Contactq course web site: http:/cs.anu.edu.au/Student/comp2300 q
Allan Hancock College - COMP - 2300
COMP2300 - TuteLab 05file:/home/peter/comp2300/doc/html/TuteLab05.htmlCOMP2300 Tutorial / Laboratory 05 - PeANUt ExperimentsSemester 1, 2007 Week 6 (26 March - 30 March)Note that for this session, there is a submitable laboratory exersise which
East Los Angeles College - GEOG - 5025
GEOG5021M: Using Databases and GIS Unit 1 PracticalUsing Access: Database Creation, Query Construction and Reporting IntroductionThe practical is in three parts. The first part gets you started with Microsoft Access by requiring you to build your o
Allan Hancock College - COMP - 2300
Evolution of the Computerq Refs: [O'H&Bryant, ch 1,3.1]; TextRefNull&Loburch 1; [Tanembaum, Ch 1,2];related web linksq history q computer technology & and von Neumann architecture q architecture s central processing unit (CPU) s arithmetic logic
Allan Hancock College - COMP - 2300
Further PeANUtq Ref: [PeANUt Spec, ]; also [OH&Bryant, sect 3.6] q traps: s input and output s relationship with exceptions q conditional branches: s condition codes (part of PSW register) s branch instructions s repetition q index register and inde
Allan Hancock College - COMP - 2300
Course Review and Exam Discussionq review Q4(a) from 2006 exam (maybe a few others) q final examination: s details s topics q review of major underlying themes q outlook for computer systems q other issues: s 14:0014:15: CEDAM Surveys x please take
Allan Hancock College - COMP - 2300
COMP2300-2007-02The Australian National University1Faculty of Engineering & Information TechnologyDepartment of Computer Science COMP2300-2007-02 Notes for Tutorial/Laboratory Session 03: C I/O, Pointers and StructuresNo preparation exercise a
Allan Hancock College - COMP - 2300
Procedure Calls and Address Parameters in PeANUtq ref: [PeANUt Spec, sect 4] q procedure calls s with local variables s with return values (non-void functions) q address parameters s ability to modify data s indirect memory reference via pointers q
Allan Hancock College - COMP - 2300
Virtual Memory in PeANUtq ref: [PeANUt Spec, sect 3]; additionally [O'H&Bryant, sect 10.110.7] or[Null&Lobur, sect 6.5]q virtual memory implementation s page tables q virtual memory in PeANUt s page replacement s paging behaviour s working sets q
Allan Hancock College - COMP - 2300
42
Allan Hancock College - COMP - 2300
/* Rename this file as: factorial.c */#include <assert.h>#include "factorial.h"int factorial(int n){ int value,i; assert(n>=0); value=1; i=2; while (i <= n) value*=i+; return value;}
Allan Hancock College - COMP - 2300
COMP2300: SPARC & OS, 20064(e) Consider the SPARC assembler program example0.s below, annotatedwith the corresponding C program in comments (the C code can assumed tobe equivalent). The programs compiled using the commands gcc -c exa
Allan Hancock College - C - 2300
#include <stdio.h>int main(void) { short int *x; /* x is a pointer to a variable of type int */ short int a = 2; printf(" sizeof(a) = %d\n", sizeof(a); printf(" sizeof(x) = %d\n", sizeof(x); x = &a; /* the address of a is assigned
Allan Hancock College - COMP - 2300
#include <stdio.h>int main(void) { short int *x; /* x is a pointer to a variable of type int */ short int a = 2; printf(" sizeof(a) = %d\n", sizeof(a); printf(" sizeof(x) = %d\n", sizeof(x); x = &a; /* the address of a is assigned
Allan Hancock College - C - 2300
#include <stdio.h> void nextYear(int *y); int main(void) { int thisYear; thisYear = 1981; nextYear(&thisYear); printf("Year: %d\n", thisYear); return 0;}void nextYear(int *y) { *y = *y + 1;
Allan Hancock College - COMP - 2300
#include <stdio.h> void nextYear(int *y); int main(void) { int thisYear; thisYear = 1981; nextYear(&thisYear); printf("Year: %d\n", thisYear); return 0;}void nextYear(int *y) { *y = *y + 1;
Allan Hancock College - COMP - 2300
/ simple C program to demmonstate loop unriolling#include <stdio.h>#define VEC_LEN 10int main(void) { int i, n = VEC_LEN; int x[VEC_LEN]; / original loop for (i=0; i < n; i+) { x[i] = 2*i; } / unrolled loop for (i=0; i+1 <
Allan Hancock College - C - 2300
#include <stdio.h> #include "myLibrary.h"int main(void) { float x = pi(); displayFloat(x); return 0;}
Allan Hancock College - COMP - 2300
#include <stdio.h> #include "myLibrary.h"int main(void) { float x = pi(); displayFloat(x); return 0;}
East Los Angeles College - GEOG - 5041
Geog5041M Advanced Proprietary GIS Unit 4 NotesTables, Map Display and ProjectionsThe aims of this unit are to explain: how to manipulate attribute tables in ArcMap methods for displaying data and saving map output projections and coordinate sy
Allan Hancock College - C - 2300
/* Examples of GCC-style inline assembler in C code.These are used in a parallel implmeentation of the Valgrind instructionset simulation framework (www.valgrind.org).Below is the code currently used to simulate an x86 an atomic exchange instr
Allan Hancock College - COMP - 2300
/* Examples of GCC-style inline assembler in C code.These are used in a parallel implmeentation of the Valgrind instructionset simulation framework (www.valgrind.org).Below is the code currently used to simulate an x86 an atomic exchange instr
Allan Hancock College - C - 2300
#include<stdio.h>#include<string.h> void uppercase(char string[]); int main(void) { char vowels[6]; strcpy(vowels, "aeiou"); printf("%s\n", vowels
Allan Hancock College - COMP - 2300
#include<stdio.h>#include<string.h> void uppercase(char string[]); int main(void) { char vowels[6]; strcpy(vowels, "aeiou"); printf("%s\n", vowels
Allan Hancock College - COMP - 2300
Data RepresentationCharacters and Stringsq Refs: [O'H&Bryant, sect 2.1,2.4], [Null&Lobur, sect 2.52.7], [Tanembaum,appendix B], related web linksq text can be stored in memory by using a number to represent every character s ASCII (American St
Allan Hancock College - COMP - 2300
THE AUSTRALIAN NATIONAL UNIVERSITY First Semester Examination, June 2007 COMP2300 (Introduction to Computer Systems) Writing Period: 3 hours duration Study Period: 15 minutes duration Permitted Materials: One A4 page with notes on both sides. NO calc
Allan Hancock College - COMP - 2300
THE AUSTRALIAN NATIONAL UNIVERSITY First Semester Examination June 2005 COMP2300 Introduction to Computer Systems Study Period: 15 minutes Time Allowed: 3 hours Permitted Materials: One A4 page with notes on both sides. NO calculator permitted. Ques
Allan Hancock College - COMP - 2300
Further PeANUtq Ref: [PeANUt Spec, ]; also [OH&Bryant, sect 3.6] q traps: s input and output s relationship with exceptions q conditional branches: s condition codes (part of PSW register) s branch instructions s repetition q index register and inde
Allan Hancock College - COMP - 2300
/* read number from text file */#include<stdio.h> int main(void) { FILE *fp; int i; fp = fope
Allan Hancock College - CXJ - 109
INSTITUTE OF PHYSICS PUBLISHING Nanotechnology 17 (2006) 53735377NANOTECHNOLOGY doi:10.1088/0957-4484/17/21/015Recombination properties of Si-doped InGaAs/GaAs quantum dotsJ Siegert1 , S Marcinkevi ius1 , L Fu2 and C Jagadish2 cDepartment of Mi
Allan Hancock College - TDM - 110
July 2007EPL, 79 (2007) 24003 doi: 10.1209/0295-5075/79/24003 www.epljournal.orgAn invariant distribution in static granular media T. Aste1 , T. Di Matteo1 , M. Saadatfar1,2 , T. J. Senden1 , Matthias Schroter3 and Harry L. Swinney3 Department of
Allan Hancock College - CXJ - 109
APPLIED PHYSICS LETTERS 89, 182109 2006Observation of coherent biexcitons in ZnO / ZnMgO multiple quantum wells at room temperatureJeffrey A. Davis,a Lap Van Dao, Xiaoming Wen, and Peter HannafordARC Centre of Excellence for Coherent X-Ray Scienc
Allan Hancock College - TJS - 110
The Electron Microscopy Unit Started by Dr Sally Stowe 15 years ago Includes 10 columns across campus 8 staff mostly in centralised facility Interfaces with research infrastructure @ ANU now looking to consolidate and to bring in emerging techno
Allan Hancock College - TJS - 110
Summary of Case Identifying the Relevant Selection Criteria:John Fitz Gerald has made a sustained and valuable contribution to microscopy services and science for 23 years. Below is a detailed summary of this contribution. Outstanding service or co