Algorithms for International Students

Garantee: Prof. Ing. Jan M. Honzík CSc.
Teacher: Prof. Ing. Jan M. Honzík CSc.
Lectures: Tuesday: 8:00 - 10:30
Term exam - 1st term (55 points) will be on Wed 2003-01-07 at 14-00 in the room F-213. (Room where were lectures.) Duration 120 minutes.

Term exam - 2nd term (55 points) will be on Wed 2003-01-21 at 14-00 in the room F-213. (Room where were lectures.) Duration 120 minutes.
Laboratory: First laboratory will be on the 1st October 2003
In computer laboratory BI/OO6 (Laboratory I), on every Wednesday, from 9:00 to 11:25
Lecture: Ing. Vladimír Čech, room 851, phone +420 541 141 211
Consult hours: Tuesday: 12:20 - 13:50
E-mail: cechvlad@fit.vutbr.cz
Last actualization: 15th October 2003

Students subscribe in the Algorithms

Surname(s)FirstnameStudy branch expectedCountryE-mail addressBrno addressPhone
Alhamar AliHasanxalham00@stud.fit.vutbr.cz
AlFarajFaisalxalfar00@stud.fit.vutbr.cz
Al GharaballyFarisxalgha00@stud.fit.vutbr.cz
Zainal AliHaiderxzajna00@stud.fit.vutbr.cz


Table of presence at lectures

WeekDateAlhamar Ali HasanAlFaraj FaisalFaris Al GharaballyZainal Ali HaiderStudent 5Student 6
1st23.9.1.51.5
2nd30.9.1.51.51.5
3rd7.10.1.51.5
4th14.10.1.5
5th21.10.
6th28.10.National feast - free day - 1.5 points each
7th4.11.
8th11.11.
9th18.11
10th25.11.
11th2.12.
12th9.12.
13th16.12.


Table of presence at laboratories

WeekDateAlhamar Ali HasanAlFaraj FaisalFaris Al GharaballyZainal Ali HaiderStudent 5Student 6
1st1.10.YY
2nd8.10.YY30 minutesY
3rd15.10.YY
4th22.10.Y
5th29.10.45 minutesY
6th5.11.Y
7th12.11.Y
8th19.11.Y
9th26.11.Y
10th3.12.Y
11th10.12.Y
12th17.12.Y

Evaluation table

Table of points from laboratories

EventMaximumAlhamar Ali HasanAlFaraj FaisalFaris Al GharaballyZainal Ali Haider
HW120
HW220
HW321
HW440


Distribution of points

Mid-term examination10 points
Final Examination50 points
Attendance at Lectures19.5 points (1.5 per Lecture) (20 points for full attendance)
Homeworks from lectures5 points
Laboratories10 points, (5 simple works, 2 points each)
Project5 points
Total100 points


Points Mark  
90 - 100 excellent A
80 - 89 very good B
70 - 79 very good C
60 - 69 good D
50 - 59 good E
0 - 49 fail F


List of lectures:

  1. Computing basics, Pascal Basics.
  2. Procedures and functions, passing of parameters.
  3. Repetition of the Pascal concepts.
  4. Repetition of the Pascal concepts.
  5. Abstract data structures, ADT lists
  6. National feast - free day - 1.5 points each
  7. ADT List
  8. Dynamic allocation of the memory.
  9. Implementation of the ADT List.
  10. ADT Stack. ADT Queue.
  11. Trees, Binary trees.
  12. Sorting
  13. Revision
1st lecture in RTF Format
2nd lecture in RTF Format, Pascal Basics, 30th September 2003
2nd lecture - Double linked list - demonstration in RTF Format
3rd lecture in RTF Format, Pascal Basics II, 7th October 2003
4th lecture in RTF Format, Pascal III (Examples), 7th October 2003
5th lecture in RTF Format
6th lecture in RTF Format
7th lecture in RTF Format
8th lecture in RTF Format, Pascal III (Examples), 11th November 2003
9th lecture in RTF Format
10th lecture in RTF Format
11th lecture in RTF Format
12th lecture in RTF Format
13th lecture in RTF Format
14th lecture in RTF Format

Exercises:

Every Wednesday at BI-006 (Laboratory I) from 9:00 to 11:25
Exercises are an appendix for lectures. Here is the list:
1stIntroduction, Pascal, Syntax
2ndPascal, procedure, function
3rd
4th
5th
6th
7th
8th
9th
10th
11th
12th
13th


Homework from lectures

Are placed by teacher during lecture. Term of give in will be told at lecture too.

Homework from laboratories

Assign of the first homework:
Give in your homework on 14th October 2003 (at lecture)
You have array where Ilow is lower boundary Ihigh is upper boundary. (Array have elements with type of integer.) First n element of array is different from zero, next are equaled to zero. Write program which counts the number of nozero and zero elements in array.

If your homework will be correct you get 2 points.

Poject

Will be program connected with take up subjects. More precisely later.



Literature:

  1. Knuth, D.: The Art of Computer programming, Vol.1,2,3. Addison Wesley, 1968
  2. Wirth, N.: Alorithms+Data Structures=Programs, Prentice Hall, 1976
  3. Horovitz, Sahni: Fundamentals of Data Structures.
  4. Amsbury, W: Data Structures: From Arrays to Priority Queues.
  5. Cormen, T.H. ,Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
  6. Aho A.V., Hoppcroft J.E., Ullman J.D.: Data Structures and Algorithms.
  7. Kruse, R.L.>Data Structures and Program Design. Prentice-Hall,Inc. 1984
  8. Baase, S.: Computer Algorithms - Introduction to Design and Analysis. Addison Wesley, 1998