https://res.cloudinary.com/hg6hswtwo/image/upload/v1/media/pics/Data-Structures-In-C-MCQs-Questions-And-Answers-For-SPPU-Exam-2020-toolsandjobs_mtxae5
secondyear

Data structures in c mcq questions and answers for sppu exam 2020 part-1





This contains data structures and algorithm mcq questions for preparing SPPU exam 2020, for placements exams, companies exam and other


This is part 1 of data structures in c mcq questions and answers for sppu exam 2020

1.A binary search tree whose left sub tree and right sub tree differ in
height by at most 1 unit is called ...
a.AVL tree 
b.Red-black tree 
c.Lemma tree 
d.None of the above 
e.both a and b

Answer:a.AVL tree 

2. .... level is where the model becomes compatible executable code 
a.Abstract level 
b.Application level
c.Implementation level 
d.All of the above
e.None of these

Answer:c.Implementation level 

3.stack is also called as
a.Last in first out
b.First in last out
c.Last in last out
d.First in first out
e.None of there

Answer:a.Last in first out

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

Answer:c.True,True

5. ....is not the component of data structure.
a.Operations
b.Storage Structures 
c.Algorithms
d.None of above
e.Programming

Answer:d.None of above

6.Inserting an item into the stack when stack is not full is Called ...... operation and deletion of item
form the stack,when stack is not empty is called .... operation.
a.Push,pop
b.Pop,push
c.Insert,delete
d.Delete,insert 
e.None of these

Answer:a.Push,pop

7. ...... is a pile in which items are added at one end and removed from the other
a.Stack 
b.Queue 
c.List
d.None of the above

Answer:b.Queue 

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 
e.None of these

Answer:a.Stack 

9.Which data structure allows deleting data elements from and inserting at rear ?
a.Stack 
b.Queue
c.Dequeues 
d.Binary search tree
e.None of these

Answer:b.Queue

10.Which of the following data structure can't store the Non-Homogeneous data elements ?
a.Arrays
b.Records
c.Pointer
d.Stacks
e.None of these

Answer:a.Arrays

11.Which of the following in non-liner data structure ?
a.stack 
b.List
c.Strings
d.trees
e.None of these

Answer:d.trees

12.To represent hierarchical relationship between elements,Which data structrue is suitable ?
a.Dequeue 
b.Priority 
c.Tree 
d.Graph 
e.None of these

Answer:c.Tree 

13.Which data structure is used in breadth first search of a graph to hold nodes ?
a.Stack 
b.Queue
c.Tree
d.Array
e.None of these 

Answer:b.Queue

14.In a stack,if a user tries to remove an elements from empty stack it is called .....
a.underflow 
b.Empty collection
c.Overflow 
d.Garbage Collection 
e.None of these

Answer:a.underflow 

15.The disadvantage in using a circular linked list is....
a. It is possible to get into infinite loop.
b Last node points to first node
c. Time consuming
d. Requires more memory space
e. None of these

Answer:a. It is possible to get into infinite loop.

16. Deletion operation is done by using ......... im a queue.
a.Front 
b.Rear
c.Top 
d.List
e.None of these

Answer:a.Front 

17. Heap can be used as...
a.Priority queue 
b.Stack
c.A decreasing order array
d.None of these 
e.Aincreasing order array

Answer:a.Priority queue 

18. Which of the following is true?
a.A graph may contain no edges and many vertices
b.A graph may contain many edges and no vertices
c.A graph may contain no edges and no vertices
d.None of these
e.All of the above

Answer:b.A graph may contain many edges and no vertices

19. Quick Sort can be categorized into which of the following?
a.Brute Force technique 
b.Divide and conquer
c.Greedy algorithm
d.Dynamic programming 
e.None of these

Answer:b.Divide and conquer

20. What is the worst case complexity of Quick Sort?
a.O(nlogn)
b.O(logn)
c.O(n) 
d.O(n2)
e.None of these

Answer:d.O(n2)

Click to read part 2
 





Publish Your Great Work

Touch below

Your AD here