1. Arrays are best data structures …………

for relatively permanent collections of data.
for the size of the structure and the data in the structure are constantly changing
for both of above situation
2. The number of items used by the dynamic array contents is its 

Capacity
Logical size
Random size
3. The postfix equivalent of the prefix*+abcd is

ab+cd*
abcd +*
ab + cd* 
4. What is the time complexity for inserting/deleting at the beginning of the array?

O(logn)
O(nlogn)
O(1)
5. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

singly linked list
circular linked list
doubly linked list
6. The following sequence of operations is performed on a stack: push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop. The sequence of popped out values are

2, 2, 1, 1, 2
2, 2, 1, 2, 2
2, 1, 2, 2, 2
7. Which data structure allows deleting data elements from front and inserting at rear?

stacks
queue
dequeue
8. What are some of the applications of sorted arrays?

Commercial computing
Priority Scheduling
Discrete Mathematics
9. Stack cannot be used to

evaluate an arithmetic expression in postfix form
implement recursion
allocate resources (like CPU) by the operating system
10. Which of the following is/are advantages suffix array one suffix tree? I. Lesser space requirement II. Improved cache locality III. Easy construction in linear time

Only I
Only I and III
Only II and III
11. In doubly linked lists

a pointer is maintained to store both next and previous nodes.
two pointers are maintained to store next and previous nodes.
a pointer to self is maintained for each node.
12. The following sequence of operations is performed on a stack push(1), push(2), pop(), push(1), push(2), pop(), pop(), pop(), push(2), pop(), the sequence of popped out values are

2, 2, 1, 2, 1
2, 2, 1, 1, 2
2, 1, 2, 2, 2
13. In Circular Linked List insertion of a node involves the modification of ____ links.
14. Who coined the term Sparse Matrix?

James Sylvester
Chris Messina
Harry Markowitz
Arthur Cayley
15. The deque can be used

as a stack
as a queue
both as a stack and as a queue
16. What are the characteristics of a Data Structure?

Correctness
Time Complexity
Space Complexity
17. Which of the following sorting algorithm has the worst time complexity of nlog (n) ?

Heap Sort
Quick sort
Insertion sort
18. Inserting an item into the stack when stack is not full is called............. operation and deletion of item from the stack, when stack is not empty is called operation.

push, pop
pop, push
insert, delete
19. You are asked to sort 15 randomly generated numbers. You should prefer

bubble sort
Selection sort
insertion sort
20. Standard approach for implementation of a list is/are of

1 type
type
type
21. To make a queue empty, elements can be deleted till

front = rear + 1
front rear1
front = rear
22.In linked list implementation, a node carries information regarding

the data
the link
both a & b
23. Which of the following abstract data types can be used to represent a many to many relation?

Tree
Stack
Graph
24. In a circularly linked list organization, insertion of a record involves the modification of

no pointer
1 pointer
2 pointers
25. To insert element at start, the previous pointer of newly added node would point to ______

null
next node
new node
26. The order of the binary search algorithm is

n
n2
nlog(n)
27. Linked list are not suitable for

Stack
Deque.
AVL Tree
28. Assume 5 buffer pages are available to sort a file of 105 pages. The cost of sorting using mway merge sort is
29. Which of the following data structure works on the principle of First Come First Serve?

Priority queue
Heap
Stack
30. Dynamic memory allocation use

Calloc
Malloc
Free
Post a Comment
0 Comments