Scribd
Upload
61 views2 pages

201 DataStructureUsingC++ Syllubus

The document outlines the syllabus for the Data Structures using C++ course at Visvesvaraya Technological University, detailing course objectives, modules, and outcomes. It covers fundamental concepts such as arrays, stacks, queues, lists, trees, and graphs, along with their operations and algorithms. Suggested learning resources include several textbooks related to data structures and C++ programming.

Uploaded by

Bhavana Venkat
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
61 views2 pages

201 DataStructureUsingC++ Syllubus

The document outlines the syllabus for the Data Structures using C++ course at Visvesvaraya Technological University, detailing course objectives, modules, and outcomes. It covers fundamental concepts such as arrays, stacks, queues, lists, trees, and graphs, along with their operations and algorithms. Suggested learning resources include several textbooks related to data structures and C++ programming.

Uploaded by

Bhavana Venkat
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

Visvesvaraya Technological University, Belagavi

(State University of Government of Karnataka Established as per the VTU Act, 1994)
Centre for Distance and Online Education (VTU-CDOE)

SEMESTER - II

Data Structures using C++ Semester II


Course Code OBCA201 CIE Marks 30
SEE Marks 70
Credits 4 Total Marks 100
Exam Hours 3
Examination nature (SEE) Theory

Course objectives:
 Fundamentals of data structures
 Basic concepts related to stacks, queues.
 Fundamentals of graphs, Multilists and file organization
MODULE-1
Introduction to Data Structure and its Characteristics Array Representation of single and
multidimensional arrays; Sparse arrays – lower and upper triangular matrices and Tri-
diagonal matrices with Vector Representation.
MODULE-2
Stacks and Queues
Introduction and primitive operations on stack; Stack application; Infix, postfix, prefix
expressions; Evaluation of postfix expression; Conversion between prefix, infix and
postfix, introduction and primitive operation on queues, D- queues and priority queues.
MODULE-3
Lists
Introduction to linked lists; Sequential and linked lists, operations such as traversal,
insertion, deletion searching, two way lists.

MODULE-4
Trees
Introduction and terminology; Traversal of binary trees; Recursive algorithms for tree
operations such as traversal, insertion, deletion; Binary Search Tree
MODULE-5
Graphs
Graph terminology, Representation of graphs, path matrix, BFS (breadth first search), DFS
(depth first search), topological sorting, Warshall’s algorithm (shortest path algorithm.)

Course outcomes:
CO 1 : Identify different types of data structures, operations and algorithms
CO 2: Illustrate searching and sorting operations on files
CO 3:Demonstrate the working of stack, Queue, Lists, Trees and Graphs in problem solving
& implement all data structures in a high-level language for problem solving
Visvesvaraya Technological University, Belagavi
(State University of Government of Karnataka Established as per the VTU Act, 1994)
Centre for Distance and Online Education (VTU-CDOE)

Suggested Learning Resources: Books


1. Adam Drozdek, “Data Structures and Algorithms in C++”, 2013, Fourth Edition,
Cengage Learning
2. Bhushan Trivedi, “Programming with ANSI C++”, Oxford Press, Second Edition,
2012.
3. Balagurusamy E, Object Oriented Programming with C++, Tata McGraw Hill
Education Pvt.Ltd, Fourth Edition 2010.
4. R.S. Salaria, “ Data Structures & Algorithms” , Khanna Book Publishing Co.
(P)Ltd..,2002

You might also like