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.

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

01

Networking

02

Operating System

03

Software Engineering

04

Systems Programming

05

Computer Architecture

06

DBMS

07

Computer Graphics

08

Artificial Intelligence

09

Web Technologies

10

Theory of Computation(TOC)

11

Discrete Structures

12

Computer Arithmetic

13

Programming in C

14

UNIX System

15

Current Trends and Technologies

16

Neural Networks

17

Fuzzy Systems

Q71.

Which of the following is a correct statement?

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

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

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

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?

Every class containing abstract method must be declared abstract

Abstract class can directly be initiated with ‘new’ operator

Abstract class can be initiated

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?

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), (b) and (c) are false

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

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

(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)

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

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

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

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

Discuss

Answer: (c).(iii) (i) (iv) (ii)

Q76.

The number of different binary trees with 6 nodes is .............

132

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?

θ(n)

θ(lg n)

θ(nlg n)

θ(n^2)

Discuss

Answer: (d).θ(n^2)

Q78.

Which one of the following array represents a binary max-heap?

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

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

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

[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)

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

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

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

(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?

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

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

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

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

Discuss

Answer: (c).926, 203, 912, 241, 913, 246, 364

Page 8 of 27

Welcome to the Data Structures and Algorithms MCQs Page

Data Structures and Algorithms MCQs | Page 8 of 27

Explore more Topics under UGC CBSE NET Exam

Networking

Operating System

Software Engineering

Systems Programming

Computer Architecture

DBMS

Computer Graphics

Artificial Intelligence

Web Technologies

Theory of Computation(TOC)

Discrete Structures

Computer Arithmetic

Programming in C

UNIX System

Current Trends and Technologies

Neural Networks

Fuzzy Systems

Suggested Topics

Systems Analysis and Design Methods

MATLAB

IT Fundamentals

Visual Basic

CompTIA PenTest+ Certification Exam PT0 002

CSS

MySQL Database

Digital Communication

Microprocessor