Practice Test: Question Set - 06
1. There is an extra element at the head of the list called a __________
- (A) Antinel
- (B) Sentinel
- (C) List
header
- (D) List
head
2. Which is/are the application(s) of stack
- (A) Function
calls
- (B) Large
number Arithmetic
- (C) Evaluation
of arithmetic expressions
- (D) All
of the above
3. Which of the following statement is false?
- (A) Arrays
are dense lists and static data structure
- (B) Data
elements in linked list need not be stored in adjacent space in memory
- (C) Pointers
store the next data element of a list
- (D) Linked
lists are collection of the nodes that contain information part and next
pointer
4. Which of the following is not the part of ADT description?
- (A) Data
- (B) Operations
- (C) Both
of the above
- (D) None of the
above
5. Which of the following data structure is non linear type?
- (A) Strings
- (B) Lists
- (C) Stacks
- (D) Graph
6. A graph is a collection of nodes, called ________ And line segments called arcs or ________ that connect pair of nodes.
- (A) Vertices,
edges
- (B) Edges,
vertices
- (C) Vertices,
paths
- (D) Graph node,
edges
7. The way in which the data item or items are logically related defines __________
- (A) Storage
structure
- (B) Data
structure
- (C) Data
relationship
- (D) Data
operation
8. Which data structure allows deleting data elements from and inserting at rear?
- (A) Stacks
- (B) Queues
- (C) Dequeues
- (D) Binary
search tree
9. In a circular queue, the value of r will be ________
- (A) r = r + 1
- (B) r = (r + 1)%
[QUEUE_SIZE – 1]
- (C) r=( r + 1)%
QUEUE_SIZE
- (D) r=(r - 1)% QUEUE_SIZE
10. Arrays are best data structures _________
- (A) For
relatively permanent collections of data
- (B) For
the size of the structure and the data in the structure are constantly changing
- (C) For
both of above situation
- (D) For
none of the above
Next Tests: