1. Which of the following data structure permits insertion and deletion operations only on one end of the structure?
-
Linked list
Array
Stack
2. What is the worst-case time for serial search finding a single item in an array?
-
Quadratic time
Linear time
Logarithmic time
3. Which type of linked List contains. pointer to the next as well as previous node in the sequence?
-
Singly Linked List
Circular Linked List
Doubly Linked List
4. The average case complexity of quick sort for sorting n numbers is
-
O(n2)
O(nlog2n)
O(n)
5. In stack deletion operation is referred as _____
-
push
pop
peek
6. Queue is _____ type of data structure.
-
lifo
fifo
both a & b
7. Linked list is not suitable data structure for which one of the following problems?
-
insertion sort
radix sort
binary search
8. Which of following operations are generally not performed on report files?
-
Updation
Maintenance
Retrieval
9. In Pseudocode part consists of?
-
Sequence
Selection
Iteration
10. Self-referential pointer is used in defining
-
an array
a node of linked-list
a queue
11.In bottom-up approach-
-
A problem is subdivided into subproblems; each one is attacked without worrying about others.
A problem is tackled from beginning to end in one go.
Subproblems are solved first; then all solution of subproblems are put together to solve the main problem
12. Which of the following statements about a binary tree is correct?
-
No binary tree is both complete and full
Every full binary tree is also a complete binary tree
Every complete binary tree is also a full binary tree
13. Inserting a node after a given node in a doubly linked list requires
-
four pointer exchanges.
two pointer exchanges
one pointer exchange.
14. Stack is also called as
-
last in first out
first in last out
last in last out
15. Binary search is not possible for
-
array
linked list
stack
16. ………… is very useful in situation when data have to stored and then retrieved in reverse order.
-
stack
queue
list
17. Which data structure allows deleting data elements from and inserting at rear?
-
stacks
queues
dequeues
18. A linear link list can be traversed using
-
recursion
both (a) and (c) are correct
Stack
19. When does top value of the stack changes?
-
before deletion
while checking underflow
at the time of deletion
20. How will you implement dynamic arrays in Java?
-
Set
Map
HashMap
21. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
-
circular queue
random of queue
priority
22. The data structure used to solve recursive problem is
-
Linked list
Queue
stack
23. The term "push" and "pop" is related to the
-
array
lists
stacks
24. What is the difference between a normal(naive) array and a sparse array?
-
Sparse array is memory efficient
Sparse array can hold more elements than a normal array
Sparse array is dynamic
25. The adjacency matrix of an undirected graph is
-
Unit matrix
Asymmetric matrix
Symmetric matrix
26. Suffix array can be created in O(nlogn) time.
-
True
False
27. The disadvantage in using a circular linked list is …………………….
-
it is possible to get into infinite loop
last node points to first node.
time consuming
28. A simple undirected graph with eight (8) vertices is said to be completed if number of edges equals to
29. If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
30.Which of the following data structure is mainly used for implementing the recursive algorithm?
-
Stack
Queue
Linked list
Post a Comment
0 Comments