Data Structures and Algorithms Design Nptel Answers All Weeks [1-12]

The modern economy is run by algorithms. This a first-level course to introduce the students to the world of algorithm design, data structures, analysis, and programming. We’ll start with the asymptotics notation which captures time and space of algorithms in the worst-case.

The basic data structures covered are — array, list, queue, stack, matrix, tree, heap, set, and graph. The algorithmic paradigms covered are — induction/recursion, divide-conquer, hashing, greedy-method, and dynamic-programming.

In the lectures, the theory will be backed up by numerous practical CS examples. The content is suitable for anyone who is mathematically inclined or computationally curious.

INTENDED AUDIENCE: Computer Science & Engineering, Mathematics, Electronics, Physics, & similar disciplines.

PREREQUISITES: Very good analytical skills.

INDUSTRY SUPPORT: Discrete Optimization, Cryptography/ Cyber Security, Coding theory, Computer Algebra, Symbolic Computing Software, Artificial Intelligence, Learning Software