University - Computer Science

Data Structures & Algorithms

The second undergraduate computer science course: algorithm analysis (Big-O notation), arrays and linked lists, stacks and queues, recursion, trees (binary, BST, AVL, heaps), hash tables, graphs (BFS, DFS, shortest path), sorting algorithms, and algorithm design strategies (divide-and-conquer, greedy, dynamic programming).

Database Systems

A standard undergraduate database systems course: relational data model, SQL (DDL, DML, queries, joins, subqueries, aggregation), entity-relationship modeling, normalization (1NF through BCNF), transaction management, indexing and query optimization, NoSQL concepts, and database application development.

Discrete Mathematics

A standard undergraduate discrete mathematics course: logic and proof techniques, sets and functions, number theory, counting and combinatorics, relations, graph theory, trees, Boolean algebra, and algorithm analysis.

Introduction to Computer Science

A standard introductory college programming course taught in Java: variables, control flow, arrays, object-oriented programming, recursion, and basic algorithms.