18-08-2012, 10:40 AM
Final Exam Question Paper
Final Exam.doc (Size: 215.5 KB / Downloads: 41)
Questions
What is a numbering system?
What is the binary numbering system?
What is the purpose of an abstract data type?
What is a variable?
What is the integer abstract data type group?
What does the term “floating-point” mean?
What is a character?
What is the difference between single and double precision?
What is an instance of a structure?
What kind of data type is a structure?
How do you reference an element of an instance of a structure?
What are three major elements of every class definition?
What is the difference between a class definition and a structure definition?
What is the hexadecimal numbering system?
How do you assign an address to a pointer?
What value is stored in a pointer variable?
Why do you use pointer arithmetic?
What is a pointer-to-pointer variable?
What is an array of elements?
What is an index?
What is an array of pointers?
What is a multidimensional array?
What is the purpose of using a multidimensional array?
What is the relationship between a pointer and an array?
What is the relationship between a stack and an array?
What is the action called that places data on a stack?
What is the action called that removes data from a stack?
Using an array, how do you determine whether the stack is empty?
Using an array, how do you determine whether the stack is full?
What is a queue?
Where is data organized in a queue stored?
What does the term “circular queue” mean?
What is the modulus operator used for with respect to circular queues?
When would you implement a queue using a linked list instead of an array?
What is the action called that places data on a queue?
What is the action called that removes data from a queue?
What is a linked list?
What is an entry in a linked list called?
How are nodes linked together in a linked list?
What is a doubly linked list?
What is the purpose of a doubly linked list?
What is used to define a node of a linked list?
How do you delete an element from the middle of a linked list?
How do you delete a node from the front of a linked list?
How do you append a node onto a linked list?
How do you put a new node onto the front of the linked list?
What condition tells you the linked list is currently empty?
What condition tells you there’s only one node on the linked list?
What is the size limitation on a linked list?
What is the destructor typically used for in a linked list?