Course Aim: Provide students with an understanding of the role computation can play in solving real-world problems.
Main Topics: An introduction to computers-Program design and development process: Problem definition, pseudo-code and algorithm development, flowcharting - Fundamental programming concepts in Python; procedures, functions, iteration, strings, decision structures.
Main Topics: An introduction to computers-Program design and development process: Problem definition, pseudo-code and algorithm development, flowcharting - Fundamental programming concepts in Python; procedures, functions, iteration, strings, decision structures.
Course Aim: Investigate fundamental concepts of linear algebra and explore their application to problems arising from mathematics, applied mathematics, and other fields.
Main Topics: Linear transformations - Linear vector spaces - Inner product spaces - numerical solutions for systems of linear and nonlinear equations - eigenvalues and matrix decompositions (Cholesky - LU - QR - SVD - etc.) - numerical analysis of errors and convergence - iterative methods - conjugate gradient techniques - an introduction to least squares methods - practice of algorithms/computational matrix methods using computational tools to solve real world problems.
Main Topics: Linear transformations - Linear vector spaces - Inner product spaces - numerical solutions for systems of linear and nonlinear equations - eigenvalues and matrix decompositions (Cholesky - LU - QR - SVD - etc.) - numerical analysis of errors and convergence - iterative methods - conjugate gradient techniques - an introduction to least squares methods - practice of algorithms/computational matrix methods using computational tools to solve real world problems.
- Teacher: khaled Walid Mohammed Tariq
Course Aim: Expose students to the depth and breadth of modern programming practice with the goal of making students better developers.
Main Topics: Introduction to functional programming: primitive types and operators, let bindings, lambda expressions, recursion - Conditional expressions, pattern matching, iteration and recursion, tuples and lists - User-defined data types, product and sum types, inductive types - Higher-order functions, currying, closures, polymorphism - List processing functions: map, filter, fold, reduce; relationship between functions - Program representation and evaluation. Type checking and type inference. - Evaluation strategies: call-by-name, call-by-value, lazy evaluation - Evaluation control: exceptions, continuations, delayed evaluation - Reasoning about program correctness, natural and structural induction - Types and imperative programming: side effects, references, mutable data structures and algorithms - Modularity and data abstraction mechanisms - Optional topics: search, program representation, concurrency, proof techniques.
Main Topics: Introduction to functional programming: primitive types and operators, let bindings, lambda expressions, recursion - Conditional expressions, pattern matching, iteration and recursion, tuples and lists - User-defined data types, product and sum types, inductive types - Higher-order functions, currying, closures, polymorphism - List processing functions: map, filter, fold, reduce; relationship between functions - Program representation and evaluation. Type checking and type inference. - Evaluation strategies: call-by-name, call-by-value, lazy evaluation - Evaluation control: exceptions, continuations, delayed evaluation - Reasoning about program correctness, natural and structural induction - Types and imperative programming: side effects, references, mutable data structures and algorithms - Modularity and data abstraction mechanisms - Optional topics: search, program representation, concurrency, proof techniques.
- Teacher: nouran Hassan Hassan Faisal
- Teacher: sama Hassan Karim Omar
Course Aim: Investigate fundamental concepts of linear algebra and explore their application to problems arising from mathematics, applied mathematics, and other fields.
Main Topics: Introduction; Basics of Linear Systems; Example Applications- Introduction to Matlab Programming. -Vector and Matrix Equations- Numerical Precision- Computational Complexity -Systems of Linear Equations: Examples- Solution Sets- Linear Independence- Linear Transformations -Matrix Operations -Inverses -Partitioned Matrices- Matrix Factorizations -Applications- Subspaces -Dimension and Rank- Determinants -Eigenvalues and Eigenvectors- including Applications -Introduction to Iterative Approaches- Inner Products- Orthogonality -Orthogonality- the Gram-Schmidt Process -Application of Orthogonality- Etc. to Least Squares -Diagonalization- Quadratic Forms- Introduction to Constrained Optimization -Singular Value Decomposition
Main Topics: Introduction; Basics of Linear Systems; Example Applications- Introduction to Matlab Programming. -Vector and Matrix Equations- Numerical Precision- Computational Complexity -Systems of Linear Equations: Examples- Solution Sets- Linear Independence- Linear Transformations -Matrix Operations -Inverses -Partitioned Matrices- Matrix Factorizations -Applications- Subspaces -Dimension and Rank- Determinants -Eigenvalues and Eigenvectors- including Applications -Introduction to Iterative Approaches- Inner Products- Orthogonality -Orthogonality- the Gram-Schmidt Process -Application of Orthogonality- Etc. to Least Squares -Diagonalization- Quadratic Forms- Introduction to Constrained Optimization -Singular Value Decomposition
- Teacher: ahmed Ahmed Khalid Ali
- Teacher: fathy Omar Omar Yousef
Course Aim: Develop the students’ skills in programming through the exploration of different fundamental concepts.
Main Topics: Structured data types: one/two-dimensional arrays, strings - Dynamic data structures (pointers) – Recursion - Object-oriented programming using C++ - Algorithm development techniques, use of abstractions/modularity, data structures/abstract data types, development of programs to solve real-world problems.
Main Topics: Structured data types: one/two-dimensional arrays, strings - Dynamic data structures (pointers) – Recursion - Object-oriented programming using C++ - Algorithm development techniques, use of abstractions/modularity, data structures/abstract data types, development of programs to solve real-world problems.
- Teacher: abeer Saeed Jamil Omar
- Teacher: ahmed Walid Yousef Saeed
- Teacher: ibrahim Abdullah Walid Abdullah
- Teacher: nada Yousef Saad Tariq
- Teacher: sama Bilal Khalid Bilal
- Teacher: sama Faisal Nabil Karim
- Teacher: shoruk Ahmed Ramy Omar