Which data structure uses contiguous memory locations?

What is the worst-case time complexity for searching an element in an unsorted array?

Which operation is costliest in an array?

What happens when we insert an element at the beginning of an array?

Which of the following is NOT a linear data structure?

What is the space complexity of an array of size n?

Which traversal technique is used in arrays?

Which data structure follows FIFO principle?

What is the index of the first element in an array (most languages)?

What is the time complexity of deleting an element from the middle of an array?

Which sorting algorithm is best for nearly sorted arrays?

Which operation is NOT possible directly on an array?

What is the maximum number of children a binary tree node can have?

Which data structure is used for recursion?

Which of the following is an advantage of arrays?

Which searching technique works only on sorted arrays?

What is the worst-case time complexity of binary search?

Which data structure allows insertion and deletion at only one end?

Which of the following represents a homogeneous data structure?

What will be the output of the following code? int a[] = {10, 20, 30, 40}; printf("%d", a[2]);

What is the time complexity of the following code? for(int i = 0; i < n; i++) printf("%d", a[i]);

What will be the output? int a[] = {1, 2, 3, 4, 5}; int sum = 0; for(int i = 0; i < 5; i++) sum += a[i]; printf("%d", sum);

What will be printed? int a[] = {5, 10, 15}; printf("%d", sizeof(a)/sizeof(a[0]));

What is the output? int a[] = {1, 2, 3, 4}; int temp = a[0]; a[0] = a[3]; a[3] = temp; printf("%d %d", a[0], a[3]);

for(int i = 0; i < sizeof(a)/sizeof(int); i++) printf("%d", a[i]);