ANNA UNIVERSITY TIRUCHIRAPPALLI Regulations 2007 Syllabus SEMESTER IV
MA1252 – PROBABILITY AND QUEUEING THEORY
L T P
3 1 0
UNIT I PROBABILITY AND RANDOM VARIABLE 9
Axioms of Probability – Conditional Probability – Total Probability – Baye’s Theorem– Random
variable – Probability mass function – Probability density function – Properties – Moments – Moment
generating functions and their properties.
UNIT II STANDARD DISTRIBUTIONS 9
Binomial – Poisson – Uniform – Exponential – Gamma – Normal distributions and their properties –
Functions of a random variable – Chebyshev inequality.
UNIT III TWO DIMENSIONAL RANDOM VARIABLES 9
Joint distributions – Marginal and conditional distributions – Covariance – Correlation and regression –
Transformation of random variables – Central limit theorem.
UNIT IV RANDOM PROCESSES AND MARKOV CHAINS 9
Classification – Stationary process – Markov process – Poisson process – Birth and death process –
Markov chains – Transition probabilities – Limiting distributions.
UNIT V QUEUEING THEORY 9
Markovian models – M/M/1 – M/M/C – finite and infinite capacity – M/M/∞ queues – Finite source
model – M/G/1 queue (steady state solutions only) – Pollaczek – Khintchine formula – Special cases.
L: 45 T: 15 Total: 60
TEXT BOOKS
1. Ross S, “A first course in probability”, Sixth Edition, Pearson Education, 2006.
2. S.Karlin and H.M. Taylor., “An Introduction to Stochastic Modeling” Academic Press,
2007
3. Taha, H. A., “Operations Research-An Introduction”, Seventh Edition, Pearson Education,
2007.
REFERENCES
1. Veerarajan T, “Probability, Statistics and Random Processes”, Second Edition, Tata McGraw
Hill, 2003.
2. Richard A Johnson, “Probability and Statistics for Engineers”, Seventh Edition,
Pearson Education, 2005.
3. Gross D. and Harris, C.M., “Fundamentals of Queuing Theory”, Third Edition, John Wiley and
Sons, 1998.
ANNA UNIVERSITY TIRUCHIRAPPALLI Regulations 2007 Syllabus SEMESTER IV
CS1251 – DESIGN AND ANALYSIS OF ALGORITHMS
L T P
3 0 0
UNIT I BASIC CONCEPTS OF ALGORITHMS 8
Basic Concepts – Notion of Algorithm – Fundamentals of Algorithmic Solving – Important Problem
types – Fundamentals of Analysis Framework – Asymptotic Notations and Basic Efficiency Classes.
UNIT II MATHEMATICAL ASPECTS AND ANALYSIS OF ALGORITHMS 8
Mathematical Analysis of Non–recursive Algorithm – Mathematical Analysis of Recursive Algorithm
– Example Fibonacci Numbers – Empirical Analysis of Algorithms – Algorithm Visualization.
UNIT III ANALYSIS OF SORTING AND SEARCHING ALGORITHMS 10
Brute Force – Selection Sort and Bubble Sort – Sequential Search and Brute – Force String Matching –
Divide And Conquer – Merge Sort – Quick Sort – Binary Search – Binary Tree – Traversal and
Related Properties – Insertion Sort – Depth First Search and Breadth First Search.
UNIT IV ALGORITHMIC TECHNIQUES 10
Transform and Conquer – Presorting – Balanced Search Trees – AVL Trees – Heaps and Heap sort –
Dynamic Programming – Warshall’s and Floyd’s Algorithm – Optimal Binary Search Trees – Greedy
Techniques – Prim’s Algorithm – Kruskal’s Algorithm – Dijkstra’s Algorithm – Huffman Trees.
UNIT V ALGORITHM DESIGN METHODS 9
Backtracking – 8-Queen’s Problem – Hamiltonian Circuit Problem – Subset – Sum Problem – Branch
and Bound – Assignment Problem – Knapsack Problem – Traveling Salesman Problem.
Total: 45
TEXT BOOK
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithm”, Pearson Education,
2003.
REFERENCES
1. T.H. Cormen C.E. Leiserson, R.L. Rivest and C. Stein, “Introduction to Algorithms”, Second
Edition, PHI, 2007.
2. Sara Baase and Allen Van Gelder, “Computer Algorithms – Introduction to Design and
Analysis”, Pearson Education, 2003.
3. A.V.Aho J.E., Hopcroft and J.D.Ullman, “The Design and Analysis of Computer Algorithms”,
Pearson Education, 2003.
ANNA UNIVERSITY TIRUCHIRAPPALLI Regulations 2007 Syllabus SEMESTER IV
EC1207 – PRINCIPLES OF COMMUNICATION ENGINEERING
L T P
3 1 0
UNIT I AMPLITUDE MODULATION 9
Principles of Amplitude Modulation – AM Envelope – Frequency Spectrum and Bandwidth –
Modulation Index and Percent Modulation – AM Power Distribution – AM Modulator Circuits – Low
Level AM Modulator – Medium Power AM Modulator – AM Transmitters – Low Level Transmitters –
High Level Transmitters – Receiver Parameters – AM Receivers – TRF – Super Heterodyne Receivers
– Double Conversion AM Receivers.
UNIT II ANGLE MODULATION 9
Angle Modulation – FM and PM Waveforms – Phase Deviation and Modulation Index – Frequency
Deviation – Phase and Frequency Modulators and Demodulators – Frequency Spectrum of Angle
Modulated Waves – Bandwidth Requirement – Broadcast Band FM – Average Power FM and PM
Modulators – Direct FM and PM – Direct FM Transmitters – Indirect Transmitters – Angle Modulation
Vs. Amplitude Modulation. FM Receivers FM Demodulators – PLL FM Demodulators – FM Noise
Suppression – Frequency Vs. Phase Modulation.
UNIT III DIGITAL MODULATION 9
Introduction – Binary PSK – DPSK – Differentially Encoded PSK – QPSK – M–Ary PSK – Binary
FSK – MSK – GMSK – Duobinary Encoding – Performance Comparison of Various Systems of
Digital Modulation.
UNIT IV BASEBAND DATA TRANSMISSION 9
Sampling Theorem – Quadrature Sampling of Bandpass Signals – Reconstruction of Message from its
Samples – Signal Distortion in Sampling – Discrete PAM Signals – Power Spectra of Discrete PAM
Signals – ISI Nyquist Criterion for Distortion Less Base Band Binary Transmission – Eye Pattern –
Baseband M–ary PAM Systems – Adaptive Equalization for Data Transmission.
UNIT V SPREAD SPECTRUM AND MULTIPLE ACCESS TECHNIQUES 9
Introduction – Pseudo–Noise Sequence – DS Spread Spectrum With Coherent Binary PSK –
Processing Gain – FH Spread Spectrum – Multiple Access Techniques – Wireless Communications –
TDMA And CDMA – Wireless Communication Systems – Source Coding of Speech for Wireless
Communications.
L: 45 T: 15 Total: 60
TEXT BOOKS
1. Wayne Tomasi, “Electronic Communication Systems Fundamentals Through Advanced”,
Pearson Education, 2001.
2. Simon Haykin, “Digital Communications”, John Wiley and Sons, 2003.
REFERENCES
1. Simon Haykin, “Communication Systems”, Fourth Edition, John Wiley and Sons, 2001.
2. Taub and Schilling, “Principles of Communication Systems”, Second Edition, TMH, 2003.
3. Martin S.Roden, “Analog and Digital Communication System”, Third Edition, PHI, 2002.
4. Blake, “Electronic Communication Systems”, Second Edition, Thomson Delman, 2002.
ANNA UNIVERSITY TIRUCHIRAPPALLI Regulations 2007 Syllabus SEMESTER IV
CS1252 – SYSTEM SOFTWARE
L T P
3 0 0
UNIT I FUNDAMENTALS 8
System Software and Machine Architecture – The Simplified Instructional Computer (SIC) – Machine
Architecture – Data and Instruction Formats – Addressing Modes – Instruction Sets – I/O and
Programming.
UNIT II ASSEMBLERS 10
Basic Assembler Functions – A Simple SIC Assembler – Assembler Algorithm and Data Structures –
Machine Dependent Assembler Features – Instruction Formats and Addressing Modes – Program
Relocation – Machine Independent Assembler Features – Literals – Symbol – Defining Statements –
Expressions – One Pass Assemblers and Multi Pass Assemblers – Implementation Example – MASM
Assembler.
UNIT III LOADERS AND LINKERS 9
Basic Loader Functions – Design of Absolute Loader – Simple Bootstrap Loader – Machine Dependent
Loader Features – Relocation – Program Linking – Algorithm and Data Structures for Linking Loader
– Machine Independent Loader Features – Automatic Library Search – Loader Options – Loader
Design Options – Linkage Editors – Dynamic Linking – Bootstrap Loaders – Implementation Example
– MSDOS Linker.
UNIT IV MACRO PROCESSORS 9
Basic Macro Processor Functions – Macro Definition and Expansion – Macro Processor Algorithm and
Data Structures – Machine Independent Macro Processor Features – Concatenation of Macro
Parameters – Generation of Unique Labels – Conditional Macro Expansion – Keyword Macro
Parameters – Macro within Macro –Implementation Example – MASM Macro Processor – ANSI C
Macro Language.
UNIT V SYSTEM SOFTWARE TOOLS 9
Text Editors – Overview of the Editing Process – User Interface – Editor Structure – Interactive
Debugging Systems – Debugging Functions and Capabilities – Relationship with other Parts of the
System – User Interface Criteria.
Total: 45
TEXT BOOK
1. Leland L. Beck, “System Software - An Introduction to Systems Programming”,Third Edition,
Pearson Education, 2000.
REFERENCES
1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition,
Tata McGraw-Hill, 1999.
2. John J. Donovan, “Systems Programming”, Tata McGraw-Hill, 1972.
ANNA UNIVERSITY TIRUCHIRAPPALLI Regulations 2007 Syllabus SEMESTER IV
CS1253 – OPERATING SYSTEMS
L T P
3 1 0
UNIT I FUNDAMENTALS 9
Concepts – Mainframe Systems – Desktop Systems – Multiprocessor Systems – Distributed Systems –
Clustered Systems – Real Time Systems – Handheld Systems – Hardware Protection – System
Components – Operating System Services – System Calls – System Programs.
UNIT II PROCESS MANAGEMENT 9
Process Concept – Process Scheduling – Operations On Processes – Cooperating Processes – Inter
Process Communication – Threads – Overview – Threading Issues – Cpu Scheduling – Basic Concepts
– Scheduling Criteria – Scheduling Algorithms – Multiple Processor Scheduling – Real Time
Scheduling – The Critical Section Problem – Synchronization Hardware – Semaphores – Classic
Problems Of Synchronization – Critical Regions – Monitors.
UNIT III DEADLOCKS 9
System Model – Deadlock Characterization – Methods for Handling Deadlocks –Deadlock Prevention
– Deadlock Avoidance – Deadlock Detection – Recovery from Deadlocks.
UNIT IV MEMORY AND FILE MANAGEMENT 9
Storage Management – Swapping – Contiguous Memory Allocation – Paging – Segmentation –
Segmentation with Paging – Virtual Memory – Demand Paging – Process Creation – Page
Replacement – Allocation of Frames – Thrashing – File Concept – Access Methods – Directory
Structure – File System Mounting – File Sharing – Protection
UNIT V FILE AND I/O SYSTEMS 9
File System Structure – File System Implementation – Directory Implementation – Allocation Methods
– Free – Space Management. Kernel I/O Subsystems – Disk Structure – Disk Scheduling – Disk
Management – Swap-Space Management. Case Study: The Linux System – Windows
L: 45 T: 15 Total: 60
TEXT BOOK
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, John
Wiley and Sons, Sixth Edition, 2003.
REFERENCES
1. Harvey M. Deitel, “Operating Systems”, Second Edition, Pearson Education, 2002.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India, 2003.
3. William Stallings, “Operating System”, Fourth Edition, Prentice Hall of India, 2003.
ANNA UNIVERSITY TIRUCHIRAPPALLI Regulations 2007 Syllabus SEMESTER IV
CS1254 – DATABASE MANAGEMENT SYSTEMS
L T P
3 1 0
UNIT I FUNDAMENTALS AND CONCEPTUAL MODELING 9
File and Database Systems – Database System Structure – Data Models – Introduction to Network and
Hierarchical Models – ER Model – Relational Model – Relational Algebra and Calculus.
UNIT II RELATIONAL MODEL 9
SQL – Data Definition – Queries in SQL – Updates – Views – Integrity and Security – Relational
Database Design – Functional Dependencies and Normalization for Relational Databases (Upto
BCNF).
UNIT III DATA STORAGE AND QUERY PROCESSING 9
Record Storage and Primary File Organization – Secondary Storage Devices – Operations on Files –
Heap File – Sorted Files – Hashing Techniques – Index Structure for Files – Different Types of Indexes
– B-Tree – B+
Tree– Query Processing.
UNIT IV TRANSACTION MANAGEMENT 9
Transaction Processing – Introduction – Need For Concurrency Control – Desirable Properties Of
Transaction – Schedule And Recoverability – Serializability And Schedules – Concurrency Control –
Types Of Locks – Two Phases Locking – Deadlock – Time Stamp Based Concurrency Control –
Recovery Techniques – Concepts – Immediate Update – Deferred Update – Shadow Paging.
UNIT V CURRENT TRENDS 9
Object Oriented Databases – Need For Complex Data Types – OO Data Model – Nested Relations –
Complex Types – Inheritance Reference Types – Distributed Databases – Homogenous and
Heterogenous – Distributed Data Storage – XML – Structure of XML – Data – XML Document –
Schema – Querying and Transformation – Data Mining and Data Warehousing.
L: 45 T: 15 Total: 60
TEXT BOOK
1. Abraham Silberschatz, Henry F.Korth and S.Sudarshan “Database System Concepts”, Fourth
Edition, McGraw-Hill, 2002.
REFERENCES
1. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition,
Pearson Education, 2003.
2. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill, 2003.
3. Hector Garcia-Molina, Jeffrey D.Ullman and Jennifer Widom, “Database System
Implementation”, Pearson Education, 2000.
4. Peter Rob and Corlos Coronel, “Database System, Design, Implementation and Management”,
Fifth Edition,Thompson Learning Course Technology, 2003.
ANNA UNIVERSITY TIRUCHIRAPPALLI Regulations 2007 Syllabus SEMESTER IV
CS1255 – SYSTEM SOFTWARE LABORATORY
L T P
0 0 3
1. Design of an Editor: Design of a Line or Screen Editor using C Language.
2. Design of an Assembler.
3. Simulation of Loaders.
4. Interprocess Communication.
5. Token Separation and Symbol Table Manipulation.
6. Construction of Parsing Table.
Total: 45
CS1256 – OPERATING SYSTEMS LABORATORY
L T P
0 0 3
(Implement the following on LINUX platform. Use C for high level language implementation)
1. Shell Programming
- Command Syntax
- Write Simple Functions
- Basic Tests
2. Shell Programming
- Loops
- Patterns
- Expansions
- Substitutions
3. Write Programs using the following System Calls of UNIX operating system:
fork - exec - getpid - exit - wait - close - stat - opendir – readdir
4. Write programs using the I/O system calls of UNIX Operating System (open - read - write - etc)
5. Write C programs to simulate UNIX Commands like ls - grep - etc.
6. Given the list of processes - their CPU Burst Times and Arrival times - display/print the Gantt
chart for FCFS and SJF. For each of the Scheduling Policies - compute and print the Average
Waiting Time and Average Turn Around Time
7. Given the list of Processes - their CPU Burst Times and Arrival Times - display/print the Gantt
chart for Priority and Round robin. For each of the Scheduling Policies - compute and print the
average waiting time and average turnaround time
8. Implement the Producer - Consumer problem using Semaphores.
9. Implement some Memory Management Schemes - I
10. Implement some Memory Management Schemes - II
Example for experiment 9 and 10:
Free space is maintained as a linked list of nodes with each node having the starting byte address and
the ending byte address of a free block. Each memory request consists of the process id and the amount
of storage space required in bytes. Allocated memory space is again maintained as a linked list of
nodes with each node having the process id, starting byte address and the ending byte address of the
allocated space.
When a process finishes (taken as input) the appropriate node from the allocated list should be deleted
and this free disk space should be added to the free space list. [Care should be taken to merge
contiguous free blocks into one single block. This results in deleting more than one node from the free
space list and changing the start and end address in the appropriate node]. For allocation use first fit,
worst fit and best fit.
Total: 45
ANNA UNIVERSITY TIRUCHIRAPPALLI Regulations 2007 Syllabus SEMESTER IV
CS1257 – DATABASE MANAGEMENT SYSTEMS LABORATORY
L T P
0 0 3
LIST OF EXPERIMENTS
1. Data Definition Language (DDL) Commands in RDBMS.
2. Data Manipulation Language (DML) and Data Control Language (DCL) Commands in
RDBMS.
3. High-Level Language extension with Cursors.
4. High Level Language extension with Triggers
5. Procedures and Functions.
6. Embedded SQL.
7. Database Design using E-R model and Normalization.
8. Design and Implementation of Payroll Processing System.
9. Design and Implementation of Banking System.
10. Design and Implementation of Library Information System.
Total: 45
0 comments :
Post a Comment