This course provides an introduction to fundamental programming concepts using a high-level programming language. Students will learn essential skills including algorithm development, data structures, control structures, and functions. The course emphasizes practical problem-solving and programming techniques, enabling students to write, test, and debug simple programs. Through hands-on lab activities, students will gain proficiency in programming constructs and methodologies, preparing them for advanced studies in computer science.

This course introduces fundamental data structures and their applications, focusing on their design, implementation, and analysis. Utilizing Java as the primary programming language, students will explore a variety of data structures, including Lists, Stacks, Queues, Trees, and Graphs. The course also delves into sorting and searching algorithms, providing a comprehensive understanding of algorithm efficiency and performance.

This course explores the organization and behavior of real computer systems at the assembly-language level. Students will study the mapping of high-level language constructs onto sequences of machine instructions, as well as the internal representation of simple data types and structures. Numerical computation is examined, noting various data representation errors and potential procedural errors.

This course introduces students to the fundamental discrete structures used in computer science, emphasizing their practical applications. Key topics include logic and proofs, set theory, functions, sequences, summations, algorithm analysis, properties of integers, mathematical induction, recursion, combinatorics, relations, graph theory, tree structures, and discrete probability. Through a combination of theoretical knowledge and practical problem-solving, students will develop a strong foundation in these essential concepts.