IndiaStudyCenter.comNot interested in regular full time college? Try Distance Education
Colleges & Universities | Distance Education | Admission Notifications | Entrance Exams | Course Syllabus | Question Papers
Home / Syllabus / Tamil Nadu / University of Madras / Under Graduate Programs / BSc / Computer Science
Semester III - Practical III - Data Structures Using C++
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 Science (BSc) Computer Science - Semester III - Practical III - Data Structures Using C++

UNIVERSITY OF MADRAS
B.Sc. DEGREE COURSE IN COMPUTER SCIENCE
SEMESTER SYSTEM WITH CREDITS
(Effective from the Academic Year 2003-2004)

Semester III - Practical III - Data Structures Using C++

Lecture Lab: 4
Duration: 3 hrs
Maximum Marks: 50
Credits: 2

1. Implement PUSH, POP operations of stack using Arrays.
2. Implement PUSH, POP operations of stack using Pointers.
4. Implement add, delete operations of a queue using Arrays.
5. Implement add, delete operations of a queue using Pointers.
6. Conversion of infix to postfix using stack operations.
7. Postflx Expression Evaluation.
8. Addition of two polynomials using Arrays and Pointers.
9. Creation, insertion, and deletion in doubly linked list.
10. Binary tree traversals (in-order, pre-order, and post-order) using linked list.
11. Depth First Search and Breadth first Search for Graphs using Recursion.

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