Académique Documents
Professionnel Documents
Culture Documents
2. What data structure can be used to check if a syntax has balanced paranthesis ?
A. Queue B. Tree C. List D. Stack
8. Heap is an example of
A. complete binary tree B. spanning tree C. sparse tree D. binary search tree
10. A data structure where elements can be added or removed at either end but not in the middle
A. Linked lists B. Stacks C. Queues D. Deque
12. To represent hierarchical relationship between elements, Which data structure is suitable?
A. Dequeue B. Priority C. Tree D. Graph
15. Finding the location of the element with a given value is:
A.Traversal B. Search C. Sort D. None of above
17. Linked list are not suitable data structure of which one of the following problems ?
A. Insertion sort B. Binary search C. Radix sort D. Polynomial manipulation
19. Which of the following algorithm design technique is used in the quick sort algorithm?
A. Dynamic programming B. Backtracking
C. Divide and conquer D. Greedy method
20. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst
case by the merge sort algorithm will be?
A. mn B. max(m,n) C. min(m,n) D. m+n-1
22. What is the result of the following operation Top (Push (S, X))
A. X B. Null C. S D. none of these
25. The list that requires two pointer variables FIRST and LAST is called ........
A. Circular list B. Header list C. One way list D. Two way list
26. The list which has its own pointer is called ........
A. pointer list B. self pointer C. free pool D. own pointer
27. A ............. is a header list where the last node points back to the header node.
A. rounded header list B. circular header list
C. common header list D. forward header list
31. Term Data Structure refers to _________ and interrelationship between them.
A. Coding Standards B. Programming Language Statement
C. Organization of data element D. None of these
34. In what kind of storage we can easily insert,delete,concatenate and rearrange substrings ?
A. Array B.Linked List C.Stack D.Queue
36. Which of the following case does not exist in complexity theory
A. Best case
B. Worst case
C. Average case
D. Null case
37. The time factor when determining the efficiency of algorithm is measured by
A. Counting microseconds
B. Counting the number of key operations
C. Counting the number of statements
D. Counting the kilobytes of algorithm