Scribd
Upload
8 views

Assignment 1 CSU1885 Algorithm and Data Structures

Uploaded by

vibhortiwari122
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
8 views

Assignment 1 CSU1885 Algorithm and Data Structures

Uploaded by

vibhortiwari122
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/ 3

Shoolini University

Assignment No. 1
CSU1885 Algorithm and Data Structures
Instructions:

• Please use A4 sheets for completing the assignment.


• Answers must be handwritten and accompanied by relevant diagrams.
• Ensure that your answers are comprehensive; short responses will not be accepted.
• Use a black ballpoint pen for writing headings and questions.
• Remember to write your name and roll number at the top of each page.
• Attach the front page as the first page of the assignment file and fill in all the necessary details.
• Create a PDF of the assignment file and upload it to the Digii portal.
• It is advisable to keep a hard copy of your assignment(stappled) until the final exams are completed.
• Complete and submit your assignment before the due date (November 14, 2024).
• Note that assignments submitted after the due date will not be accepted.
• Incomplete assignments will not be considered and will be returned to the students.

Assignment Questions
1. Define "data structure" and explain its importance in computer science.
Discuss the role data structures play in organizing, managing, and storing data efficiently. Provide
examples where effective use of data structures can optimize performance.
2. Classify the types of data structures and give examples for each type.
Explain the main categories of data structures (e.g., linear vs. non-linear, static vs. dynamic,
homogeneous vs non-homogeneous) and describe examples such as arrays, linked lists, stack,
queues, trees, and graphs.
3. What is an array? Discuss its characteristics.
Describe the basic structure of an array, including its fixed size and index-based element access
memory allocation, row major order and column major order, 1D and 2D arrays memory allocation.
4. Explain the concept of a linked list and differentiate it from an array. Describe the different
types of linked lists and their use cases.
Define linked lists and explain the structure of nodes and pointers. Compare linked lists to arrays,
focusing on memory allocation, dynamic sizing, and efficiency of operations.
Discuss singly linked lists, header link list, doubly linked lists, and circular and doubly circular
linked lists, explaining their structures and scenarios where each type is particularly useful.
5. What is a stack, and how does it operate?
Define a stack data structure and explain its Last-In, First-Out (LIFO) principle. Describe common
operations such as push, pop, and peek, and provide examples of stack applications. Include the
examples for infix to prefix and post fix and vice versa operations using stack.
Assignment
Subject Title: Algorithm and Data Structures Subject Code: CSU1885

Submitted By: Submitted To:


Student Name VIBHOR TIWARI Teacher Name: DR. Piyush Sewal
Class & Sem. MCA 1st SEM Date of Submission: 14/11/2024
Class Roll No. PGD202458246 Last date of Submission: 14/11/2024
No. of Pages: 10

(For Teacher)

Signature Marks: _____________________

Remarks (If any): ____________________________________________________

You might also like