CSI 260 - Introduction to Data Structures and Algorithms

5 Credits
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

Prerequisite(s): Completion of CSI 226 with a 2.0 or higher.

Course Outcomes

Compute time efficiency of an algorithm and conclude its Big O notation.
Explain the working concept of the 5 sort methods: bubble sort, selection sort, insertion sort, merge sort & quick sort.
State the advantages and disadvantages of the List data structure, by analyzing its insert, search & delete implementation algorithms.
Define and explain the main functions of the Queue data structure.
Analyze the time efficiency and Big O notation of each of the functions: insert, search and delete implementation algorithms of the Queue.
Define and explain the main functions of the Stack data structure.
Analyze the time efficiency and Big O notation of each of the functions: insert, search and delete implementation algorithms of the stack.
Define and explain the main functions of a Hashtable.
Analyze the time efficiency and Big O notations of each of the functions: insert, search, and delete algorithms.