COURSE STRUCTURE

Program BCA
Semester III Semester
Course Code and Name BCA302
Data Structure
Credits 5
Contact Hours per week 7(Lecture-3 Tutorial-0, Practical-4)

A. COURSE OUTCOMES
CO.1: Understanding: comprehensive knowledge of the data structures;

CO.2: Applying: understand the importance of data and be able to identify the data requirements
for an application;
CO.3: Analyzing: have a practical experience of algorithmic design and implementation;

CO.4: Evaluating: practical experience of developing applications that utilize data structures and
evaluating the performances of applications;
CO.5: Creating: develop program requiring the implementation of various data structures.

B. ASSESSMENT TOOLS
S. Course Specific Assessment Tools CO’s Mapped
No.
1 Two Midterm Exams – One midterm exam is of 30 Multiple CO1-CO5
choice based questions. Second midterm exam consist of 5
subjective questions with internal choice.
2 Application Based Activity CO3, CO4,CO5

3 Project Based Learning (Group of 2-3 students) CO3,CO4,CO5

4 ABCA-Flip Class Room/seminar/Poster/Quiz CO1, CO2, CO3

5 Workshop/Internship/Certification course/Research paper CO1-CO5

1
Prerequisite:To understand the contents and successfully complete this course,
a participant must have a basic understanding of Storage Systems, Operating
systems, Networking and Database. Lectures with
whiteboard/PPT,
Unit – 1
Recorded
Overview of Data Structure: Definition, types, various operations and
applications , Arrays
(T1,T3,T10)
: Linear Array, Operations on Linear Array,
(T1,T4,T7) video/interactive videos,
Multidimensional Array, Sparse Matrices; Strings .(T1,T4,T7)

2 Lectures with
Unit –-2
Stack: contiguous implementation of stack, various operations on stack, whiteboard/PPT,
Applications of stack: Infix, postfix and prefix conversions Recorded
Queue: Linear queue, various operations on queue, its drawback; circular video/interactive videos,
queue programming labs

3 Lectures with
Unit – 3 whiteboard/PPT,
General List: Singly linked list-operations on it; doubly linked list, circular Recorded
linked list.
video/interactive videos,
programming labs

4 Lectures with
Unit – 4
whiteboard/PPT,
Searching: sequential search, binary search,
Sorting : Bubble sort, selection sort, insertion sort, merge sort, Quick Sort
( Recorded
video/interactive videos,
programming labs

5 Lectures with
Unit –5 whiteboard/PPT,
Trees: Definitions: height, depth, order, degree, parent and child relationship Recorded
etc; Binary tree- complete binary tree, almost complete binary tree
Graph : Related Definitions: graph representations
( video/interactive videos,
programming labs

D. Text Book:
S. No. Author Title Publisher
1. Seymour Lipschutz; s Outlines,. Data Structures; Schaum’ Systems Tata McGraw Hill
Publishing
2 ● R. Kruse et al. Data Structures and Program Pearson Education
Design in C Publication

E. Reference Books:
S. No. Author Title Publisher
1 E. Horowitz, S. Sahani. Fundamentals of Data Structures Galgotia Publication

2 A M. Tenenbaum Data Structures using C & C++ PHI Publication.

3 ISRD Group; Tata. Data Structures using C g McGraw-Hill Publishing

Practical Lab:
1.Program for matrix addition and subtraction by using functions.
2.Given a Queue A, you need to reverse the Queue.
Input: The first line of input contains an integer T denoting the Test cases.
Then T test cases follow. Second line contains value of N Third line a[i]
elements.
3.Given a doubly linked list, rotate the linked list counter-clockwise by P nodes. Here P is a given
positive integer and is smaller than the count of nodes(N) in a linked
list.
4. Write a program that implements doubly linked list for the following operations: Create, Display,
Count, Insert, Delete, Search .

5.Given an infix expression. Convert the infix expression to postfix expression using stack.
Infix expression: The expression of the form a op b. When an operator is in-between every pair of
operands.
Postfix expression: The expression of the form a b op. When an operator is followed for every pair of
operands.
6.Write a recursive program to find the kth smallest element of an array a of numbers by choosing any
element a[i] of a and partitioning a into those elements smaller than equal to and greater than a[i].
7. Implement to insert a new node in linked list are discussed. A node can be added and delete in
three ways
1) At the front of the linked list
2) After a given node.
3) At the end of the
linked list.
8.Given a singly linked list of size N containing only English Alphabets, your task is to complete the
function arrange C&V(), that arranges the consonants and vowel nodes of the list it in such a way that
all the vowels nodes come before the consonants while maintaining the order of their
arrival.

9.Assume that an array of ten integer contains the elements 8,3,15,21,2,14,78,63,95,19 use the bubble
sort
1. arrange in ascending order
2. find out the even and odd number

10.Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. You
are required to complete the function top View, which should print the top view of the given binary
tree.

11.Assume that an array of last 20 year contain the elements using selection sort.
1. arranged in descending order
2. find out the leap year