BCA Data Structures and Algorithms

bcasemester 3

This course includes fundamental concept of data structures such as stack, queue, list, linked list, trees and graph; application of these data structures along with several algorithms.

Chapter Wise Notes Question Banks Syllabus Chapter Wise Questions Viva Practical

Faculty of Humanities and Social Sciences

2026

Bachelor of Computer Application

Data Structures and Algorithms

CACS201

Full Marks: 60

Pass Marks: 24

Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks.

"Group B"

Attempt any SIX questions.

[6 × 5 = 30]

What is Deterministic and Non-deterministic Algorithm? How are data structure classified?

[2.5 + 2.5]

Write an algorithm for the insertion and deletion operations performed on the circular queue.

[5]

Explain different types of linked list with example.

[5]

Write down recursive algorithm to find Fibonacci series.

[5]

Explain the different traversal techniques used in binary tree with examples.

[5]

Find MST for following graph using Kruskal algorithm.

[5]

Explain different collision resolution techniques with examples.

[5]

"Group C"

Attempt any TWO questions.

[2 × 10 = 20]

Why stack is called a LIFO data structure? Write an algorithm to convert infix expression to postfix expression and show how it works with your own example

[1 + 9]

What is AVL tree? Construct AVL tree from given data set 3,5,11,8,4,1,12,7,2,6

[5 + 5]

How quick sort implements divide and conquer strategy. Sort the following numbers using heap sort : 46, 25, 35, 49, 10, 92, 32

[10]

BCA Data Structures and Algorithms

BCA Semester 3 Data Structures and Algorithms Question Paper 2026 (TU) – Solved

Faculty of Humanities and Social Sciences