Data Structures and advanced algorithms

• This class is designed primarily for BSc Computer Science students who want to build a strong foundation in Data Structures. It is suitable for beginners, students preparing for university examinations, and learners who want to improve their programming and problem-solving skills.

Students will learn important Data Structures concepts including arrays, linked lists, stacks, queues, trees, graphs, searching, sorting, and time and space complexity. Each topic will be explained step by step using simple explanations, examples, diagrams, and practical coding exercises. Students will also learn how to choose the appropriate data structure for solving different programming problems efficiently.

No advanced programming knowledge is required. Basic knowledge of programming fundamentals such as variables, loops, conditions, functions, and basic coding concepts is helpful. Students should bring a notebook and pen for taking notes and, if possible, a laptop for practicing coding exercises during the class.

The class will be interactive and student-focused, with opportunities to ask questions, solve problems, clarify difficult concepts, and practice important topics. The lessons can also be adapted to the student's academic syllabus and learning pace.