Scribd
Upload
90 views2 pages

2-Data Structures

This document provides details about the Bachelor of Computer Application (BCA) Data Structures course offered at Symbiosis International (Deemed University). The course aims to provide a systematic study of data structures and algorithms with a focus on abstract data types. Students will learn about common data structures like arrays, stacks, queues, linked lists, trees, and sorting/searching algorithms. The course is divided into 7 modules covering these topics in detail over 2 credits of study. Recommended textbooks are also provided.

Uploaded by

Muntaka Muhammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
90 views2 pages

2-Data Structures

This document provides details about the Bachelor of Computer Application (BCA) Data Structures course offered at Symbiosis International (Deemed University). The course aims to provide a systematic study of data structures and algorithms with a focus on abstract data types. Students will learn about common data structures like arrays, stacks, queues, linked lists, trees, and sorting/searching algorithms. The course is divided into 7 modules covering these topics in detail over 2 credits of study. Recommended textbooks are also provided.

Uploaded by

Muntaka Muhammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Symbiosis International (Deemed University)

COURSE DETAILS

Name of the Programme : Bachelor of Computer Application (BCA)


Semester : 2
Course Name : Data Structures
Course Code : T3209
No. of Credit : 2

Learning Objectives:

 A systematic study of data structures and their algorithms organized


around the unifying concept of data and code abstraction.
 Emphasis is placed on ADT-based.
 Topics include abstract data types (ADTs), objects.
 It enables to study specific data structures such as linear lists, stacks,
queues, binary trees, and binary search trees, sorting & searching
algorithms.

Course Outline:

Module Topic
No.
1 Data Structure Concepts And Algorithm Concepts:
Definition of Data Structures, Types of Data structures,
Abstract Data Type (ADT), Definition of Algorithm
2 Arrays :
Arrays Characteristics of an array, Definition of an Array,
Indexing of an array, Base address of array, Implementation of
1-D arrays, Row and Column Major implementations of 2-D, 3-
D arrays.
Symbiosis International (Deemed University)

3 Stacks:
Stack as ADT, operations on stack - PUSH and POP, Stack
implementation - array and linked list (static / dynamic),
Applications of Stack.
4 Queues:
Queue as ADT, Operations on cue, Types of queues - Linear
Queue, Circular Queue, Priority Queue
5 Linked Lists:
Concept of a linked list, linear Linked list, Doubly linked list,
Circular linked list.
6 Trees:
Concepts of a Tree, Tree as ADT, definitions of Binary trees,
Strictly Binary tree, Complete Binary tree, weight of a tree, level
of a node, Height/Depth of a Tree, Operations on trees –
Addition and Deletion of nodes, Tree Traversal Algorithms:
Inorder, Preorder, Postorder,
7 Sorting & Searching:
Bubble sort, Insertion sort, Selection Sort Linear and Binary
Search

Books Recommended:
1. Data Structures using C and C++ by Tanenbaum
2. Fundamentals of Data Structures by Horowitz and Sahni
3. Data Structure and Files using C by Abhay Abhyankar
4. Data Structures by Schaum Series

You might also like