Difference between revisions of "BITL-CS1"

From DiLab
Jump to: navigation, search
(Calendar)
(Calendar)
Line 18: Line 18:
==== 09.09.2019.====
==== 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.
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.
Write a pseudocode for binary search algorithm, in the context of a dictionary.
|-
|
==== 10.09.2019.====
|
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.
|

|-
|
==== 10.11.2019.====
|
Python data types.
|

|-
|-
|
|

Revision as of 21:49, 11 September 2019

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. 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.

10.09.2019.

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.

10.11.2019.

Python data types.

23.12.2019.

Christmas break and the New Year

 

??.01.2020.

Final Exam.

 

Resources