-
-
Why would you define a getSize() function instead of having the application access the size of the linked list directly?
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) You use the getSize() function instead of having the application access the size of the linked list directly to protect the data from inadvertently being changed by the application.Explanation: If the application needs to change the data, then the appropriate function is called and the function changes the data.
-
Creating and using a hashtable in your application is a single-step process[Topic] Hash Table.
Skill/Topic: Hash TableA) TrueB) FalseExplanation: Creating and using a hashtable in your application is a two-step process. The first step is to define a user-defined structure similar to the way you defined nodes in a tree or a linked list. The second step is to define a Hashtable class. The Hashtable class declares an instance of the user-defined structure and defines member data and member functions...
-
_________ is the way you groups things together by placing one thing on top of another and then removing things one at a time from the top.
Skill/Topic: Stacks using an ArrayA) ArrayB) StackC) PointerD) All of the above
-
The byte abstract data type is the smallest abstract data type in the integer group and is declared by using the keyword byte.
Skill/Topic: Memory, Abstract Data Types, and AddressesA) TrueB) FalseExplanation: The byte abstract data type is the smallest abstract data type in the integer group and is declared by using the keyword byte. �byte abstract data type� is commonly used when sending data to and receiving data from a file or across a network.
-
What is precision?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) Precision refers the accuracy of the decimal portion of a value
-
Char *ptGrade;The use of the symbol ; ( semi colon) in the above example is wrong.
Skill/Topic: Variables and PointersA) TrueB) FalseExplanation: the symbol ; ( semi colon) tells the computer this is an instruction (statement)
samiksc
- Jan 19th, 2006
(B) False. In several prog langauges like C C++ every statement ends with a semicolon.
-
The isEmpty() member method determines if there is room for one more value on the stack.
Skill/Topic: Stacks using an ArrayA) TrueB) FalseExplanation: The isFull() member method determines if there is room for one more value on the stack.
samiksc
- Jan 19th, 2006
(B) False -- IsEmpty() checks if the stack has at least one element. This method is called by Pop() before retrieving and returning the top element.
-
What kind of value is assigned to the top attribute?
Skill/Topic: Stacks using an ArrayA) VariableB) IndexC) CharacterD) FloatExplanation: The value at the top attribute is an index.
-
Constructor is a member method of a class that is called when an instance of the class is declared.
Skill/Topic: Stacks using an ArrayA) TrueB) FalseExplanation: A constructor is a member method of a class that is called when an instance of the class is declared. A destructor is a member method of a class that is called when the instance of the class falls out of scope.
samiksc
- Jan 19th, 2006
For some prog languages like C# : False -- to be specific a constructor is called when an instance of a class is initialized. In C# declaration A obj; does not call the constructor. A statement like A...
-
Data in a queue is accessible.
Skill/Topic: QueueA) First in First outB) First in last outC) Last in First outExplanation: Data in a queue is accessible in a First in First out (FIFO) Concept
-
Priority queue organizes items in a line where the first item is at the beginning of the line and the last item is at the back of the line.
Skill/Topic: QueueA) TrueB) FalseExplanation: A simple queue organizes items in a line where the first item is at the beginning of the line and the last item is at the back of the line. Each item is processed in the order in which it appears in the queue. The first item in line is processed first, followed by the second item and then the third until the last item on the line is processed.
samiksc
- Jan 19th, 2006
False: Priority queue organizes items based on their entry time AND priority. If a high priority item enters this queue it will be placed at the end of items having same priority, but before those which have lower priority.
-
Items on a priority queue can jump to the front of the line if they have priority.
Skill/Topic: QueueA) TrueB) FalseExplanation: A priority queue is similar to a simple queue in that items are organized in a line and processed sequentially. However, items on a priority queue can jump to the front of the line if they have priority. Priority is a value that is associated with each item placed in the queue.
-
The _______ process places data at the back of the queue.
Skill/Topic: QueueA) enqueueB) dequeueC) priority queue
-
Why is the isEmpty() member method called?
Skill/Topic: QueueA) The isEmpty() member method is called within the dequeue process to determine if there is an item in the queue to be removed.
samiksc
- Jan 19th, 2006
IsEmpty() is called to decide whether the queue has at least one element. This method is called by the dequeue() method before returning the front element.
-
A Node has ___ elements.
Skill/Topic: Linked ListA) NoneB) OneC) TwoD) ThreeExplanation: A node has three elements. These are the current data and pointers to the previous node and the next node on the linked list
samiksc
- Jan 19th, 2006
At least 2 or 3. A singly linked list will have at least one data element and a pointer. A doubly linked list will have at least one data element and 2 pointers.
-
A node can reference more than one data element.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: Yes, a node can reference more than one data element if the current data element of the node is a pointer to a group of data such as an instance of a class, a structure, or an array.
samiksc
- Jan 20th, 2006
Yes, a node itself can contain as many data elements as it needs and it can also reference other data elements. Following is an example of a complex node strcuture in a linked liststruct linkList{struct empNode{string empName;long empNo;struct empSal *salPtr;} node; linkList *nextNode;}
-
What member function places a new node at the end of the linked list?
Skill/Topic: Linked ListA) appendNode()B) addNode()C) displayNode()D) structNode()Explanation: The appendNode() member function places a new node at the end of the linked list. The appendNode() requires an integer representing the current data of the node.
samiksc
- Jan 20th, 2006
appendNode() will place a node at the end of the linked list.addNode() may take two parameters, node to be inserted and position and add the element at the specified position.
-
The LinkedList class specification is defined in the source file.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: The LinkedList class specification is defined in the header file, and the implementation is defined in the source file.
samiksc
- Jan 20th, 2006
True: In case of C/C++ a class declaration is generally kept in the header file and the definition is written in source files. But it is possible that both declaration and definition are written in the source file.
-
The LinkedList constructor is a member function that is called when an instance of the LinkedList is removed.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: The LinkedList constructor is a member function that is called when an instance of the LinkedList is declared
Data Structures Interview Questions
Ans