[{"type":"blog","content":" \r\n\r\n\r\n

List

\r\n

Lists are used to store multiple items in a single variable.

\r\n

Lists are one of 4 built-in data types in Python used to store collections of data, the other 3 are Tuple, Set, and Dictionary, all with different qualities and usage.

\r\n

Lists are created using square brackets:

\r\n

thislist = ["apple", "banana", "cherry"]\r\n

\r\n

List Items

\r\n

List items are ordered, changeable, and allow duplicate values.

\r\n

List items are indexed, the first item has index [0], the second item has index [1] etc.

\r\n

Ordered

\r\n

When we say that lists are ordered, it means that the items have a defined order, and that order will not change.

\r\n

If you add new items to a list, the new items will be placed at the end of the list.

\r\n

Changeable

\r\n

The list is changeable, meaning that we can change, add, and remove items in a list after it has been created.

\r\n

Allow Duplicates

\r\n

Since lists are indexed, lists can have items with the same value:

\r\n

thislist = ["apple", "banana", "cherry", "apple", "cherry"]\r\n

\r\n

List Length

\r\n

To determine how many items a list has, use the len() function:

\r\n

List Items - Data Types

\r\n

List items can be of any data type:

\r\n

list1 = ["apple", "banana", "cherry"]\r\nlist2 = [1, 5, 7, 9, 3]\r\nlist3 = [True, False, False]\r\n

\r\n

A list can contain different data types:

\r\n

list1 = ["abc", 34, True, 40, "male"]\r\n

\r\n

type()

\r\n

From Python's perspective, lists are defined as objects with the data type 'list':

\r\n

mylist = ["apple", "banana", "cherry"]\r\nprint(type(mylist))\r\n#<class 'list'>\r\n

\r\n

The list() Constructor

\r\n

It is also possible to use the list() constructor when creating a new list.

\r\n

thislist = list(("apple", "banana", "cherry")) # note the double round-brackets\r\nprint(thislist)\r\n

\r\n

Access Items

\r\n

List items are indexed and you can access them by referring to the index number:

\r\n

thislist = ["apple", "banana", "cherry"]\r\nprint(thislist[1])\r\n

\r\n

Negative Indexing

\r\n

Negative indexing means start from the end

\r\n

-1 refers to the last item, -2 refers to the second last item etc.

\r\n

Print the last item of the list:

\r\n

thislist = ["apple", "banana", "cherry"]\r\nprint(thislist[-1])\r\n

\r\n

Range of Indexes

\r\n

You can specify a range of indexes by specifying where to start and where to end the range.

\r\n

When specifying a range, the return value will be a new list with the specified items.

\r\n

Return the third, fourth, and fifth item:

\r\n

thislist = ["apple", "banana", "cherry", "orange", "kiwi", "melon", "mango"]\r\nprint(thislist[2:5])\r\n

\r\n

<aside>\r\n💡 Note: The search will start at index 2 (included) and end at index 5 (not included).

\r\n

</aside>

\r\n

Range of Negative Indexes

\r\n

Specify negative indexes if you want to start the search from the end of the list:

\r\n

This example returns the items from "orange" (-4) to, but NOT including "mango" (-1):

\r\n

thislist = ["apple", "banana", "cherry", "orange", "kiwi", "melon", "mango"]\r\nprint(thislist[-4:-1])\r\n

\r\n

Check if Item Exists

\r\n

To determine if a specified item is present in a list use the in keyword:

\r\n

Check if "apple" is present in the list:

\r\n

thislist = ["apple", "banana", "cherry"]\r\nif "apple" in thislist:\r\n   print("Yes, 'apple' is in the fruits list")\r\n

\r\n

Loop Through a List

\r\n

You can loop through the list items by using a for loop:

\r\n

Print all items in the list, one by one:

\r\n

thislist = ["apple", "banana", "cherry"]\r\nfor x in thislist:\r\n  print(x)\r\n

\r\n

Loop Through the Index Numbers

\r\n

You can also loop through the list items by referring to their index number.

\r\n

Use the range() and len() functions to create a suitable iterable.

\r\n

Print all items by referring to their index number:

\r\n

thislist = ["apple", "banana", "cherry"]\r\nfor i in range(len(thislist)):\r\n  print(thislist[i])\r\n

\r\n

The iterable created in the example above is [0, 1, 2]\r\n.

\r\n

List Methods

\r\n

The list data type has some more methods. Here are all of the methods of list objects:

\r\n

list.append(x)\r\nAdd an item to the end of the list. Equivalent to a[len(a):] = [x].

\r\n

list.extend(iterable)\r\nExtend the list by appending all the items from the iterable. Equivalent to a[len(a):] = iterable.

\r\n

list.insert(i, x)\r\nInsert an item at a given position. The first argument is the index of the element before which to insert, so a.insert(0, x) inserts at the front of the list, and a.insert(len(a), x) is equivalent to a.append(x).

\r\n

list.remove(x)\r\nRemove the first item from the list whose value is equal to x. It raises a ValueError if there is no such item.

\r\n

list.pop([i])\r\nRemove the item at the given position in the list, and return it. If no index is specified, a.pop() removes and returns the last item in the list. (The square brackets around the i in the method signature denote that the parameter is optional, not that you should type square brackets at that position. You will see this notation frequently in the Python Library Reference.)

\r\n

list.clear()\r\nRemove all items from the list. Equivalent to del a[:].

\r\n

list.index(x[, start[, end]])\r\nReturn zero-based index in the list of the first item whose value is equal to x. Raises a ValueError if there is no such item.\r\nThe optional arguments start and end are interpreted as in the slice notation and are used to limit the search to a particular subsequence of the list. The returned index is computed relative to the beginning of the full sequence rather than the start argument.

\r\n

list.count(x)\r\nReturn the number of times x appears in the list.

\r\n

list.sort(***, key=None, reverse=False)\r\nSort the items of the list in place (the arguments can be used for sort customization, see sorted() for their explanation).

\r\n

list.reverse()\r\nReverse the elements of the list in place.

\r\n

list.copy()\r\nReturn a shallow copy of the list. Equivalent to a[:].

\r\n\r\nMethod | Description\r\n-- | --\r\nappend() | Adds an element at the end of the list\r\nclear() | Removes all the elements from the list\r\ncopy() | Returns a copy of the list\r\ncount() | Returns the number of elements with the specified value\r\nextend() | Add the elements of a list (or any iterable), to the end of the current list\r\nindex() | Returns the index of the first element with the specified value\r\ninsert() | Adds an element at the specified position\r\npop() | Removes the element at the specified position\r\nremove() | Removes the item with the specified value\r\nreverse() | Reverses the order of the list\r\nsort() | Sorts the list\r\n\r\n\r\n\r\n\r\n## **List**\r\n\r\n","frontmatter":{"title":"Python - Lists","subtitle":"Sets in Python","description":null,"author":"zhenispir","slug":"python-list","tags":"Computer Science, Algorithms, Lesson, Python","category":"lesson, EN","image":null,"date":"2024-11-17T00:00:00.000Z","canonical":"https://zhenispir.com/Python"},"title":"Python - Lists","subtitle":"Sets in Python","description":" ","category":"lesson, en","tags":["Computer Science","Algorithms","Lesson","Python"],"canonical":"https://zhenispir.com/Python","slug":"python-list","date":"2024-11-17T00:00:00.000Z","readingTime":"4 minutes","ghMetadata":{"issueUrl":"https://github.com/zhenispir/zpirkit/issues/12","commentsUrl":"https://api.github.com/repos/zhenispir/zpirkit/issues/12/comments","title":"Lists in Python","created_at":"2024-11-25T08:16:42Z","updated_at":"2024-11-25T08:17:54Z","reactions":{"url":"https://api.github.com/repos/zhenispir/zpirkit/issues/12/reactions","total_count":0,"+1":0,"-1":0,"laugh":0,"hooray":0,"confused":0,"heart":0,"rocket":0,"eyes":0}}},{"type":"blog","content":" \r\n\r\n\r\n

Set

\r\n

Sets are used to store multiple items in a single variable.

\r\n

Set is one of 4 built-in data types in Python used to store collections of data, the other 3 are List, Tuple, and Dictionary, all with different qualities and usage.

\r\n

A set is a collection which is unordered, unchangeable*, and unindexed.

\r\n

\r\n💡 Note: Set items are unchangeable, but you can remove items and add new items.

\r\n

Sets are written with curly brackets.

\r\n

Create a Set:

\r\n

thisset = {"apple", "banana", "cherry"}\r\nprint(thisset)\r\n

\r\n

<aside>\r\n💡 Note: Sets are unordered, so you cannot be sure in which order the items will appear.

\r\n

</aside>

\r\n

Set Items

\r\n

Set items are unordered, unchangeable, and do not allow duplicate values.

\r\n

Unordered

\r\n

Unordered means that the items in a set do not have a defined order.

\r\n

Set items can appear in a different order every time you use them, and cannot be referred to by index or key.

\r\n

Unchangeable

\r\n

Set items are unchangeable, meaning that we cannot change the items after the set has been created.

\r\n

\r\n
Once a set is created, you cannot change its items, but you can remove items and add new items.
\r\n

\r\n

Duplicates Not Allowed

\r\n

Sets cannot have two items with the same value.

\r\n

Get the Length of a Set

\r\n

To determine how many items a set has, use the len() function.

\r\n

thisset = {"apple", "banana", "cherry", "banana"}\r\nprint(len(thisset))\r\n

\r\n

Set Items - Data Types

\r\n

Set items can be of any data type:

\r\n

String, int and boolean data types:

\r\n

set1 = {"apple", "banana", "cherry"}\r\nset2 = {1, 5, 7, 9, 3}\r\nset3 = {True, False, False}\r\n

\r\n

A set with strings, integers and boolean values:

\r\n

set1 = {"abc", 34, True, 40, "male"}\r\n

\r\n

type()

\r\n

From Python's perspective, sets are defined as objects with the data type 'set':

\r\n

myset = {"apple", "banana", "cherry"}\r\nprint(type(myset))\r\n# <class 'set'>\r\n

\r\n

The set() Constructor

\r\n

It is also possible to use the set() constructor to make a set.

\r\n

Using the set() constructor to make a set:

\r\n

thisset = set(("apple", "banana", "cherry")) # note the double round-brackets\r\nprint(thisset)\r\n

\r\n

Access Items

\r\n

You cannot access items in a set by referring to an index or a key.

\r\n

But you can loop through the set items using a for loop, or ask if a specified value is present in a set, by using the in keyword.

\r\n

thisset = {"apple", "banana", "cherry"}\r\n\r\nfor x in thisset:\r\n  print(x)\r\n

\r\n

Check if "banana" is present in the set:

\r\n

thisset = {"apple", "banana", "cherry"}\r\nprint("banana" in thisset)\r\n

\r\n

Change Items

\r\n

Once a set is created, you cannot change its items, but you can add new items.

\r\n

Join Two Sets

\r\n

There are several ways to join two or more sets in Python.

\r\n

You can use the union() method that returns a new set containing all items from both sets, or the update() method that inserts all the items from one set into another:

\r\n

The union() method returns a new set with all items from both sets:

\r\n

set1 = {"a", "b" , "c"}\r\nset2 = {1, 2, 3}\r\nset3 = set1.union(set2)\r\nprint(set3)\r\n

\r\n

The update() method inserts the items in set2 into set1:

\r\n

set1 = {"a", "b" , "c"}\r\nset2 = {1, 2, 3}\r\nset1.update(set2)\r\nprint(set1)\r\n

\r\n

<aside>\r\n💡 Note: Both union()and update() will exclude any duplicate items.

\r\n

</aside>

\r\n

Keep ONLY the Duplicates

\r\n

The intersection_update() method will keep only the items that are present in both sets.

\r\n

Keep the items that exist in both set x, and set y:

\r\n

x = {"apple", "banana", "cherry"}\r\ny = {"google", "microsoft", "apple"}\r\nx.intersection_update(y)\r\nprint(x)\r\n

\r\n

The intersection() method will return a new set, that only contains the items that are present in both sets.

\r\n

Return a set that contains the items that exist in both set x, and set y:

\r\n

x = {"apple", "banana", "cherry"}\r\ny = {"google", "microsoft", "apple"}\r\n\r\nz = x.intersection(y)\r\n\r\nprint(z)\r\n

\r\n

Keep All, But NOT the Duplicates

\r\n

The symmetric_difference_update() method will keep only the elements that are NOT present in both sets.

\r\n

Keep the items that are not present in both sets:

\r\n

x = {"apple", "banana", "cherry"}\r\ny = {"google", "microsoft", "apple"}\r\nx.symmetric_difference_update(y)\r\nprint(x)\r\n

\r\n

The symmetric_difference() method will return a new set, that contains only the elements that are NOT present in both sets.

\r\n

Return a set that contains all items from both sets, except items that are present in both:

\r\n

x = {"apple", "banana", "cherry"}\r\ny = {"google", "microsoft", "apple"}\r\nz = x.symmetric_difference(y)\r\nprint(z)\r\n

\r\n

Set Methods

\r\n\r\nMethod | Description\r\n-- | --\r\nadd() | Adds an element to the set\r\nclear() | Removes all the elements from the set\r\ncopy() | Returns a copy of the set\r\ndifference() | Returns a set containing the difference between two or more sets\r\ndifference_update() | Removes the items in this set that are also included in another, specified set\r\ndiscard() | Remove the specified item\r\nintersection() | Returns a set, that is the intersection of two other sets\r\nintersection_update() | Removes the items in this set that are not present in other, specified set(s)\r\nisdisjoint() | Returns whether two sets have a intersection or not\r\nissubset() | Returns whether another set contains this set or not\r\nissuperset() | Returns whether this set contains another set or not\r\npop() | Removes an element from the set\r\nremove() | Removes the specified element\r\nsymmetric_difference() | Returns a set with the symmetric differences of two sets\r\nsymmetric_difference_update() | inserts the symmetric differences from this set and another\r\nunion() | Return a set containing the union of sets\r\nupdate() | Update the set with the union of this set and others\r\n\r\n\r\n","frontmatter":{"title":"Python - Sets","subtitle":"Sets in Python","description":null,"author":"zhenispir","slug":"python-sets","tags":"Computer Science, Algorithms, Lesson, Python","category":"lesson, EN","image":null,"date":"2024-11-13T00:00:00.000Z","canonical":"https://zhenispir.com/Python"},"title":"Python - Sets","subtitle":"Sets in Python","description":" ","category":"lesson, en","tags":["Computer Science","Algorithms","Lesson","Python"],"canonical":"https://zhenispir.com/Python","slug":"python-sets","date":"2024-11-13T00:00:00.000Z","readingTime":"4 minutes","ghMetadata":{"issueUrl":"https://github.com/zhenispir/zpirkit/issues/11","commentsUrl":"https://api.github.com/repos/zhenispir/zpirkit/issues/11/comments","title":"Sets in Python","created_at":"2024-11-25T08:08:38Z","updated_at":"2024-11-25T08:13:04Z","reactions":{"url":"https://api.github.com/repos/zhenispir/zpirkit/issues/11/reactions","total_count":0,"+1":0,"-1":0,"laugh":0,"hooray":0,"confused":0,"heart":0,"rocket":0,"eyes":0}}},{"type":"blog","content":"\r\n\r\n\r\n\r\n## Printing\r\n### Printing variables\r\nIn this task, we print value of variable.\r\n\r\n

\r\n\t\r\n\t\t# This will get executed each time the exercise gets initialized\r\n\t\tb = 6\r\n\t\r\n\t\r\n\t\t# Create a variable c, equal to 5\r\n\r\n\r\n\t\t# Print out c\r\n\r\n\r\n\t\r\n\t\r\n\t\t# Create a variable c, equal to 5\r\n\t\tc = 5\r\n\r\n\t\t# Print out c\r\n\t\tprint(c)\r\n\t\r\n\t\r\n\t\ttest_object(\"a\")\r\n\t\ttest_function(\"print\")\r\n\t\tsuccess_msg(\"Great job!\")\r\n\t\r\n\t

Use the assignment operator (=) to create the variable a.

\r\n

","frontmatter":{"title":"Python - Test","subtitle":"This is testing of Datacamp servers.","description":null,"author":"zhenispir","slug":"test-python","tags":"Computer Science, Algorithms, Lesson, Python","category":"lesson, EN","image":null,"date":"2024-10-13T00:00:00.000Z","canonical":"https://zhenispir.com/Python Test"},"title":"Python - Test","subtitle":"This is testing of Datacamp servers.","description":" ","category":"lesson, en","tags":["Computer Science","Algorithms","Lesson","Python"],"canonical":"https://zhenispir.com/Python Test","slug":"test-python","date":"2024-10-13T00:00:00.000Z","readingTime":"1 minute","ghMetadata":{"issueUrl":"https://github.com/zhenispir/zpirkit/issues/6","commentsUrl":"https://api.github.com/repos/zhenispir/zpirkit/issues/6/comments","title":"Test - Python","created_at":"2024-10-14T10:16:14Z","updated_at":"2024-10-15T04:16:30Z","reactions":{"url":"https://api.github.com/repos/zhenispir/zpirkit/issues/6/reactions","total_count":0,"+1":0,"-1":0,"laugh":0,"hooray":0,"confused":0,"heart":0,"rocket":0,"eyes":0}}},{"type":"blog","content":"\r\nHere is the Markdown format of the table:\r\n\r\n# Unit 11.1A: Basic Structures of the Python Programming Language\r\n\r\n| № | Lesson Topics | \r\n| --- | ---------------------------------------- |\r\n| 1-2 | Introduction to the Python programming language. Organizing data output | \r\n| 3-4 | Data types. Input data. | \r\n| 5-6 | Selection. | \r\n| 7-10 | Loop While. | \r\n| 11-14 | Loop For. | \r\n| 15-18 | Nested loops. | \r\n| 19-20 | Sets. | \r\n| 21-24 | String processing. | \r\n| 25-28 | Lists. | \r\n| 29-32 | Tuples. | \r\n| 33-36 | List and string methods. | \r\n| 37-40 | Nested lists. | \r\n| 41-44 | Dictionaries. | \r\n| 45-48 | User-defined functions. | \r\n| 49-52 | Lambda functions. | \r\n| 53-58 | Classes. | \r\n| 59-64 | Polymorphism and inheritance. | \r\n| 65-68 | Solution of applied problems. |\r\n\r\n\r\nLet me know if you need any further changes!","frontmatter":{"title":"Programming - 11","subtitle":"This is continuous lesson of Computer Science at NIS Aktau for **12th grade**.","description":null,"slug":"python-11","tags":"Computer Science, Algorithms, Lesson, C++","category":"lesson, EN","image":null,"date":"2024-09-01T00:00:00.000Z","canonical":"https://zhenispir.com/python-11"},"title":"Programming - 11","subtitle":"This is continuous lesson of Computer Science at NIS Aktau for **12th grade**.","description":"Here is the Markdown format of the table: ","category":"lesson, en","tags":["Computer Science","Algorithms","Lesson","C++"],"canonical":"https://zhenispir.com/python-11","slug":"python-11","date":"2024-09-01T00:00:00.000Z","readingTime":"1 minute","ghMetadata":{"issueUrl":"https://github.com/zhenispir/zpirkit/issues/10","commentsUrl":"https://api.github.com/repos/zhenispir/zpirkit/issues/10/comments","title":"Python-11","created_at":"2024-11-22T05:02:39Z","updated_at":"2024-11-22T05:02:39Z","reactions":{"url":"https://api.github.com/repos/zhenispir/zpirkit/issues/10/reactions","total_count":0,"+1":0,"-1":0,"laugh":0,"hooray":0,"confused":0,"heart":0,"rocket":0,"eyes":0}}},{"type":"blog","content":"\r\n### 1st Quarter\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n

№	Theme	Goals
1A: Artificial Intelligence (12 hours)
1-4	Artificial Intelligence	12.4.3.1. describe spheres where artificial intelligence is applied: industry, education, medicine, gaming industry, society.
5-10	Virtual and augmented reality	12.4.3.2. explain the purpose of virtual and augmented reality
11-12	Revision. SA unit 1
1B: Programming Paradigms (14 hours)
13-16	Declarative & Imperative programming languages	12.5.1.1. compare declarative and imperative programming languages
17-18	Expert systems	12.5.1.2. create a simple expert system
19-24	Interpreters & Compilers. Stages of compilation	12.5.1.3. describe program compilation stages: lexical and syntactic analysis, code generation and optimization \r\n 12.5.1.4. demonstrate understanding of the program compilation stages: lexical, syntactic analysis \r\n 12.5.1.5. demonstrate understanding of the program compilation stage: code generation \r\n 12.5.1.6. demonstrate understanding of code optimization as the program compilation stage
25-26	Revision. SA unit 2
1C: System Testing (22 hours)
27-32	Types of test data. Execution Errors	12.5.3.1. describe execution errors at program startup \r\n 12.5.3.2. perform testing using normal data \r\n 12.5.3.3. perform testing using extreme data
33-38	Types of Errors	12.5.3.4. perform testing using erroneous data \r\n 12.5.3.5. describe a syntax error in a program code
39-44	Logic Error	12.5.3.6. describe a logic error in a program code
45-46	Revision. SA unit 3
47-48	Summative Assessment

\r\n","frontmatter":{"title":"Computer Science - 12","subtitle":"This is continuous lesson of Computer Science at NIS Aktau for **12th grade**.","description":null,"slug":"CS-12","tags":"Computer Science, Algorithms, Lesson, C++","category":"lesson, EN","image":null,"date":"2024-09-01T00:00:00.000Z","canonical":"https://zhenispir.com/cs-12"},"title":"Computer Science - 12","subtitle":"This is continuous lesson of Computer Science at NIS Aktau for **12th grade**.","description":"### 1st Quarter ","category":"lesson, en","tags":["Computer Science","Algorithms","Lesson","C++"],"canonical":"https://zhenispir.com/cs-12","slug":"cs-12","date":"2024-09-01T00:00:00.000Z","readingTime":"3 minutes","ghMetadata":{"issueUrl":"https://github.com/zhenispir/zpirkit/issues/3","commentsUrl":"https://api.github.com/repos/zhenispir/zpirkit/issues/3/comments","title":"Computer Science - 12","created_at":"2024-09-01T12:30:20Z","updated_at":"2024-10-15T03:59:54Z","reactions":{"url":"https://api.github.com/repos/zhenispir/zpirkit/issues/3/reactions","total_count":0,"+1":0,"-1":0,"laugh":0,"hooray":0,"confused":0,"heart":0,"rocket":0,"eyes":0}}},{"type":"blog","content":"\r\n> This year, I will try to put everything work-related stuff here. So everyone including students, colleagues and other interested people can reach out. \r\n\r\n> This is one of the first pages I make, so it probably contains a lot of mistakes.\r\n\r\nThis academic year consists of **36 weeks**:\r\n\r\n1. quarter: 8 weeks\r\n2. quarter: 8 weeks\r\n3. quarter: 11 weeks\r\n4. quarter 9 weeks\r\n\r\nHere is the educational calendar graphic created by @qazyr.kz ([original article](https://qazyr.kz/2024-2025-zhylgy-okushylardyn-oku-zhane-demalys-uakyty-bekitildi/)):\r\n![2024-2025 Academic Year](https://qazyr.kz/wp-content/uploads/2024/07/IMG_20240722_125716_704.jpg \"2024-2025 Academic Year\")\r\n\r\n> Education is the most powerful weapon which you can use to change the world.” —[Nelson Mandela](https://libquotes.com/nelson-mandela) \r\n\r\n### My Lectures\r\n\r\n- [Computer Science - 11th Grade](https://zhenispir.com/cs-11)\r\n- [Computer Science - 12th Grade](https://zhenispir.com/cs-12)\r\n- [Programming - 11th Grade](https://zhenispir.com/programming-11)\r\n\r\n\r\n### Weekly Timetable\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n

	08:30-10:05	10:20-12:00	12:25-14:10	14:15-15:50
Mon	12-CS-1		Prog-11B
Tue	12-CS-2	11-CS-1		Prog-11C
Wed	12-CS-1
Thu	11-CS-1	12-CS-2	Prog-11A
Fri	11-CS-1	12-CS-2	12-CS-1

\r\n\r\n## Monthly Updates\r\n\r\n### August 2024\r\n\r\nTaking to olympic team of NIS Aktau was not easy task. Certainly it was fun one. When I go to another place usually, I try to see around or walk around while listening some good tunes.
\r\nBut this time I had a challenge to accomplish: **creating my own website**. That is why I had a strict schedule: first running, then breakfast, and immediately at nine o'clock, I sit down in front of my computer to learn web development. Coding until lunch time, then continue again. Afternoon I did unusual pull-up training (Pull-up every half hour ten times). Dinner, fruit or sometimes tea, but mostly water and honey is good for me. And of course, coding until 22:00. Then sleeping.\r\nI met up with my old colleague and friend Asim. It was always fun to talk with your peers. And also, I gathered with my freshly graduated students who are accepted for NU.\r\n\r\n### September 2024","frontmatter":{"title":"Academic Year 2024-2025","subtitle":"This is ongoing blueprint of my work in NIS Aktau in 2024-25.","description":null,"slug":"2024-25","tags":"Computer Science, Programming, Lesson, Python, C++","category":"lesson, english","image":"https://qazyr.kz/wp-content/uploads/2024/07/IMG_20240722_125716_704.jpg","date":"2023-08-22T00:00:00.000Z","canonical":"https://zhenispir.com/AY-202425"},"title":"Academic Year 2024-2025","subtitle":"This is ongoing blueprint of my work in NIS Aktau in 2024-25.","description":"> This year, I will try to put everything work-related stuff here. So everyone including students, colleagues and other interested people can reach out. ","category":"lesson, english","tags":["Computer Science","Programming","Lesson","Python","C++"],"image":"https://qazyr.kz/wp-content/uploads/2024/07/IMG_20240722_125716_704.jpg","canonical":"https://zhenispir.com/AY-202425","slug":"2024-25","date":"2023-08-22T00:00:00.000Z","readingTime":"3 minutes","ghMetadata":{"issueUrl":"https://github.com/zhenispir/zpirkit/issues/1","commentsUrl":"https://api.github.com/repos/zhenispir/zpirkit/issues/1/comments","title":"Academic Year 2024-2025 ","created_at":"2024-08-18T15:02:40Z","updated_at":"2024-09-06T08:00:16Z","reactions":{"url":"https://api.github.com/repos/zhenispir/zpirkit/issues/1/reactions","total_count":0,"+1":0,"-1":0,"laugh":0,"hooray":0,"confused":0,"heart":0,"rocket":0,"eyes":0}}}]

Blog