S.D.

COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department
Department
Electronics&
COMPUTER Communication
SCIENCE Engineering
Engineering

ASSIGNMENT-1
Session: 2024-25 Semester:III

Program: B.Tech Branch: CS/IT/A.I

Course: DATA STRUCTURE Code: BCS301

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1 .Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory,
used by the algorithms and their common applications.
2. Discuss the computational efficiency of the sorting and searching algorithms.
3. Implementation of Trees and Graphs and perform various operations on these data structure.
4. Understanding the concept of recursion, application of recursion and its implementation and
removal of recursion.
5.Identify the alternative implementations of data structures with respect to its performance to
solve a real world problem.

Assignments-I
LONG ANSWER QUESTIONS

1. What to you mean by algorithm and its Efficiency ?

2. How to find time and space complexity of a algorithm using notation.
3. Write a program in “c”,which represent all operation of linked list?
4. Briefly explain sparse matrix ?
5. Derive the formula to find physical address of an element of three dimensional
array stored in row major order.

NAME & SIGN OF FACULTY

 S.D.COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department Computer Science &Engineering

ASSIGNMENT-II
Session: 2024-25 Semester:III

Program: B.Tech Branch: CS/IT/A.I

Course: DATA STRUCTURE Code: BCS301

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1 .Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory,
used by the algorithms and their common applications.
2. Discuss the computational efficiency of the sorting and searching algorithms.
3. Implementation of Trees and Graphs and perform various operations on these data structure.
4. Understanding the concept of recursion, application of recursion and its implementation and
removal of recursion.
5.Identify the alternative implementations of data structures with respect to its performance to
solve a real world problem.

Assignments-II
LONG ANSWER QUESTIONS

1. Write an algorithm for converting infix expression into postfix expression. Trace your
algorithm for infix expression Q into its equivalent postfix expression
P Q: A + ( B * C – ( D / E ^ F) * G ) * H
2. What is circular Queue? Write a C code to insert an element in circular queue?
3. What is Stack? Write a C program for linked list implementation of stack
4. What is recursion? Write a recursive program to find sum of digits of the given number
5. Array and linked list representation of queue in c?

NAME & SIGN OF FACULTY

 S.D.COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department COMPUTER SCIENCE Engineering

ASSIGNMENT-III
Session: 2024-25 Semester:III

Program: B.Tech Branch: CS/IT/A.I

Course: DATA STRUCTURE Code: BCS301

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1 .Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory,
used by the algorithms and their common applications.
2. Discuss the computational efficiency of the sorting and searching algorithms.
3. Implementation of Trees and Graphs and perform various operations on these data structure.
4. Understanding the concept of recursion, application of recursion and its implementation and
removal of recursion.
5. Identify the alternative implementations of data structures with respect to its performance to
solve a real world problem.

Assignment-III

1. What do you mean by computational efficiency of searching algorithm?

2. Write the Quick Sort algorithm and illustrate the steps of the algorithm for the following key
values: 65, 43, 54, 26, 38, 48, 50
3. What is sorting? How is sorting essential for database application?
4. What is Hashing? Explain division method to compute the hash function and also explain the
collision resolution strategies used in hashing.
5. Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the following sequence: 18,
25, 45, 34, 36, 51, 43, and 24.

NAME & FACULTY OF SIGN

 S.D.COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department COMPUTER SCIENCE Engineering

ASSIGNMENT-IV
Session: 2024-25 Semester:IV

Program: B.Tech Branch: CS/IT/A.I

Course: DATA STRUCTURE Code: BCS301

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1 .Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory,
used by the algorithms and their common applications.
2. Discuss the computational efficiency of the sorting and searching algorithms.
3. Implementation of Trees and Graphs and perform various operations on these data structure.
4. Understanding the concept of recursion, application of recursion and its implementation and
removal of recursion.
5. Identify the alternative implementations of data structures with respect to its performance to
solve a real world problem.

Assignment-IV

1. What do you mean by terminology used in graph representation?

2. Explain adjacent matrices with example?
3. Differentiate between the BFS and DFS?
4. Minimum spanning tree Alogrithm ?write best minimum spanning tree algorithm with
example?
5. Write and explain the Floyd Warshall algorithm?

NAME & FACULTY OF SIGN

 S.D.COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department
DepartmentCOMPUTER
Computer Science
SCIENCE&Engineering
Engineering

ASSIGNMENT-V
Session: 2024-25 Semester:III

Program: B.Tech Branch: CS/IT/A.I

Course: DATA STRUCTURE Code: BCS301

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1 .Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory,
used by the algorithms and their common applications.
2. Discuss the computational efficiency of the sorting and searching algorithms.
3. Implementation of Trees and Graphs and perform various operations on these data structure.
4. Understanding the concept of recursion, application of recursion and its implementation and
removal of recursion.
5.Identify the alternative implementations of data structures with respect to its performance to
solve a real world problem.

Assignments-VI
LONG ANSWER QUESTIONS

1. What is B-Tree? Write the various properties of B- Tree. Show the results of inserting the
keys F, S, Q, K ,C, L, H, T, V, W, M, R, N, P, A, B in order into a empty B-Tree of order 5.
2. What do you mean by threaded B-tree?
3. Huffman coding with example?
4. Binary heaps and its application?
5. Draw step by step construction of AVL tree with given sequence
21,26,30,9,4,14,28,15,10,2,3,7.