- Teacher: Tanzim Hossain
Course Overview
There is no content in this section.
To add content, click on the above link ‘Edit course text’
Course Content
Enrolment options
Latest Courses
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.
Welcome to the Operating System and System Programming Lab course. This course introduces about the tools used to develop modern operating systems (OS). The focuses of this course is UNIX-based operating systems, though alternative operating systems, including MS Windows are introduced. This course is divided into two parts. The first part is about GNU/Linux command line interface. Where around 50 important commands are exercised. The second parts is about GNU/Linux application programming interface. In this part the creation and control of processes and threads are practiced. The cooperative process resource share management system and some advanced topics in the field of concurrency (synchronization, mutual exclusion, deadlock, starvation), memory (both primary and secondary) management and input/output file organization are practiced.