HOME
PARTNERS
CONTACT

Computer Science and Engineering Data Structures – 1 Experiments

Aim

Overview

Recap

Pretest

Polynomials

Aim Concept Algorithm Representation

Polynomial Arithmetic-Linked List

Aim Addition Subtraction Multiplication Demo Practice Exercise Quiz

Analysis

Aim Time and Space Complexity Quiz

Posttest

Polynomial Arithmetic

Choose difficulty:

Beginner

Intermediate

Advanced

1. In a linked list node, there are two fields. One of them is for holding the data but what is the other field?

a: Pointer to next node Explanation

Explanation

b: Pointer to first node Explanation

Explanation

c: Pointer to last node Explanation

Explanation

d: Another data field Explanation

Explanation

2. What makes a Circular Linked List different from a normal Linked List?

a: All nodes hold the address to the last node Explanation

Explanation

b: All nodes hold the address to the first node Explanation

Explanation

c: The first node holds the address of the last node Explanation

Explanation

d: The last node holds the address of the first node Explanation

Explanation

3. Random access of elements is one of the applications of linked lists.

a: True Explanation

Explanation

b: False Explanation

Explanation

4. Given a singly linked list of size ‘n’, what is the maximum number of comparisons required to search for a desired element?

a: n/2 Explanation

Explanation

b: n/4 Explanation

Explanation

c: n Explanation

Explanation

d: log n Explanation

Explanation

5. Which of the following sorting algorithms will take minimum time complexity to sort a linked list?

a: Quick Sort Explanation

Explanation

b: Insertion Sort Explanation

Explanation

c: Merge Sort Explanation

Explanation

d: Heap Sort Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)