Scribd
Upload
14 views1 page

Important DS UNIT 3

The document is an assignment for Computer Science & Engineering students focusing on data structures, specifically queues and linked lists. It includes various questions and tasks such as explaining queue types, writing C functions for circular queues, singly and doubly linked lists, and polynomial representation using linked lists. The assignment emphasizes practical coding skills and theoretical understanding of data structures.

Uploaded by

redhawk1522
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
14 views1 page

Important DS UNIT 3

The document is an assignment for Computer Science & Engineering students focusing on data structures, specifically queues and linked lists. It includes various questions and tasks such as explaining queue types, writing C functions for circular queues, singly and doubly linked lists, and polynomial representation using linked lists. The assignment emphasizes practical coding skills and theoretical understanding of data structures.

Uploaded by

redhawk1522
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

ABES Engineering College

Assignment 3
Computer Science & Engineeing-Data Science
Data Structure_BCS301_3rd Semester
S.No. Questions CO K-Level
Explain various types of Queues? Why circular queue is more desirable than linear
1
queue? Explain applications of queues.
2 Write a C function to delete the element from circular queue implemented using array. CO2 K3
Explain circular queue.Write the condition for empty and full circular queue. Write a C
3 CO2 K2
code to insert an element in circular queue?
Write a program in C for implementation of a queue. Your program should at least
4 CO2 K3
contain ADD, CREATE. DELETE, FULL and EMPTY functions.
Discuss the implementation of singly-linked list. Write C functions to implement
following operations on singly-linked list.
5 CO1 K5
(i) to count the number of nodes(ii) to reverse the direction of links.
(iii) to delete alternate nodes that is first, third, fifth and so on
6 Explain the use of calloc ( ) and realloc ( ) functions with example CO1 K1
7 Write an algorithm to insert a node at the end in a Circular linked list
8 Write a C program to insert a node at kth position in single linked list
Discuss the representation of polynomial using linked list. Write 'C' functions to add two
9 CO1 K6
such polynomials represented by linked list.
10 What is doubly linked list? What are its applications? CO1 K1
Define the double link list. Write an algorithm to delete an element from the existing link
11 CO1 K6
list.
12 List the advantages of doubly linked list over single linked list. CO1 K2
13 Write an algorithm to insert an element in doubly circular linked list. CO1 K6
What is doubly linked list? What are its applications? Write an algorithm how to insert
15 CO1 K6
an element at the end in doubly linked list.
Write a program in C to delete a specific element in singly linked list. Double linked list
16 takes more space than single linked list for storing one extra address.Under what
condition, could a double linked list more beneficial than single linked list

You might also like