Semester - III

Course Type Course Code Course Name Credit

Core Theory CMS-A-CC-3-5-TH Computer Organization & Architecture 4
Course -5 Practical CMS-A-CC-3-5-P Computer Organization Lab 2
Core Theory CMS-A-CC-3-6-TH Computational Mathematics 4
Course -6 Practical CMS-A-CC-3-6-P Computational Mathematics Lab 2
Core Theory CMS-A-CC-3-7-TH Operating Systems 4
Course -7 Practical CMS-A-CC-3-7-P Operating Systems Lab 2
Skill Enhancement Course (SEC-A)
(Candidate has to opt any one from the under mentioned courses)
Course Type Course Code Course Name Credit
SEC-A-1 Theory CMS-A-SEC-A-3-1-TH Computer Graphics 2
SEC-A-2 Theory CMS-A-SEC-A-3-2-TH IoT (Internet of Things) 2

CMS-A-CC-3-5-TH: Computer Organization and Architecture

Core Course- 5: Theory, Credits:04, Contact hours: 60.

Basic Structure of Computers (Qualitative Discussion) 05 hours

Computer Types, Basic Functional Units, Basic Operational Concept, Bus Structure,
Software, Performance, Multiprocessor and Multicomputer, IAS Computer, Historical
perspectives.
Register Transfer and Micro-operation 05 hours
Register Transfer Language, Register Transfer, Bus and Memory Transfers, Three State Bus
Buffers, memory Transfer, Arithmetic and Logical micro-operations, Shift and Arithmetic
shifts.
Basic Computer Organization and Design 05 hours
Instruction Codes, Stored Program Organization, Indirect Address, Computer Registers,
Common Bus System, Computer Instruction, Timing and Control, Instruction Cycle, fetch
Decode, Register Reference Instructions, Memory Reference Instruction, Input-Output and
Interrupt, Design of Basic Computer, Design of Accumulator Logic.
CPU Organization 06 hours
Arithmetic and Logic Unit (ALU)- Combinational ALU, 2'S Complement Addition,
Subtraction Unit, Booths Algorithm for Multiplication, Division Hardware using Restoration
Division Algorithm.
General register organization, Control Word, Accumulator Based, Register Based, Stack
Type CPU organization.
Control Unit 07 hours
Hardwired Control Unit, Micro-programmed Control Unit: Control memory, Address
Sequencing, conditional branching, mapping of instructions, subroutine, Design of Control
Unit.
CPU Registers 06 hours
Program Counter, Stack Pointer Register, Memory Address Register, Instruction Register,
Memory Buffer Register, Flag registers, Temporary Registers.
Instructions. 03 hours
Operational Code, Operands, Zero, One, Two and Three Address Instruction, Instruction
Types, Addressing modes, Data Transfer and Manipulation instructions, Program control
instructions.
CISC and RISC processors 03 hours
Introduction, relative merits and De-merits.
Computer Peripherals 08 hours
VDU, Keyboard, Mouse, Printer, Scanner (Qualitative approach).
Input / Output Organization 02 hours
Polling, Interrupts, subroutines, Memory mapped IO, IO mapped IO, DMA, I/O Bus and
Protocol, SCSI, PCI, USB, Bus Arbitration.
Memory 10 hours
Primary memory: ROM, PROM, EPROM, EEPROM, Flash memory, RAM: SRAM,
DRAM, Asynchronous DRAMs, Synchronous DRAMs, Structure of Larger Memories,
RAMBUS Memory, Cache Memory: Mapping Functions, Replacement Algorithms,
interleaving, Hit and Rate penalty, Virtual memories, Address Translation, Memory
Management requirements, Secondary Storage: Magnetic Hard Disks, Optical Disks,
Magnetic Tape Systems.

CMS-A-CC-3-5-P: Computer Organization Lab.

Core Course-5, Practical, Credits: 02, Contact hours:40.

(1). Construct an Arithmetic Unit capable of performing 4-bit subtraction and Addition using 2's
complement method. Use Parallel Adders and other necessary logic gates.
(2). Construct a logical unit using logic gates capable of performing 4-bit, Bitwise ORing, ANDing,
XORing and inversion.
(3). Construct a 4-bit ALU unit which can perform the following operation;

