Students willing to learn programming in C and Data Structures with Algorithms can attend.
Topics to be covered
Session 1: Introduction to C.
Session 2: Arrays and Strings.
Session 3: Pointers and Functions.
Session 4: Structures and Unions.
Session 5: Stacks, Queues and Linked list.: Definition, Representation, Operations, Implementation and Applications
Session 6: Linked list cont.: Operations on Linked List, Doubly Linked List, Circular Linked List, and Circular Doubly Linked List. Applications of Linked List: Searching, Sorting, Linked Implementation of Stack and Queue.
Session 7: Tress and Graphs: Binary Trees-operations, Binary Search Tree, AVL Tree, Heaps and Traversal-BFS & DFS.
Session 8: Sorting and Searching: Selection Sort, Merge Sort, Quick Sort, Linear Search, Binary Search and Hashing.
Applications and Complexity of algorithms will be discussed.
The method of delivery is through chalk and talk.
Textbook referred:
- Herbert Schildt, “C: The Complete Reference”, McGraw Hill Education (India) Pvt Ltd. 4thEdition, 2016.
- Richard F Gilberg and Behrouz A Forouzan, “Data Structures: A Pseudocode Approach with C”, Cengage learning, 2nd Edition, 2016
Course Details:
Duration: 1 Month / 4 Weeks / 8 Sessions / 16 Hours.
Batch Size: 8 only
Number of Batches: 2
Sessions/week: Two only
Days: Slot / Time.
Saturday: 1 / 5-7 pm
2 / 7-9 pm
Sunday: 1 / 9-11 am
2 / 11:30am-1:30pm
Fees: 3500/-
Note:
- Introduction of a new student by an existing one can earn points leading to gift vouchers worth 500/-. T&C apply.
- Only when the seats are full, the course shall commence immediately.
- On request weekday / online slots can be arranged.
View this Course
Certified
You have 
