-
LinkedList.h file is the header file that contains the definition of the Node structure and the definition of the LinkedList class.
Skill/Topic: Stacks using Linked ListA) TrueB) False
Venkateswara Rao
- Sep 5th, 2006
True
-
New nodes are added to the _____ of the queue.
Skill/Topic: Queues Using Linked ListsA) frontB) backC) middleExplanation: New nodes are added to the back of the queue.
Ganesh Ashtekar
- Jun 13th, 2006
Answer: B) Back
-
The size of an array queue can change during runtime?
Skill/Topic: Queues Using Linked ListsA) TrueB) FalseExplanation: The size of an array queue is set at compile time and cannot change at runtime
Sandhya
- Sep 5th, 2006
False, size won't change. It is fixed.
-
What is a Tree?
Skill/Topic: TreeA) A tree is a data structure where data is stored in nodesExplanation: A tree is a data structure where data is stored in nodes. Nodes are arranged in branches where each node can expand into 0, 1, or 2 other nodes.
-
A parent node is a node that branches into one or two other nodes, which are called child nodes.
Skill/Topic: TreeA) TrueB) False
-
Parent Node is also called as _____ Node.
Skill/Topic: TreeA) MainB) RootC) BranchD) Stem
-
The depth of a tree is the _______ of a tree.
Skill/Topic: TreeA) number of nodes on the treeB) number of levels of a treeC) Number of branches
-
What is a leaf node?
Skill/Topic: TreeA) A leaf node is the last node on a branch
Manish
- Jan 13th, 2007
A leaf node is a node which does not contain any child node.A leaf node have zero or one node is connected to it.
-
A stack-linked list is a data structure that uses a ______ to create a stack.
Skill/Topic: Stacks using Linked ListA) Linked ListB) QueueC) Doubly linked list
uttama
- Feb 13th, 2007
Ans to this question is: Linked-list because, queue can be only implemented by FIFO! and doublly link list is used for both ends! hence linked list is correct option!
-
A hashtable is a table in which each entry consists of a hashed key and a value.
Skill/Topic: Hash TableA) TrueB) FalseExplanation: The hashed key retrieves entries
noverino
- Feb 23rd, 2007
B) FalseHashtable not always need value, it could contain only key/keys. Example, we use hashtable to keep unique value, then we only need the key/keys right.
-
-
What is a user-defined data type?
Skill/Topic: Variables and PointersA) A user-defined data type is a group of primitive data types defined by the programmer.
-
How many parts are there in a declaration statement?
Skill/Topic: Variables and PointersA) 1B) 2C) 3D) 4
ahmarshi
- May 19th, 2007
3 parts. i. SCOPE (private/public/protected) ii. DATATYPE (int, short, long, byte, string, char, etc...)iii. VARIABLE NAMEe.g.private int id;private string name;
M.Ahmar
- May 19th, 2007
3 Parts.Scope (private/public/protected), DataType (integer, short, byte, string, etc...), Variable nameExamples:private int i;public string name;
-
Data members of the Hashtable class stored in the private access specifier.
Skill/Topic: Hash TableA) private access specifierB) Public access specifierC) common access specifier
-
An application iterates the hashtable by calling the ______ and ______ member functions.
Skill/Topic: Hash TableA) hasNext() and getNextKey()Explanation: An application iterates the hashtable by calling the hasNext() and getNextKey() member functions. These two functions are used together with initIterator() to retrieve all the keys from a hashtable
-
An array is a way to reference a series of memory locations using the ______.
Skill/Topic: ArrayA) Same nameB) different nameC) Multiple namesD) Unique nameExplanation: An array is a way to reference a series of memory locations using the same name. Each memory location is represented by an array element. An array element is similar to one variable except it is identified by an index value instead of a name.
-
-
Which of the following symbol table implementation is based on the property of locality of reference ?
1. Linear list 2. search tree 3. Hash table 4. self-organization list
-
The node in a single linked list can reference the previous node in the linked list.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: A single linked list is a linked list consisting of nodes that have only the next element and not the previous element. This links the node to only the next node in the linked list. There is no way for the node to reference the previous node in the linked list
Vikram.N
- Sep 3rd, 2007
True: Only in the case of a circular linked list with two elements!
-
What is the use of fflush() function?
mswaroop
- Sep 5th, 2007
Suppose we read a sentence using scanf e.g. "My name is ABC" in a string.Printing this string using a printf statement prints "My".Go for another successive scanf.It...
Data Structures Interview Questions
Ans