Explore topic-wise MCQs in Technical Programming.

The following C function takes a simply-linked list as input argument.
It modifies the list by moving the last element to the front of the list and returns
the modified list. Some part of the code is left blank. Choose the correct alternative
to replace the blank line.

typedef struct node 
{
    int value;
    struct node *next;
}Node;
 
Node *move_to_front(Node *head) 
{
    Node *p, *q;
    if ((head == NULL: || (head->next == NULL)) 
    return head;
    q = NULL; p = head;
    while (p-> next !=NULL) 
    {
        q = p;
        p = p->next;
    }
   _______________________________
  return head;
}

What is the output of following function for start pointing to first node of following 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);
}

The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.

/* Link list node */
struct node
{
    int data;
    struct node* next;
};
 
/* head_ref is a double pointer which points to head (or start) pointer 
  of linked list */
static void reverse(struct node** head_ref)
{
    struct node* prev   = NULL;
    struct node* current = *head_ref;
    struct node* next;
    while (current != NULL)
    {
        next  = current->next;  
        current->next = prev;   
        prev = current;
        current = next;
    }
    /*ADD A STATEMENT HERE*/
}

What should be added in place of “/*ADD A STATEMENT HERE*/”, so that the function correctly reverses a linked list.

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

 Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

What does the following function do for a given Linked List with first node as head?

void fun1(struct node* head)
{
    if(head == NULL)
    return;
    fun1(head->next);
    printf("%d  ", head->data);
}

Which of the following points is/are true about Linked List data structure when it is compared with array

 Linked list data structure offers considerable saving in

In Linked List implementation, a node carries information regarding

Linked list is considered as an example of ___________ type of memory allocation.

 Linked lists are not suitable to for the implementation of?

What kind of linked list is best to answer question like “What is the item at position n?”

Which of the following c code is used to create new node?

The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?

What would be the asymptotic time complexity to insert an element at the second position in the linked list?

 What would be the asymptotic time complexity to find an element in the linked list?

What would be the asymptotic time complexity to add an element in the linked list?

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

 In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

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

A linear collection of data elements where the linear node is given by means of pointer is called?

Which of the following is not the type of queue?

Queues serve major role in

A normal queue, if implemented using an array of size MAX_SIZE, gets full when

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

 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?

In Breadth First Search of Graph, which of the following data structure is used?

A queue is a ?

The data structure required for Breadth First Traversal on a graph is?

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?

Assume that the operators +,-, X are left associative and ^ is right associative.
The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c – d ^ e ^ f is

 The type of expression in which operator succeeds its operands is?

Which of the following is not an inherent application of stack?

Consider the following operation performed on a stack of size 5.
Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);
After the completion of all operation, the number of elements present in stack are

Which of the following statement(s) about stack data structure is/are NOT correct?

Convert the following Infix expression to Postfix form using a stack
x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.

Convert the following infix expressions into its equivalent postfix expressions

(A + B ⋀D)/(E – F)+G

The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?

Which data structure is used for implementing recursion?

The prefix form of an infix expression p + q – r * t is?

 What is the result of the following operation
Top (Push (S, X))

The prefix form of A-B/ (C * D ^ E) is?

Which data structure is needed to convert infix notation to postfix notation?

The postfix form of A*B+C/D is?

The process of accessing data stored in a serial access memory is similar to manipulating data on a ________

What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

The data structure required to check whether an expression contains balanced parenthesis is?

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation.
The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?