Welcome to the Course Portal

Explore course information for Object-Oriented Programming, Green Computing, Numerical Methods, Computer Programming, and Discrete Mathematics.

View Courses Course Details
Academic Courses

Courses

Click the View Details button to see topics, objectives, and learning outcomes.

CSE Course

Object-Oriented Programming

Learn programming using classes, objects, inheritance, polymorphism, abstraction, and encapsulation.

  • Classes and Objects
  • Inheritance
  • Polymorphism
View Details
CSE Course

Discrete Mathematics

Learn logic, sets, relations, counting, functions, recurrence relations, trees, and graph theory.

  • Propositional Logic
  • Relations and Functions
  • Graph Theory
View Details
CSE Course

Green Computing

Learn sustainable computing, green IT, energy-efficient systems, and e-waste management.

  • Green IT Concepts
  • E-Waste Management
  • Sustainable ICT
View Details
CSE Course

Numerical Methods

Learn computational techniques for solving mathematical, scientific, and engineering problems.

  • Bisection Method
  • Newton-Raphson Method
  • Interpolation
View Details
CSE Course

Computer Programming

Learn the fundamentals of programming, logic building, algorithms, flowcharts, and problem solving.

  • Variables and Data Types
  • Conditions and Loops
  • Arrays and Functions
View Details
Course Information

Course Details

Detailed course objectives, major topics, and learning outcomes are given below.

Object-Oriented Programming

This course introduces modern software development using object-oriented programming principles. Students learn how to design modular, reusable, and maintainable programs.

Main Topics

  • OOP concepts
  • Classes and objects
  • Constructors and methods
  • Encapsulation and abstraction
  • Inheritance and polymorphism
  • Exception handling
  • File handling

Learning Outcomes

  • Explain core OOP principles.
  • Develop programs using classes and objects.
  • Apply inheritance and polymorphism.
  • Build small software projects using OOP.
Back to Courses

Green Computing

This course focuses on environmentally responsible computing practices, energy-efficient ICT systems, sustainable technology use, and proper e-waste management.

Main Topics

  • Green computing concepts
  • Energy-efficient hardware and software
  • Green data centers
  • Cloud computing and virtualization
  • E-waste management
  • Sustainable ICT policies

Learning Outcomes

  • Describe the importance of green computing.
  • Identify energy-saving ICT techniques.
  • Explain e-waste management practices.
  • Apply sustainable computing ideas.
Back to Courses

Numerical Methods

This course teaches computational methods for solving mathematical problems through approximation techniques and numerical algorithms.

Main Topics

  • Error analysis
  • Bisection method
  • False position method
  • Newton-Raphson method
  • Secant method
  • Interpolation
  • Numerical differentiation
  • Numerical integration

Learning Outcomes

  • Solve nonlinear equations numerically.
  • Apply interpolation techniques.
  • Understand numerical errors.
  • Use computational methods for real problems.
Back to Courses

Computer Programming

This course introduces programming fundamentals and algorithmic thinking. Students learn how to write structured programs for basic computational problems.

Main Topics

  • Programming basics
  • Algorithms and flowcharts
  • Variables and data types
  • Input and output
  • Conditional statements
  • Loops
  • Arrays
  • Functions

Learning Outcomes

  • Understand basic programming concepts.
  • Write programs using conditions and loops.
  • Use arrays and functions effectively.
  • Develop programming-based problem-solving skills.
Back to Courses

Discrete Mathematics

This course provides the mathematical foundation required for computer science, including logic, set theory, relations, functions, counting, recurrence, trees, and graph theory.

Main Topics

  • Propositional logic
  • Predicate logic
  • Set theory
  • Relations and functions
  • Counting principles
  • Recurrence relations
  • Graph theory
  • Trees

Learning Outcomes

  • Apply logical reasoning in problem solving.
  • Understand sets, relations, and functions.
  • Use counting techniques in computing problems.
  • Analyze graph-based problems.
Back to Courses

Course Instructor

Dr. Mohammad Salah Uddin

The instructor will guide students through programming, mathematical reasoning, sustainable computing, and computational problem-solving concepts.

Students are encouraged to attend classes regularly, complete assignments, participate in lab work, and practice problem solving consistently.

Contact Information

For academic guidance, students may contact the department or course instructor.

Department: Department of Computer Science and Engineering

Web: https://www.ewubd.edu/faculty-profile/uddin

Email: uddin@ewubd.edu

Office Hour: Click Here