Difference between revisions of "BITL-CS1"

From DiLab
Jump to: navigation, search
(→‎Calendar)
 
(80 intermediate revisions by the same user not shown)
Line 1: Line 1:
__NOTOC__
__NOTOC__
{{pagebreak}}
=Introduction to Computer Science 1=


Course: Introduction to Computer Science CS1 (BITL).
__NOTOC__
<big>
'''Shortcuts:'''
[[#Calendar | Calendar]] |
[[#Assignments | Assignments]] |
[[#Resources | Resources]] |
</big>


Please follow eStudijas/ORTUS for the updates.
=Introduction=


{{pagebreak}}
What is Computer Science?
* From [https://en.wikipedia.org/wiki/Computer_science 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.


{{BITL_CS1_Resources}}
* A video version [https://www.youtube.com/watch?v=DIbtX0GqIA8 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=

{| 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. Binary encoding. Abstraction. Data. Algorithms. Search using linear, skip and binary approach. Correctness and complexity of an algorithm.
* [https://www.dropbox.com/s/p2p5mfwgxmt6ebs/L01_introduction_to_CS.pdf?raw=1 Slides]
|
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.
* [https://www.dropbox.com/s/9gk545is1q3jy7j/L02_expressions_literals.pdf?raw=1 Slides]
|
* Explore the online IDE: [http://repl.it/languages/python3 repl.it].
* Read about Anaconda environment.
|-
|

==== 12.09.2019.====
|
Python: variables. Statements. Assignment. Data types.
* [https://www.dropbox.com/s/scmhpox9pf62hk8/L03_variables_assignment.pdf?raw=1 Slides]
|
Find out why 123_456 is a valid expression in Python, and what does it mean.
|-
|

==== 16.09.2019.====
|
Python: functions. Purpose and uses. Calling functions. Libraries, "import math" statement.
* [https://www.dropbox.com/s/70xilodu2mqi28n/L04_functions_calling_python.pdf?raw=1 Slides]
|
Practice writing functions:
* A sum of two numbers
* A greeter function with the name as a parameter
* A signature (-1,0,+1) function
|-
|

==== 17.09.2019.====
|
Python: functions. Defining functions. Function body. The use of indentation in Python.
* [https://www.dropbox.com/s/b1g3fg08dc898m5/L05_functions_defining_python.pdf?raw=1 Slides]
|
|-
|

==== 19.09.2019.====
|
Expressions, boolean.
* [https://www.dropbox.com/s/cf14dkw07nhnf1j/L06_expressions_boolean.pdf?raw=1 Slides]

|
|-
|

==== 23.09.2019.====
|
Flow control: if / if-else / if-elif-else.
* [https://www.dropbox.com/s/4ablnnzjqczlbmb/L07_flow_control_if-else-elif.pdf?raw=1 Slides]
|
|-
|
==== 24.09.2019.====
|
Flow control: examples in functions
|
|-
|
==== 26.09.2019.====
|
Javascript, part1
|
|-
|
==== 30.09.2019.====
|
Javascript, part2
|
|-
|
==== 01.10.2019.====
|
Javascript, part3
|
|-
|
==== 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
|
&nbsp;
|-
|

==== ??.01.2020.====
| Final Exam.
|
&nbsp;
|-
|}

=Assignments=

=Resources=

Latest revision as of 09:21, 15 August 2022

Course: Introduction to Computer Science CS1 (BITL).

Please follow eStudijas/ORTUS for the updates.

Resources

Test environments

Practice exercises

Python

Javascript

HTML

SQL

Security

XSS. HTML and SQL injection attacks and prevention.

Algorithms

Retrieved from "http://andromeda.df.lu.lv/wiki/index.php?title=BITL-CS1&oldid=10188"