CMS-A-CC-3-7-TH: Operating Systems Core Course- 7: Theory, Credit: 04, Contact hours: 60.

 Introduction

Basic OS functions, types of operating systems- batch processing, multiprogramming, time

sharing, multiprocessing, distributed and real time systems.

6 hours

Operating System Organization

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

6 hours

Process

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;

18 hours

Deadlock:

Definition, Prevention, Avoidance, Detection, Recovery.

9 hours

Memory Management

Physical and logical address space; memory allocation strategies – fixed and variable

partitions, paging, segmentation, virtual memory

14 hours

File and I/O Management

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

5 hours

Protection and Security

Policy mechanism, Authentication

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.

CMS-A-CC-3-6-TH: Computational Mathematics Core Course- 6: Theory, Credits: 04, Contact hours: 60.

 Introduction

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.

10 hours

Introduction to Probability

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.

10 hours

Growth of Functions

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

04 hours

Recurrences

Relations, Generating Functions, Linear Recurrence Relations with Constant Coefficients

and their solution, Substitution Method, Recurrence Trees.

06 hours

Numerical Methods (Algorithmic Approach)

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 ei 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

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-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.

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)

Computer Types, Basic Functional Units, Basic Operational Concept, Bus Structure,

Software, Performance, Multiprocessor and Multicomputer, IAS Computer, Historical

perspectives.

05 hours

Register Transfer and Micro-operation

Register Transfer Language, Register Transfer, Bus and Memory Transfers, Three State Bus

Buffers, memory Transfer, Arithmetic and Logical micro-operations, Shift and Arithmetic

shifts.

05 hours

Basic Computer Organization and Design

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.

05 hours

CPU Organization

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.

06 hours

Control Unit

Hardwired Control Unit, Micro-programmed Control Unit: Control memory, Address

Sequencing, conditional branching, mapping of instructions, subroutine, Design of Control

Unit.

07 hours

CPU Registers

Program Counter, Stack Pointer Register, Memory Address Register, Instruction Register,

Memory Buffer Register, Flag registers, Temporary Registers.

06 hours

Instructions.

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

Introduction, relative merits and De-merits.

03 hours

Computer Peripherals

VDU, Keyboard, Mouse, Printer, Scanner (Qualitative approach).

08 hours

Input / Output Organization

Polling, Interrupts, subroutines, Memory mapped IO, IO mapped IO, DMA, I/O Bus and

Protocol, SCSI, PCI, USB, Bus Arbitration.

02 hours

Memory

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-2-4-P: Basic Electronic Devices and Circuits Lab. Core Course-4: Practical, Credits - 02, Contact hours - 40.

 1. Study the forward characteristic of a p-n junction diode and calculate the static and dynamic

resistance.

2. Construct a Half wave rectifier using power diodes and study its load regulation characteristics

with and without capacitor filter.

3. Construct a full wave rectifier using power diodes and study its load regulation characteristics

with and without capacitor filter.

4. Construct a Bridge rectifier using power diodes and study its load regulation characteristics

with and without capacitor filter.

5. Study the reverse characteristic of a Zener diode and calculate the Zener voltage from the

characteristic curve and also calculate the value of current limiting resistance.

6. Construct a voltage regulator using Zener diode and study its load regulation characteristics.

7. Construct a positive and negative voltage regulator using three terminal linear voltage

regulators 78XX and 79XX. Study its load regulation characteristics.

8. Construct a variable positive voltage regulator using three terminal linear voltage regulator

LM317 and study its load regulation characteristics for different sets of output voltage.

9. Study the output characteristics of a transistor in CE mode and calculate the dc current gain (β)

from the graph.

10. Realize a NOT operation using a Transistor. Draw its transfer characteristics and measure the

threshold voltage.

11. Construct and study an Inverting amplifier using OPAMP with different sets of voltage gain

and calculate the gain from the graph.

12. Construct and study a non-inverting amplifier using OPAMP with different sets of voltage gain

and calculate the gain from the graph.

13. Construct and study an inverting adder using OPAMP capable of adding two inputs.

14. Construct and study a non-inverting adder using OPAMP capable of adding two inputs.

15. Construct and study a subtractor using OPAMP.

16. Construct and study the OPAMP as a subtractor.

17. Construct and study the OPAMP as a differentiator. Apply sine and square wave and study and

record the output waveforms.

18. Construct and study the OPAMP as an integrator. Apply sine and square wave and study and

record the output waveforms.

19. Construct an astable multivibrator using Timer 555.

20. Construct and study a R-2R ladder digital to analog converter.

