Saturday, 21 October 2017

Multiple Choice Question on Data Structure

Q1. Which if the following is/are the levels of implementation of data structure?
A) Abstract level implementation
B) Application level implementation
C) Implementation level implementation
D) All of the above

Q2.  In which level, where the model becomes compatible executable code?
A) Abstract level
B) Application level
C) Implementation level
D) All of the above

Q3. Which of the following is true about the characteristics of abstract data types?
i) It exports a type. ii) It exports a set of operations
A) True, False
B) False, True
C) True, True
D) False, False


Q4. Which one is not the component of data structure?
A) Operations
B) Storage Structures
C) Algorithms
D) None of above

Q5. 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

Q6. Which of the following data structure can’t store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks

Q7. Which of the following is non-liner data structure?
A) Stacks
B) Linked List
C) Strings
D) Trees

Q8. Which of the following data structure is non linear type?
A) Strings
B) Lists
C) Stacks
D) Graph

Q9. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack

Q10. For hierarchical relationship between elements, which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph

Q11. How many numbers of comparisons are needed to perform sequential search?
A) (N/2)+1
B) (N+1)/2
C) (N-1)/2
D) (N+2)/2

Q12. In which algorithm, search start at the beginning of the list and check every element in the list.
A) Linear search
B) Binary search
C) Hash Search
D) Binary Tree search

Q13. State True or False.
i) Binary search is used for searching in a sorted array.
ii) The time complexity of binary search is O(logn).
A) True, False
B) False, True
C) False, False
D) True, True

Q14. In general, the binary search method needs no more than ……………. comparisons.
A) [log2n]-1
B) [logn]+1
C) [log2n]
D) [log2n]+1

Q15. Which of the following data structures are indexed structures?
A. Linear arrays
B. Linked lists
C. Queue
D. Stack

Q16. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Trees
C. Pointers
D. Lists

Q17. Operations on a data structure may be ………..
A. creation
B. destruction
C. selection
D. all of the above

Q18. 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

Q19. Which operations are applicable on primitive data structures?
A. create
B. destroy
C. update
D. all of the above

Q.20. 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 non of above situation

Q21. 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.

Q22. Which of the following is a linear data structure type?
A) Array data structure
B) Tree data structure
C) Graphs data structure
D) Hierarchy data structure

Q23. The mathematical model of a particular organization of data is known as……….
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation

Q24. Which one of the following is the simplest type of data structure?
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array

Q25. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array


Thanks
Mukesh Rajput

No comments:

Post a Comment

Thanks
Mukesh Rajput