GATE 2022: National Champion Quiz-1

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only.

Given the representation, which of the following operation can be implemented in O(1) time?

i) Insertion at the front of the linked list

ii) Insertion at the end of the linked list

iii) Deletion of the front node of the linked list

iv) Deletion of the last node of the linked list

What is the best case to find the smallest element in binary search tree implemented using single linked list with n × log n elements?

Consider a max heap represented by the array elements:
{50, 25, 22, 17, 16, 15, 12, 10, 9}. The following operations are carried out: 17 is deleted, 24 is inserted. The number of operations to heapify is

Given an array of element 5, 7, 9, 1, 3, 10, 8. Which of the following is the correct sequences of elements after inserting all the elements in a min-heap?

A text is made using A, B, C, D, E each occurring with the probability of 0.38, 0.25, 0.08, 0.15, 0.14 respectively, the optimal coding technique will have the average length of ________. (Upto 2 decimal places)

A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use?

Which of the following data structures is best suited for heap sort?

Consider the recurrence relation:

Then T(n) in terms of Θ notation is

Which of the following is correct?

What is printed by the following program?

Consider the following C-fragment where size of int is 1 B (Assume starting address of array is 1000)

The output generated by above code is __________ .