MCQ | Data Structure

DATA STRUCTURE

« Previous Next »

1. The most widely used method for interpreting bit setting as non-negative integer is :

A) Binary number system
B) ASCII system
C) BCD System
D) None of the above

... Answer is A)
Binary number system

2. While considering data structure implementation,the factor(s) underconsideration is (are):

A) time
B) time and space
C) time,space and processor
D) None of these

... Answer is C)
time,space and processor

3. Data structure as define at logical level, is called abstract data type.

A) true
B) false

... Answer is A)
true

4. Without pointer data type is not possible to implement hierarchical data structure.

A) true
B) false

... Answer is A)
true

5. Data structures are programming language dependent.

A) true
B) false

... Answer is B)
false

6. A data type is a collection of values and a set of operations on that values.

A) true
B) false

... Answer is A)
true

7. Pick out invalid statement for following : algorithm must be:

A) efficient
B) concise and compact
C) free of ambiguity
D) None of these

... Answer is C)
free of ambiguity

8. Modular programming uses

A) only top down method
B) only bottom up method
C) both A and B
D) None of these

... Answer is A)
only top down method

9.In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do it is expressed by using:

A) Order of magnitude or Big O
B) central tendency
C) differential equation
D) None of these

... Answer is B)
central tendency

10.Which is better computing time (with respect to algorithm analysis)

A) O(n)
B) O(2ⁿ)
C) O(log₂n)
D) None of these

... Answer is C)
O(log₂n)

11. Which of the following is the best time for an algorithm ?

A) O(N)
B) O(logN)
C) O(0.5ⁿ)
C) O(N²)

... Answer is B)
O(logN)

12. An unrestricted use of the "goto" statement is harmful because

A) it makes it more difficult to verify programs
B) it increases the running time of the programs
C) it increases the memory required for the programs
D) it result in the compiler generating longer machine code.

... Answer is A)
it makes it more difficult to verify programs

13. The recurrence relation that arises in relation with the complexity of binary search is

A) T(n)=T(n/2)+k,k is a constant
B) T(n)=2T(n)+k,k is a constant
C) T(n)=T(n/2)+log n(
C) T(n)=T(n/2)+n

... Answer is A)
T(n)=T(n/2)+k,k is a constant

14. Consider the following two functions:
g1(n)=n² for 0<=n<10,000
=n³ for n>10,000
g2(n)=n for 0<n<=100
=n³ for n>100
which of the following is true:

A) g1(n) is O(g2(n)
B) g1(n) is O(n²)
C) g2(n) is O(g1(n))
D) g2(n) is O(n)

... Answer is a)
g1(n) is O(g2(n)

15. Which of the following is false

A) 100n logn = O((n logn)/100)
B) √logn = O(logn)
C) 2ⁿ≠ O(n)
C) 10n logn = O((n logn)

... Answer is B)
√logn = O(logn)

16. Structured data type made up of finite collection of ordered elements, all of which is of same data type is:

A) record
B) array
C) file
C) None of these

... Answer is B)
array

17. Element of array is accessed by

A) accessing function in built-in data structure
B) mathematical function
C) index
D) None of these

... Answer is C)
index

18. Array is

A) Linear data structure
B) Non Linear data structure
C) Complex data structure
C) None of these

... Answer is A)
Linear data structure

19. Static memory allocation takes place at run time

A) true
B) false

... Answer is B)
false

20. In linked list the logical order of elements

A) is same as their physical arrangement
B) is determined by their physical arrangement
C) can not be determined from their physical arrangement
D) None of these

... Answer is C)
can not be determined from their physical arrangement

21.Direct or random access of element is not possible in

A) linked list
B) array
C) string
D) None of these

... Answer is A)
linked list

22. Odd may out (linked list)

A) modify
B) replace
C) to determine if it is empty
D) None of these

... Answer is C)
to determine if it is empty

23. The nth node in singly linked list, is accessed via (where n>1):

A) the head node
B) the tail node
C) (n-1) nodes
D) None of these

... Answer is A)
the head node

24. In linked list,the successive elements

A) must occupy contiguous space in memory
B) need not occupy contiguous space in memory
C) must not occupy contiguous space in memory
D) None of these

... Answer is B)
need not occupy contiguous space in memory

25. Linear order in linked list is provided through

A) index number
B) the implied position of the node
C) Pointer
D) None of these

... Answer is C)
Pointer

26. Null pointer is used to tell

A) end of linked list
B) empty pointer field of a structure
C) the linked list is empty
D) All the above

... Answer is A)
end of linked list

27. List pointer variable in linked list contains address of

A) following node in the list
B) current node in the list
C) first node in the list
D) None of these

... Answer is A)
following node in the list

28. Underflow condition in linked list may occur when attempting to

A) insert a new node when there is no free space for it.
B) delete anon-existent node in the list.
C) delete a node in empty list
D) None of these

... Answer is C)
delete a node in empty list

29. Overflow condition in linked list may occur when attempting to

A) create a node when free space pool is empty
B) traverse the nodes when free space pool is empty
C) create a node when linked list is empty
D) None of these

... Answer is A)
create a node when free space pool is empty

30. Searching a linked list requires linked list be created

A) in sorted order only
B) in any order
C) without underflow condition
D) None of these

... Answer is A)
in sorted order only

31. Deletion of a node in linked list involves keeping track of the address of the node

A) which immediately follows the node that is to be deleted.
B) which immediately precedes the node that is to be deleted.
C) that is to be deleted
D) None of these

... Answer is B)
which immediately precedes the node that is to be deleted.

32. Header of a linked list is a special node at the

A) end of the linked list
B) at the middle of the linked list
C) beginning of the linked list
D) None of these

... Answer is C)
beginning of the linked list

33. Header linked list in which last node contains the null pointer is called

A) grounded header list
B) circular header list
C) general header list
D) None of these

... Answer is A)
grounded header list

34. Header linked list in which last node points to the header node is called

A) grounded header list
B) circular header list
C) general header list
D) None of these

... Answer is B)
circular header list

35. polynomials in memory may be maintained through

A) linked list with header node
B) one dimensional array
C) stack
D) None of these

... Answer is A)
linked list with header node

36. Representing the polynomial in memory using linked list requires each node having

A) two fields
B) three fields
C) more than tree fields
D) None of these

... Answer is B)
three fields

37. The n th node in a singly linked list is accessed via

A) The first n-1 nodes
B) 1 node (olny the head)
C) 1 node (only the tail)
D) the first n+1 nodes

... Answer is B)
1 node (olny the head)

38. Linked lists are not suitable for which one of the following problem

A) insertion sort
B) binary search
C) radix sort
D) shell sort

... Answer is B)
binary search

39. The concatenation of two lists is to be performed in O(1) time.Which of the following implementations of a list should be used?

A) single linked list
B) doubly linked list
C) circular doubly linked list
D) array implementation of list

... Answer is C)
circular doubly linked list

40. Having address of the node to be deleted in double linked list,the node can be deleted

A) without traversing the list
B) only after traversing the list from the head
C) only traversing the list from the tail
D) None of these

... Answer is A)
without traversing the list

41. A data structure in which an element is added and removed only from one end is known as:

A) queue
B) stack
C) in-built data structure
D) None of these

... Answer is B)
stack

42. A data structure in which elements are added or removed only at a fixed end is kinown as a

A) queue
B) stack
C) array
D) linked list

... Answer is B)
stack

43. One can convert an infix expression to a postfix expression using a

A) stack
B) queue
C) dequeue
D) none of these

... Answer is A)
stack

44. Which of the following is essential for converting an infix expression to the postfix from efficiently.

A) An operator stack
B) An operand stack
C) An operand stack and operator stack
D) a parse tree

... Answer is A)
An operator stack

45. Which of the following types of expressions do not require precedence rules for evalution?

A) Fully parenthesized infix expression.
B) Postfix expression.
C) Partially parenthesized infix expression.
D) More than one of the above.

... Answer is D)
More than one of the above.

46. Which of the following is essential for converting an infix expression to the postfix from efficiently.

A) An operator stack
B) An operand stack
C) An operand stack and operator stack
D) a parse tree

... Answer is A)
An operator stack

47. The queue can be define as a

A) Waiting line
B) Empty line
C) Series
D) Ordered list

... Answer is A)
Waiting line

48. Circular queues are implemented using arrays because of _____ utilization of memory space

A) Maximum
B) Optimum
C) Minimum
D) Normal

... Answer is B)
Optimum

49. A priority queue does not follow ______ rule strictly

A) FIFO
B) LIFO
C) LILO
D) None of these

... Answer is A)
FIFO

50.FRONT=RARE=-1 pointer refers to ______ queue

A) single element in
B) Full
C) Empty
D) None of these

... Answer is C)
Empty

« Previous Next »