Course Content for BCA, Semesters III and IV 2024-25

Semester: III
Corse Code: BCA-63T-201 Course Title: Data Structures and Algorithms
Course Credit : 04 Hours/Week: 04
Course Objectives (COs):
By the end of this course, students will be able to:
• To design efficient algorithms using various algorithm designing strategies
• To analyze the problem and develop the algorithms related to these problems
• To classify the problem and apply the appropriate design strategy to develop algorithm
• To design algorithm in context of space and time complexity and apply asymptotic notation

Course Outcomes (COs):

After completing this course satisfactorily, a student will be able to:
• Understand the concepts of data structures and their importance in computing.
• Implement and use common data structures such as arrays, linked lists, stacks, queues, trees, and
graphs.
• Analyze the time and space complexity of algorithms related to data structures.
• Apply data structures to efficiently solve real-world problems

BCA-63T-201 : Data Structures and Algorithms

UNIT – I
Introduction to Algorithm Design: Algorithm, its characteristics, efficiency of algorithms, analyzing
Algorithms and problems.
Linear Structure: Arrays, records, stack, operation on stack, implementation of stack as an array, queue,
types of queues, operations on queue, implementation of queue.
UNIT – II
Linked Structure : List representation, Polish notations, operations on linked list - get node and free
node operation, implementing the list operation, inserting into an ordered linked list, deleting, circular
linked list.
Tree Structure : Concept and terminology, Types of trees, Binary search tree, inserting, deleting and
searching into binary search tree, tree traversals.
 UNIT – III
Graph Structure : Graph representation - Adjacency matrix, adjacency list, Warshall's algorithm,
adjacency multilist representation. Orthogonal representation of graph . Graph traversals - BFS and DFS.
Shortest path, transitive closure.
UNIT – IV
Searching and sorting : Searching - sequential searching, binary searching, hashing. Sorting - selection
sort, bubble sort, quick sort, heap sort, merge sort, and insertion sort, efficiency considerations.
Recommended reference books
1. S.Lioschutz: Data Structures, Mc Graw Hill International Edition.
2. A.V.Aho., J.E.Hopcroft, and J.D.Ullman, Data Structures and Algorithms, Pearson.
3. A. MichaelBerman: Data Structures via C++, OxfordUniversity Press.
4. SaraBaase and AllenVan Gelder: Computer Algorithms, Pearson Education Asia.
 Roll No.
This question paper contains 2 printed pages.

Data Stru. (Using C/C++)

301/331 B.c.A. (Part-IIm
100127
B.C.A. (Part-II) EXAMINATION - 2022
(Paculty of Science)
Pattern)
(Three-Year Scheme of 10+2+3

DATA STRUCTURE (Using C/C++)

gB
Maximum Marks: 100
Time Allowed: 3 Hours

write their answer

Hence the candidates should
No supplementary answer-book will be given to any candidate.
precisely in the main answer-book only.
a r e to be given in the main
answer-book only.
Answer of all the questions (short answer a s well as descriptive)
order. Similarly all the parts question
of one
Answers of short a n s w e r type questions must be given in sequential
should not be
answer-book. One complete question
of descriptive part should be answered at one place in the
answered at different places in the ansuwer-book.
Write your roll number on question paper before start writing answers of questions.
Question papercónsists of three parts.

All three parts are compulsory.

of 2 marks each. Maximum limit for each question is upto

Part -I: (Very Short Answer) consists 10 questions
40 words.
consists 5 questions of 4 marks each. Maximum limit for each question is upto 80
Part -
II: (Short Answer)
words.
of 12 marks each with internal choice.
Part - III: (Long Answer) consists 5 questions

PART I

10x2-20
Very Short Answer:
1
2
What is an Algorithm?
Explain a n Array in Data
structure.
(b)
Define polish notation.

Single Linked List.

d) Write advantages of Double Linked List over

Write difference between Tree and Graph.

Explain Binary Tree with diagram.

What is adjacency matrix in Graph?

Differentiate between directed and undirected graphs.

(h)
What is hashing?
Write time complexity of merge sort in all cases.

P.T.O.
301/3311 1
 ,his
question
pa

PART.I
3 0 2

ShortAnswer example.
algorithm with
(a) Explain Eficiency of a n
linked list with diagram.
(b) What is Linked List ? Explain doubly

(c) Write Huffman's algorithm.

with example.
(d) Explain shortest path in Graph
dimension array.
algorithm of Linear search for
one
e) Write an

PART-1II

4+8
3. What is Stack? Write the procedure of PUSH and POP operation in Stack.
OR
4+8
What is Queue ? Explain types of queue and its operation.

4. Explain Circular linked list. Write an algorithm for inserting and deleting a node in circular linked 4+8
list.
OR
Explain Infix, Prefix and Postfix expression. Convert the following infix expression into postix expresSsion 6+6
using stack.

(A+B) -C*(D/E))+F.

5. What is Binary Search Tree (BST) ? Write an algorithm for searching into Binary Search Tree. 4+8
OR
Explain Tree Traversal in detail with example. 12

6. Explain graph traversal-BFS and DFS with example. 12

OR
Write Warshall's algorithm with diagram. 12

What is binary search ? Write advantages of binary search over linear search. Write complexity of
7.
2 4+4+4
Binary search. 2
OR
Write algorithm for Heap sort, 12
What is heap? an

- o 0 o-