Data Structure and Algorithm

This gives introduction to what you will learn in this subject. Remeber terms and definitions like: ADT, Asymptotic Notations. They are used in every following chapter.

This chapter follows a format. You will learn what is stack, its ADT, its implementation, then expression evaluation (most asked in exam). In exam, you will be asked to either create algorithm for stack or perform expression evaluation with stack (prefix, postfix, infix). Side note: Here you will need a bit basic of array and linked list, for that basic intro video is also added, you will learn abou array and linked list in detail in their own chapter

Queue chapter format is similar to Stack. You must know basic about array and linkedlist (available in stack chapter). Priority queue is actually taught in wrong manner in our syllabus, in syllabus array implementation is taught however actual implementation is done through head data structure, for exam case just learn through array.

Recursion is more like a method of solving problem than a data structure itself. Recursion utilise "Divide and Conquer", practice problems of it given here.

Finally here you will learn about linked list. Linked list questions are asked repeatedly in exam and is in itself a very important concept (since you will need it in Stack, Queue etc). Actually list is a general concept, (queue and stack are also list). This is good to know but not much important exam-wise so better to straight jump to main topics. Also side tip: SLL means (Singular Linked List) , DLL means (Doubly Linked List), CLL means (Circular Linked List) and DCLL means (Doubly Circular Linked List).

Generally a question is asked in exam telling to sort a list of number using a given method. So you will learn various sorting methods. Just learn different algorithm and practice by hand testing (as this is what asked in exams). After watching all these videos, checkout important question section and you can find questions on sorting. Also bonus tip: these videos length might seem too long but you can watch them on 1.5 or 2x.

You should at least learn binary search from this chapter, high probability of having question of linear or binary search (5 marks). Hashing concept is not also that hard, but might be new for you.

The biggest chapter of this subject. There are many algorithms here: Huffman, Dijkstra, Prims, Kruskal. They are not that hard once you watch their implementation with example. Pay attention on the algorithm part.