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 GATE CSE 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 GATE CSE 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 GATE CSE 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 6 of 30

Explore more Topics under GATE CSE Exam

Q51.
The most appropriate matching for the following pairs

X: depth first search 1: heap
Y: breadth-first search 2: queue
Z: sorting 3: stack

is

a.

X—1, Y—2 ,Z --3

b.

X—3, Y—1, Z --2

c.

X—3, Y—2, Z--1

d.

X—2 ,Y—3 ,Z--1

Discuss
Answer: (c).X—3, Y—2, Z--1
Q52.
Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right sub stress, respectively, of node X. Note that Y and Z may be NULL, or further nested. Which of the following represents a valid binary tree?

a.

(1 2 (4 5 6 7))

b.

(1 (2 3 4) 5 6) 7)

c.

(1 (2 3 4)(5 6 7))

d.

(1 (2 3 NULL) (4 5))

Discuss
Answer: (c).(1 (2 3 4)(5 6 7))
Q53.
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s. which of the following statements is true?

a) t (n) is O(1)
b) n < t (n) < n log2n
c) n log 2 n < t (n) < (n/2)
d) t (n) = [/Tex]{n \choose 2} [/Tex]

a.

a

b.

b

c.

c

d.

d

Discuss
Answer: (a).a
Q54.
Aliasing in the context of programming languages refers to

a.

multiple variables having the same memory location

b.

multiple variables having the same value

c.

multiple variables having the same identifier

d.

multiple uses of the same variable

Discuss
Answer: (a).multiple variables having the same memory location
Q55.
Consider the following C declaration

struct {
short s [5]
union {
float y;
long z;
}u;
} t;

Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes and 8 bytes, respectively. The memory requirement for variable t, ignoring alignment considerations, is

a.

22 bytes

b.

14 bytes

c.

18 bytes

d.

10 bytes

Discuss
Answer: (c).18 bytes
Q56.
The number of tokens in the following C statement

printf("i = %d, &i = %x", i, &i);

is

a.

3

b.

26

c.

10

d.

21

Discuss
Answer: (c).10
Q57.
B+ trees are preferred to binary trees in databases because

a.

Disk capacities are greater than memory capacities

b.

Disk access is much slower than memory access

c.

Disk data transfer rates are much less than memory data transfer rates

d.

Disks are more reliable than memory

Discuss
Answer: (b).Disk access is much slower than memory access
Q58.
Suppose you are given an array s[1..n] and a procedure reverse (s, i, j) which reverses the order of elements in a between positions i and j (both inclusive). What does the following sequence do, where 1 <= k <= n:

reverse(s, 1, k) ;
reverse(s, k + 1, n);
reverse(s, l, n);

a.

Rotates s left by k positions

b.

Leaves s unchanged

c.

Reverses all elements of s

d.

None of the above

Discuss
Answer: (a).Rotates s left by k positions
Q59.
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal, respectively, of a complete binary tree. Which of the following is always true?

a.

LASTIN = LASTPOST

b.

LASTIN = LASTPRE

c.

LASTPRE = LASTPOST

d.

None of the above

Discuss
Answer: (d).None of the above
Q60.
Consider the following functions. Which of the following is true?

a.

h(n) is O(f(n))

b.

h(n) is O(g(n))

c.

g(n) is not O(f(n))

d.

f(n) is O(g(n))

Discuss
Answer: (d).f(n) is O(g(n))
Page 6 of 30

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!

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Visual Basic

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

MongoDB

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

Compiler Design

Unravel the process of translating source code into executable programs with our...

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Java Programming

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

Neural Networks

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

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....