MCA C1002
Data Structures through C
![](data:image/svg+xml,%3Csvg xmlns="http://www.w3.org/2000/svg" width="1" height="1"/%3E)
Notes are on their way.
For now, use the syllabus outline to see what this subject covers.
Syllabus topics
History and Importance of C, Sample programming, Basic Structure and execution of C programs, Constants, Variables, and Data Types and various type of declarations, Different type operators and Expressions, Operator Precedence and Associability, Mathematical and Character Functi ons., Decision Making and Branching, Looping. One – dimensional Arrays and their declaration and Initializations, Two-dimensional Arrays and their initializations, Multidimensional Arrays, Dynamic Arrays, String handling functions. [Q-1]
Notes will be added here.
Syllabus: supplied PDF, page 10.
Syllabus topics
Need and Elements for user –defined Functions, Definition of Functions, Return values and their types, Function calls and Declaration, Arguments and corresponding return values, Functions that return multiple values, Nesting of functions, Recursion, Defining Structure, Declaring Structure Variable and Accessing Structure Members, Initialization of Structure, Comparing Structure Variables, Arrays of Structures, and Structures within structures, Unions, Understanding Poi nters, Accessing the Address of a Variable, Declaration and Initialization of Pointer Variables, Accessing a Variable through its Poin ter, File Management in C. [Q-2]
Notes will be added here.
Syllabus: supplied PDF, page 10.
Syllabus topics
Need of Data Structure, Algorithm, Complexity, Asymptotic Notations, Introduction to linked lists; Linked list types, operations on linked list; Introduction and primitive operations on stack; Stack application; Infix, postfix, prefix expressions; Evaluation of postfix expressio n; Conversion between prefix, infix and postfix, introduction and primitive operation on queues. [Q-2]
Notes will be added here.
Syllabus: supplied PDF, page 10.
Syllabus topics
Introduction, Tree terminology; Traversal of binary trees; Recursive algorithms for tree operations such as traversal, insertion, deletion; Binary Search Tree. The invention of B -Tree; Example for creating a B - Tree, B+ Tree, AVL tree. Graph Definition and Terminology, Directed and Undirected graph with adjacency Matrix; Weighted Graph, Graph Linked representation, DFS and BFS. [Q-2]
Notes will be added here.
Syllabus: supplied PDF, page 10.
Syllabus topics
Sorting : Insertion sort, Selection sort, Merge sort, Bubble sort, Heap Sort Searching Techniques: Linear search & Binary search [Q-1]
Notes will be added here.
Syllabus: supplied PDF, page 10.
Check your university’s syllabus for the topics covered in your exams.