CSE 302 introduces core concepts and techniques for organizing, storing, and processing data efficiently. The course covers linear and non linear data structures—arrays, linked lists, stacks, queues, trees, graphs, heaps, and hash tables—along with recursion and fundamental searching and sorting algorithms. Students analyze algorithmic efficiency using Big O notation, compare alternative implementations, and apply Python to design and implement data structures and algorithms that support effective problem solving.
- Teacher: Ahmed Ali