syllabus

:Operating system:

UNIT 1:

Introduction to Operating Systems: Function, Evolution, Different Types, Desirable

Characteristics and features of an O/S, Operating Systems Services: Types of Services, Different
ways of providing these Services – Utility Programs, System Calls.

UNIT 2:
File Systems: File Concept, User’s and System Programmer’s view of File System, Disk
Organization, Tape Organization, Different Modules of a File System, Disk Space Allocation
Methods – Contiguous, Linked, Indexed. Directory Structures, File Protection, System Calls for
File Management, Disk Scheduling Algorithms.

UNIT 3:
CPU Scheduling : Process Concept, Scheduling Concepts, Types of Schedulers, Process State
Diagram, Scheduling Algorithms, Algorithms Evaluation, System calls for Process Management;
Multiple Processor Scheduling; Concept of Threads.
Memory Management: Different Memory Management Techniques – Partitioning, Swapping,
Segmentation, Paging, Paged Segmentation, Comparison of these techniques, Techniques for
supporting the execution of large programs: Overlay, Dynamic Linking and Loading, Virtual
Memory – Concept, Implementation by Demand Paging etc.

UNIT 4:
Input / Output : Principles and Programming, Input/Output Problems, Asynchronous Operations,
Speed gap Format conversion, I/O Interfaces, Programme Controlled I/O, Interrupt Driven I/O,
Concurrent I/O.
Concurrent Processes : Real and Virtual Concurrency, Mutual Exclusion, Synchronization, Inter-
Process Communication, Critical Section Problem, Solution to Critical Section Problem :
Semaphores – Binary and Counting Semaphores, WAIT & SIGNAL Operations and their
implementation. Deadlocks: Deadlock Problems, Characterization, Prevention, Avoidance,
Recovery.

UNIT 5:
Introduction to Network, Distributed and Multiprocessor Operating Systems. Case Studies: Unix/Linux,
WINDOWS and other Contemporary Operating Systems.

:Mathematics 3:

UNIT 1:
Module 1: Numerical Methods – 1: (8 hours): Solution of polynomial and transcendental
equations – Bisection method, Newton-Raphson method and Regula-Falsi method. Finite
differences, Relation between operators, Interpolation using Newton’s forward and backward
difference formulae. Interpolation with unequal intervals: Newton’s divided difference and
Lagrange’s formulae.

UNIT 2:
Module 2: Numerical Methods – 2: (6 hours): Numerical Differentiation, Numerical integration:
Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules. Solution of Simultaneous Linear Algebraic
 syllabus
Equations by Gauss’s Elimination, Gauss’s Jordan, Crout’s methods, Jacobi’s, Gauss-Seidal, and
Relaxation method.,

UNIT 3:
Module 3: Numerical Methods – 3: (10 hours): Ordinary differential equations: Taylor’s series,
Euler and modified Euler’s methods. RungeKutta method of fourth order for solving first and
second order equations. Milne’s and Adam’s predicator-corrector methods. Partial differential
equations: Finite difference solution two dimensional Laplace equation and Poission equation,
Implicit and explicit methods for one dimensional heat equation (BenderSchmidt and Crank-
Nicholson methods), Finite difference explicit method for wave equation.

UNIT 4:
Module 4: Transform Calculus: (8 hours): Laplace Transform, Properties of Laplace Transform,
Laplace transform of periodic functions. Finding inverse Laplace transform by different methods,
convolution theorem. Evaluation of integrals by Laplace transform, solving ODEs by Laplace
Transform method, Fourier transforms.

UNIT 5:
Module 5: Concept of Probability: (8 hours): Probability Mass function, Probability Density
Function, Discrete Distribution: Binomial, Poisson’s, Continuous Distribution: Normal
Distribution, Exponential Distribution.

ANALYSIS DESIGN OF AL GORITHM

UNIT 1:
Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort.
Introduction to divide and conquer technique, analysis, design and comparison of various algorithms
based on this technique, example binary search, merge sort, quick sort, strassen’s matrix multiplication.

UNIT 2:
Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman coding,
minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path
algorithm

