Engineering

Data Structure and Algorithms (DSA) MCQs: 350 Questions & Answers in Engineering

350 Data Structure and Algorithms (DSA) MCQs in Engineering with answers & explanations. Page 11. Practice objective questions for competitive exams, intervi… Use the answer toggle below to show or hide all solutions, tap an option to check one question, or open a question for its own page.

Page 11 of 18

Show answers

Answers hidden — tap an option or use “View Answer” on each question.

201

Data Structure and Algorithms (DSA) MCQs: 350 Questions & Answers in Engineering

Each node in a linear list contains an item called____which points to the next node in the list.

Which is not dynamic memory allocation function?

The function that allocates requested size of bytes and returns a pointer to the first byte of the allocated space is

NULL link is not present in…

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

In a circular linked list

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

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

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?

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

A sort which compares adjacent elements in a list and switches wherever necessary is _______

Which of the following sorting method is the slowest?

Consider that n elements are to be sorted.The worst case complexity of bubble sort is____

In bubble sort,for a file of size n,after p iterations number of records in proper position is____

In bubble sort,for a file of size n,during each pth pass the number of last records left out are____

Given a file size n the number of times a given file is passed through in bubble sort is____

Total number of comparision in bubble sort is____

Study tips for Data Structure and Algorithms (DSA)