# 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

61. Which of the below given sorting techniques has highest best-case runtime complexity ?

SHOW ANSWER

Correct Ans:selection sort

Explanation:

Workspace

62. Which of these algorithmic approach tries to achieve localized optimum solution ?

SHOW ANSWER

Correct Ans:Greedy approach

Explanation:

Workspace

63. Time complexity of Depth First Traversal of is

SHOW ANSWER

Correct Ans:?(|V|+|E|)

Explanation:

Workspace

64. Match the following ?

(1) Bubble Sort ------ (A) ?(n)

(2) Shell Sort ------ (B) ?(n^2)

(3) Selection Sort ------ (C) ?(n log n)

(1) Bubble Sort ------ (A) ?(n)

(2) Shell Sort ------ (B) ?(n^2)

(3) Selection Sort ------ (C) ?(n log n)

SHOW ANSWER

Correct Ans:1 ? B, 2 ? C, 3 ? A

Explanation:

Workspace

65. A stable sorting algorithm

SHOW ANSWER

Correct Ans:does not change the sequence of appearance of elements

Explanation:

A stable sorting algorithm like bubble sort, does not change the sequence of appearance of similar element in the sorted list.

Workspace

66. Re-balancing of AVL tree costs

SHOW ANSWER

Correct Ans:?(log n)

Explanation:

Workspace

67. In the deletion operation of max heap, the root is replaced by

SHOW ANSWER

Correct Ans:last element of the last level

Explanation:

Workspace

68. Linked list search complexity is

SHOW ANSWER

Correct Ans:O(n)

Explanation:

Workspace

69. Time required to merge two sorted lists of size m and n, is

SHOW ANSWER

Correct Ans:?(m + n)

Explanation:

Workspace

70. What is not true about insertion sort?

SHOW ANSWER

Correct Ans:None of these

Explanation:

Workspace

71. Maximum number of nodes in a binary tree with height k, where root is height 0, is

SHOW ANSWER

Correct Ans:2^(k+1) ? 1

Explanation:

Workspace

72. A procedure that calls itself is called

SHOW ANSWER

Correct Ans:recursive

Explanation:

In recursion, a procedure calls itself, either directly or by calling a procedure which in turn calls it.

Workspace

73. Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the inorder transversal sequence of the resultant tree ?

SHOW ANSWER

Correct Ans:0 1 2 3 4 5 6 7 8 9

Explanation:

Workspace

74. Consider the following declaration of a two-dimensional array in C :

Char a[100][100]

Assuming that the main memory is byte-addressable and that array is stored starting from memory address 0, the address of a [40] [50] is

Char a[100][100]

Assuming that the main memory is byte-addressable and that array is stored starting from memory address 0, the address of a [40] [50] is

SHOW ANSWER

Correct Ans:4050

Explanation:

Workspace

75. Prim's algorithm is a method available for finding out the minimum cost of a spanning tree. Its time complexity is given by:

SHOW ANSWER

Correct Ans:O(n*n)

Explanation:

Workspace

76. The complexity of linear search algorithm of an array of n elements is:

SHOW ANSWER

Correct Ans:O (n)

Explanation:

Workspace

77. The Eigen vectors of a real symmetric matrix corresponding to different Eigen values are:

SHOW ANSWER

Correct Ans:Orthogonal matrix

Explanation:

Workspace

78. Graph having every pair of vertices connected is called:

SHOW ANSWER

Correct Ans:Complete graph

Explanation:

Workspace

79. An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes is:

SHOW ANSWER

Correct Ans:ODD degree

Explanation:

Workspace

80. Give the name of the Linear list in which elements can be added at ends but not in the middle:

SHOW ANSWER

Correct Ans:Queue

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.