DATA STRUCTURES USING C
|
| UP Polytechnic/Diploma In Computer Science And Engineering Digital Electronics Syllabus - EdufyHUB 4U |
RATIONALE
Data structures are the techniques of designing the basic algorithms for real-life projects. Understanding data structures is essential and this facilitates the understanding of the language. The practice and assimilation of data structure techniques is essential for programming. The knowledge of 'C' language and data structures will be reinforced by practical exercises during the course of study. The course will help students to develop the capability of selecting a particular data structure.
LEARNING OUTCOMES
After undergoing the subject, the students will be able to:
- Identify the problem and formulate an algorithm for it.
- Identify the best data structures to solve the problem
- Store data, process data using appropriate data structures
- Sort the data in ascending or descending order.
- Implement trees and various traversing techniques.
- Implement various searching and sorting algorithms and to compare them for checking efficiency.
DETAILED CONTENTS
1. Fundamental Notations
(08 Periods)
- Problem Solving Concept Top Down And Bottom Up Design, Structured Programming
- Concept Of Data Types, Variables And Constants
- Concept Of Pointer Variables And Constants
- Categories Of Data Structure
2. Arrays
(08 Periods)
- Concept Of Arrays
- Storage Representation Of Multi-Dimensional Arrays.
- Operations On Arrays With Algorithms (Searching, Traversing, Inserting, Deleting)
3. Linked Lists
(12 Periods)
- Introduction To The Linked List
- Representation Of Linked Lists In Memory
- Operations On A Linked List (Insertion, Deletion And Traversals)
- Application Of Linked Lists
- Doubly Linked Lists
- Operations On Doubly Linked Lists (Insertion, Deletion And Traversals)
4. Stacks, Queues And Recursion
(12 Periods)
- Introduction To stacks
- Representation Of Stacks
- Implementation Of Stacks
- Applications Of Stacks
- Introduction To Queues
- Implementation Of Queues
- Circular Queues
- De-queues
- Application Of Queues
- Recursion
5. Trees
(12 Periods)
- Concept Of Trees
- Representation Of Binary Tree In Memory
- Traversing Binary Trees (Pre Order, Post Order And In Order)
- Searching, inserting And Deleting Binary earch Trees
- Introduction To Heap
- Application Of Trees
6. Sorting And Searching
(12 Periods)
- Introduction To Sorting And Searching
- Search Algorithm (Linear and Binary)
- Sorting algorithms (Bubble Sort, Insertion Sort, Quick Sort, Selection Sort, Merge Sort, Heap Sort)
7. Graph
(06 Periods)
- Introduction To Graph
- Basic Operations
- Depth First Search
- Breadth First Search
LIST OF PRACTICALS
Write programs in C to implement
- Addition of two matrices using functions
- Multiplication of two matrices
- Push and pop operation in stack
- Inserting and deleting elements in queue
- Inserting and deleting elements in a circular queue
- Insertion and deletion of elements in the linked list
- Insertion and deletion of elements in a doubly linked list
- Factorial of a given number with recursion and without recursion
- Fibonacci series with recursion and without recursion
- Program for pre-order, post order and in order traversal of binary tree.
- The selection sort technique
- The bubble sort technique
- The quick sort technique
- The merge sort technique
- The binary search procedures to search an element in a given list
- The linear search procedures to search an element in a given list
INSTRUCTIONAL STRATEGY
This subject clears all fundamentals of programming techniques. Teachers should stress on explaining all the techniques and algorithms in detail in theory sessions. The students should be asked to convert their ideas about a problem into an algorithm in theory class and implement it in practical class. This will help the students to have clear concepts of programming.
MEANS OF ASSESSMENT
- Assignments and quiz/class tests, mid-term and end-term written tests
- Actual laboratory and practical work, exercises and viva-voce
- Software installation, operation, development and viva-voce
RECOMMENDED BOOKS
- Data Structure using C by Robert Kruse; Prentice Hall of India
- Data Structure through C by Yashwant Kanekar; BPB Publications
- Data structures – Schaum’s Outline Series by Lipschutz; McGraw Hill Education Pvt Ltd, New Delhi
- Data Structure using C by ISRD Group ; Tata McGraw Hills Education Pvt Ltd, New Delhi
- Expert Data Structures with C by R.B. Patel ; Khanna Publishers, New Delhi.
- Data Structures and Algorithm Using C by RS Salaria; Khanna Book Publishing Co. (P) Ltd. New Delhi
- Data Structure through C in depth by SK Srivastava, Deepali Srivastava; BPB Publications
- Data Structure through “C” Language by Sameeran Chattopadhyay, MatanginiChottopadhyay; BPB Publications
- Data Structure through “C” Language by DOEACC; BPB Publications
- Data Structure using “C” Lab Workbook by Shukla; BPB Publications
- E-books/e-tools/relevant software to be used as recommended by AICTE/NITTTR, Chandigarh.
Websites for Reference:
https://swayam.gov.in/
SUGGESTED DISTRIBUTION OF MARKS
| Topic No. | Time Allotted (Periods) | Marks Allotted (%) |
|---|---|---|
| 1 | 08 | 10 |
| 2 | 08 | 15 |
| 3 | 12 | 15 |
| 4 | 12 | 15 |
| 5 | 12 | 15 |
| 6 | 12 | 15 |
| 7 | 06 | 15 |
| Total | 70 | 100 |