This subject deals with basic concepts of the Data Structures and Algorithms. The Students currently enrolled must have passed first Discrete Mathematics and other lower major subjects. This subject aims to enhance Student's knowledge in Java. The subject must have hands-on exercise every after major topic. The lecture is done twice a week: "Mondays and Wednesdays" and/or "Tuesdays and Thursdays". Each lecture meeting is one(1) hour only, therefore: all in all for the lectures, two(2) hours a week. Now, for the laboratory, the subject is allotted with three (3) hours a week. Most of the time, the students will do their hands-on exercises at the laboratory. The Subject Instructor is free for a three(3) hour consultancy per week. If there are things you need to clarify or which are not clear to you, you can always consult to your Instructor even beyond the three (3) hours consultation period for as long as the the Instructor is free. Just feel free to the ask questions.Expected exercises (Updated on February 3, 2010; 8:00AM)
Midterms
- Exer1 - Min, Max, Identification which is the biggest, middle and the lowest numbers
- Exer2 - LinkedList
- Exer3 - Stacks
- Exer4 - Palindrome
- Exer5 - Multi-Stacks
- Exer6 - Queues
- Exer7 - Priority Queues. Will be submitted on or before February 8, 2010. Please follow the principles discussed during the lectures
- Exer8 - Topological Sorting which will be submitted on or before February 15, 2010. Please follow the principles discussed during the lectures
Please submit your exercises on time to avoid point deductions.. thanks
* Grades for the Midterm will be released next week.
.jpg)
