Quiz 1_DSA

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

• 1. The Array shows a hierarchical structure.

• 1. Arrays are immutable.

• 1. Container that stores the elements of similar types

• 1. The Array is not a data structure

How can we initialize an array in C language?

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

• 1. int arr(2)={10, 20}

• 1. int arr[2] = {10, 20}

• 1. int arr(2) = (10, 20)

Which of the following is the disadvantage of the array?

• 1. Stack and Queue data structures can be implemented through an array.

• 1. Index of the first element in an array can be negative

• 1. Wastage of memory if the elements inserted in an array are lesser than the allocated size

• 1. Elements can be accessed sequentially.

Which one of the following is the size of int arr[9] assuming that int is of 4 bytes?

• 1. 9

• 1. 36

• 1. 35

• 1. None of the above

Which data structure is mainly used for implementing the recursive algorithm?

• 1. Queue

• 1. Stack

• 1. Binary tree

• 1. Linked list

What would be the time complexity if user tries to insert the element at the end of the linked list (head pointer is known)

• 1. O(1)

• 1. O(n)

• 1. O(logn)

• 1. O(nlogn)

  
  

Which of the following is the time complexity to search an element in the linked list?

• 1. O(1)

• 1. O(n)

• 1. O(logn)

• 1. O(nlogn)

Consider the following code

1. struct node  

2. {  

3.     int data;  

4.    struct node *next;  

5. }  

6. node ptr;  

Which one of the following is the correct option to create a new node?

• 1. ptr= (node*)malloc(sizeof(node*))

  
  

• 1. ptr=(node)malloc(sizeof(node))

• 1. ptr=(node*)malloc(sizeof(node))

• 1. None of the above

Which of the following statement is not true about the doubly linked list?

• 1. We can traverse in both the directions.

• 1. It requires extra space

• 1. Implementation of doubly linked list is easier than the singly linked list

• 1. It stores the addresses of the next and the previous node

Which of the following is a characteristic of an efficient algorithm?

• Uses minimal CPU time

• Uses minimal memory

• Is easy to implement

• All of the above