Difference between revisions of "BITL-CS1"
(→Calendar) |
|||
| Line 9: | Line 9: | ||
=Calendar= |
=Calendar= |
||
{| border=1 cellspacing=0 cellpadding=4 |
|||
|- |
|||
! Date |
|||
! Topic |
|||
! Exercises |
|||
|- |
|||
| |
|||
==== 09.09.2019.==== |
|||
| |
|||
Introduction to the course. Syllabus. What is computer science. Branches of computer science. Abstraction. Data. Algorithms. Search using linear, skip and binary approach. Correctness and complexity of an algorithm. |
|||
| |
|||
Write a pseudocode for binary search algorithm, in the context of a dictionary. |
|||
|- |
|||
| |
|||
==== 23.12.2019.==== |
|||
| Christmas break and the New Year |
|||
| |
|||
|
|||
|- |
|||
| |
|||
==== ??.01.2020.==== |
|||
| Final Exam. |
|||
| |
|||
|
|||
|- |
|||
|} |
|||
=Resources= |
=Resources= |
||
Revision as of 20:44, 11 September 2019
Contents
Introduction to Computer Science 1
Notes
What is Computer Science?
Calendar
| Date | Topic | Exercises |
|---|---|---|
09.09.2019. |
Introduction to the course. Syllabus. What is computer science. Branches of computer science. Abstraction. Data. Algorithms. Search using linear, skip and binary approach. Correctness and complexity of an algorithm. |
Write a pseudocode for binary search algorithm, in the context of a dictionary. |
23.12.2019. |
Christmas break and the New Year |
|
??.01.2020. |
Final Exam. |
|
