|
LO-1
|
Upon successful completion of this course, students will reach the competence to code linear data structures such as arrays, linked lists, stacks, and queues by understanding basic concepts like data types, algorithm design, and complexity analysis with Big-O notation; solve network optimization and shortest path problems by modeling trees (especially binary search and balanced trees) and graph algorithms; use fundamental searching and sorting algorithms like quick sort and binary search in data manipulation; and simultaneously produce high-performance, optimized algorithmic solutions in back-end applications by grasping memory management and database indexing logic. |