What data structure is typically used to implement the Map data structure?

If the elements "A", "B", "C", and "D" are placed in a queue and are deleted one at a time, in what order will they be removed?

What is the plain text corresponding to the cipher text "SECMSG" if the rail fence cipher is used with a key value of 2?

The basic principle employed in which algorithm is hashing?

The basic principle behind the Bellman-Ford algorithm is

In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is:

Given 2 sorted lists of size 'm' and 'n' respectively, the number of comparisons needed in the worst case by the merge sort algorithm will be

Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?

What is the output of the following function for a linked list starting with the first node?

Linked List: 1->2->3->4->5->6

void fun(struct node* start)

{

if(start == NULL)

return;

printf("%d ", start->data);

if(start->next != NULL)

fun(start->next->next);

printf("%d ", start->data);

}

Consider an implementation of an unsorted singly linked list with a head pointer only. Which of the following operations 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