Welcome to IRDT Uttarakhand E-Syllabus Web Portal

17 PGDCA
Duration : 2 Years
Eligibility : Graduate
Intake : 40/60 (As approved by AICTE)
Pattern of the Examination : Semester System
Assessment Type : The assessment will we carry out through credit point system/Learning Based Out comes.
Theory & Practical Ratio : 60: 40
Industrial Training: Included after IInd Semester
Ecology & Environment :
Entrepreneurship Development: A subject on Entrepreneurship Development has been incorporated after IInd Semester.
General Proficiency : A provision of 6 periods per week has been made. It Included of various cocurricular activities like games, hobby clubs, seminars, declamation contests, extension lectures, NCC, NSS, cultural activities and discipline etc.

Syllabus


Paper Code :
172001
Paper Name :
IMPLEMENTATION OF DATA STRUCTURE USING C
Data structures are the techniques of designing the basic algorithms for real-life
projects. Understanding of 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.
Revision of C fundamentals, Structures and Unions, Declaration of structures,
Accessing structure members, Structure Initialization, Arrays of structure, Unions.
Introduction to data structure, Primitive data structure, Non primitive data structure,
Linear data structure, Non- Linear data structure, operation on data structure, Algorithm
analysis & complexity.
Concept of Arrays, Single dimensional array, Two dimensional array, Storage strategy
of multidimensional arrays, Index Formula for single and multidimensional Array,
Operations on arrays with Algorithms (Insertion, deletion), Advantages and
disadvantages of Arrays, Recursion .
Introduction to stacks, Representation of stacks, Implementation of stacks using Array
& Link List, Uses of stacks, Introduction to queues, Implementation of queues, Circular
Queues, De-queues.
Introduction to linked list and double linked list, Representation of linked lists in
Memory, Traversing a linked list, Searching linked list, Insertion and deletion into
linked list, Application of linked lists, Doubly linked lists, Traversing a doubly linked
lists, insertion and deletion into doubly linked lists.
Concept of Trees, Concept and representation of Binary tree, Binary search trees,
Traversing Binary Trees (Pre order, Post order and In order), Introduction to graphs,
types of graphs, Breadth first search, Depth first search.
Sorting and Searching Introduction, Search algorithm (Linear and Binary),
Concept of sorting, Sorting algorithms (Bubble Sort, Insertion Sort, Quick Sort,
Selection Sort, Merge Sort, Heap Sort, Radix Sort) and their comparisons, Complexity
Analysis of Sorting Algorithms.
1. Inserting and deleting elements in an array
2. Insertion and deletion of elements in linked list
3. Insertion and deletion of elements in double linked list
4. Stack implementation using arrays
5. Stack implementation using pointers
6. Queue implementation using arrays
7. Queue implementation using pointers
8. Linear search in a given list
9. Binary search in a given list
10. Implementation of binary search tree
11. Implementation of bubble sort algorithm
12. Implementation of insertion sort algorithm
13. Implementation of quick sort algorithm
14. Implementation of selection sort algorithm
15. Conversion from infix and post-fix notation
16. Implementation of factorial of a number using recursion
17. Implementation of Fibonacci series using recursions
1. Data Structures Using C and C++ by Rajesh K. Shukla; Wiley-India Pvt. Ltd.
Daryaganj, New Delhi
2. Data Structures and Algorithm Using C by R.S. Salaria; Khanna Book Pub. Co. (P)
Ltd. New Delhi
3. Data Structure Using C by Manoj Kumar Jambla; Eagle Publishing House,
Jalandhar 13/07/2013 Page 25 of 38
4. Expert Data Structures with C by R.B. Patel; Khanna Publishers, New Delhi.
5. Data Structure Through C by Yashwant Kanekar; BPB Publications
6. Data Structure Through C by G.S. Baluja


Website Developed By Softmaart