IndiaStudyCenter.com
Colleges & Universities | Distance Education | Admission Notifications | Entrance Exams | Course Syllabus | Question Papers
Home / Syllabus / Tamil Nadu / University of Madras / Under Graduate Programs / BCA / IInd Year
Semester IV - BCA215 - Data Structures and Algorithms
Ask a question
Print this page
University of Madras (UnOM)

University of Madras (UnOM)

Courses, Admission & Eligibility

Syllabus

Test Papers

University Departments & Campus Colleges

Notifications, Circulars & Announcements

Events, Conferences, Seminars & Workshops

Who's Who at the University

Personalities who studied at the University

Madras University Virtual University to begin offering courses from next academic year
University to offer graduate, postgraduate, Ph.D programmes

University of Madras - Institute of Distance Education (IDE)

Computer Science Study Guides

Study Guides

Objective Tests

Computer course admissions

Computer Science Textbooks & Reference Books

Popular Study Guides

C Programming Language

C++ Programs and Tutors

Database Technologies

Computer Organization

Operating Systems

Visual C++ Tutors

Software Engineering

University of Madras - Syllabus of Bachelor of Computer Applications (BCA) IInd Year - Semester IV - BCA215 - Data Structures and Algorithms

UNIVERSITY OF MADRAS
Bachelor in Computer Applications (BCA)
SEMESTER SYSTEM WITH CREDITS
(Effective from the Academic Year 2003-2004)

SYLLABUS

Semester IV - BCA215 - Data Structures and Algorithms

Lecturer/Lab Hours per Week: 6
Duration: 3 hrs
Max Makrs: 100
Credit: 4

Unit - I

Defmition of a Data structure - primitive and composite Data Types, Asymptotic notations, Arrays, Operations on Arrays, Order lists.

Unit - II

Stacks - Applications of Stack - Infix to Postfix Conversion, Recursion, Maze Problems - Queues - Operations on Queues, Queue Applications, Circular Queue.

Unit - III

Singly Linked List - Operations, Application - Representation of a Polynomial, Polynomial Addition; Doubly Linked List - Operations, Applications Ordering of Books in Library (Alphabetical Ordering).

Unit - IV

Trees and Graphs: Binary Trees - Conversion of Forest to Binary Tree, Operations - Tree Traversals; Graph - Defmition, Types of Graphs, Hashing Tables and Hashing Functions, Traversal - Shortest Path; Dijkstra’s Algorithm.

Unit - V

Algorithm - Defmition - Examples - Complexity - Divide and Conquer - Binary Search - Maximum and Minimum - Merge Sort.

Reference:

I. E.Horowitz and S.Shani Fundamentals of Data Structures in C++, Galgotia Pub. 1999.
2. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, Galgotia Pub. Pvt. Ltd., 1998.
3. R. Kruse C.L. Tondo and B. Leung, Data Structures and Program design in C, PFU, 1997.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Most popular pages

Business Schools - Engineering Colleges - Medical & Nursing Admissions - BEd in Distance mode - Journalism & Media Studies - Forensic Science

Search this site

Enter a detailed keyword. Ex: Syllabus of University of Madras Ist year BSc Computer Science course