|
King Saud University
CCIS
CS 212 Website – 2nd Semester 2012 |
|
Course title |
Data Structures |
|
Credit hours |
3 Lecture + 1 Tutorial |
|
Course description |
Fundamental concepts of data structures. Performance measurement of algorithms. Implementation and use of lists, stacks, queues, priority queues, trees, heaps and hash tables. Recursion. Students will do programming assignments. |
Text Book
Data Structures and Algorithms in Java, 5th edition, by M.T. Goodrich and R. Tamassia. John Wiley and Sons, Inc., ISBN: 0-471-73884-0 [Link]
Course Objectives
|
1. |
To be able to describe and use fundamental data structures such as lists, stacks, queues and trees. |
|
2. |
To be able to determine time and space complexity of data structures and associated algorithms. |
|
3. |
To be able to design appropriate data structures for a problem i.e. be able to analyze a given problem, identify and specify data elements, structure and operations appropriate to it. |
|
4. |
To be able to implement a specified data structure i.e. be able to choose a storage structure for the data elements and algorithms for the operations. |
|
5. |
To be able to compare alternative data structures for a problem (e.g. based on their time and space complexity) and be able to choose the most appropriate one for the given problem. |
|
6. |
To understand recursion and be able to write recursive algorithms for problems. |
|
Updates |
|
Date, Time |
Announcement |
| 27/02/2012 |
Project Phase 1 is out , Due Date is 12/03/2012 |
|
1/2/2012 7:38:51 PM |
Important Note for all Students enrolled in this course (see end of this Page) |
|
1/2/2012 7:38:50 PM |
Course website launched |
|
Week |
Lecture 1 |
Lecture 2 |
Lecture 3 |
|
2 (04 Feb) |
Introduction to the course |
Java Review[Lecture 1] |
Java Generics [ Lecture 2] |
|
3 (11 Feb) |
Introduction to data structure ADT[Lecture 3] |
ADT List (Linked Lists))[Lecture 4] |
ADT List (Array Lists))[Lecture 5] |
|
4 (18 Feb) |
Applications on Lists and LL [Lecture 6] |
Complexity , Big O notation
[Lecture 7,8] |
Complexity , Big O notation
[Lecture 7,8] |
|
5 (25 Feb) |
Applications on Lists and LL |
Double Linked List [lecture 9] |
Queue ADT [Lecture 10,11,12] |
|
6 (03 Mar.) |
Queue ADT [Lecture 10,11,12] |
Queue Types [Lecture 10,11,12] |
Stack ADT [Lecture 14] |
|
7 (10 Mar.) |
Stack ADT[Lecture 14] |
Tree BT[Lecture 15] |
Binary Tree[Lecture 15] |
|
8 (17 Mar.) |
Recursion[Lecture 16] |
Recursion[Lecture 16] |
Mt1 REVIEW |
|
9 (24 Mar.) |
|
|
|
|
10(31 Mar.) |
Recursion[Lecture 16] |
BST[Lecture 18] |
BST[Lecture 18] |
|
11(07 Apr.) |
AVL[Lecture 19] |
AVL[Lecture 19] |
AVL[Lecture 19] |
|
12(14 Apr.) |
B+ Tree |
B+ Tree |
B+ Tree |
|
13(21 Apr.) |
Hash |
Hash |
Heap |
|
14(28 Apr.) |
Heap |
Heap |
Problem solving |
|
15(05 May) |
Problem solving |
Problem solving |
Problem solving |
|
16(12 May) |
Review MT2 |
|
|
Assessment
|
Project |
20% |
|
Tutorial |
10% |
|
2 Midterms |
(15%+15%)30% |
|
Final |
40% |
Midterm 1 will be in week 7, Midterm 2 will be in week 12, exact dates and time will be announced later . Final will be announced by the college.
course instructors
NOTE
Plagiarism will not be tolerated and is grounds for failing the course. Any student (or group of students) submitting work which is not his/their own , or if the submitted work was found to be copied, he/they will all face failing the course. No excuses will be accepted whatsoever
Past Exams
حلول اختبارات اعمال السنه
20120103151646400.pdf
السؤال الاول في الميد 1 الحمجموع 23 و ليس 13 ارجو تصحيحيه
20120103152140111.pdf