adplus-dvertising

Welcome to the Data Structures and Algorithms MCQs Page

Dive deep into the fascinating world of Data Structures and Algorithms with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Data Structures and Algorithms, a crucial aspect of UGC CBSE NET Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Data Structures and Algorithms, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within UGC CBSE NET Exam.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Data Structures and Algorithms. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of UGC CBSE NET Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Data Structures and Algorithms. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Data Structures and Algorithms MCQs | Page 26 of 27

Explore more Topics under UGC CBSE NET Exam

Q251.
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding technique will have the average length of:

a.

2.4

b.

1.87

c.

3.0

d.

2.15

Discuss
Answer: (d).2.15
Q252.
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves:

a.

cannot have more than 37 nodes

b.

has exactly 37 nodes

c.

has exactly 35 nodes

d.

cannot have more than 35 nodes

Discuss
Answer: (b).has exactly 37 nodes
Q253.
Match the following with respect to algorithm paradigms :

List - I
(a) The 8-Queen’s problem
(b) Single-Source shortest paths
(c) STRASSEN’s Matrix multiplication
(d) Optimal binary search trees

List - II
(i) Dynamic programming
(ii) Divide and conquer
(iii) Greedy approach
(iv) Backtracking

Code:
(a) (b) (c) (d)

a.

(iv) (i) (iii) (ii)

b.

(iv) (iii) (i) (ii)

c.

(iii) (iv) (ii) (i)

d.

(iv) (iii) (ii) (i)

Discuss
Answer: (d).(iv) (iii) (ii) (i)
Q254.
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):

a.

45

b.

72

c.

360

d.

450

Discuss
Answer: (c).360
Q255.
A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be:

a.

30

b.

33

c.

45

d.

125

Discuss
Answer: (c).45
Q256.
Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is:

a.

Logarithmic

b.

Linear

c.

Quadratic

d.

Exponential

Discuss
Answer: (d).Exponential
Q257.
Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i< = n), the index of the parent is:

a.

floor ((i +1)/2)

b.

ceiling ((i + 1)/2)

c.

floor (i/2)

d.

ceiling (i/2)

Discuss
Answer: (c).floor (i/2)
Q258.
The following numbers are inserted into an empty binary search tree in the given order:

10, 1, 3, 5, 15, 12, 16.

What is the height of the binary search tree?

a.

3

b.

4

c.

5

d.

6

Discuss
Answer: (a).3
Q259.
Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following statements is false?

a.

Every minimum spanning tree of G must contain Emin.

b.

If Emax is in minimum spanning tree, then its removal must disconnect G.

c.

No minimum spanning tree contains Emax.

d.

G has a unique minimum spanning tree.

Discuss
Answer: (c).No minimum spanning tree contains Emax.
Q260.
A list of n strings, each of length n, is sorted into lexicographic order using merge - sort algorithm. The worst case running time of this computation is:

a.

O(n log n)

b.

O(n^2 log n)

c.

O(n^2 + log n)

d.

O(n^3)

Discuss
Answer: (b).O(n^2 log n)
Page 26 of 27

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Software Engineering

Learn about the systematic approach to developing software with our Software...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Compiler Design

Unravel the process of translating source code into executable programs with our...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....