Data Structure using c MCQ bank pdf bcs bca mca mcs srtmun pdf computer science bsc cs it

*Data Structure using c MCQ bank*

1. The values in which field uniquely determine the record in a file

A. Primary key

B. Secondary key

C. Pointer

D. Key

Ans. A. Primary key

2.  In which of the following length records file records may contain different lengths?

A. Fixed

B. Primary

C. Variable

D. Entity

Ans. c. variable

3. Which is the logical or mathematical model of a particular organization of a data?

A. Structures

B. Variable

C. Data structures

D. Function

Ans. C. Data structures

4. Which of the following is not a primitive data structure?

A. Boolean

B. Integer

C. Arrays

D. Character

Ans. C. Arrays

5. Which of the following refers to a single unit of values?

A. Group item

B. Data item

C. Basic item

D. Elementary item

Ans. B. Data item

6. Which of the following is something that has certain attributes or properties which may be assigned values?

A. Field

B. File

C. Records

D. Entity

Ans. D. Entity

7. Which of the following is the collection of records of the entities in a given entity set?

A. Field

B. File

C. Records

D. Entity

Ans. B. File

8. Which of the following involves arranging the records in a logical order?

A. Merging

B. Sorting

C. Traversing

D. Searching

Ans. B. Sorting

9. Which of the following operations combined record into different sorted files into a single sorted file?

A. Sorting

B. Merging

C. Searching

D. Inserting

Ans. B. Merging

10. Which of the following operations accesses each record exactly once so that certain items may be processed?

A. Inserting

B. Deleting

C. Traversing

D. Searching

Ans. C. Traversing

11. Which of the following is also called first in first out FIFO system?

A. Tree

B. Stack

C. Queue

D. Graph

Ans. C. Queue

12. Which of the following is also called last in first out LIFO system?

A. Queue

B. Stack

C. Graph

D. Tree

Ans. b. stack

13. Which of the following is a non linear data structure?

A. Array

B. Linked list

C. Stack

D. Graph

Ans. D. Graph

14. Data structure that contains a relationship between a pair of elements, this is not necessarily hierarchical in nature.

A. Tree

B. String

C. Graph

D. Array

Ans. C. Graph

15. Which one of the below mentioned is linear data structure −

A. Queue

B. Stack

C. Arrays

D. All of the above

Ans. D. All of the above

Q.16 - Graph traversal is different from a tree traversal, because

A. trees are not connected.

B. graphs may have loops.

C. trees have root.

D. None is true as tree is a subset of graph.

Ans. C. trees have root.

Q.17.  Minimum number of fields in each node of a doubly linked list is ____

A. 2

B. 3

C. 4

D. None of the above

Ans. B. 3

Q.18 Which of the following data structure is more appropriate to represent a heap?

A. Two-dimensional array

B. Doubly linked list

C. Linear Array

D. Linked list

Ans. C. Linear array

Q.19. A data structure in which linear sequence is maintained by pointers is known as

A. Array

B. Stack

C.Linked list

D. Pointer-based data structure

Ans. C. Linked list

Q.20. Which of the following data structure works on the principle of First Come First Serve?

A. Priority queue

B. Heap

C. Stack

D. Queue

Ans. D. Queue

Q.21. A  ____ is a linear collection of self-referential structures, called nodes, connected by pointer links.

A. Queue

B. Linked list

C. Tree

D. Stack

Ans. B. Linked list

Q.22. A queue where all elements have equal priority is a

A. ILFO data structure

B. LILO data structure

C. FIFO data structure

D. LIFO data structure

Ans. C. FIFO

Q.23. Which of the following data structure can be used to represent many-to-many relation?

A. B-tree

B. Binary tree

C. Graph

D. All of above

Ans. C. GRAPH

Q.24. Which of the following statement is not true about linked lists?

A. Element in a linked list, if it is sorted, can be quickly searched by applying binary search technique

B. Elements are not necessarily stored in contiguous locations

C. Insertions and deletions can be performed efficiently as compared to arrays

D. Linked list is a dynamic structure

Ans. A. Element in a linked list, if it is sorted, can be quickly searched by applying binary search technique

Q.25. Which of the following is not a linear data structure?

A. Stack

B. Queue

C. Linked list

D. Binary tree

Ans. D. BINARY TREE

Q.26. Which of the following data structure permits insertion and deletion operations only on one end of the structure?

A. Linked list

B. Array

C. Stack

D. Queue

Ans. C. STACK

