VTU NOTES for CBCS SYLLABUS, QUESTION PAPER By Asst Prof Adarsh Lakshetty

Click on below Syllabus to view module 1( 17cs33)notes Array .   Structure & Unions . Pointer  and Dynamic memory allocation function . 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 Introduction Data Structure is a way of collecting and organising data in such a way that we can perform operations on these data in an  effective way. Data Structures is about rendering data elements in terms of some relationship, for better organization and storage. For example, we have some data which has, player's  name  and  age . Here  is of  String  data type and  is of  integer data type. What is Data Structure?             1.        A  data structure  is a systematic way of organizing and accessing data.       A  data structure  t

DATA STRUCTURES AND APPLICATIONS [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2017 -2018) SEMESTER – III Subject Code 17CS33     IA Marks 40 Number of Lecture Hours/Week 04 Exam Marks 60 Total    Number of Lecture Hours 50 Exam Hours 03 CREDITS – 04 Module 1 Teaching Hours 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