This is an introductory course on the architecture & organization of modern processors, with emphasis on pipelined RISC machines; gain understanding of the design of the memory subsystem, I/O, and system level interconnect; become proficient in the use of tools such as VHDL and for the description, simulation, and verification of architectural designs; complete a series of assignments leading to the design, implemention, validation and assessment of a RISC system. It is assumed students are familiar with combinational and sequential logic design principles.

The aim of this course is to make the students aware of different data types and data structure such as lists, trees and graphs and associated algorithms. Later, they are expected to use these different data structures and algorithms efficiently in their software development. Emphasis is also given to concepts such as abstraction and interfaces. They are also taught the techniques used in performing complexity analysis of algorithms. Java will be used as the programming tool for this course.

This course is formulated around the C programming language. This is a 100% lab based course (with continuous projects) and will show the students how system programmers use C for building their targets. The Department offers this course for the first time and we strongly believe that the students will enjoy following this course as we do offering it!

The first course in Embedded Systems. Even though, the focus is mainly on hardware, the course deals with a huge amount of micro-controller programming in the labs. Theory and hands-on experiences will include micro-controllers and their memory architectures, interfacing with the analogue world, timers, etc.

Theory of computation is a course of abstractions about what we can compute. It is the purest of all computer science topics attempting to strip away any details about the real computer and replacing it with abstractions that give a hierarchy of capabilities culminating in a Turing Machine, the abstract model of our modern computer, invented by Alan Turing. Abstractions give us a way of saying something about what we are doing in a rigorous formal way.

We will study Automata (Finite State Machines), Computability and Complexity: They are linked by the question: “What are the fundamental capabilities and limitations of computers?”

Finite state machines are used in string searching algorithms, compiler design, control unit design in computer architecture, and many other modeling applications. Context free grammars and their restricted forms are the basis of compilers and parsing. NP-Complete theory helps us distinguish the tractable from the intractable.