MSBTE I Scheme Practice MCQs of “Data Structure using ‘C’ (22317)” All Chapter MCQ.

 

MSBTE I Scheme Practice MCQs of “Data Structure using ‘C’ (22317)”

 

All Chapter MCQ.

 

1. The logical or mathematical model of a particular organization of data is called a __________

(A) Data structure

(B) Data arrangement

(C) Data configuration

(D) Data formation.

2. Operations on a data structure may be ____________

(A) Creation

(B) Destruction

(C) Selection

(D) All of the above

3. ________ Is a directed tree in which outdegree of each node is less than or equal to two.

(A) Unary tree

(B) Binary tree

(C) Trinary tree

(D) Both B and C

4. The property of binary tree is

(A) The first subset is called left subtree

(B) The second subtree is called right subtree

(C) The root cannot contain NULL

(D) The right subtree can be empty

5. ________ is not the operation that can be performed on queue.

(A) Insertion

(B) Deletion

(C) Retrieval

(D) Traversal

6. A graph is said to be _________ if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 vertices of V2.

(A) Partite

(B) Bipartite

(C) Rooted

(D) Bisects

7. In the _________ traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

(A) Depth First

(B) Breadth First

(C) Width First

(D) Depth Limited

8. Which data structure is used in breadth first search of a graph to hold nodes?

(A) Stack

(B) Queue

(C) Tree

(D) Array

9. In _________, 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

10. The advantage of ________is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

(A) Lists

(B) Linked Lists

(C) Trees

(D) Queues

 

 

1. State True or False.

    (i) An undirected graph which contains no cycles is called forest.

    (ii) A graph is said to be complete if there is an edge between every pair of vertices.

(A) True, True

(B) False, True

(C) False, False

(D) True, False

2. A ________ is a graph that has weights of costs associated with its edges.

(A) Network

(B) Weighted graph

(C) Both A and B

(D) None A and B

3. ________ is not an operation performed on linear list

    (i) Insertion (ii) Deletion (iii) Retrieval (iv) Traversal

(A) Only i, ii and iii

(B) Only i and ii

(C) All of the above

(D) None of the above

4. A data structure where elements can be added or removed at either end but not in the middle is called ________

(A) Linked lists

(B) Stacks

(C) Queues

(D) Dequeue

5. When does top value of the stack changes?

(A) Before deletion

(B) While checking underflow

(C) At the time of deletion

(D) After deletion

6. A ________ does not keep track of address of every element in the list.

(A) Stack

(B) String

(C) Linear array

(D) Queue

7. Which if the following is/are the levels of implementation of data structure

(A) Abstract level

(B) Application level

(C) Implementation level

(D) All of the above

8. _______ is not the component of data structure.

(A) Operations

(B) Storage Structures

(C) Algorithms

(D) None of above

9. Which of the following data structure can’t store the non-homogeneous data elements?

(A) Arrays

(B) Records

(C) Pointers

(D) Stacks

10. To represent hierarchical relationship between elements, which data structure is suitable?

(A) Deque

(B) Priority

(C) Tree

(D) Graph

 

 

1. Match the following.

    (a) Completeness (i) How long does it take to find a solution

    (b) Time Complexity (ii) How much memory need to perform the search.

    (c) Space Complexity (iii) Is the strategy guaranteed to find the solution when there in one.

(A) a-iii, b-ii, c-i

(B) a-i,  b-ii, c-iii

(C) Implementation level

(D) a-i, b-iii, c-ii

2. What will be the value of top, if there is a size of stack STACK_SIZE is 5

(A) 5

(B) 6

(C) 4

(D) None

3. Any node is the path from the root to the node is called

(A) Successor node

(B) Ancestor node

(C) Internal node

(D) None of the above

4. Which of the following data structure store the homogeneous data elements?

(A) Arrays

(B) Records

(C) Pointers

(D) Lists

5. Which of the following data structure is linear type?

(A) Array

(B) Tree

(C) Graphs

(D) Hierarchy

6. Each node in a linked list has two pairs of _______ and _______

(A) Link field and information field

(B) Link field and avail field

(C) Avail field and information field

(D) Address field and link field

7. _______ level is where the model becomes compatible executable code

(A) Abstract level

(B) Application level

(C) Implementation level

(D) All of the above

8. _______ is very useful in situation when data have to stored and then retrieved in reverse order.

(A) Stack

(B) Queue

(C) List

(D) Link list

9. Which of the following data structure is linear type?

(A) Graph

(B) Trees

(C) Binary tree

(D) Stack

10. In a queue, the initial values of front pointer f rare pointer r should be _______ and ________ respectively.

(A) 0 and 1

(B) 0 and -1

(C) -1 and 0

(D) 1 and 0