100 likes | 289 Views
CSE 246 Data Structures and Algorithms. Spring2011 Lecture#1. Instructor Information. Quratulain Rajput Office: Break out room no.7 Email: quratrajput@yahoo.com Cell: 0345-2324452. Course Information. Course wiki: CSE246DS(Spring2011). wikispaces.com
E N D
CSE 246Data Structures and Algorithms Spring2011 Lecture#1
Instructor Information Quratulain Rajput Office: Break out room no.7 Email: quratrajput@yahoo.com Cell: 0345-2324452 Quratulain Rajput
Course Information • Course wiki: CSE246DS(Spring2011).wikispaces.com • Councelling hours: Tuesday and Saturday Quratulain Rajput
Prerequisites • Object-Oriented Programming Techniques • Logic and Discrete Structures Quratulain Rajput
Books • Text books • Data Structures & problem solving using JAVA by Mark Allen Wiess • Data Structures using java by Robert Lafore • Reference Books • Data Structures and Algorithms in Java (4th edition) by Michael T. Goodrich and Roberto Tamassia • Data Structures with Java by William H. Ford • Data Structures and Algorithms in Java (2nd Edition) • Data Structure by Robert Sedgwick • Java: How to program, Deitel and Deitel Quratulain Rajput
Grading Policy Midterm Exams ............... 30%Final Exam ..................... 40%Quizzes ........................... 5%Assignments .................... 10%Term Project ................... 15% Quratulain Rajput
Course Description • Data structure and algorithm is core course of computer science that provides understanding of basic data structures and algorithms. • In this course we will study the different data structures to store and organized the information. Algorithms analysis include searching, sorting and traversal using data structures to perform operation in an efficient manner. • This course covers important data structures like, arrays, Linked list, stack, queues, trees and graphs. • This course offers the students a mixture of theoretical knowledge and practical experience(using JAVA). Quratulain Rajput
Course Objective • Understand the use of different data structures. • Understand the time and space analysis of algorithms for iterative as well as for recursive. • Be able to implement data structures and algorithms. • Understanding of problem solving paradigm. Quratulain Rajput
Course Goal • The goal of the course is to give a basic understanding of how common computational problems can be solved efficiently on a computer. Quratulain Rajput
Course Content • This course basically comprises on two main parts: • Data Structures • ADT, Lists, dynamic list, stacks, queues, trees, heap, hashing, graphs • Algorithms • Algorithm complexity, big-O notation, Analysis of recursive and non recursive algorithms, searching and sorting algorithms. Briefly covers the algorithms types(divide and conquer, dynamic, and greedy) Quratulain Rajput