Software engineering | JSE

🔥LET'S START VOTING FOR THE PRESIDENT OF THE STUDENT COUNCIL 2023/2024!!!!🔥 Have you voted? If not, I wanted to ask you as the one who (I hope) helped you throughout this year with your academic journey and validation to support our team(Renaissance)! I promise you, next year, this channel will be even more active and I will do my best to make your academic life convenient, so your help is going to be huge motivation for me! 🌟🙏

Suggested today's to do list: - ID project 3 - 1/2 part - CA assignment 3 completion - ADS - revise topics before midterm

#finals exam information 1. Algorithms and Data Structures #algorithms_and_data_structures SATURDAY, 12:00 - 13:30 20 MCQ - 40%(each 2pts, no negative marking), 6 writing questions - 60%(each 10pts, algorithm, code, pseudocode etc); 100pts, 2 sets of question available Questions from week 2 to 14, if you want to get just around 60/100, revise only from week 5 to week 14 2. Probability Models #probability_models MONDAY, 12:00 - 13:30 20 MCQ - 50%, 2.5pts each 5 questions written: - Martingales - Branching processes - Hidden Markov chains - Queuing Theory - Bayesian Statistics 3. Discrete Mathematics (#discrete_math) TUESDAY, 16:30-18:00 Written questions only 4. Interaction Design #interaction_design SATURDAY Project 3 - DEADLINE: 24.06.2023, presentation - 25.06.2023 5. Computer Architecture #computer_architecture SATURDAY, 16:30-18:00 Written, when you are preparing pay more attention to examples shown there (professor's words), questions only from topics we've learned after midterms IF YOU HAVE ADDITIONAL INFO, PLEASE SHARE IN THE COMMENTS OR IN THE GROUP: https://t.me/+VWAc-AE2zmNhZTEy

🌝🌝🌝🌝

🔥LET'S START VOTING FOR PRESIDENT OF THE STUDENT COUNCIL 2023/2024!!!!🔥

Hello everyone! Hope you are doing well in preparing for exams! (however, I am not sure if it is possible to be able "do well" by preparing for exams, lol) Election are really close, maybe they have already started haha I hope my support in this channel helped you somehow (even at least for 1 percent ಥ‿ಥ), and I wanted to ask for your support this time(of course it is still your choice). Renaissance is the greatest opportunity that can gather all students in academic and social fields, we are going to pay huge attention to your personal growth in your career path and provide you will all the required opportunities and many more (you know what I am talking about, like internships and job offers and many more 🌝) and enhance your academic life by bringing out all your problems, and provide solutions to them that will satisfy you ✨ Even if our team won't elected, I will continue running this channel! And still hope that it won't be useless 🤧 Best Regards, Team member of Renaissance Zulfiya Usmonova (I will share the finals info soon)

Guys, tomorrow at 7 am, we will have small practice session from Discrete mathematics(with Mukaddas) where we will cover week 10-12 topics, join us if you can! First floor for now, if the location will change I will let you know

You can still submit it on Monday, leave your answer sheet on the prof Khudoyorkhon's table room 609 (if I am not mistaken, front of the room 613)

Submit the Report file in .odt or .doc/docx format only! The file name should include your FULL NAME and the week day and time slot for your class! Example: Muslimbek_Abduganiev_Tuesday_13PM.odt You can find a template for the report file in the attached zip file. Submission by email only! Put assignment-3 in the subject of the email. Submission deadline is the 22nd of June. No late submission are to be accepted.

Picture from ADS lecture hw 14

Send the doc file by email to professor, plus share it in google doc also! Deadline: today

If you have any suggestions, leave them in the comments

I will be updating this list

LAB 1 Write C++ program, algorithm/Pseudocode for the following: - Check whether a year is a leap or not. - Convert a lowercase alphabet to uppercase or vice versa. - Check whether a given character is an uppercase or lowercase alphabet or a digit or a special character. LAB2 Conquer and divide concepts; where we can apply divide and conquer Complete Stack implementation of both array and linked list versions Complete Queue implementation of both array and linked list versions LAB3 1. Perform the following operations on Doubly linked list (algorithm/pseudocode, code implementation in c++) Algorithm: Create list Algorithm: Insert at the beginning Algorithm: Insert at the end Algorithm: Insert at a given position Algorithm: Delete node Algorithm: count number of nodes in the list Algorithm: display (traverse) the list Algorithm: reverse the list 2. Implement Double Ended queue, deque at the back/front, enqueue at the front/back, display(), reverse()/*display from last*/, count(), using Linked List LAB4 1.Count the number of occurrences of letter input by the user in a string input by the user 2.recursive function in C++ to count the number of occurrences of a given character in a string LAB5 1. Binary Tree methods 2. Algorithm of finding kth smallest element: 3. Compare binary search and interpolation search algorithms for searching an element in asorted array LAB6 Day-Stout-Warren algorithm to balance a given Binary Search Tree (mention that it creates ‘backbone’, it is also a balancing tree) Priority heap - priority queue implementation using a binary heap Guessing game: it will ask how many options you want to insert, for example, 5, if you will say any option it will say “target value is higher/lower”, you will get this kinda message 5 times for inserting 5 options or until you correctly guess within this 5 options LAB7 Quick Sort Merge Sort - find mid value by taking quotient = integer part of (L+R)/2 Heap Sort Bubble Sort Insertion Sort Selection Sort LAB10 Implementation of Fibonacci sequence using dynamic programming Implementation of knapsack problem (1/0) using dynamic programming Implementation of fractional knapsack problem LAB11 Implementation of Dijkstra algorithm Implementation of Prim’s algorithm Implementation of Kruskal’s algorithm LAB12 1.C++ program that implements Run-length encoding (RLE) data compression 2. C++ program that implements Lempel-Ziv (LZ) encoding data compression 3.C++ program that implements Shannon Fano encoding data compression LAB13 Implementation of Huffman Coding Delta encoding implementation Shannon Fano coding Deflate (Huffman + LZ77)

Check you emails and lms for more info