# Data Structure Questions and Answers updated daily – Computer Knowledge

Data Structure Questions: Solved 242 Data Structure Questions and answers section with explanation for various online exam preparation, various interviews, Computer Knowledge Category online test. Category Questions section with detailed description, explanation will help you to master the topic.

## Data Structure Questions

81. Binary search algorithm employs the strategy of.

SHOW ANSWER

Correct Ans:Divide and Conquer technique

Explanation:

Workspace

82. The number of nodes in a complete binary tree of height n:

SHOW ANSWER

Correct Ans:2n+1-1

Explanation:

Workspace

83. Which of the following connected simple graph has exactly one spanning tree?

SHOW ANSWER

Correct Ans:all of the above

Explanation:

Workspace

84. Consider the following statements for priority queue :

S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.

S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields.

Which of the following is correct?

S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.

S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields.

Which of the following is correct?

SHOW ANSWER

Correct Ans:Both S1 and S2 are correct.

Explanation:

Workspace

85. Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has weight 65. Which statement is always true?

SHOW ANSWER

Correct Ans:Weight (u, v) > 12

Explanation:

Workspace

86. Leaves of which of the following trees are at the same level?

SHOW ANSWER

Correct Ans:B-tree

Explanation:

Workspace

87. Skolmization is the process of

SHOW ANSWER

Correct Ans:removing all the existential quantifiers

Explanation:

Workspace

88. Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5 ?

SHOW ANSWER

Correct Ans:5, 4, 3, 2, 1

Explanation:

Workspace

89. Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ?

SHOW ANSWER

Correct Ans:T(n) = O(n)

Explanation:

Workspace

90. The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ?

(n and m are no. of nodes and edges respectively)

a. Bellman Ford Algorithm ------- 1. O (m log n)

b. Kruskals algorithm ------- 2. O (n3)

c. Floyd Warshall Algorithm ------- 3. O(mn)

d. Topological sorting ------- 4. O(n + m)

Codes : a b c d

(n and m are no. of nodes and edges respectively)

a. Bellman Ford Algorithm ------- 1. O (m log n)

b. Kruskals algorithm ------- 2. O (n3)

c. Floyd Warshall Algorithm ------- 3. O(mn)

d. Topological sorting ------- 4. O(n + m)

Codes : a b c d

SHOW ANSWER

Correct Ans:3 1 2 4

Explanation:

Workspace

91. Enumeration is a process of

SHOW ANSWER

Correct Ans:Assigning a legal values possible for a variable

Explanation:

Workspace

92. Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push(5), Pop, what is the value of the top of the stack ?

SHOW ANSWER

Correct Ans:1

Explanation:

Workspace

93. A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79 ?

SHOW ANSWER

Correct Ans:5

Explanation:

Workspace

94. In which tree, for every node the height of its left subtree and right subtree differ almost by one ?

SHOW ANSWER

Correct Ans:AVL tree

Explanation:

Workspace

95. The worst case time complexity of AVL tree is better in comparison to binary search tree for

SHOW ANSWER

Correct Ans:Search, Insert and Delete Operations

Explanation:

Workspace

96. Given a binary search trees for a set of n=5 keys with the following probabilities :

i 0 1 2 3 4 5

p 0.15 0.10 0.05 0.10 0.20

qi 0.05 0.10 0.05 0.05 0.05 0.10

The expected optimal cost of the search is

i 0 1 2 3 4 5

p 0.15 0.10 0.05 0.10 0.20

qi 0.05 0.10 0.05 0.05 0.05 0.10

The expected optimal cost of the search is

SHOW ANSWER

Correct Ans:2.75

Explanation:

Workspace

97. Linked Lists are not suitable for _____.

SHOW ANSWER

Correct Ans:Binary Search

Explanation:

Workspace

98. A simple graph G with n ? vertices is connected if the graph has

SHOW ANSWER

Correct Ans:more than (n ? 1) (n ? 2)/2 edges

Explanation:

Workspace

99. Consider the In-order and Post-order traversals of a tree as given below :

In-order : j e n k o p b f a c l g m d h i

Post-order : j n o p k e f b c l m g h i d a

The Pre-order traversal of the tree shall be

In-order : j e n k o p b f a c l g m d h i

Post-order : j n o p k e f b c l m g h i d a

The Pre-order traversal of the tree shall be

SHOW ANSWER

Correct Ans:a b e j k n o p f c d g l m h i

Explanation:

Workspace

100. Consider the following statements :

(i) A graph in which there is a unique path between every pair of vertices is a tree.

(ii) A connected graph with e = v ? 1 is a tree.

(iii) A graph with e = v ? 1 that has no circuit is a tree.

Which of the above statements is/are true ?

(i) A graph in which there is a unique path between every pair of vertices is a tree.

(ii) A connected graph with e = v ? 1 is a tree.

(iii) A graph with e = v ? 1 that has no circuit is a tree.

Which of the above statements is/are true ?

SHOW ANSWER

Correct Ans:All of the above

Explanation:

Workspace

Are you seeking for good platform for practicing Data Structure questions in online. This is the right place. The time you spent in Fresherslive will be the most beneficial one for you.

## Online Test on Data Structure @ Fresherslive

This page provides important questions on Data Structure along with correct answers and clear explanation, which will be very useful for various Interviews, Competitive examinations and Entrance tests. Here, Most of the Data Structure questions are framed with Latest concepts, so that you may get updated through these Data Structure Online tests. Data Structure Online Test questions are granted from basic level to complex level.

## Why To Practice Data Structure Test questions Online @ Fresherslive?

Data Structure questions are delivered with accurate answer. For solving each and every question, very lucid explanations are provided with diagrams wherever necessary.

Practice in advance of similar questions on Data Structure may improve your performance in the real Exams and Interview.

Time Management for answering the Data Structure questions quickly is foremost important for success in Competitive Exams and Placement Interviews.

Through Fresherslive Data Structure questions and answers, you can acquire all the essential idea to solve any difficult questions on Data Structure in short time and also in short cut method.

Winners are those who can use the simplest method for solving a question. So that they have enough time for solving all the questions in examination, correctly without any tense. Fresherslive provides most simplest methods to answer any tough questions. Practise through Fresherslive test series to ensure success in all competitive exams, entrance exams and placement tests.

## Why Fresherslive For Data Structure Online Test Preparation?

Most of the job seekers finding it hard to clear Data Structure test or get stuck on any particular question, our Data Structure test sections will help you to success in Exams as well as Interviews. To acquire clear understanding of Data Structure, exercise these advanced Data Structure questions with answers.

You're Welcome to use the Fresherslive Online Test at any time you want. Start your beginning, of anything you want by using our sample Data Structure Online Test and create yourself a successful one. Fresherslive provides you a new opportunity to improve yourself. Take it and make use of it to the fullest. GOODLUCK for Your Bright Future.