CS104DS Course Detail Syllabus

The Syllabus of this course is Subjective.

You will be only applying the concept you already know to solve numerous problems.

This course intends to induce the ability to think in a way to approach a given problem.

You will be solving problem on all data structures you know  Stacks, Queues, LinkedList, Trees, Recursion etc.

The questions will be picked from various IT MNCs exams, and coding websites.

Approach to solve the problems will be discussed by the instructor for tougher problems.

Instructor will be discussing certain techniques to approach a solution to a problem.

You cannot 100% expertise in solving any given problem, you can only grow strong and strong

MNCs interviewers look more for your approach to attack a problem, rather than arriving the correct solution

Various programming glitches which are often asked will also be discussed

This course will develop skill to think of which Data structure to use to solve the problem, and what other approaches could be possible.

You will be evaluating time and space complexity of every algorithm you write.

Once you are confident at solving problems, you can appear for written test for Core computer science MNCs whose selection criteria is technically very tough and challenging to clear

There are plethora of websites available which discusses the problem/solution. Yet not everyone make it to high paying jobs in IT MNCs. Its because folks don't develop problem solving habit.

You can subscribe to those websites. But, regularity is very important for this course.

Even if you complete this course, be in touch at solving the problems regularly through those websites.

A particular problem can be approached in different ways, a common blog will be provided where students can discuss their respective solution and point out the flaw/improvement in others.

This course is a gateway to any sufficiently high , Core computer Science jobs in IT MNCs. You cannot have a interview/Written test where you are not asked to solve the DataStructure/Algorithm based problem.

Sample problems :

Find and resolve the loop in a Linked List

Implement LRU cache

Find the sum of nodes of a tree which are at depth d

Convert a tree into a doubly linked list

Convert a tree into right threaded Binary tree

Remove all nodes of a tree which have exactly on child

Write a equivalent nonrecursive procedure

Find the Diameter of the tree

..... And Many More ....
