313301: Data Structure Using C Syllabus for Computer Science & Information Technology 3rd Sem K Scheme MSBTE PDF

Data Structure Using C detailed Syllabus for Computer Science & Information Technology (IH), K scheme PDF has been taken from the MSBTE official website and presented for the diploma students. For Subject Code, Subject Name, Lectures, Tutorial, Practical/Drawing, Credits, Theory (Max & Min) Marks, Practical (Max & Min) Marks, Total Marks, and other information, do visit full semester subjects post given below.

For all other MSBTE Computer Science & Information Technology 3rd Sem K Scheme Syllabus PDF, do visit MSBTE Computer Science & Information Technology 3rd Sem K Scheme Syllabus PDF Subjects. The detailed Syllabus for data structure using c is as follows.

Rationale

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.
.

Course Outcomes:

Students will be able to achieve & demonstrate the following COs on completion of course based learning

1. – Perform basic operations on Arrays.
2. – Apply different Searching and Sorting methods.
3. – Implement basic operations on Linked List.
4. – Perform operations on Stack using Array and Linked List Implementations.
5. – Perform operations on Queue using Array and Linked List Implementations.
6. – Create and Traverse Tree to solve problems.

Unit I

Introduction to Data Structures 1.1 Introduction: Concept and Need of Data Structure, Definition, Abstract Data Type 1.2 Types of Data Structures: (i) Linear Data Structures (ii) Non-Linear Data Structures 1.3 Operations on Data Structures: (i) Traversing (ii) Insertion (iii) Deletion Lecture Using Chalk-Board Presentations

Unit II

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.
.

Unit III

Linked List 3.1 Difference between Static and Dynamic Memory Allocation. 3.2 Introduction to Linked List, Terminologies: Node, Address, Pointer, Information field / Data field, Next pointer, Null Pointer, Empty List. 3.3 Type of Lists: Linear List, Circular List, Representation of Doubly Linked List. 3.4 Operations on a Singly Linked List: Creating a Linked List, Inserting a new node in a Linked List, Deleting a node from a Linked List, Searching a key in Linked List, Traversing a Singly Linked List. 3.5 Applications of Linked List. Lecture Using Chalk-Board Demonstration Presentations Hands-on

Unit IV

Stack 4.1 Introduction to Stack: Definition, Stack as an ADT, Operations on Stack-(Push, Pop), Stack Operation Conditions – Stack Full / Stack Overflow, Stack Empty /Stack Underflow. 4.2 Stack Implementation using Array and representation using Linked List. 4.3 Applications of Stack: Reversing a List, Polish Notations, Conversion of Infix to Postfix Expression, Evaluation of Postfix Expression. 4.4 Recursion: Definition and Applications. Lecture Using Chalk-Board Demonstration Presentations Hands-on

Unit V

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.
.

Unit VI

Tree 6.1 Introduction to Trees Terminologies: Tree, Degree of a Node, Degree of a Tree, Level of a node, Leaf Node, Depth / Height of a Tree, In-Degree and Out-Degree, Path, Ancestor and Descendant Nodes. 6.2 Tree Types and Traversal methods, Types of Trees: General Tree, Binary Tree, Binary Search Tree (BST). Binary Tree Traversal: In-Order Traversal, Preorder Traversal, Post-Order Traversal. 6.3 Expression Tree, Heap Lecture Using Chalk-Board Demonstration Presentations Hands-on

Suggested Learning Materials / Books

1. Lipschutz Data Structures with ‘C’ (SIE) (Schaum’s Outline Series) McGraw Hill Education, New Delhi ISBN: 978-0070701984
2. Balgurusamy, E. Data Structures using ‘C’ McGraw Hill Education, New Delhi 2013, ISBN: 978-1259029547
3. ISRD Group Data Structures using ‘C’ McGraw Hill Education, New Delhi 2013, ISBN: 978-12590006401
4. Yashwant Kanetkar Understanding Pointers in C BPB ISBN 8170298911

Learning Websites & Portals

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.
.

For detail Syllabus of all other subjects of Computer Science & Information Technology, K scheme do visit Computer Science & Information Technology 3rd Sem Syllabus for K scheme.

For all Computer Science & Information Technology results, visit MSBTE Computer Science & Information Technology all semester results direct links.