# 40 Data Structure MCQ’s to Test your Computer Knowledge

### Application Form 2020

Data Structure (DS) is one of the most scoring subjects in Competitive Exams. Those who score great in it stands higher on the merit. To help students, we have started a new series call “Computer Awareness for Competitive Exams”. In this post, our team has brought some of the well compiled Data Structure MCQ with answer asked in Competitive Exams. These practise sets in Data Structure are the best way to check your knowledge before going for any competitive exams. Let us explore, the model paper on Data Structure.

## Set:- 1 Data structure MCQ

Instruction: From the four options, choose the most appropriate answer.

Marks: Each question carries 1 (one) mark (Total 40 marks)

1. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
a. elementary items
b. atoms
c. scalars
d. all of the above

2. Which of the following is a two-way list?
a. grounded header list
b. circular header list
c. linked list with header and trailer nodes
d. none of the above

3. Which of the following statement is false?
a. Arrays are dense lists and static data structure
b. data elements in a 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 a collection of the nodes that contain information part and next pointer

4. When in order traversing a tree resulted in E A C K F H D B G; the preorder traversal would return
a. FAEKCDBHG
b. FAEKCDHGB
c. EAFKHDCBG
d. FEAKDCHBG

5. The memory address of the first element of an array is called

6. The difference between a linear array and a record is
a. An array is suitable for homogeneous data but the data items in a record may have different data type
b. In a record, there may not be a natural ordering in opposed to a linear array.
c. A record forms a hierarchical structure but a linear array does not
d. All of the above

7. Which of the following name does not relate to stacks?
a. FIFO lists
b. LIFO list
c. Piles
d. Push-down lists

8. Which of the following data structures are indexed structures?
a. linear arrays
c. both of above
d. none of the above

9. The term “push” and “pop” is related to the
a. array
b. lists
c. stacks
d. all of above

10. The memory address of the fifth element of an array can be calculated by the formula
a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
d. None of the above

11. Two-dimensional arrays are also called
a. tables arrays
b. matrix arrays
c. both of above
d. none of the above

12. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
a. underflow
b. overflow
c. Housefull
d. saturated

13. The situation when in a linked list START=NULL is
a. underflow
b. overflow
c. Housefull
d. saturated

14. A variable P is called pointer if
a. P contains the address of an element in DATA.
b. P points to the address of the first element in DATA
c. P can store only memory addresses
d. P contains the DATA and the address of DATA

15. Which of the following data structure can’t store the non-homogeneous data elements?
a. Arrays
b. Records
c. Pointers
d. None

16. Which of the following data structure store the homogeneous data elements?
a. Arrays
b. Records
c. Pointers
d. None

17. Which of the following is not a limitation of the binary search algorithm?
a. must use a sorted array
b. the requirement of a sorted array is expensive when a lot of insertion and deletions are needed
c. there must be a mechanism to access the middle element directly
d. a binary search algorithm is not efficient when the data elements are more than 1000.

18. The binary search algorithm can not be applied to
a. sorted linked list
b. sorted binary trees
c. sorted linear array
d. pointer array

19. A data structure where elements can be added or removed at either end but not in the middle
b. Stacks
c. Queues
d. Deque

20. Which of the following is not the required condition for a binary search algorithm?
a. The list must be sorted
b. there should be direct access to the middle element in any sublist
c. There must be a mechanism to delete and/or insert elements in list
d. none of above.

## Set:- 2 Data structure MCQ

21. When determining the efficiency o the algorithm, the space factor is measured by
a.    Counting the maximum memory needed by the algorithm
b.    Counting the minimum memory needed by the algorithm
c.    Counting the average memory needed by the algorithm
d.    Counting the maximum disk space needed by the algorithm

22. The complexity of Bubble sort algorithm is
a.    O(n)
b.    O(log n)
c.    O(n2)
d.    O(n log n)

23. Linked lists are best suited
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 none of the above situation

24. If the values of a variable in one module is indirectly changed by another module, this situation is called
a.    internal change
b.    inter-module change
c.    side effect
d.    side-module update

25. In the linear search algorithm, the Worst case occurs when
a.    The item is somewhere in the middle of the array
b.    The item is not in the array at all
c.    The item is the last element in the array
d.    The item is the last element in the array or is not there at all

26. For an algorithm, the complexity of the average case is
a.    Much more complicated to analyze than that of worst case
b.    Much simpler to analyze than that of worst case
c.    Sometimes more complicated and some other times simpler than that of the worst cased.   d. None of the above

27. The complexity of merge sort algorithm is
a.    O(n)
b.    O(log n)
c.    O(n2)
d.    O(n log n)

28. The complexity of a linear search algorithm is
a.    O(n)
b.    O(log n)
c.    O(n2)
d.    O(n log n)

29. When determining the efficiency of the algorithm the time factor 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

30. Which of the following data structure is a linear data structure?
a.    Trees
b.    Graphs
c.    Arrays
d.    None of the above

31. The elements of an array are stored successively in memory cells because
a.    by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
b.    the architecture of computer memory does not allow arrays to store other than serially
c.    both of above
d.    none of the above

32. Which of the following data structure is not a linear data structure?
a.    Arrays
c.    Both of above
d.    None of the above

33. The Average case occurs in the linear search algorithm
a.    When Item is somewhere in the middle of the array
b.    When Item is not in the array at all
c.    When Item is the last element in the array
d.    When Item is the last element in the array or is not there at all

34. Two main measures for the efficiency of an algorithm are
a.    Processor and memory
b.    Complexity and capacity
c.    Time and space
d.    Data and space

35. Finding the location of the element with a given value is:
a.    Traversal
b.    Search
c.    Sort
d.    None of the above

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 operation of processing each element in the list is known as
a.    Sorting
b.    Merging
c.    Inserting
d.    Traversal

38. 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 none of the above situation

39. Each array declaration need not give, implicitly or explicitly, the information about
a.    the name of array
b.    the data type of array
c.    the first data from the set to be stored
d.    the index set of the array

40. The complexity of Binary search algorithm is
a.    O(n)
b.    O(log )
c.    O(n2)
d.    O(n log n)

## Data Structure MCQ Answer-Sheet

Here is the complete answer sheet of the above Data Structure MCQ.

 1- D 2- D 3- C 4- B 5- B 6- D 7- A 8- A 9- C 10- A 11- A 12- B 13- A 14- A 15- A 16- A 17- D 18- A 19- D 20- C 21 – A 22 – B 23 – B 24 – C 25 – D 26 – A 27 – D 28 – A 29 – B 30 – C 31 – A 32 – D 33 – A 34 – C 35 – B 36 – D 37 – D 38 – A 39 – C 40 – B

## Other Useful Links

Apart from this Data Structure MCQ with Answers for competitive exams, solving online test will help you to fetch some extra marks. Here are some of the useful links where you can find the best study materials and Books on Computer Awareness for competitive exams.

### Online Test

To access free Online Test on Computer Awareness Click Here

### Books

A good book can help you to crack any competitive examination. You can buy these books on Computer Awareness to score best and practise more sets on Operating System MCQ with Answers.

1. Computer Awareness by Mini Goyal and Shweta Rani (Publisher: Arihant)  Click Here to Buy

Best Of Luck Aspirants..!!

### Application Form 2020

Disclaimer: If you have found any inappropriate or wrong information/data on the site, inform us by emailing at mail[@]edufever.com for rectification/deletion/updating of the same.

Happy to share educational and career information here.