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 8 of 27

Explore more Topics under UGC CBSE NET Exam

Q71.
Which of the following is a correct statement?

a.

Composition is a strong type of association between two classes with full ownership

b.

Composition is a strong type of association between two classes with partial ownership

c.

Composition is a weak type of association between two classes with partial ownership

d.

Composition is a weak type of association between two classes with strong ownership

Discuss
Answer: (a).Composition is a strong type of association between two classes with full ownership
Q72.
Which of the following is not a correct statement?

a.

Every class containing abstract method must be declared abstract

b.

Abstract class can directly be initiated with ‘new’ operator

c.

Abstract class can be initiated

d.

Abstract class does not contain any definition of implementation

Discuss
Answer: (b).Abstract class can directly be initiated with ‘new’ operator
Q73.
Consider the following binary search tree. If we remove the root node, which of the node from the left subtree will be the new root?

a.

11

b.

12

c.

13

d.

16

Discuss
Answer: (d).16
Q74.
Given the following statements:

(a) To implement Abstract Data Type, a programming language require a syntactic unit to encapsulate type definition.
(b) To implement ADT, a programming language requires some primitive operations that are built in the language processor.
(c) C++, Ada, Java 5.0, C#2005 provide support for parameterised ADT.

Which one of the following options is correct?

a.

(a), (b) and (c) are false

b.

(a) and (b) are true; (c) are false

c.

(a) is true; (b) and (c) are false

d.

(a), (b) and (c) are true

Discuss
Answer: (d).(a), (b) and (c) are true
Q75.
Match the following types of variables with the corresponding programming languages:

(a) Static variables                   (i) Local variables in Pascal
(b) Stack dynamic                    (ii) All variables in APL
(c) Explicit heap dynamic       (iii) Fortran 77
(d) Implicit heap dynamic       (iv) All objects in JAVA

Codes:
      (a)   (b)   (c)   (d)

a.

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

b.

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

c.

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

d.

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

Discuss
Answer: (c).(iii)  (i)    (iv)   (ii)
Q76.
The number of different binary trees with 6 nodes is .............

a.

6

b.

42

c.

132

d.

256

Discuss
Answer: (c).132
Q77.
Let A[1...n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i,j) is called an inversion of A. What is the expected number of inversions in any permutation on n elements?

a.

θ(n)

b.

θ(lg n)

c.

θ(nlg n)

d.

θ(n^2)

Discuss
Answer: (d).θ(n^2)
Q78.
Which one of the following array represents a binary max-heap?

a.

[26, 13, 17, 14, 11, 9, 15]

b.

[26, 15, 14, 17, 11, 9, 13]

c.

[26, 15, 17, 14, 11, 9, 13]

d.

[26, 15, 13, 14, 11, 9, 17]

Discuss
Answer: (c).[26, 15, 17, 14, 11, 9, 13]
Q79.
Match the following:

(a) Huffman codes                              (i) O(n2)
(b) Optimal polygon triangulation     (ii) θ(n3)
(c) Activity selection problem             (iii) O(nlgn)
(d) Quicksort                                         (iv) θ(n)

Codes:
      (a)   (b)   (c)   (d)

a.

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

b.

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

c.

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

d.

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

Discuss
Answer: (c).(iii)  (ii)   (iv)   (i)
Q80.
Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined?

a.

925, 221, 912, 245, 899, 259, 363, 364

b.

3, 400, 388, 220, 267, 383, 382, 279, 364

c.

926, 203, 912, 241, 913, 246, 364

d.

3, 253, 402, 399, 331, 345, 398, 364

Discuss
Answer: (c).926, 203, 912, 241, 913, 246, 364
Page 8 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!

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

JavaScript

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