Data Structures and Algorithms MCQs | Objective Questions Answers

Questions
81 Which of the following sorting algorithms does not have a worst case running time of O(n2)?
A Insertion sort
B Quick sort
C Bubble sort
D Merge sort

Answer: Option [D]
82 In a circular linked list
A there is no beginning and no end.
B components are arranged hierarchically.
C forward and backward traversal within the list is permitted.
D components are all linked together in some sequential manner.

Answer: Option [A]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source
83 The quick sort algorithm exploit _________ design technique
A Overflow
B Backtracking
C Dynamic programming
D Divide and Conquer

Answer: Option [D]
84 The data structure required to check whether an expression contains balanced parenthesis is
A Stack
B Queue
C Tree
D Array

Answer: Option [A]
85 What data structure would you mostly likely see in a nonrecursive implementation of a recursive algorithm?
A Trees
B Linked list
C Stack
D Queue

Answer: Option [C]
86 The number of leaf nodes in a complete binary tree of depth d is
A 2d
B 2d–1+1
C 2d+1+1
D 2d+1

Answer: Option [A]
87 The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum
A One node
B Two nodes
C Three nodes
D Any number of nodes

Answer: Option [A]
88 A binary tree of depth “d” is an almost complete binary tree if
A Each leaf in the tree is either at level “d” or at level “d–1”
B For any node “n” in the tree with a right descendent at level “d” all the left descendents of “n” that are leaves, are also at level “d”
C Both (A) & (B)
D None of the above

Answer: Option [C]
89 In a binary tree a sequence of consecutive edges is called ......
A Path
B Rotate
C Two-way
D Connecting lines

Answer: Option [A]
90 An adjacency matrix representation of a graph cannot contain information of:
A nodes
B edges
C parallel edges
D direction of edges

Answer: Option [C]
apsc complete general studies course