Applications of Data Structures in C and C++

• Understand the fundamental concepts of linear sorting techniques such as Counting Sort, Radix Sort, and Bucket Sort.
• Apply hashing techniques, including chaining, linear probing, and double hashing, to optimize data retrieval.
• Compare different implementations of symbol tables using arrays, linked lists, and other structures.
• Develop algorithms for finding the single source shortest path using Dijkstra’s and Bellman-Ford algorithms.
• Analyze the greedy approach for solving optimization problems like Huffman coding and the fractional knapsack problem.
• Demonstrate the use of dynamic programming in solving problems like 0/1 knapsack and matrix chain multiplication.
• Implement divide and conquer algorithms like binary search and Strassen’s matrix multiplication.
• Explore the branch and bound approach to solving complex problems like the 4-queens problem and least cost search.
• Investigate selection algorithms and their applications in finding the k-smallest elements.
• Assess the complexity of algorithms and understand NP-complete problems and their computational challenges.

• Explain the significance and differences of various linear sorting algorithms.
• Solve hashing problems by implementing different collision handling methods such as chaining and linear probing.
• Evaluate the efficiency of different symbol table implementations in terms of space and time complexity.
• Compute the shortest paths using Dijkstra’s and Bellman-Ford algorithms for various graph-based problems.
• Design efficient solutions to optimization problems using the greedy approach.
• Apply dynamic programming techniques to complex problems like knapsack and matrix chain multiplication.
• Implement divide and conquer algorithms to improve efficiency in search and matrix multiplication.
• Solve problems using branch and bound techniques, ensuring optimal solutions for puzzles and scheduling problems.
• Identify the k-smallest elements in a set of data using selection algorithms.
• Classify problems as NP-complete and understand the implications of solving these problems in real-world applications.

The Academic Approach of the course focuses on the “work centric” education i.e. begin with work (and not from a book !), derive knowledge from work and apply that knowledge to make the work more wholesome, useful and delightful. The ultimate objective is to empower the Learner to engage in socially useful and productive work. It aims at leading the learner to his/her rewarding career as well as development of the society.

Learning methodology

• Learners are given an overview of the course and its connection to life and work.
• Learners are then exposed to the specific tool(s) used in the course through the various real-life applications of the tool(s).
• Learners are then acquainted with the careers and the hierarchy of roles they can perform at workplaces after attaining increasing levels of mastery over the tool(s).
• Learners are then acquainted with the architecture of the tool or Tool Map so as to appreciate various parts of the tool, their functions and their inter-relations.
• Learners are then exposed to simple application development methodology by using the tool at the beginner’s level
• Learners then perform the differential skills related to the use of the tool to improve the given ready-made outputs.
• Learners are then engaged in appreciation of real-life case studies developed by the experts.
• Learners are then encouraged to proceed from appreciation to imitation of the experts.
• After imitation experience, they are required to improve the expert’s outputs so that they proceed from mere imitation to emulation.
• Finally, they develop the integral skills involving optimal methods and best practices to produce useful outputs right from scratch, publish them in their ePortfolio and thereby proceed from emulation to self-expression.

Evaluation Pattern of KLiC Courses consists of 4 Sections as per below table:

MKCL’s KLiC Certificate will be provided to the learner who will satisfy the below criteria:

1. Learners who have successfully completed above mentioned 3 Sections i.e. Section 1, Section 2 and Section 3
2. Additionally, learner should have completed Section 4 (i.e. Section 4 will comprise of SUPWs i.e. Socially Useful and Productive Work in form of Assignments)
   • Learner has to complete and upload minimum 2 out of 5 Assignments