Data Structures and Applications detail syllabus for Computer Science & Engineering (Cse), 2017 scheme is taken from VTU official website and presented for VTU students. The course code (17CS33), 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 cse 3rd sem syllabus for be 2017 scheme vtu you can visit CSE 3rd Sem syllabus for BE 2017 Scheme VTU Subjects. The detail syllabus for data structures and applications is as follows.
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 1: Ch 1: 1.2, Ch2: 2.2 -2.7 Text 2: Ch 1: 1.1 -1.4, Ch 3: 3.1-3.3, 3.5, 3.7, Ch 4: 4.1-4.9, 4.14 Ref 3: Ch 1: 1.4
Module 2
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 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 1: Ch4: 4.1 -4.8 except 4.6 Text 2: Ch5: 5.1 – 5.10
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 1: Ch5: 5.1 -5.5, 5.7 Text 2: Ch7: 7.1 – 7.9
Module 5
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.
Course Outcomes:
After studying this course, students will be able to:
- Explain different types of data structures, operations and algorithms Apply searching and sorting operations on files Make use of stack, Queue, Lists, Trees and Graphs in problem solving. Develop all data structures in a high-level language for problem solving.
Question paper pattern:
- The question paper will have ten questions.
- There will be 2 questions from each module.
- Each question will have questions covering all the topics under a module.
- The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
- Fundamentals of Data Structures in C – Ellis Horowitz and Sartaj Sahni, 2nd edition, Universities Press, 2014
- Data Structures – Seymour Lipschutz, Schaum’s Outlines, Revised 1st edition, McGraw Hill, 2014
Reference Books:
- Data Structures: A Pseudo-code approach with C -Gilberg & Forouzan, 2nd edition, Cengage Learning, 2014
- Data Structures using C, , Reema Thareja, 3rd edition Oxford press, 2012
- An Introduction to Data Structures with Applications- Jean-Paul Tremblay & Paul G. Sorenson, 2nd Edition, McGraw Hill, 2013
- Data Structures using C – A M Tenenbaum, PHI, 1989
- Data Structures and Program Design in C – Robert Kruse, 2nd edition, PHI, 1996
For detail syllabus of all other subjects of BE Cse, 2017 scheme do visit Cse 3rd Sem syllabus for 2017 scheme.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.