Selection Function
S1 S0

0 0 Addition

0 1 Subtraction

1 0 XOR-ing

1 1 Complement

(4). Construct a 2-bit Carry Look Ahead Adder using logic gates.
(5). Study and Construct a 1-digit BCD/Decimal adder using parallel adders and other necessary logic
gates.
(6). Construct a Binary Multiplier using basic logic gates.
(7). Construct a Binary Divider using basic logic gates.
(8). Subtraction with 1's complement method using parallel adders and other necessary logic gates.
(9). Construction of BCD Subtractor with 9'S complement method using parallel adders and logic gates.
(10). Construction of BCD Subtractor with 10'S complement method using parallel adders and logic
gates.
(11). Binary magnitude comparators (up to 4 bits) using parallel adder and logic gates.
(12). Construct a Binary 4-bit and 8-bit adder using logic gates.
(13). Construct a Serial in Serial out 4-bit register.
(14). Construct a 4-bit Universal Shift register.
(15). Construct a 4 bit ring counter.
(16). Construct a 4 - bit Johnson Counter.
(17) Construct RAM (4-bit) and extend it
(18). Horizontal and Vertical Cascading of Memory modules.
(19). Code converters using memory modules.

Text/Reference Books
1. Computer System Architecture, Morries Mano, Pearson.
2. Computer Organization & Architecture, Williams Stallings, Pearson.
3. Computer Organization, Hamacher, Vranesic and Zaky, McGraw Hill.
4. Computer Architecture and Organization, Govindrajalu, Tata McGraw Hill.
5. Computer Architecture and Organization, J P Hayes, Tata McGraw Hill.
6. Structured Computer Organization, Andrew S. Tanenbaum, Austin, Pearson.

CMS-A-CC-3-6-TH: Computational Mathematics

Core Course- 6: Theory, Credits: 04, Contact hours: 60.

Introduction 10 hours
Set Theory: Finite and Infinite Sets, Uncountable Infinite Sets, Relations: Properties of
Binary Relations, Closure, Partial Ordering Relations, Equivalence, Functions: definition,
one-to-one, onto and invertible, Mathematical Functions: Exponential and Logarithmic,
Counting: Mathematical Induction, Pigeonhole Principle, Permutation and Combination,
Binomial Theorem, Principle of Inclusion and Exclusion.

Introduction to Probability 10 hours

Elementary events, Sample space, Classical and Axiomatic definition of Probability,
Theorems on Total Probability, Conditional Probability, Bernoulli Trials and Binomial
Distribution, Bayes’ Theorem, Random Variables, Expectation, Variance, Standard
Deviation.

Growth of Functions 04 hours

Asymptotic Notations, Standard notations and common functions with simple examples.

Recurrences 06 hours
Relations, Generating Functions, Linear Recurrence Relations with Constant Coefficients
and their solution, Substitution Method, Recurrence Trees.

Numerical Methods (Algorithmic Approach) 20 hours

Errors: Approximate and Rounding of Numbers, Significant digits, Errors and their types,
Propagation of errors.
Interpolation: Newton Forward and Backward interpolation, Lagrange interpolation.
Solving a Set of Linear Equations: Gaussian Elimination, Gauss–Jordan, Iteration methods
a n d t h e i r convergence conditions, Gauss-Seidel, Gauss-Jacobi Iterative Methods.
Solving Non-linear equations: Bisection, Regula-falsi, Secant and Newton-Raphson, their
order of convergence.
Solving Differential Equations: Euler, Runge-Kutta second and fourth order methods.
Numerical Integration:
Trapezoidal and Simpson’s 1/3rd rules.
Curve fitting :
Least square approximation, Linear regression, Polynomial regression, Fitting Exponential
and Trigonometric functions.
Graph Theory 10 hours
Basic Terminology, Models and Types, Multi graphs and Weighted graphs, Graph
Representation, Graph Isomorphism, Connectivity, Euler and Hamiltonian Paths and
Circuits, Planar Graphs, Trees and their basic terminologies and properties.

CMS-A-CC-3-6-P: Computational Mathematics Lab.

