Software engineering | JSE

https://t.me/nuu_ixd_2023 Interaction Design Telegram group

No homework from Computer Architecture and Probability Models for this week, from Interaction Design, I haven't attended yet, so don't know

HOMEWORK from Discrete mathematics #discrete_mathematics 1. Exercises 4, 6, and 8 from the main book(Rosen), page 214. 2. Complete this task: "Write a pseudocode to find the number of words in a given sentence made of letters and spaces." 3. Complete this task: "Write a pseudocode to check that a given function is injective." You have to write them on a white A4 paper and give it to professor Makeev Georgiy. Make sure to include at the top your full name and student ID. DEADLINE: your upcoming next week's lab/tutorial #Week1

HOMEWORK from Algorithms and data structures #algorithms_and_data_structures 1. Create 2 Google Documents with your university account, FIRST ONE(1): solely for homework from lecture, you have to add(share the file as commentator or editor) professor m.uvaze@newuzbekistanuniversity.uz there; SECOND ONE:(2) this one is for lab/tutorial lessons, don't share it with the professor. 2. Do 4 exercises from lecture slides (there are four exercises, 2 are marked as homework and the other 2 are kinda example questions that also have to be completed) and write the answers in a google document (1). Make sure to include at the top your full name, date, and student ID. 3. Lab tasks - complete them and write in google document (2). Make sure to include at the top your full name, date, and student ID. Here is the question that was given in the lab: "Write C++ program, algorithm, and Pseudocode for the following: 1)Check whether a year is a leap or not. 2)Convert a lowercase alphabet to uppercase or vice versa. 3) Check whether a given character is an uppercase or lowercase alphabet or a digit or a special character." DEADLINE: for the 2nd one - till upcoming lecture, for the 3rd one - upcoming next week's tutorial/lab #Week1

Hopefully on Sunday I will send you all notes I made during this week (firstly I shouzld organise them and make them readable lol)

It is not 100% necessary, just will be useful, you still can get all info from book and lectures

Guys, I highly suggest you attend both Discrete math labs from 2 professors, cause the information they are giving is slightly different and kinda complements each other

POINTS DISTRIBUTION Computer Architecture(#computer_architecture): - Assessment/assignments - 35% - Midterm exams - 30% - Final exams - 35% Algorithms and Data Structures(#algorithms_and_data_structures): - Assessment/assignments - 10% - Final Project - 30 % where: 10 - code 10 - document 10 - presentation - Midterm exams - 25% - Final exams - 35% Probability Models(#probability_models): - Assessment/assignments - 20% - Midterm exams - 40% - Final exams - 40% Discrete Mathematics(#discrete_math): - Assessment/assignments - 15% - Tutorial activity - 5% - Midterm exams - 40% - Final exams - 45% (Not confirmed yet) Interaction Design(#interaction_design): - Labs - 10% - Project 1 (digital product) - 30% - Project 2 (physical product) - 30% - Project 3 (virtual product) - 30% Political Science(#political_science): - Assessment/assignments - —% - Midterm exams - —% - Final exams - —% #points_distribution

Subgroup of the channel: https://t.me/+VWAc-AE2zmNhZTEy We can make it the group of SSE students(not official) and discuss most of the problems and issues there (cases as if you have any questions about any concepts we are learning and etc), like, community of SSE students⚡️

I am getting several(most) of the books and lecture slides above from A plus NUU club, cause I was too lazy to search them by myself when they were already sent by this club lol 🌝

First week lecture slides from #algorithms_and_data_structures #probability_models #discrete_math (thanks to @aplusclubnuu for lecture slides from discrete math)

Probability Models Books (thanks to @aplusclubnuu) #books #probability_models

Algorithms and Data Structures Books (thanks to @aplusclubnuu) #books #algorithms_and_data_structures