Scribd
Upload
6 views

AL 303 DS Home Assignments

The document outlines a home assignment for B. Tech. II Year III Semester students at Acropolis Institute of Technology & Research, focusing on Data Structures. It includes various assignments covering topics such as data structure classification, linked lists, stack operations, queue types, tree concepts, graph algorithms, and sorting algorithms. The assignment requires students to answer all questions with a minimum of 300 words and is due by January 13, 2025.

Uploaded by

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

AL 303 DS Home Assignments

The document outlines a home assignment for B. Tech. II Year III Semester students at Acropolis Institute of Technology & Research, focusing on Data Structures. It includes various assignments covering topics such as data structure classification, linked lists, stack operations, queue types, tree concepts, graph algorithms, and sorting algorithms. The assignment requires students to answer all questions with a minimum of 300 words and is due by January 13, 2025.

Uploaded by

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

Acropolis Institute of Technology & Research, Indore

Department of CSE (Artificial Intelligence & Machine Learning)


B. Tech. II Yr. III Semester Home Assignment
Subject Code: AL-303 Subject Name: Data Structures
Last Date to Submit: 13/01/2025 Max Marks: 50
Note: i) Answer all the questions with minimum 300 words
ii) All questions carry equal marks
Course Outcomes: Category of Bloom’s Taxonomy
At the end of the course student will be able to :
CO1. List different types of data structures. L1. Knowledge
CO2. Describe the concepts of stack and queue. L2. Understand
CO3. Describe the concepts of various tree. L3. Apply
CO4. Discuss the concepts of Graph. L4. Analyze
CO5. Demonstrate various algorithms of sorting. L5. Evaluate
L6. Create

Assignment 1
Q1) Outline the classification of data structure & also list the operation that can be performed with each
type of data structure. (CO-1, BT-1)
Q2) Define link list? Write an algorithm to insert & delete a node in singly link list.(CO-1,BT-1)

Assignment 2
Q1) Consider the following stack of the character, where stack is allocated N=8 memory cells:
Stack: A, C, D, F, K, _, _, _,
Describe the stack as the following operation takes place:
(a). POP(Stack ,Item) (b). POP (Stack, Item) (C) Push (Stack, L) (d) Push (stack, P) (CO-2,
BT-2)
Q2) Describe the concept of Queue, Circular Queue, Priority Queue & Dequeue in detail. (CO-2, BT-2)

Assignment 3
Q1) Describe the concept of AVL tree & Red Black tree with example. (CO-3, BT-2)
Q2) Explain B tree & B+ tree in detail with example. (CO-3, BT-2)

Assignment 4
Q1) Explain graph traversal algorithm in detail with example. (CO-4, BT-2)
Q2) Describe spanning tree and also explain minimum spanning tree algorithms with example.
(CO-4, BT-2)

Assignment 5
Q1) Demonstrate bubble sort & insertion sort on following list of elements:
54, 26, 93, 17, 77, 31, 44, 55, 20 (CO-5, BT-3)
Q2) Demonstrate merge sort & radix sort on following list of elements:
333, 125,436, 568, 27, 5, 49, 792, (CO-5, BT-3)

You might also like