Download Session 1

Session 1
Advanced Concepts of C and Introduction to data structures
1. Introduction,
Data
Types,
Arrays,
Pointers,
Pointer
Arithmetic, Array of pointers, Passing parameters to the
functions, Relation between Pointers and Arrays, Scope Rules
and Storage Classes, Dynamic allocation and de-allocation of
memory, Dangling pointer problem, Structures, Enumerated
Constants, Unions.
Session 2
Introduction to Data structures
2. Introduction, Data Objects & Data Structures, Implementation
of the Data Structures, Abstract Data type, Algorithm and
pseudo code, Complexity of Algorithms.
Session 3
Arrays
3. Introduction, Evaluation of Polynomials, Polynomial in a
single variable, Polynomial in Two variables, Strings, String
Functions, String Length Using Arrays and Using Pointers,
String Copy Using Arrays and Using Pointers, String Compare
Using Arrays, Concatenation of S2 to the end of S1, Two
Dimensional Arrays, Sparse Matrix, Multiplication of the
sparse matrices, Multidimensional Arrays
Session 4
Linked Lists
4. Introduction, Singly Linked List [or] One way chain, Function
to add a node at the end of the linked list, Function to add a
node at the beginning of the linked list, Function to add a
node after the specified node, Functions for display and
count, Function to delete the specified node from the list,
Doubly Linked Lists [or] Two-way chain, Applications of the
linked lists, Linked lists and Polynomials.
Session 5
Stacks and Queues
5. Introduction, Stacks, Implementation of Stacks using Arrays,
Implementing Stacks using Linked Lists, Queues, Implementing
Queues using Arrays, Queues using linked lists, Circular
Queue, Circular Queue using linked list [Circular Lists],
Evaluation
of
expressions,
Postfix
expression,
Prefix
expression
Session 6
Graphs
6. Introduction, Adjacency Matrix and Adjacency lists, Breadth first
search and Depth first search, Other Tasks For The Graphs like-To
find the degree of the vertex, To find the number of edges, To print
a path from one vertex to another, To print the multiple paths from
one vertex to another, To find the number of components in a graph,
To find the critical vertices and edges.
Session 7
Trees
(Part 1)
7. Introductions, Rooted Tree, Binary Tree, Creation of Binary
Tree Breadth First Search, Binary Search Trees, Binary Search
Tree Creation, Searching a value in a binary search tree,
Depth First Traversal of the tree, Tree Traversals - Preorder
traversal of the tree, Post-order traversal of the tree, In
order Traversal, Functions to find Predecessor, Successor,
Parent, Brother, To delete a node from the tree,Expression
trees.
Session 8
Trees
(PART – 2)
8. Introduction, Binary Threaded Tree, Inorder Threading, To
create a simple binary tree and then thread it, To thread the
tree during creation, Post-order Threading, Preorder Treading,
Traversal of Binary Threaded Tree, Inorder Traversal, Preorder
Traversal, Post-order Traversal
Session 9
Searching And Sorting
9. Introduction, Searching Techniques-Sequential Search, Binary
Search, Sorting-Selection Sort, Bubble sort, Merge Sort, Quick
Sort (Partition Exchange Sort), Radix Sort, Heap Sort.