Difference between revisions of "BITL-CS1"
| Line 1: | Line 1: | ||
__NOTOC__ |
__NOTOC__ |
||
=Introduction to Computer Science 1= |
=Introduction to Computer Science 1= |
||
__NOTOC__ |
|||
<big> |
|||
'''Shortcuts:''' |
|||
[[#Calendar | Calendar]] | |
|||
[[#Assignments | Assignments]] | |
|||
[[#Resources | Resources]] | |
|||
</big> |
|||
What is Computer Science? |
What is Computer Science? |
||
| Line 316: | Line 324: | ||
|- |
|- |
||
|} |
|} |
||
=Assignments+ |
|||
=Resources= |
=Resources= |
||
Revision as of 21:48, 11 September 2019
Introduction to Computer Science 1
Shortcuts: Calendar | Assignments | Resources |
What is Computer Science?
- From Wikipedia:
- Computer Science is the study of processes that interact with data and that can be represented as data in the form of programs. It enables the use of algorithms to manipulate, store, and communicate digital information.
- A video version from Udacity
Administrative information
Communication:
- via slack: workspace name: bitl-cs1-2019
- via email: use instructor's email address for personal communication
- office hours: by appt.
Calendar
| Date | Topic | Exercises |
|---|---|---|
09.09.2019. |
Introduction to the course. Syllabus. What is computer science. Branches of computer science. Binary encoding. 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 or a phone book. |
10.09.2019. |
Algorithms revisited. iterative v.s. recursive algorithm, binary search example in both versions. Life cycle of program development. Source code. Compiler v.s. interpreter. Integrated development environment. Python programming language. Python version 3 vs version 2. Expressions, evaluation of expressions. Operators and their precedence. |
|
12.09.2019. |
Python data types. |
|
16.09.2019. |
TBA |
|
17.09.2019. |
TBA |
|
19.09.2019. |
TBA |
|
23.09.2019. |
TBA |
|
24.09.2019. |
TBA |
|
26.09.2019. |
TBA |
|
30.09.2019. |
TBA |
|
01.10.2019. |
TBA |
|
03.10.2019. |
TBA |
|
07.10.2019. |
TBA |
|
08.10.2019. |
TBA |
|
10.10.2019. |
TBA |
|
14.10.2019. |
TBA |
|
15.10.2019. |
TBA |
|
17.10.2019. |
TBA |
|
21.10.2019. |
TBA |
|
22.10.2019. |
TBA |
|
24.10.2019. |
TBA |
|
28.10.2019. |
TBA |
|
29.10.2019. |
TBA |
|
31.10.2019. |
TBA |
|
04.11.2019. |
TBA |
|
05.11.2019. |
TBA |
|
07.11.2019. |
TBA |
|
11.11.2019. |
TBA |
|
12.11.2019. |
TBA |
|
14.11.2019. |
TBA |
|
18.11.2019. |
TBA |
|
19.11.2019. |
TBA |
|
21.11.2019. |
TBA |
|
25.11.2019. |
TBA |
|
26.11.2019. |
TBA |
|
28.11.2019. |
TBA |
|
02.12.2019. |
TBA |
|
03.12.2019. |
TBA |
|
05.12.2019. |
TBA |
|
09.12.2019. |
TBA |
|
10.12.2019. |
TBA |
|
12.12.2019. |
TBA |
|
16.12.2019. |
TBA |
|
17.12.2019. |
TBA |
|
19.12.2019. |
TBA |
|
23.12.2019.- 01.01.2020 |
Christmas break and the New Year |
|
??.01.2020. |
Final Exam. |
|
=Assignments+
