19/04/2024, 22:41 1st Module Assessment

Dashboard / My courses / Data Structures and Algorithm Design (CSE601)-Semester II / #Module I Overview of Data Structures

/ 1st Module Assessment

Question 1

Not yet answered

Marked out of 1.00

Which of the following is false about a doubly linked list?

a. We can navigate in both the directions

b. It requires more space than a singly linked list
c. The insertion and deletion of a node take a bit longer
d. ) Implementing a doubly linked list is easier than singly linked list
Clear my choice

Question 2

Not yet answered

Marked out of 1.00

How can we describe an array in the best possible way?

a. The Array shows a hierarchical structure.

b. Arrays are immutable.
c. Container that stores the elements of similar types
d. The Array is not a data structure
Clear my choice

https://amigo.amityonline.com/mod/quiz/attempt.php?attempt=6804515&cmid=142449 1/7
19/04/2024, 22:41 1st Module Assessment

Question 3

Not yet answered

Marked out of 1.00

How can we initialize an array in C language?

a. int arr[2]=(10, 20)

b. int arr(2)={10, 20}
c. int arr[2] = {10, 20}
d. int arr{2} = {10, 20}
Clear my choice

Question 4

Not yet answered

Marked out of 1.00

Circular Queue is also called

a. Curve Buffer
b. Square Buffer
c. Rectangle Buffer
d. Ring Buffer
Clear my choice

Question 5

Not yet answered

Marked out of 1.00

The complexity of linear search algorithm is

a. O(n)
b. O(log n)
c. O(n^2)
d. O(n log n)
Clear my choice

https://amigo.amityonline.com/mod/quiz/attempt.php?attempt=6804515&cmid=142449 2/7
19/04/2024, 22:41 1st Module Assessment

Question 6

Not yet answered

Marked out of 1.00

The worst case occurs in quick sort when

a. Pivot is the median of the array

b. Pivot is the smallest element
c. Pivot is the middle element
d. None of the above
Clear my choice

Question 7

Not yet answered

Marked out of 1.00

Which of the following statements accurately describe the differences between a linked list data structure and an array?

a. Arrays have less cache locality that can make them better in terms of performance.
b. Random access is allowed in a typical implementation of Linked Lists
c. The size of array has to be Not decided, linked lists can change their size any time.
d. It is not Easy to insert and delete in the list

Clear my choice

Question 8

Not yet answered

Marked out of 1.00

Which of the following highly uses the concept of an array?

a. Binary Search tree

b. Caching
c. Spatial locality
d. Scheduling of Processes
Clear my choice

https://amigo.amityonline.com/mod/quiz/attempt.php?attempt=6804515&cmid=142449 3/7
19/04/2024, 22:41 1st Module Assessment

Question 9

Not yet answered

Marked out of 1.00

Which of the following is the correct way of declaring an array?

a. int javatpoint[10];
b. int javatpoint;
c. javatpoint{20}
d. array javatpoint[10]
Clear my choice

Question 10

Not yet answered

Marked out of 1.00

The complexity of merge sort algorithm is

a. O(n)
b. O(log n)
c. O(n^2)
d. O(n log n)
Clear my choice

Question 11

Not yet answered

Marked out of 2.00

Among the following sorting algorithms, which one is commonly used in conjunction with quicksort to sort subarrays?

a. Merge sort
b. Shell sort
c. quick sort
d. Insertion sort
Clear my choice

https://amigo.amityonline.com/mod/quiz/attempt.php?attempt=6804515&cmid=142449 4/7
19/04/2024, 22:41 1st Module Assessment

Question 12

Not yet answered

Marked out of 2.00

Which one of the following options does not represent an application of a stack?

a. Data Transfer between two asynchronous process

b. Tracking of local variables at run time
c. Compiler Syntax Analyzer
d. A parentheses balancing program
Clear my choice

Question 13

Not yet answered

Marked out of 2.00

What is the space complexity involved in deleting a linked list?

a. O(0)
b. O(n)
c. Either O(1)
d. O(1)
Clear my choice

Question 14

Not yet answered

Marked out of 2.00

What is the worst-case complexity of bubble sort?

a. O(n^2)
b. O(logn)
c. O(n2)
d. O(n)
Clear my choice

https://amigo.amityonline.com/mod/quiz/attempt.php?attempt=6804515&cmid=142449 5/7
19/04/2024, 22:41 1st Module Assessment

Question 15

Not yet answered

Marked out of 4.00

Where is linear searching used?

a. When the list has only a few elements

b. When performing a single search in an unordered list
c. Used all the time
d. When the list has only a few elements and When performing a single search in an unordered list
Clear my choice

Question 16

Not yet answered

Marked out of 4.00

What is the advantage of recursive approach than an iterative approach?

a. Consumes No memory
b. Consumes less memory
c. Consumes more memory
d. More code has to be written
Clear my choice

Question 17

Not yet answered

Marked out of 4.00

What is the best case for linear search?

a. (nlogn)
b. (logn)
c. (n)
d. O(1)
Clear my choice

◄ Test Your Understanding : 1.4.6 Quick Sort

Jump to...

https://amigo.amityonline.com/mod/quiz/attempt.php?attempt=6804515&cmid=142449 6/7
19/04/2024, 22:41 1st Module Assessment

Module 1 Feedback Form ►

https://amigo.amityonline.com/mod/quiz/attempt.php?attempt=6804515&cmid=142449 7/7