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

Q151.
Match the following with respect to java.util.* class methods :

(a) Bit Set                      (i) Time zone getTimezone( )
(b) Calendar                 (ii) int hashcode( )
(c) Time zone               (iii) int nextInt( )
(d) Random                  (iv) Void setID(String tzName)

      (a)     (b)    (c)   (d)
Discuss
Answer: (a).(ii)     (i)     (iv)  (iii)
Discuss
Answer: (d).G1 is not planar and G2 is planar graph.
Q153.
Which of the following data structure is Non-linear type?
Discuss
Answer: (d).None of the above
Q154.
The total number of comparisons in a bubble sort is
Discuss
Answer: (b).O(n log n)
Q155.
Which of the following is a bad example of recursion?
Discuss
Answer: (b).Fibonacci numbers
Q156.
McCabe’s cyclomatic metric V(G) of a graph G with n vertices, e edges and p connected component is
Discuss
Answer: (c).e – n + p
Q157.
The number of nodes in a complete binary tree of height h (with roots at level 0) is equal to
Discuss
Answer: (a).2^0 + 2^1 + ….. 2^h
Q158.
The number of different trees with 8 nodes is
Discuss
Answer: (c).248
Q159.
Given a binary tree whose inorder and preorder traversal are given by

Inorder  : EICFBGDJHK
Preorder : BCEIFDGHJK

The post order traversal of the above binary tree is
Discuss
Answer: (a).IEFCGJKHDB
Q160.
The number of disk accesses performed by insertion operation in B-tree of height h is
Discuss
Answer: (c).O(h)

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!