Core Course- 6: Practical, Credits:02, Contact hours: 40.

Lab. based on Numerical Methods using C.

Text/ Reference Books:

1. Elements of Discrete mathematics, C.L. Liu & Mahapatra, Tata McGraw Hill.
2. Discrete Mathematics and Its Applications, Rosen, McGraw Hill.
3. Introduction to algorithms, T.H. Cormen, C.E. Leiserson, R. L. Rivest, Prentice Hall .
4. Discrete Mathematics with Algorithms, M. O. Albertson and J. P. Hutchinson, John
Wiley Publication.
5. Discrete Structures, Logic, and Computability, J. L. Hein, Jones and Bartlett Publishers.
6. Essentials of Discrete Mathematics, D.J. Hunter, Jones and Bartlett Publishers.
7. Numerical Analysis and Computational Procedures by Mollah, New Central Book.
8. Computer Oriented Numerical Methods, 3rd Edition, V Rajaraman, PHI
9. Graph Theory With Applications To Engineering And Computer Science by Narsingh
Deo, PHI.
10. Graph Theory by J.A. Bondy and U.S.R. Murty, Springer.
11. Introduction to Graph Theory by D B West, 2nd edition, Pearson Education

CMS-A-CC-3-7-TH: Operating Systems

Core Course- 7: Theory, Credit: 04, Contact hours: 60.

Introduction 6 hours
Basic OS functions, types of operating systems- batch processing, multiprogramming, time
sharing, multiprocessing, distributed and real time systems.

Operating System Organization 6 hours

Processor and user modes, kernels, system calls and system programs.

Process 18 hours
System view of the process and resources, process control block, I/O and CPU bound
process, process hierarchy, concept of threads
Process Scheduling: Preemptive and non-preemptive scheduling, Long term scheduling,
short term/CPU scheduling (FCFS, SJF, SRJF, RR and priority) and medium term
scheduling
Process Synchronization: Concurrent processes, critical section, semaphores and
application, methods for inter-process communication;

Deadlock: 9 hours
Definition, Prevention, Avoidance, Detection, Recovery.
Memory Management 14 hours
Physical and logical address space; memory allocation strategies – fixed and variable
partitions, paging, segmentation, virtual memory

File and I/O Management 5 hours

Directory structure, file operations, file allocation methods, disk management.

Protection and Security 2 hours

Policy mechanism, Authentication

CMS-A-CC-3-7-P: Operating Systems Lab.

Core Course- 7: Practical, Credit: 02, Contact hours: 40.
Shell programming in LINUX
1. Write a shell script to convert the content of a file from lower case to upper case.
2. Write a shell script to count the words, lines and characters of a given file. File name should be
provided at run time.
3. Write a shell script that take a word from user and find out the frequency of the word in a given
file.
4. Write a shell script that gets executed at the moment of user login and it displays Good Morning,
Good afternoon, Good Evening, Good Night, depending upon the time at which the user logs on.
5. Write a shell script to print Pascal diamond.
6. Write a shell script to find a number using sequential search method.
7. Write a shell script to find a number using binary search technique.
8. Write a shell script to sort a set of integer numbers using bubble sort.
9. Write a shell script to find out the factorial of a given number.
10. Write a shell script to reverse a string and check whether it is a palindrome.
11. Write a shell script to find the roots of a quadratic equation ax2 + bx +c = 0, considering all
possible cases.
12. Write a shell script for menu based system to insert records for employees with employee ID,
name, designation, salary in a data file, also display records when necessary. Display salary for
the employee asked.

These are only examples, more can be included.

Text/ Reference Books

1. Operating Systems Concepts, A Silberschatz, P.B. Galvin, G. Gagne, John Wiley

Publications.
rd
2. Modern Operating Systems, A.S. Tanenbaum, 3 Edition, Pearson Education.
3. Operating Systems: A Modern Perspective, G. Nutt, Pearson Education.
4. Operating Systems, Internals & Design Principles W.Stallings, PHI.
5. Operating Systems- Concepts and design, M. Milenkovic, Tata McGraw Hill.
6. Sumitabha Das , UNIX Concepts and Applications, Tata McGraw-Hill.
7. Understanding the Linux Kernel,D. P. Bovet and M. Cesati, O'Reilly.
 CMS-A-SEC-A-3-1-TH: Computer Graphics
