Data Structures detailed syllabus for Information Technology (IT), 2nd Year 1st Sem R18 regulation has been taken from the JNTUH official website and presented for the B.Tech students affiliated to JNTUH course structure. For Course Code, Subject Names, Theory Lectures, Tutorial, Practical/Drawing, Credits, and other information do visit full semester subjects post given below. We make sure the result links and syllabus uploaded here is latest and up to date, also the syllabus PDF files can also be downloaded from the universities official website.
For Information Technology (IT) 2nd Year 1st Sem R18 Regulation Scheme, do visit IT 2nd Year 1st Sem R18 Scheme. The detailed syllabus for data structures is as follows.
Data Structures Subject Syllabus for IT 2nd Year 1st Sem R18 Regulation
Prerequisites:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.
Course Objectives:
- Exploring basic data structures such as stacks and queues.
- Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs.
- Introduces sorting and pattern matching algorithms
Course Outcomes:
- Ability to select the data structures that efficiently model the information in a problem.
- Ability to assess efficiency trade-offs among different data structure implementations or combinations.
- Implement and know the application of algorithms for sorting and pattern matching.
- Design programs using a variety of data structures, including hash tables, binary and general tree structures, search trees, tries, heaps, graphs, and AVL-trees.
UNIT – I
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
UNIT – II
Dictionaries: linear list representation, skip list representation, operations – insertion, deletion and searching.
Hash Table Representation: hash functions, collision resolution-separate chaining, open addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing.
UNIT – III
Search Trees: Binary Search Trees, Definition, Implementation, Operations- Searching, Insertion and Deletion, AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and Searching, Red -Black, Splay Trees.
UNIT – IV
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
UNIT – V
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer -Moore algorithm, the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries.
TEXTBOOKS:
- Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson Freed, Universities Press.
- Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson Education.
REFERENCE BOOKS:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
For detailed syllabus of all the other subjects of B.Tech 2nd Year Information Technology (IT), visit Information Technology (IT) 2nd Year Syllabus Subjects.
For results of Information Technology (IT) 2nd Year 1st Sem R18 Regulation, visit IT 2nd Year 1st Sem R18 Regulation results direct link.