TCS Linked List Quiz-1

Question 1

Time: 00:00:00

What type of sorting algorithm can be used to sort the random linked list with minimum time complexity?

Heap sort

Quick sort

Merge sort

Insertion Sort

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 2

Time: 00:00:00

Suppose a person sees a picture, so he slides the picture left and can see the next picture and when he wants to see the previous image so he slides picture right. So in viewing previous or next image, what type of data structure is used in it?

Stack

Queue

Linked list

Tree

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 3

Time: 00:00:00

What is time complexity to count the number of elements of a linked list.

O(n)

O(log n)

O(1)

None of them

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

PrepInsta User

it should be O(n) as it needs to travel to entire list

PrepInsta User

To count the number of elements, you have to traverse through the entire list, hence complexity is O(n).

PrepInsta User

For count, you have to travel all the link list so correct answer is O(n).

Question 4

Time: 00:00:00

what type of functionality the following code performs

Public void(Node node)

        {

            if(size==0)

            head==node;

            else

            {

            Node temp,cur;

            for(cur = head(temp=cur.getNext())! = Null; cur = temp);

            cur.setNext(node);

            }

        size++;

        }

Insertion from beginning

Deletion from beginning

Insertion from end

Deletion from end

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 5

Time: 00:00:00

What is the functionality of the following piece of code

Public int function(int data)

    {

        Node temp = head;

        Int var=0;

        while(temp!=Null)

        {

            if(temp.getData()==data)

Return var;

            var=var+1;

            Temp = temp.getNext();

        }

        Return Integer.Min_value;

    }

Find the data

Find the data and return position

Find the data and insert new element

Find the data and return data

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 6

Time: 00:00:00

Which of the following functionality is true for the count the number of the element of the link list.

A. public void insertBegin(Node node)
{
node.setNext(head);
head = node;
size++;
}

B. public void insertBegin(Node node)
{
head = node;
node.setNext(head);
size++;
}

C. public void insertBegin(Node node)
{
Node temp = head.getNext()
node.setNext(temp);
head = node;
size++;
}

D. public void insertBegin(Node node)
{
Node temp = head.getNext()
node.setNext(temp);
node = head;
size++;
}

A

B

C

D

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 7

Time: 00:00:00

There is a following code of simply link list. The code is for modifying the list by moving the last element to the front of the list. Some part of the code is left blank so choose a right statement for fill this blank.

typedef struct node

{

    Int value;

    Struct node *next;

}Node;

Node *function(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;

}

q- >next=null; p- >next=head;head=p;

head=p;p- >next=q; q- >next=null;

q- >next=null; head=p; p- >next=head;

q=null; p- >next=head;head=p;

Good Job!

Oops!