Web Engineering (Summer 2025)

Mohseu Minhaj Niloy

Welcome to Theory of Computing Course! This course has been designed for students pursuing a degree in any information technology or computer science related field. It attempts to help students grasp the essential concepts involved in automata theory. Learn Aotomata Theory- Simply easy learning Automata Theory is a branch of computer science that deals with designing abstract selfpropelled computing devices that follow a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton. This is a brief and concise course that introduces the fundamental concepts of Finite Automata, Regular Languages, and Pushdown Automata before moving onto Turing machines and Decidability. Prerequisites:  To enter this course you need to have those following topics idea - This tutorial has a good balance between theory and mathematical rigor. The readers are expected to have a basic understanding of discrete mathematical structures.    

Mujahidul Islam

  Welcome to The Software Engineering Web Application Course!    My hope is that by the end of this course you have a new appreciation for the subject matter and will continue your education in the subject. Career Path- Become a Web Developer This course is designed to start you on a path toward future studies in web development and design, no matter how little experience or technical knowledge you currently have. The web is a very big place, and if you are the typical internet user, you probably visit several websites every day, whether for business, entertainment, or education. But have you ever wondered how these websites actually work? How are they built? How do browsers, computers, and mobile devices interact with the web? What skills are necessary to build a website? With almost 1 billion websites now on the internet, the answers to these questions could be your first step toward a better understanding of the internet and developing a new set of internet skills. By the end of this course, you’ll be able to describe the structure and functionality of the world wide web, create dynamic web pages using a combination of HTML, CSS, JavaScript, Ajax, and  PHP, apply essential programming language concepts when creating HTML forms, select an appropriate web hosting service, and publish your webpages for the world to see. Finally, you’ll be able to develop a working model for creating your own personal or business websites in the future and be fully prepared to take the next step in more advanced web development or design course or specialization. Prerequisites:  To enter this course you need to have those following topics idea -   Basic Programming Language knowledge,   Object-Oriented Software Development,   Database system knowledge. 

Arpita Ghose Tusi

Discrete mathematics is a branch of mathematics that deals with finite and discrete objects, such as integers, sets, graphs, logic, and algorithms. It is often used as a foundation for computer science, software engineering, cryptography, data science, and other fields that involve computation and information. In this course the following topics will be covered: Logic and proofs: how to use symbols, truth tables, and rules of inference to reason about propositions, predicates, and quantifiers. Sets and functions: how to define, manipulate, and compare sets, relations, functions, and cardinality. Number theory and cryptography: how to use modular arithmetic, divisibility, prime numbers, and congruences to encrypt and decrypt messages, and to test the security of cryptographic schemes. Combinatorics and probability: how to count and enumerate objects, permutations, combinations, binomial coefficients, and apply the principles of inclusion-exclusion, pigeonhole, and induction. Recursion and recurrence relations: how to define and solve problems that involve recursive definitions, such as Fibonacci numbers, factorial, and Tower of Hanoi. Graph theory and algorithms: how to represent, traverse, and analyze graphs, trees, networks, and their properties, such as connectivity, coloring, Eulerian and Hamiltonian paths, and planarity. Computability and complexity: how to classify problems and algorithms according to their decidability, solvability, and efficiency, using concepts such as Turing machines, halting problems, NP-completeness, and big-O notation.