Data Structures and Applications detailed Syllabus for Information Science Engineering (IS), 2018 scheme has been taken from the VTUs official website and presented for the VTU students. For Course Code, Subject Names, Teaching Department, Paper Setting Board, Theory Lectures, Tutorial, Practical/Drawing, Duration in Hours, CIE Marks, Total Marks, Credits and other information do visit full semester subjects post given below. The Syllabus PDF files can also be downloaded from the official website of the university.
For all other VTU IS 3rd Sem Syllabus for BE 2018 Scheme, do visit VTU IS 3rd Sem Syllabus for BE 2018 Scheme Subjects. The detailed Syllabus for data structures and applications is as follows.
Course Learning Objectives:
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 pdfs platform to make students’s lives easier.
.
Module 1
Introduction: Data Structures, Classifications (Primitive & Non Primitive), Data structure Operations, Review of Arrays, Structures, Self-Referential Structures, and Unions. Pointers and Dynamic Memory Allocation Functions. Representation of Linear Arrays in Memory, Dynamically allocated arrays. Array Operations: Traversing, inserting, deleting, searching, and sorting. Multidimensional Arrays, Polynomials and Sparse Matrices. Strings: Basic Terminology, Storing, Operations and Pattern Matching algorithms. Programming Examples.
Text Books:
1: Chapter 1: 1.2, Chapter 2: 2.2 – 2.7 Text Textbook 2: Chapter 1: 1.1 – 1.4, Chapter 3: 3.1 – 3.3, 3.5, 3.7, Ch apter 4: 4.1 – 4.9, 4.14 Reference 3: Chapter 1: 1.4 RBT: L1, L2, L3
Module 2
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 pdfs platform to make students’s lives easier..
Text Books:
1: Chapter 3: 3.1 -3.7 Textbook 2: Chapter 6: 6.1 -6.3, 6.5, 6.7-6.10, 6.12, 6.13 RBT: L1, L2, L3
Module 3
Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation; Garbage Collection. Linked list operations: Traversing, Searching, Insertion, and Deletion. Doubly Linked lists, Circular linked lists, and header linked lists. Linked Stacks and Queues. Applications of Linked lists – Polynomials, Sparse matrix representation. Programming Examples
Text 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 pdfs platform to make students’s lives easier..
Module 4
Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked Representation of Binary Trees, Binary Tree Traversals – Inorder, postorder, preorder; Additional Binary tree operations. Threaded binary trees, Binary Search Trees – Definition, Insertion, Deletion, Traversal, Searching, Application of Trees-Evaluation of Expression, Programming Examples
Text Books:
1: Chapter 5: 5.1 -5.5, 5.7; Textbook 2: Chapter 7: 7.1 – 7.9 RBT: L1, L2, L3
Module 5
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 pdfs platform to make students’s lives easier..
Text Books:
1: Chapter 6 : 6.1 -6.2, Chapter 7:7.2, Chapter 8 : 8.1-8.3 Textbook 2: Chapter 8 : 8.1 – 8.7, Chapter 9 : 9.1-9.3, 9.7, 9.9 Reference 2: Chapter 16 : 16.1 – 16.7 RBT: L1, L2, L3
Course Outcomes:
The student will be able to :
- Use different types of data structures, operations and algorithms
- Apply searching and sorting operations on files
- Use stack, Queue, Lists, Trees and Graphs in problem solving
- Implement all data structures in a high-level language for problem solving.
Question Paper Pattern:
- The question paper will have ten questions.
- Each full Question consisting of 20 marks
- There will be 2 full questions (with a maximum of four sub questions) from each module.
- Each full question will have sub questions covering all the topics under a module.
- The students will have to answer 5 full questions, selecting one full question from each module.
Textbooks:
- Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2nd Ed, Universities Press, 2014
- Seymour Lipschutz, Data Structures Schaum’s Outlines, Revised 1st Ed, McGraw Hill, 2014
Reference Books:
- Gilberg & Forouzan, Data Structures: A Pseudo-code approach with C, 2nd Ed, Cengage Learning,2014
- Reema Thareja, Data Structures using C, 3rd Ed, Oxford press, 2012
- Jean-Paul Tremblay & Paul G. Sorenson, An Introduction to Data Structures with Applications, 2nd Ed, McGraw Hill, 2013
- A M Tenenbaum, Data Structures using C, PHI, 1989
- Robert Kruse, Data Structures and Program Design in C, 2nd Ed, PHI, 1996
For detail Syllabus of all other subjects of BE 3rd Sem Information Science Engineering, visit (IS) 3rd Sem Syllabus Subjects.
For all (CBSE & Non-CBSC) BE results, visit VTU BE all semester results direct links.