CS2468: Data Structures and Data Management Lecturer: Lusheng Wang · office:B6422 Phone:34429820 E-mail cswangl @cityu. edu. hk TA ( Assignment Marking and Tutorial) Chao shen chaoshen 2-c@my cityu. edu. hk, phone 3442 2546 ZichengZHAOshinaiderzhao@gmail.com Welcome to ask questions at any time The course Website: Canvas Some」 ava source code http:/inEt3.datastructures.net/download.html The course website Text Book: Michael T goodrich and roberto tamassia Data Structure and Algorithms in Java, John Wiley Sons, Inc. 5th Edition Stacks
CS2468: Data Structures and Data Management • Lecturer: Lusheng Wang • Office: B6422 • Phone: 3442 9820 • E-mail cswangl@cityu.edu.hk • TA (Assignment Marking and Tutorial) – Chao SHEN chaoshen2-c@my.cityu.edu.hk , Phone: 3442 2546 – Zicheng ZHAO shinaider.zhao@gmail.com Welcome to ask questions at ANY time. • The course Website: Canvas • Some Java Source code: http://net3.datastructures.net/download.html • The course Website: Text Book: Michael T. Goodrich and Roberto Tamassia, Data Structure and Algorithms in Java, John Wiley & Sons, Inc. 5th Edition Stacks 1
opicS to be covere Analysis of algorithms worst case time and space complexity Data structures stack, queue, linked list, tree, priority queue, heap, hash, and graph, Searching agorithms binary and avl search trees Sorting agorithms merge sort, quick sort, bucket sort and radix sort; (Reduce some contents Graph data structure depth first search and breadth first search ( add some interesting contents). shortest path Stacks 2
Topics to be covered • Analysis of Algorithms – worst case time and space complexity • Data Structures – stack, queue, linked list, tree, priority queue, heap, hash, and graph, • Searching algorithms – binary and AVL search trees; • Sorting algorithms – merge sort, quick sort, bucket sort and radix sort; (Reduce some contents) • Graph – data structure, depth first search and breadth first search. (add some interesting contents). • shortest path. Stacks 2
Why This Course? You will be able to evaluate the quality of program analysis of algorithms: Running time and memory space You will be able to write fast programs You will be able to solve new problems You will be able to give non-trivial methods to solve problems. (Your algorithm(program) will be faster than others. Stacks
Why This Course? • You will be able to evaluate the quality of a program (Analysis of Algorithms: Running time and memory space ) • You will be able to write fast programs • You will be able to solve new problems • You will be able to give non-trivial methods to solve problems. (Your algorithm (program) will be faster than others.) Stacks 3
Course evaluations · Course work:30% Final Exam: 70% Course Work Three assignments, 15% One quiz or lab test 3% One mid term exam 12% Stacks
Course Evaluations • Course work: 30% • Final Exam: 70% • Course Work: – Three assignments, 15% – One quiz or lab test 3% – One mid term exam 12% Stacks 4
OBL. Course Intended Learning Outcomes 1. Describe the functiona lity of a data structure as an abstract data type 2. Implement an abstract data type in a programming language 3. Implement and test data structures for common structures 4. Select an appropriate data structure from a given set of structures to solve a given problem 5. Design and implement data storage management with simple file structures Will be tested in quiz or assignment or midterm For each item you have to get 40%to pass
5 OBTL: Course Intended Learning Outcomes 1.Describe the functionality of a data structure as an abstract data type; 2.Implement an abstract data type in a programming language; 3.Implement and test data structures for common structures; 4.Select an appropriate data structure from a given set of structures to solve a given problem; 5.Design and implement data storage management with simple file structures. Will be tested in quiz or assignment or midterm. For each item, you have to get 40% to pass