Scribd
Upload
2 views1 page

DSA Assigment - 02

The assignment from Government Engineering College, Jehanabad, requires students to implement various operations on Doubly and Circular Linked Lists, including node insertion and deletion. Additionally, it asks for an explanation of algorithmic complexity analysis and solutions for given recurrence relations. Lastly, students are tasked with sorting a list using Insertion Sort, Bubble Sort, and Selection Sort.

Uploaded by

apnabhojpuri817
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views1 page

DSA Assigment - 02

The assignment from Government Engineering College, Jehanabad, requires students to implement various operations on Doubly and Circular Linked Lists, including node insertion and deletion. Additionally, it asks for an explanation of algorithmic complexity analysis and solutions for given recurrence relations. Lastly, students are tasked with sorting a list using Insertion Sort, Bubble Sort, and Selection Sort.

Uploaded by

apnabhojpuri817
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Government Engineering College, Jehanabad

Assignment-02
Last Date of Submission: 10/04/2025
Subject: DSA

(1)Write a program to implement the following operations on


Doubly Linked List:
a. Insertion of a node at front of the list
b. Insertion of a node after a given node
c. Deletion of a node after a given position of node(m)
d. Deletion of last node

(2)Write a C program to implement the following operations on


Circular Linked List:
a. Insertion of node at front of the List
b. Deletion of node at front of the List

(3)Explain best case, worst case, and average case analysis with
example.

(4) Find the Solution for following recurrence relation:


𝑇 + 𝑛 𝑓𝑜𝑟 𝑛 > 1
a. 𝑇(𝑛) =
1 𝑓𝑜𝑟 𝑛 ≤ 1
2𝑇 + 𝑛 𝑓𝑜𝑟 𝑛 > 1
b. 𝑇(𝑛) =
1 𝑓𝑜𝑟 𝑛 ≤ 1

(5)Sort the following list using:


a. Insertion Sort
b. Bubble Sort
c. Selection Sort
34 51 12 33 38 16 11 17

You might also like