Data Structures through C++ Detailed Syllabus for B.Tech second year first sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.
The detailed syllabus for Data Structures through C++ B.Tech 2016-2017 (R16) second year first sem is as follows.
B.Tech. II Year I Sem. L/T/P/C
Course Code: CS302ES 4/0/0/4
Course Objectives:
- To understand the basic concepts such as Abstract Data Types, Linear and Non Linear Data structures.
- To understand the notations used to analyze the Performance of algorithms.
- To understand the behavior of data structures such as stacks, queues, trees, hash tables, search trees, Graphs and their representations.
- To choose an appropriate data structure for a specified application.
- To understand and analyze various searching and sorting algorithms.
- To learn to implement ADTs such as lists, stacks, queues, trees, graphs, search trees in C++ to solve problems.
Course Outcomes:
- Ability to choose appropriate data structures to represent data items in real world problems.
- Ability to analyze the time and space complexities of algorithms.
- Ability to design programs using a variety of data structures such as stacks, queues, hash tables, binary trees, search trees, heaps, graphs, and B-trees.
- Able to analyze and implement various kinds of searching and sorting techniques.
UNIT – I C++ Programming Concepts: Review of C, input and output in C++, functions in C++-
value parameters, reference parameters, Parameter passing, function overloading, function templates, Exceptions-throwing an exception and handling an exception, arrays, pointers, new and delete operators, class and object, access specifiers , friend functions, constructors and destructor, Operator overloading, class templates, Inheritance and Polymorphism.. Basic Concepts – Data objects and Structures, Algorithm Specification-Introduction, Recursive algorithms, Data Abstraction, Performance analysis- time complexity and space complexity, Asymptotic Notation-Big O, Omega and Theta notations, Complexity Analysis Examples, Introduction to Linear and Non Linear data structures.
UNIT – II Representation of single, two dimensional arrays, sparse matrices-array and linked
representations. Linear list ADT-array representation and linked representation, Singly Linked ListsOperations-Insertion, Deletion, Circularly linked lists-Operations for Circularly linked lists,
Doubly Linked Lists- Operations- Insertion, Deletion. Stack ADT, definition, array and linked implementations, applications-infix to postfix conversion, Postfix expression evaluation, recursion implementation, Queue ADT, definition, array and linked Implementations, Circular queues-Insertion and deletion operations.
UNIT – III Trees – definition, terminology, Binary trees-definition, Properties of Binary Trees, Binary
Tree ADT, representation of Binary Trees-array and linked representations, Binary Tree traversals, Threaded binary trees, Priority Queues –Definition and applications, Max Priority Queue ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion from a Max Heap.
TEXT BOOKS:
- Data structures, Algorithms and Applications in C++, 2nd Edition, Sartaj Sahni, Universities Press.
- Data structures and Algorithms in C++, Adam Drozdek, 4th edition, Cengage learning.
REFERENCE BOOKS:
- Data structures with C++, J. Hubbard, Schaum’s outlines, TMH.
- Data structures and Algorithms in C++, M.T. Goodrich, R. Tamassia and D. Mount, Wiley India.
- Data structures and Algorithm Analysis in C++, 3rd edition, M. A. Weiss, Pearson.
- Classic Data Structures, D. Samanta, 2nd edition, PHI.
For all other B.Tech 2nd Year 1st Sem syllabus go to JNTUH B.Tech Information Technology 2nd Year 1st Sem Course Structure for (R16) Batch.
All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.
Do share with friends and in case of questions please feel free drop a comment.