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 9 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

Q81.

A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles.

n-2, n-1

n-3, n-2

n-1, n

n-2, n-2

Discuss

Answer: (b).n-3, n-2

Q82.

Implicit return type of a class constructor is:

not of class type itself

class type itself

a destructor of class type

a destructor not of class type

Discuss

Answer: (b).class type itself

Q83.

It is possible to define a class within a class termed as nested class. There are ............ types of nested classes.

Discuss

Answer: (c).4

Q84.

Which of the following statements is correct?

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

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

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

Aggregation is a weak type of association between two classes with full ownership.

Discuss

Answer: (c).Aggregation is a weak type of association between two classes with partial ownership.

Q85.

Which of the following statements is correct?

Every class containing abstract method must not be declared abstract.

Abstract class cannot be directly initiated with ‘new’ operator.

None of the above

Discuss

Answer: (c).Abstract class cannot be directly initiated with ‘new’ operator.

Q86.

When one object reference variable is assigned to another object reference variable then

a copy of the object is created

a copy of the reference is created

a copy of the reference is not created

it is illegal to assign one object reference variable to another object reference variable

Discuss

Answer: (b).a copy of the reference is created

Q87.

Which of the following statement(s) is/are false?

(a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.
(b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree.
(c) A complete graph (Kn) has a Hamilton Circuit whenever n≥3
(d) A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite.

(a) only

(b) and (c)

(d) only

Discuss

Answer: (d).(d) only

Q88.

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?

(a) and (b)

(b) and (c)

(a) and (c)

(a), (b) and (c)

Discuss

Answer: (d).(a), (b) and (c)

Q89.

Consider the following two statements:

(a) A publicly derived class is a subtype of its base class.
(b) Inheritance provides for code reuse.

Which of the above statements is correct?

Both the statements (a) and (b) are correct

Neither of the statements (a) and (b) are correct

Statement (a) is correct and (b) is incorrect

Statement (a) is incorrect and (b) is correct

Discuss

Answer: (a).Both the statements (a) and (b) are correct

Q90.

In general, in a recursive and non-recursive implementation of a problem (program):

Both time and space complexities are better in recursive than in non-recursive program

Both time and space complexities are better in non-recursive than in recursive program

Time complexity is better in recursive version but space complexity is better in non-recursive version of the program

Space complexity is better in recursive version but time complexity is better in non-recursive version of the program

Discuss

Answer: (b).Both time and space complexities are better in non-recursive than in recursive program

Page 9 of 27

Welcome to the Data Structures and Algorithms MCQs Page

Data Structures and Algorithms MCQs | Page 9 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

MS Office

Java Programming

Hadoop

Reverse Engineering

Data Structures and Algorithms

UNIX

Cryptography and Network Security

C# programming

C Programming