Q.27. Which of the following operation is not supported by a queue?

A. Inserting element at rear

B. Removing element from front

C.  Removing element from middle

D. None of above

Ans. C. Removing element from middle

Q.28. statements about a binary tree is correct?

A. No binary tree is both complete and full

B. Every full binary tree is also a complete binary tree

C. Every complete binary tree is also a full binary tree

D. Every binary tree is either complete or full

Ans. B. Every full binary tree is also a complete binary tree

Q.29.The best way to find an item in an unsorted implemented using an array list is with

A. Binary search

B. Linear search

C. Direct search

D. Random search

Ans. B. LINEAR SEARCH

Q.30.A data item that cannot be divided into sub items is known as

A. Elementary data item

B. Group data item

C.Primary key

D. Primary data item

Ans. B. GROUP DATA ITEM

Q.31. A data structure whose elements form a sequence is known as

A. Heterogeneous data structure

B.  Homogeneous data structure

C. Linear data structures

D. Non- linear data structure

Ans. C. LINEAR DATA STRUCTURE

Q.32. Which of the following data structure is used to represent hierarchical relationship among its elements?

A. Queue

B. Hash table

C.  Tree

D. Graph

Ans: C. TREE

Q.33.The data structure required to evaluate a postfix expression is

A.Queue

B.Stack

C.Array

D.linked-list

Ans. b. stack

Q.34. Beginning address of an array is called

A. Base Address

B. Top Address

C. Both (a) & (b)

D. None of the above

Ans. C. both a and b

Q.35. Which of the following usees FIFO method

A. Queue

B. Stack

C. Hash Table

D. Binary Search Tree

Ans. A. Queue

Q.36. Which one of the below mentioned is linear data structure −

A. Queue

B. Stack

C. Arrays

D. All of the above

Ans. D. All of the above

Q.37. Index of arrays in C programming langauge starts from

A. 0

B. 1

C. Either 0 or 1

D. Undefined

Ans. A. 0

Q.38.  In C programming, when we remove an item from bottom of the stack, then −

A. The stack will fall down.

B. Stack will rearranged items.

C. It will convert to LIFO

D. This operation is not allowed.

Ans. B. Stack will rearranges items.

Q.39. What is the maximum number of children that a binary tree node can have?

A. 0

B. 1

C. 2

D. 3

Ans. c. 2

Q.40. A binary tree is a rooted tree but not an ordered tree.

A. true

B. false

Ans. b. FALSE

Q.41. How many common operations are performed in a binary tree?

A. 1

B. 2

C. 3

D. 4

Ans. c. 3

Q.42. How many types of insertion are performed in a binary tree?

A. 1

B. 2

C. 3

D. 4

Ans. b. 2

Q.43. ....... is a pile in which items are added at one end and removed from the other.

A. List

B. Queue

C. Stack

D. Array

Ans. B. QUEUE

Q.44. Which of the following data structures are indexed structures?

A. Stack

B. Linked lists

C. Linear arrays

D. None of the above

Ans. C. LINEAR ARRAY

Q.45. Which of the following data structure store the homogeneous data elements?

A. Lists

B. Pointers

C. Records

D. Arrays

Ans. C. RECORDS

Q.46. Linear arrays are also called.......

A. One-dimensional array

B. Vertical array

C. Horizontal array

D. All of the above

Ans. A. ONE DIMENSIONAL ARRAY 

Q.47. A ......... does not keep track of address of every element in the list.

A. Stack

B. Queue

C. String

D. Linear array

Ans. D. LINEAR ARRAY

Q.48. Any node is the path from the root to the node is called

A. Ancestor node

B. Successor node

C. Internal node

D. None of the above

Ans. A. ANCESTOR NODE

Q.49.  A graph is a collection of nodes, called ...... And line segments called arcs or ...... that connect pair of nodes.

A. vertices, paths

B. vertices, edges

C. graph node, edges

D. edges, vertices

Ans. B. VERTICES, EDGES

Q.50. In ........, search start at the beginning of the list and check every element in the list.

A. Binary search

B. Hash Search

C. Linear search

D. Binary Tree search

Ans. C. Linear search

Q.51. To represent hierarchical relationship between elements, Which data structure is suitable?

A. Graph

B. Tree

C. Dequeue

D. Priority

Ans. B. TREE

Q.52. Which of the following data structure is linear type?

A. Stack

B. Graph

C. Trees

D. Binary tree

Ans. A. STACK