Course Aim: Introduce students to the foundations of discrete Structures.
Main Topics: Big-O - counting methods - recursion/recurrences - Elementary logic including propositional/predicate logic - methods of proof – relations - basic definitions and properties - special types of relations - Boolean algebras - introduction to graph theory - special types of graphs -trees and their applications - practice in reasoning formally and proving theorems.
Main Topics: Big-O - counting methods - recursion/recurrences - Elementary logic including propositional/predicate logic - methods of proof – relations - basic definitions and properties - special types of relations - Boolean algebras - introduction to graph theory - special types of graphs -trees and their applications - practice in reasoning formally and proving theorems.
- Teacher: ibrahim Jamil Omar Nabil
- Teacher: sayed Karim Bilal Omar
Course Aim: Introduce students to the foundations of discrete Structures.
Main Topics: Big-O - counting methods - recursion/recurrences - Elementary logic including propositional/predicate logic - methods of proof – relations - basic definitions and properties - special types of relations - Boolean algebras - introduction to graph theory - special types of graphs -trees and their applications - practice in reasoning formally and proving theorems.
Main Topics: Big-O - counting methods - recursion/recurrences - Elementary logic including propositional/predicate logic - methods of proof – relations - basic definitions and properties - special types of relations - Boolean algebras - introduction to graph theory - special types of graphs -trees and their applications - practice in reasoning formally and proving theorems.
- Teacher: ibrahim Jamil Omar Nabil
- Teacher: sayed Karim Bilal Omar
Course Aim: Introduce students to basic concepts of graph theory, graph properties and formulations of typical graph problems. This is also supplemented with some abstract-level algorithms for the presented problems and with some advanced graph theory topics.
Main Topics: Simple graphs - digraphs - Eulerian and Hamiltonian graphs - trees - matchings - networks - paths - cycles - graph colorings - and planar graphs - existence - enumeration - construction - algorithms - optimization - pigeonhole principle - bijective combinatorics - inclusion-exclusion - recursions - graph modeling - isomorphism - degree sequences - edge counting - connectivity - Euler's formula - network flows and matching theory.
Main Topics: Simple graphs - digraphs - Eulerian and Hamiltonian graphs - trees - matchings - networks - paths - cycles - graph colorings - and planar graphs - existence - enumeration - construction - algorithms - optimization - pigeonhole principle - bijective combinatorics - inclusion-exclusion - recursions - graph modeling - isomorphism - degree sequences - edge counting - connectivity - Euler's formula - network flows and matching theory.
- Teacher: khaled Walid Mohammed Tariq
- Teacher: nada Khalid Khalid Bilal
Course Aim: Introduce students to methods of algebraic integration. How to integrate complicated functions. Students will be introduced to using integration techniques to solve differential equations especially those coming from physical or social systems. Also, they will learn using sequences and series to compute/approximate numbers or functions. Finally, they will study geometric objects in two and three dimensions using tools from calculus.
Main Topics: Techniques of integration - including integration by parts - simple trig substitutions - partial fraction - Taylor polynomials - basic numerical integration; improper integrals; arc length; area of surface of revolution - separable differential equations - Euler’s method - exponential growth and decay - parametric curves and polar coordinates - sequences and series - vectors in three dimensions - dot product - cross product - lines - planes - cylinders - quadric surfaces; cylindrical and spherical coordinates.
Main Topics: Techniques of integration - including integration by parts - simple trig substitutions - partial fraction - Taylor polynomials - basic numerical integration; improper integrals; arc length; area of surface of revolution - separable differential equations - Euler’s method - exponential growth and decay - parametric curves and polar coordinates - sequences and series - vectors in three dimensions - dot product - cross product - lines - planes - cylinders - quadric surfaces; cylindrical and spherical coordinates.
- Teacher: nada Khalid Khalid Bilal
- Teacher: zaki Faisal Karim Walid
Course Aim: Introduce students to basic concepts of graph theory, graph properties and formulations of typical graph problems. This is also supplemented with some abstract-level algorithms for the presented problems and with some advanced graph theory topics.
Main Topics: The Basics and definitions of graph theory - graphs and their relatives - isomorphism and automorphism of graphs - degree sequences and edge counting - eulerian and hamiltonian walks/cycles -trees and networks - traveling salesman problem (TSP) - graph matchings- euler's formula - networks flows - graph colorings - combinatorial objects and techniques - sets and subsets- sequences - basic principles of counting- permutations and factorials - fibonacci numbers- catalan numbers – inclusion – exclusion - recursions - pigeonhole principle- estimations - algebraic combinatorics: binomial coefficients - pascal's triangle - geometric combinatorics.
Main Topics: The Basics and definitions of graph theory - graphs and their relatives - isomorphism and automorphism of graphs - degree sequences and edge counting - eulerian and hamiltonian walks/cycles -trees and networks - traveling salesman problem (TSP) - graph matchings- euler's formula - networks flows - graph colorings - combinatorial objects and techniques - sets and subsets- sequences - basic principles of counting- permutations and factorials - fibonacci numbers- catalan numbers – inclusion – exclusion - recursions - pigeonhole principle- estimations - algebraic combinatorics: binomial coefficients - pascal's triangle - geometric combinatorics.
- Teacher: khaled Walid Mohammed Tariq
- Teacher: nada Khalid Khalid Bilal
Course Aim: Introduce students to methods of algebraic integration. How to integrate complicated functions. Students will be introduced to using integration techniques to solve differential equations especially those coming from physical or social systems. Also, they will learn using sequences and series to compute/approximate numbers or functions. Finally, they will study geometric objects in two- and three-dimensions using tools from calculus.
Main Topics: Techniques of integration - including integration by parts - simple trig substitutions - partial fraction - Taylor polynomials - basic numerical integration; improper integrals; arc length; area of surface of revolution - separable differential equations - Euler’s method - exponential growth and decay - parametric curves and polar coordinates - sequences and series - vectors in three dimensions - dot product - cross product - lines - planes - cylinders - quadric surfaces; cylindrical and spherical coordinates.
Main Topics: Techniques of integration - including integration by parts - simple trig substitutions - partial fraction - Taylor polynomials - basic numerical integration; improper integrals; arc length; area of surface of revolution - separable differential equations - Euler’s method - exponential growth and decay - parametric curves and polar coordinates - sequences and series - vectors in three dimensions - dot product - cross product - lines - planes - cylinders - quadric surfaces; cylindrical and spherical coordinates.
- Teacher: zaki Faisal Karim Walid
Course Aim: Introduce students to basic concepts that include combinational and sequential circuit analysis and design, digital circuit design optimization methods using random logic gates, multiplexers, decoders, registers, counters and programmable logic arrays.
Main Topics: Logic states – number systems – Boolean algebra – basic logical operations – gates and truth tables - combinational logic: minimization techniques – multiplexers and de-multiplexers – encoders – decoders – adders and subtractors – comparators – programmable logic arrays and memories – design with MSI – logic families – tri-state devices - sequential logic: flip flops – mono-stable multi-vibrators – latches and registers – counters.
Main Topics: Logic states – number systems – Boolean algebra – basic logical operations – gates and truth tables - combinational logic: minimization techniques – multiplexers and de-multiplexers – encoders – decoders – adders and subtractors – comparators – programmable logic arrays and memories – design with MSI – logic families – tri-state devices - sequential logic: flip flops – mono-stable multi-vibrators – latches and registers – counters.
- Teacher: abeer Saeed Amir Walid
- Teacher: aya Saad Omar Khalid
- Teacher: nouran Abdullah Karim Abdullah
Course Aim: Introduce students to electromagnetics physics concepts.
Main Topics: Introduction to electricity - electric field - Gauss's law - electric potential - capacitors and dielectrics - electric circuits - magnetism - magnetic fields and currents - magnetic materials - magnetic induction - inductance and energy - Maxwell's equations and EM waves - AC circuits - semiconductors and electronics
Main Topics: Introduction to electricity - electric field - Gauss's law - electric potential - capacitors and dielectrics - electric circuits - magnetism - magnetic fields and currents - magnetic materials - magnetic induction - inductance and energy - Maxwell's equations and EM waves - AC circuits - semiconductors and electronics
- Teacher: ahmed Ahmed Khalid Saeed
- Teacher: fathy Saad Khalid Tariq
- Teacher: ibrahim Tariq Khalid Nabil
- Teacher: nouran Saad Nabil Reda