21. Convert an analog signal into digital using ADC 0804/0808/0809.

CMS-A-CC-2-4-TH: Basic Electronic Devices and Circuits Core Course-4: Theory, Credits - 04, Contact hours - 60.

 Basics of Circuit Theory

KVL, KCL, Thevenin's, Norton's, superposition, maximum power transfer theorem,

application to simple problems.

04 hours

Theory of Semiconductor devices

Semiconductor materials and their properties, classification based on energy band

diagram, Intrinsic and extrinsic semiconductors, P & N type.

03 hours

Diode and its applications

PN junction diode: Construction, characteristics and working principle, unbiased and

biased band diagram, Single Phase Half and Full wave rectifier circuits, working principle,

derivation and calculation of average dc current, average dc voltage, RMS, ripple factor,

efficiency, Peak Inverse Voltage (PIV), Circuit and working of bridge rectifiers.

Zener diode: Characteristics and its application as a voltage regulator, simple problems.

09 hours

Bipolar Junction Transistor

Working Principle of Junction bipolar Transistor (including current components, current

gains), Modes: Common Emitter (CE), Common Base (CB), Common Collector (CC), DC

biasing in CE mode: Fixed bias, Emitter Stabilized bias, Voltage divider bias and

Collector feedback bias, simple related numerical problems, Q-Point, dc load line analysis,

single stage CE mode based transistor amplifying action (qualitative study).

Inverter using transistors: Transistor as a switch, transfer characteristics and threshold

voltages.

08 hours

Unipolar Junction Transistor

Principle of JFET and MOSFET, Depletion and Enhancement mode operations, Concept of

NMOS, PMOS and CMOS. CMOS circuits for basic logic gates (AND, OR, NOT, NAND

and NOR).

08 hours

PNPN Devices

Construction, characteristics, working and simple applications: SCR, DIAC, TRIAC.

Power supply (qualitative study only): SCR regulated power supply, Switch Mode Power

Supply (SMPS).

06 hours

Optoelectronic materials (Qualitative study)

Construction and working: LED, LCD, Photo Sensors and basics of Optical fiber and

Opto-couplers).

02 hours

Operational Amplifiers (OPAMP)

Ideal Characteristics, Open loop operation, Single and double ended operation, Common

mode operation, Common mode rejection ratio (CMRR), Offset parameters, Concept of

Virtual ground.

Application: Inverting, Non-inverting Amplifier, Inverting and Non-inverting Adder,

Differentiator, Integrator, Scale changer and Schmitt Trigger.

Signal Generation using OPAMP: Monostable, Astable (Square wave generator).

12 hours

Timer

Construction and Functional description of 555, Mono-stable, Bi-stable and Astable

Operation, VCO.

Data Acquisition

Digital to Analog Converter (DAC): R-2R ladder, Weighted resistor type.

Analog to Digital Converters (ADC): Flash, Counter, Successive Approximation Register

(SAR), Dual Slope type.

CMS-A-CC-2-3-P: Data Structure Lab using C. Core Course- 3: Practical, Credits - 02, Contact hours - 40.

 1. Write a program to search an element from a list. Give user the option to perform Linear or

Binary search.

2. Write a program to sort a list of elements. Give user the option to perform sorting using Insertion

sort, Bubble sort or Selection sort.

3. Implement Linked List. Include functions for insertion, deletion and search of a number, reverse

the list and concatenate two linked lists.

4. Implement Doubly Linked List. Include functions for insertion, deletion and search of a number,

reverse the list.

5. Implement Circular Linked List. Include functions for insertion, deletion and search of a

number, reverse the list.

6. Perform Stack operations using Linked List implementation.

7. Perform Stack operations using Array implementation.

8. Perform Queue operations using Array and linked list implementation.

9. Create and perform different operations on Double-ended Queues using Linked List

implementation.

10. Write a program to scan a polynomial using linked list and add two polynomials.

11. Write a program to create a Binary Search Tree and include following operations in tree:

(a) Insertion (Recursive and Iterative Implementation).

(b) Deletion.

(c) Search a node in BST.

(d) Display its preorder, postorder and inorder traversals recursively.

(e) Display its preorder, postorder and inorder traversals Iteratively.

(f) Display its level-by-level traversals.

(g) Count the non-leaf nodes and leaf nodes.

(h) Display height of tree.

(i) Create a mirror image of tree.

12. Write a program to reverse the order of the elements in the stack using additional stack.

13. Write a program to reverse the order of the elements in the stack using additional Queue.

CMS-A-CC-2-3-TH: Data Structure Core Course-3: Theory, Credits - 04, Contact hours - 60.

 Introduction to Data Structure

