Syllabus

Data Structures Using C++ Syllabus for VTU BE 2017 Scheme (Open Elective-2)

Data Structures Using C++ detail syllabus for various departments, 2017 scheme is taken from VTU official website and presented for VTU students. The course code (17EC661), and for exam duration, Teaching Hr/week, Practical Hr/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below.

For all other open elective-2 syllabus for vtu be 2017 scheme you can visit Open Elective-2 syllabus for VTU BE 2017 Scheme Subjects. The detail syllabus for data structures using c++ is as follows.

Course Objectives:

This course will enable students to

  • Explain fundamentals of data structures and their applications essential for programming/problem solving
  • Analyze Linear Data Structures: Stack, Queues, Lists
  • Analyze Non Linear Data Structures: Trees
  • Assess appropriate data structure during program development/Problem Solving

Module 1
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

Module 2

ARRAYS AND MATRICS: Arrays, Matrices, Special matrices, Sparse matrices. STACKS: The abstract data types, Array Representation, Linked Representation, Applications-Parenthesis Matching & Towers of Hanoi.

Module 3

QUEUES: The abstract data types, Array Representation, Linked Representation, Applications-Railroad car arrangement. HASHING: Dictionaries, Linear representation, Hash table representation.

Module 4
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

Module 5

Priority Queues: Linear lists, Heaps, Applications-Heap Sorting.
Search Trees: Binary search trees operations and implementation, Binary Search trees with duplicates.

Course Outcomes:

After studying this course, students will be able to:

  • Acquire knowledge of Dynamic memory allocation, Various types of data structures, operations and algorithms and Sparse matrices and Hashing
  • Understand non Linear data structures trees and their applications
  • Design appropriate data structures for solving computing problems
  • Analyze the operations of Linear Data structures: Stack, Queue and Linked List

Text Books:

Data structures, Algorithms, and applications in C++, Sartaj Sahni, Universities Press, 2nd Edition, 2005.

Reference Books:

  1. Data structures, Algorithms, and applications in C++, Sartaj Sahni, Mc. Graw Hill, 2000.
  2. Object Oriented Programming with C++, E.Balaguruswamy, TMH, 6th Edition, 2013.
  3. Programming in C++, E.Balaguruswamy. TMH, 4th, 2010.

For detail syllabus of all other subjects of BE do syllabus for different schemes from menu given on top.

Dont forget to download iStudy for latest syllabus and results, class timetable and more.

Leave a Reply

Your email address will not be published. Required fields are marked *

*