Skill Enhancement Course: SEC-A: Choice -1: Theory, Credit:02, Contact hours: 40.

Introduction 05 hours
Basic concepts of Graphics Devices– CRT monitor, Monochrome and Color Monitor
displaying technique only, Physical and logical units of graphics devices – Pixel and its
different properties, Basic idea for image or picture formation using pixels – Raster Scan and
Vector Scan.

Basic geometrical shapes formation algorithms 05 hours

Concepts Co-ordinate System, Line Segment, Digital Differential Analyzer, Circle and arc
segment, elliptic segment, Bresenham’s and Midpoint scan conversion algorithms.

Two and Three Dimensional Transformations 14 hours

Transformations operations - Translation, Rotation, Scaling. Reflection, Shearing and Inverse
of these operations, Homogeneous coordinate system representation, matrix representation.
Composite Transformations Operations – Basic ideas and matrix representations by matrix
concatenation for a particular operation.

Two Dimensional Clipping 08 hours

View port, window port, display device, Point Clipping, Line Clipping, Cohen-Sutherland
line clipping algorithm, Sutherland Hudgeman polygon clipping algorithm

Projection 06 hours
Basic Concept of Projection operation and its application, Classification – Perspective,
Parallel and its subclasses, Principles of these projections (Geometric representation only, no
Mathematical Foundation and algorithms)

Applications 02 hours
Basic Concepts Computer Art, Animation – Animating and modeling of real world,
Morphing – Classification of morphing and Application to the Advertisements and
publicities.
Text/ Reference Books:

1. Computer Graphics by Zhigang Xiang, Roy Plastock, Schaum’s Outlines Series.

2. Computer Graphics by Hearn & Baker, Pearson.
3. Procedural Elements for Computer Graphics by David F. Roger, 2nd Edition, TMH.
4. Computer Graphics by Foley, Van Dam, Feimer& John, Pearson.
5. Introduction to Computer Graphics and Multimedia, Mukhophadhyay and
Chattopadhyay, Vikas publication.

CMS-A-SEC-A-3-2-TH: Internet of Things (IoT)

Skill Enhancement Course: SEC-A: Choice -2, Theory, Credit:02, Contact hours: 40.

Introduction to Internet of Things (IoT) 04 hours

Defining IoT, Characteristics of IoT, Physical design of IoT, Functional blocks of IoT,
Communication models & APIs.

IoT and M2M 04 hours

Difference between IoT and M2M, Software defined Network, network function
virtualization (NFV), difference between SDN and NFV.
Network & Communication aspects 08 hours
Wireless medium access issues, MAC protocol survey, Survey routing protocols,
Sensor deployment & Node discovery, Edge connectivity and protocols, Fog/Gateway
Devices for Data aggregation and dissemination, Security challenges.

IoT Physical Servers and Cloud Offerings 05 hours

Introduction to Cloud Storage models and communication APIs Web Server – Web Server
for IoT, Cloud for IoT, Python web application framework.

Developing IoTs 08 hours

Introduction to Python, Introduction to different IoT tools, Developing applications
through IoT tools, Developing sensor based application through embedded system platform,
Implementing IoT concepts with python.

IoT Physical Devices and Endpoints Introduction to Raspberry PI-Interfaces (serial, SPI, 04 hours
I2C) Programming – Python program with Raspberry PI with focus of interfacing external
gadgets.

IoT Analytics 04 hours

Signal processing, real-time and local analytics, Databases, cloud analytics and applications.

Domain specific applications of IoT 03 hours

Home automation, Industry applications, Surveillance applications.

Text/ Reference Books:

1. Foundational Elements of an IoT Solution,J. Biron and J. Follett, O'Reilly Media.

2. IoT fundamentals, David, Pearson Education.
3. Internet of Things by Tripathy and Anuradha, CRC Press.
4. Internet of Things – A hands-on approach, ArshdeepBahga and VijayMadisetti,
Universities Press.
5. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O’Reilly.
6. Internet of Things by Bahga, Madishetty, Orient Blackswanpvtltd.