Summary of Class - 02

[svm11]

Here is a summary of the class that took place on 17th June, 2013 and the references you will needing.

1. Arrays
• GeeksforGeeks
2. Linked List
• Pointers
• Basics
• Problems
• GeeksforGeeks
3. Stack and Queue
• Chapter 10 from Introduction to Algorithms - CLRS
4. Deque
• Sliding Window Problem
5. Binary Tree and Binary Search Tree
• Basics
• Basics 2
• Chapter 12 from Introduction to Algorithms - CLRS
• GeeksforGeeks
6. Set and Map
• Chapter 11 from Introduction to Algorithms - CLRS
7. Trie
• Topcoder tutorial
8. Suffix Tree and Suffix Array
• Topcoder Forums
• Codechef Discuss
• Stackoverflow
  
• Ukkonen's algorithm

Wiki links for these and other data structures can be found here.

Start following this online course by IIT Delhi. 

Look up courses from MIT which interest you.

Use Google to search up more slides/ppt/blog/codes/etc. on the topics.

Before the next class,

• Do the tasks mentioned in Summary of Class - 01.
• Do Arrays, Linked List, Stack, Queue, Dequeue, Binary Trees and Binary Search Trees from the resources mentioned. Code them and add them to your data structure library.
• Do chapter 31 from Introduction to Algorithms - CLRS

In next we will finish up the overview of the rest of the data structures and then start with number theory.

Also, there had been many juniors asking for how and what to prepare for internships and placements. These questions are very well answered on quora under the topic NSIT.