Scribd
Upload
15 views2 pages

DS Assignment - 1

The document outlines an assignment for students in the Department of Computer Science & Engineering at JBIET. It includes five questions related to data structures, covering topics such as circular linked lists, algorithm performance notations, operations in doubly linked lists, infix to postfix conversion, and circular queue implementation. Students are required to provide detailed answers and programming solutions for the assignment.

Uploaded by

hemanshausali8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
15 views2 pages

DS Assignment - 1

The document outlines an assignment for students in the Department of Computer Science & Engineering at JBIET. It includes five questions related to data structures, covering topics such as circular linked lists, algorithm performance notations, operations in doubly linked lists, infix to postfix conversion, and circular queue implementation. Students are required to provide detailed answers and programming solutions for the assignment.

Uploaded by

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

Data Structures

Name of the student : ...………………………..


Roll No. : .......................
Section : .......................

Assignment - 1

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING UGC


AUTONOMOUS
JBIET
YENKEPALLY, MOINABAD
Write all the questions

1) What is a circular linked list? How does its implementation differ from a singly
linked list?
2) Define Big O, Omega, and Theta notations. How do they help in evaluating the
performance of an algorithm? Provide examples of each.
3) Explain the following operations in a doubly linked list.
(i) Insert an element
(ii) Delete an element
(iii) Reverse the list
4) Describe the process of converting an infix expression to postfix using a stack with an
example.
5) Write a program to implement the circular queue.

You might also like