UNIT 3:
Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage
graph, reliability design, Floyd-Warshall algorithm

UNIT 4:
Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph coloring
problem etc. Introduction to branch & bound method, examples of branch and bound method like
traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem,
introduction to parallel algorithms.
 syllabus

UNIT 5:
Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for
trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.

SOFTWARE ENGINEERING

UNIT 1:
The Software Product and Software Process Software Product and Process Characteristics, Software
Process Models: LinearSequential Model, Prototyping Model, RAD Model, Evolutionary Process Models
likeIncremental Model, Spiral Model, Component Assembly Model, RUP and Agileprocesses. Software
Process customization and improvement, CMM, Product andProcess Metrics

UNIT 2:
Requirement Elicitation, Analysis, and Specification Functional and Non-functional requirements,
Requirement Sources and Elicitation Techniques, Analysis Modeling for Function-oriented and Object-
oriented software development, Use case Modeling, System and Software Requirement Specifications,
Requirement Validation, Traceability

UNIT 3:
Software Design The Software Design Process, Design Concepts and Principles, Software Modeling
andUML, Architectural Design, Architectural Views and Styles, User Interface Design, Functionoriented
Design, SA/SD Component Based Design, Design Metrics

UNIT 4:
Software Analysis and Testing Software Static and Dynamic analysis, Code inspections, Software
Testing, Fundamentals, Software Test Process, Testing Levels, Test Criteria, Test Case Design,
TestOracles, Test Techniques, Black-Box Testing, White-Box Unit Testing and Unit, Testing
Frameworks, Integration Testing, System Testing and other Specialized, Testing, Test Plan, Test
Metrics, Testing Tools. , Introduction to Object-oriented analysis, design and comparison with structured
Software Engg.

UNIT 5:
Software Maintenance & Software Project Measurement Need and Types of Maintenance, Software
Configuration Management (SCM), Software Change Management, Version Control, Change control
and Reporting, Program Comprehension Techniques, Re-engineering, Reverse Engineering, Tool
Support. Project Management Concepts, Feasilibility Analysis, Project and Process Planning,
Resources Allocations, Software efforts, Schedule, and Cost estimations, Project Scheduling and
Tracking, Risk Assessment and Mitigation, Software Quality Assurance(SQA). Project Plan, Project
Metrics

COMPUTER ORG. & ARCHITECTURE

 syllabus
UNIT 1:
Basic Structure of Computer: Structure of Desktop Computers, CPU: General Register
Organization-Memory Register, Instruction Register, Control Word, Stack Organization,
Instruction Format, ALU, I/O System, bus,CPU and Memory Program Counter, Bus Structure,
Register Transfer Language-Bus and Memory Transfer, addressing modes. Control Unit
Organization: Basic Concept of Instruction, Instruction Types, Micro Instruction Formats, Fetch
and Execution cycle, Hardwired control unit, Microprogrammed Control unit microprogram
sequencer Control Memory, Sequencing and Execution of Micro Instruction.

UNIT 2:
Computer Arithmetic: Addition and Subtraction, Tools Compliment Representation, Signed
Addition and Subtraction, Multiplication and division, Booths Algorithm, Division Operation,
Floating Point Arithmetic Operation. design of Arithmetic unit

UNIT 3:
I/O Organization:I/O Interface –PCI Bus, SCSI Bus, USB, Data Transfer: Serial, Parallel,
Synchronous, Asynchronous Modes of Data Transfer, Direct Memory Access(DMA), I/O
Processor.

UNIT 4:
Memory Organization: Main memory-RAM, ROM, Secondary Memory –Magnetic Tape, Disk,
Optical Storage, Cache Memory: Cache Structure and Design, Mapping Scheme, Replacement
Algorithm, Improving Cache Performance, Virtual Memory, memory management hardware

UNIT 5:
Multiprocessors: Characteristics of Multiprocessor, Structure of Multiprocessor-Interprocessor
Arbitration, Inter-Processor Communication and Synchronization. Memory in Multiprocessor
System, Concept of Pipelining, Vector Processing, Array Processing, RISC And CISC, Study of
Multicore Processor –Intel, AMD.