School of Electronic Engineering and Computer Science

People menu

Mr Zia Khan


Room Number: Engineering, Eng 358


Computability, Complexity and Algorithms (Undergraduate)

A theoretical course, which concerned with the theoretical core of Computer Science. The course covers some of the most successful algorithms as well as some of the most central decision problems. A large part of the course will focus on the NP versus P problem as well as other famous unsolved problem in Computer Science. To understand this problem we consider the issue of how one programming problem can be disguised as another apparently very different problem. This idea is very important in designing algorithms and plays a crucial role in the theory of NP-completeness.

Digital Circuit Design (Undergraduate)

The module covers: Number Systems and Codes; Boolean Algebra and Basic Logic Functions; MAP minimisation; Combinational Logic; Synchronous Sequential Logic; VHDL

Electric and Magnetic Fields (Undergraduate)

This module covers the basic laws of electric and magnetic fields, their application to elementary problems involving steady and time changing fields and currents, and an introduction to electromagnetic radiation. The Maxwell Equations, which explain the relationships between time varying electric and magnetic fields, will be introduced. The emphasis is on physical intuition and visualisation supported by mathematical modelling and analysis and labs.

Electronic Devices and Applications (Undergraduate)

This module describes the physical basis behind common semiconductor devices including the pn junction diode, bipolar junction transistor, MOSFET and related devices (NMOS, PMOS, CMOS) and Operational Amplifiers. Basic circuits using these devices are discussed including rectifiers, amplifiers, inverters, integrators, differentiators, and summing circuits.


Return to top