SCHOOL OF ENGINEERING & IT

BACHELOR OF COMPUTER APPLICATION

BATCH :2024-27
SEMESTER : III
ACADEMIC YEAR: 2025-26
SUBJECT: DATA STRUCTURE THROUGH C

THEORY ASSIGNMENTS
 General Instructions
1. Students are advised to submit the assignment along with the below-mentioned
information at the top Page: -
I. Student ID : - AJU/210XXX
II. Name of The Students :-
III. Course Name :-
IV. Contact No :-
V. E-Mail :-
2. Total of 5 assignments will be given. All the Assignments are compulsory
3. Submit unit-wise Assignment.
4. Each Assignment has a separate deadline.
5. Assignment correction should be on or before the deadline.
6. Students have to use only Classmate Type Copy to answer their Assignment in their
own handwriting.
7. Typed or Print out Assignments are not accepted.
8. After completing the assignment, the student will make a scanned copy of the solution
in pdf format and afterward has to submit by google form or via mail only.
9. The Assignment pdf file name would be in the unique format of Students Registan no
+ Course Code. (Ex: - AJU/210001 and CSC10023 pdf file name should be
AJU_210001_CSC10023).
10. If any discrepancy such as copying/duplication from others is found in the assignment
submitted, cancellation of the entire assignment may be imposed.
11. Students should have to retain hand written hard copy of the Assignments Sent for
future reference as well as submission to the course teacher as instructed.
12. Knowledge Level (KL)
K1 : Remembering K3 : Applying K5 : Evaluating
K2 : Understanding K4 : Analysing K6 : Creating
13. Course Outcomes:
CO.1 Understand and demonstrate Android activities life cycle
CO.2 Build their own Android applications.
CO.3 Explain the differences between Android and other mobile
development environments

CO.4 Secure, tune, package and deploy Applications.

 Assignment 01

Sl.No Questions CO KL

1. What do you understand by dynamic memory management? How CO1 K2

we can allocate memory dynamically using functions like malloc (),
calloc (), realloc (), free () give example of each

2. What is a data structure, and why is it important in programming? CO1 K1

3. What is the difference between linear and non-linear data structures? CO1 K2

4. Discuss the applications of data structures. CO1 K2

5. What is an algorithm? Write its characteristics and Give suitable CO1 K1

example.

6. What do you understand by self-referential data structures? Give a CO3 K3

suitable example.

7. Differentiate between an array and linked List. CO3 K4

8. Write an algorithm to insert a new node at beginning and end of the CO3 K3,K6
linked list.

9. WAP a program to implement function, pointer, structure. CO1 K3,K5

10. What do you understand by arithmetic operations with pointer? CO1 K2

11. What do you understand by time-space trade-off.? CO5 K4

12. What are the criteria to choose an algorithm to solve a particular CO5 K5
problem?
 Assignment 02

Sl Questions CO KL
1. CO1 K1,K2
What is a stack data structure and how does it differ from other data
structures like queues
2. CO1 K1,K2
What are the basic operations that can be performed on a stack?

3. CO2 K2
What are the applications of stacks in computer science and real
world scenario?
4. CO1 K2
What do you mean by Queue data structure? Explain its types.

5. CO1 K3
Write an algorithm for insert and delete elements in queue?

6. CO1 K4
What is a circular queue and Deque? write algorithm with example

7. CO1 K3
Perform polynomial representation using arrays and perform
addition operations.
8. CO2 K4
Convert infix expression A+ (B*C-(D/E^F)*G)*H into postfix
notation using Stack.
9. CO2 K5
Convert infix expression: K + L - M*N + (O^P) * W/U/V * T + Q
into postfix using stack.
10. CO4 K3
What is Polish notation? Explain the infix, prefix, and postfix
notations with suitable example
 Assignment 03

Sl Questions CO KL
1. CO1 K2
Describe the Bubble sort. Also write an algorithm and program to
implement bubble sort
2. CO1 K3
Describe the Selection sort. Also write an algorithm and program to
implement selection sort
3. CO1 K3
Describe the Insertion sort. Also write an algorithm and program to
implement insertion sort
4. CO1 K4
What is the difference between linear search and binary search?
5. CO1 K5
Describe the merge sort algorithm and write programs with time
complexity
6. CO1 K5
Describe the Quick sort algorithm and write programs with time
complexity
7. CO1 K4
Write about Binary search? Also write algorithm of binary search
and write a program in C
8. CO1 K3
Explain the array implementation of queue ADT in detail?
9. CO1 K4
Explain the addition and deletion operations performed on a
circular queue with necessary algorithms
10. CO1 K2
Write short notes on:
i. Binomial heaps

ii. Fibonacci heaps

11. CO5 K5
Explain the Θ notation.

12. CO5 K5
Explain the ω notation.
 Assignment 04

Sl Questions CO KL
1. CO4 K2
What is a tree data structure? Also write its basic components.
2. CO5 K2
What are the different methods of traversing

3. CO4 K4
Write an algorithm of inserting and deleting an element in Binary
Search Tree (BST)?

4. CO5 K3
Explain the concept of Breath First Search (BFS)?

5. CO5 K3
Explain the concept of Depth First Search (DFS)?

6. CO4 K2
What are the properties of Binary Trees?

7. CO4 K4
Explain with a proper algorithm to search an element in Binary
Search Tree (BST)?
8. CO1 K3
Explain the concept of a heap and its applications.

9. CO4 K5
What is the difference between a red-black tree and an AVL tree?

10. CO4 K3
Write the some common applications of trees in computer science

11. CO1 K5
Can a queue be implemented using arrays? What are the
advantages and disadvantages of this approach?.
12. CO2 K3
What are the applications of stacks in computer science and real-
world scenarios?
 Assignment 05

Sl Questions CO KL
1. CO1 K2
What is pattern matching in data structures, and why is it
important?
2. CO5 K4
How does the Knuth-Morris-Pratt (KMP) algorithm improve upon
the naive approach?
3. CO5 K2
Write short notes on: Time Complexity, Space Complexity, Best
Case, Worst Case, and Average Case
4. CO1 K3
Explain different types of Pattern Matching Algorithm with
example
5. CO5 K4
Find the height of a binary search tree with suitable example

6. CO1 K3
What is recursion and what is the need of Recursion, How the
problems can be solved using recursion like Towers of Hanoi
7. CO1 K4
Explain Re-hashing and Extendible hashing

8. CO1 K5
what are the advantages and disadvantages of various collision
resolution strategies?
9. CO3 K2
What are some common applications of circular linked lists?
10. CO5 K3
How do you traverse a circular linked list?

11. CO5 K4
How can you efficiently find the middle node of a circular linked
list?
12. CO3 K6
Represent the polynomials by using singly linked lists and perform
addition operation.
 Write down the first 10 questions in bold in every assignment.
Use the remaining 5 questions as practice exercises.

Date: Dean Sign: