1. Data Structures for Programmers Vamshi Ambati vamshi@cmu.edu 24-10-2007

2. Agenda  Course Objective  Administration  Course Policy  Plan and Schedule  Guidelines

3. Objective  Data Structures Understand and use existing Data Structures Identify and address data needs in a problem using new data structures Analyze and appreciate variations in Data Structures  Programming Improve Programming skills & Java Working within a given framework for a project Building a small scale search engine using effective practices Object Oriented Programming Process

4. Administration  Course Webpage http://kathmandu.lti.cs.cmu.edu/wiki/index.ph p/DSP http://kathmandu.lti.cs.cmu.edu/wiki/index.ph p/DSP You will also have local copies  Assisted by knowledgeable Associate Mentors  Appointment with Principal Mentor at anytime during the course via email

5. Course Policy  Grade 60% Code deliverables 10% Report deliverables 20% Interaction with Mentors and asking right questions 10% Surprise Quiz  Surprise Quiz Once in a week, anytime of the working days Be thorough with the reading materials to perform well

6. Course Resources  Just in time lessons PPT with Voice Sample Exercises and Examples  Web Resources Collection of pages and tutorials from various sources  Text Book Data Structures in C/C++ : Mark Allen Weiss

7. Plan and Schedule  Running theme of the course is a “Search Engine” We focus from the perspective of Data and Representations Major portion of the design will be provided You learn what a design is and to work within a design We want you to be good Developers and good Engineers  You will also solve some interesting problems as we go

8. Schedule  Week 1: Basics of Data Structures Writing Pseudo Code Big O Notation Program Complexity Abstract Data Type Stack Data Type Stack Data Type: Application to Paranthesis Checking Linked List Data Type Java Collections Framework

9. Schedule:  Week 2: Minigoogle and Data Structures Dictionary Data Type Queue Data Type Double Ended Queue Binary Search Trees Binary Trees: Insertion Recursive Call Stack Tracing (Tool and Sample problem) Binary Trees: Traversal Binary Trees: Other operations (deletion, merge)

10. Schedule  Week 3: Mini Google and Data Structures Hashtable: Java API Hashing Techniques: Simple Hashing Techniques: MyOwn (Students implement a creative technique) HashTable: Insertion and Deletion HashTable: Collison Resolution Priority Queues: Array Based Priority Queues: Sorting Technique Priority Queues: Heap based Sets and Sequences Inserting and Retrieving from a Set

11. Schedule  Week4: Design Data Structures and Wrapping Minigoogle Graphs: Abstract Data Type Adjacency Matrices and Representing Graphs Finite State Machines Defining a Data Structure for FSM Defining Functionality for FSM Implementing the FSM using an Array Report (Analysis of Data Structures) Graphical User Interface Server Side Programming in Java Final Demo

12. Guidelines  Read the resources  Clarify early and clear your doubts  Group discussions are highly encouraged  Plagiarism is highly discouraged Let us not have to deal with such situations Follow ethics, learn more If you have genuine problems of understanding approach us  We are here to help you, make the best use of us