Data Structures - CS3301 Syllabus

816 questions in the bank
Are you ready to take quiz?
Explore more
Logo
About the Quiz

Quiz will ask 20 randomly selected questions with allotted time of . You can take the quiz more than once. Once you submit the quiz, you can review how you have done, the correct the answers for each questions and the explanation for the correct the answer.

Quiz Topics

9 Modules

Complexity Analysis

4 topics
1.

Best, worst, and average case analysis

10 questions
2.

Big O notation

10 questions
3.

Space complexity

10 questions
4.

Time complexity of data structure operations

10 questions

Heaps

4 topics

Hashing

4 topics

Graphs

5 topics

Trees

5 topics

Queues

5 topics

Stacks

4 topics

Linked Lists

5 topics

Arrays

5 topics
Sample questions

Which of the following statements about single-dimensional arrays is true?

They can store elements of different data types.

They have a fixed size once declared.

They can be resized dynamically.

They are stored in contiguous memory locations.

What will be the output of the following code snippet?

int arr[] = {1, 2, 3, 4, 5}; printf("%d", arr[2] + arr[4]);

5

7

8

9

Given an array of integers, which of the following algorithms can be used to find the maximum element?

Linear Search

Binary Search

Selection Sort

Bubble Sort

What is the time complexity of accessing an element in a single-dimensional array?

O(1)

O(n)

O(log n)

O(n^2)

Which of the following operations can be performed on a single-dimensional array?

Insertion at the end

Deletion from the middle

Searching an element

Resizing the array

Quiz Topics

9 Modules

Complexity Analysis

4 topics
1.

Best, worst, and average case analysis

10 questions
2.

Big O notation

10 questions
3.

Space complexity

10 questions
4.

Time complexity of data structure operations

10 questions

Heaps

4 topics

Hashing

4 topics

Graphs

5 topics

Trees

5 topics

Queues

5 topics

Stacks

4 topics

Linked Lists

5 topics

Arrays

5 topics