DATA STRUCTURES USING C++
- Course Code : 18EC643
- CIE Marks :40
- Lecture Hours/Week :03
- SEE Marks : 60
- Total Number of Lecture Hours : 4O (08 Hrs/module)
- Exam Hours : 03
- CREDITS — 03
Course Learning Objectives: This course will enable students to
- o Solve the problems using object oriented approach
- 0 Explain fundamentals of data structures and their applications essential for programming/problem solving
- 0 Analyze Linear Data Structures: Stack, Queues, Lists
- 0 Analyze Non Linear Data Structures: Trees
- 0 Assess appropriate data structure during program development/Problem Solving
Module -1
INTRODUCTION: GH- and its features, Data types, Variables, Operators, Expressions, Control structures, classes and Objects, Functions and parameters, function overloading, Recursion, Constructors, Destructors and Operator overloading, Inheritance, Polymorphism, Programming examples.Full Notes Given Below
Module -2
ARRAYS AND MATRICES: Arrays, Matrices, Special matrices, Sparse matrices. POINTERS: Pointers, Dynamic memory allocation LINEAR LISTS: Data objects and structures, Introduction to Linear and Non Linear data structures, Linear list data structures, Array Representation, Vector Representation, Singly Linked lists and chains.Full Notes Given Below
Module -3
STACKS: The abstract data types, Array Representation, Linked Representation, Applications — Parsing and Evaluation of arithmetic expressions, Parenthesis Matching & Towers of Hanoi.Full Notes Given Below
Module -4
QUEUES: The abstract data types, Array Representation, Linked Representation, Applications-Railroad car arrangement, Priority Queues HASHING: Dictionaries, Linear representation, Hash table representation.Full Notes Given Below
Module -5
TREES: Binary trees, Properties and representation of binary trees, Common binary tree operations, Binary tree traversal the ADT binary tree, ADT binary tree and the class linked binary tree. Binary search trees operations and implementation. Heaps, Applications—Heap SortingImportant Links:
Course Outcomes: After studying this course, students will be able to:
l. Relate to Dynamic memory allocation, Various types of data structures, operations and algorithms and Sparse matrices and Hashing2. Apply object-oriented approach to solve problems
3. Understand non-Linear data structures trees and their applications
4. Design appropriate data structures for solving computing problems
5. Analyze the operations of Linear Data structures: Stack, Queue and Linked List and their applications
0 Comments