Scribd
Upload
404 views2 pages

220C3A

Uploaded by

bcaakasc2021
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
404 views2 pages

220C3A

Uploaded by

bcaakasc2021
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

UNIVERSITY OF MADRAS

BACHELOR OF COMPUTER APPLICATIONS (BCA)


DEGREE PROGRAMME
SYLLABUS WITH EFFECT FROM 2023-2024

Year: II Semester: III


Data Structures 220C3A
Common for B.C.A. , B.Sc.-CSc-wAI , B.Sc.-CSc-wDS
Credits 5 Lecture Hours:4 per week

Learning Objectives: (for teachers: what they have to do in the class/lab/field)


 To impart the basic concepts of data structures and algorithms.
 To acquaint the student with the basics of the various data structures
 This course also gives insight into the various algorithm design techniques
Course Outcomes: (for students: To know what they are going to learn)
CO1: To introduce the concepts of Data structures and to understand simple linear data
structures.
CO2: Learn the basics of stack data structure, its implementation and application
CO3: Use the appropriate data structure in context of solution of given problem and
demonstrate a familiarity with major data structures.
CO4: To introduce the basic concepts of algorithms
CO5: To give clear idea on algorithmic design paradigms like Divide and conquer and
Backtracking,
Units Contents
I INTRODUCTION TO DATA STRUCTURES:
Representation of arrays, Applications of arrays, sparse matrix and its representation -
Linear list: Singly linked list implementation, insertion, deletion and searching
operations on linear list
II Circular linked list: implementation, Double linked list implementation, insertion,
deletion and searching operations.
STACKS and QUEUES:
Operations, array and linked representations of stack, stack applications, infix to
postfix conversion, postfix expression evaluation
III Queues: operations on queues, array and linked representations - Circular Queue:
operations, applications of queues.
TREES & GRAPHS:
Trees: Definitions and Concepts- Representation of binary tree, Binary tree traversals
(Inorder, Postorder, preorder), Binary search trees in arrays
IV Heaps - AVL Trees – B Trees
Graphs: Representation of Graphs- Types of graphs
V Graph Applications: Breadth first traversal – Depth first traversal- -Single source
shortest path – Minimal spanning trees – prim’s and kruskal’s algorithms
UNIVERSITY OF MADRAS
BACHELOR OF COMPUTER APPLICATIONS (BCA)
DEGREE PROGRAMME
SYLLABUS WITH EFFECT FROM 2023-2024

Learning Resources:
Recommended Texts
1. Ellis Horowitz , Sartaj Sahni, Susan Anderson Freed, Second Edition ,
“Fundamentals of Data in C”, Universities Press
2. E. Horowitz, S. Sahni and S. Rajasekaran, Second Edition ,“Fundamentals of
Computer Algorithms “ Universities Press

Reference Books
1. Seymour Lipschutz ,”Data Structures with C”, First Edition, Schaum’s outline series
in computers, Tata McGraw Hill.
2. R.Krishnamoorthy and G.Indirani Kumaravel, Data Structures using C, Tata
McGrawHill – 2008.
3. A.K.Sharma, Data Structures using C , Pearson Education India,2011.
4. G. Brassard and P. Bratley, “Fundamentals of Algorithms”, PHI, New Delhi, 1997.
5. A.V. Aho, J.E. Hopcroft, J.D. Ullmann,, “The design and analysis of
ComputerAlgorithms”, Addison Wesley, Boston, 1974
6. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to
Algorithms, Third edition, MIT Press, 2009
7. Sanjoy Dasgupta, C.Papadimitriou and U.Vazirani , Algorithms , Tata McGraw-Hill,
2008.

You might also like