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

Explore more Topics under UGC CBSE NET Exam

Q101.
Which of the following is used to make an Abstract class ?

a.

Making atleast one member function as pure virtual function

b.

Making atleast one member function as virtual function

c.

Declaring as Abstract class using virtual keyword

d.

Declaring as Abstract class using static keyword

Discuss
Answer: (a).Making atleast one member function as pure virtual function
Q102.
Match the following with reference to object oriented modelling :

List - I                         List - II

(a) Polymorphism        (i) Picking both operator and attributes with
operations appropriate to model an object
(b) Inheritance             (ii) Hiding implementation details of methods
from users of objects
(c) Encapsulation        (iii) Using similar operations to do similar things
(d) Abstraction              (iv) Create new classes from existing class

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

a.

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

b.

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

c.

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

d.

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

Discuss
Answer: (b).(iii)  (iv)   (i)   (ii)
Q103.
Which of the following is/are correct with reference to Abstract class and interface ?

(a) A class can inherit only one Abstract class but may inherit several interfaces.
(b) An Abstract class can provide complete and default code but an interface has no code.

a.

(a) is true

b.

(b) is true

c.

Both (a) and (b) are true

d.

Neither (a) nor (b) is true

Discuss
Answer: (c).Both (a) and (b) are true
Q104.
Consider the following conditions :

(a) The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
(b) The number of positive allocations must be equal to m+n-1, where m is the number
of rows and n is the number of columns.
(c) All the positive allocations must be in independent positions.

The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies :

a.

(a) and (b) only

b.

(a) and (c) only

c.

(b) and (c) only

d.

(a), (b) and (c)

Discuss
Answer: (d).(a), (b) and (c)
Q105.
Consider the following transportation problem. The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is :

a.

1450

b.

1465

c.

1480

d.

1520

Discuss
Answer: (b).1465
Q106.
Big-O estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by

a.

O(n!) and O(n log n)

b.

O(n^n) and O(n log n)

c.

O(n!) and O(log n!)

d.

O(n^n) and O(log n!)

Discuss
Answer: (b).O(n^n) and O(n log n)
Q107.
Match the following:

List-I                                       List-II
a. Classification           i. Principal Component Analysis
b. Clustering                 ii. Branch and Bound
c. Feature Extraction   iii. K-nearest neighbour
d. Feature Selection   iv. K-means

Codes:
      a    b    c    d

a.

iii   iv    ii     i

b.

iv   iii    i     ii

c.

iii   iv    i     ii

d.

iv   iii    ii    i

Discuss
Answer: (c).iii   iv    i     ii
Q108.
Merge sort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step?

a.

The array elements from a heap

b.

Elements in each half of the array are sorted amongst themselves

c.

Elements in the first half of the array are less than or equal to elements in second half of the array

d.

All of the above

Discuss
Answer: (b).Elements in each half of the array are sorted amongst themselves
Q109.
Searching for an element in the hash table requires O(1) time for the ............... time, whereas for direct addressing it holds for the ............. time.

a.

worst-case, average

b.

worst-case, worst-case

c.

average, worst-case

d.

best, average

Discuss
Answer: (c).average, worst-case
Q110.
An algorithm is made up of 2 modules M1 and M2. If time complexity of  modules M1 and M2 are h(n) and g(n) respectively, the time complexity of the algorithm is

a.

min (h(n),g(n))

b.

max (h(n),g(n))

c.

h(n) + g(n)

d.

h(n) * g(n)

Discuss
Answer: (b).max (h(n),g(n))
Page 11 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!

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

Visual Basic

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

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

UNIX

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

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Formal Languages and Automata Theory

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