Abstract Data Type.

Arrays

1D, 2D and Multi-dimensional Arrays, Sparse Matrices. Polynomial representation

Linked Lists

Singly, Circular and Doubly Lists, Polynomial representation.

Stacks

Array and linked representation of stack, Prefix, Infix and Postfix expressions, utility and

conversion of these expressions from one to another, evaluation of postfix and prefix

expression using stack, applications of stack, limitations of Array representation of stack.

Queues

Array and Linked representation of Queue, Circular Queue, De-queue, Priority Queues.

Recursion

Developing Recursive Definition of Simple Problems and their implementation; Advantages

and Limitations of Recursion; Understanding what goes behind Recursion (Internal Stack

Implementation), Tail recursion.

Trees

Introduction to Tree as a data structure: Binary Trees (Recursive and Iterative Traversals),

Binary Search Tree (Traversal, Insertion, Deletion and Searching), Threaded Binary Trees

(Traversal and advantages).

Searching and Sorting

Linear Search, Binary Search, Comparison of Linear and Binary Search with respect to time

complexity, Selection Sort, Bubble sort, Insertion Sort, Merge Sort, Quick sort, Heap sort,

Shell Sort, Radix sort, Comparison of Sorting Techniques with respect to time complexity.

Hashing

Introduction to Hashing, Different hashing Techniques, Collision and resolving collision by

Open Addressing, Closed Hashing, Separate Chaining, Choosing a Hash Function.

CMS-A-CC-1-2-P: Programming with C Core Course-2: Practical: 02 Credits: 40 hours

 1. WAP to print the sum and product of digits of an integer.

2.WAP to reverse a number.

3. WAP to compute the sum of the first n terms of the following series,

S=1+1/2+1/3+1/4+……

4. WAP to compute the sum of the first n terms of the following series, S =1-2+3-

4+5…………….

5. Write a function that checks whether a given string is Palindrome or not. Use this function

to find whether the string entered by user is Palindrome or not.

6.Write a function to find whether a given no. is prime or not. Use the same to generate the

prime numbers less than 100.

7. WAP to compute the factors of a given number.

8. Write a macro that swaps two numbers. WAP to use it.

9.WAP to print a triangle of stars as follows (take number of lines from user):

                *

              ***

           *****

        *******

     *********

10. 10.WAP to perform following actions on an array entered by the user :

i) Print the even-valued elements

ii) Print the odd-valued elements

iii) Calculate and print the sum and average of the elements of array

iv) Print the maximum and minimum element of array

v) Remove the duplicates from the array

vi) Print the array in reverse order

The program should present a menu to the user and ask for one of the options. The menu

should also include options to re-enter array and to quit the program.

11. WAP that prints a table indicating the number of occurrences of each alphabet in the text

entered as command line arguments.

12. Write a program that swaps two numbers using pointers.

13. Write a program in which a function is passed address of two variables and then alter its

contents.

14. Write a program which takes the radius of a circle as input from the user, passes it to

another function that computes the area and the circumference of the circle and displays

the value of area and circumference from the main() function.

15. Write a program to find sum of n elements entered by the user. To write this program,

allocate memory dynamically using malloc() / calloc() functions or new operator.

16. Write a menu driven program to perform following operations on strings:

a) Show address of each character in string

b) Concatenate two strings without using strcat function.

c) Concatenate two strings using strcat function.

d) Compare two strings

e) Calculate length of the string (use pointers)

f) Convert all lowercase characters to uppercase

g) Convert all uppercase characters to lowercase

h) Calculate number of vowels

i) Reverse the string

17. Given two ordered arrays of integers, write a program to merge the two-arrays to get an

ordered array.

18. WAP to display Fibonacci series (i) using recursion, (ii) using iteration.

19. WAP to calculate Factorial of a number (i) using recursion, (ii) using iteration.

20. WAP to calculate GCD of two numbers (i) with recursion (ii) without recursion.

21. Write a menu-driven program to perform following Matrix operations (2-D array

implementation): a) Sum b) Difference c) Product d) Transpose

22. Copy the contents of one text file to another file, after removing all whitespaces.

23. Write a function that reverses the elements of an array in place. The function must accept

only one pointer value and return void.

24. Write a program that will read 10 integers from user and store them in an array.

Implement array using pointers. The program will print the array elements in ascending

and descending order.

25. Add two distances in meter kilometer system using structure.

26. Add two complex numbers using structures.

27. Calculate the difference between two time periods using structures.

These are only examples; more can be included related to the theory.

Use open source C compiler.