- Written by KamatchiPriya
- Hits: 1744
2009 CSE IV SEM- BE Curriculum and Syllabus
Curriculum and Syllabus: B.E.2009 CSE, Anna University Trichy, 2009
Semester: 4
CS1251, Design and Analysis of Algorithms
Subject Introduction / Notes not available
Unit I - ALGORITHM ANALYSIS
Algorithm analysis - Time space tradeoff - Asymptotic notations - Conditional - asymptotic notation - Removing condition from the conditional asymptotic notation - Properties of Big-oh notation - Recurrence equations - Solving recurrence equations - Analysis of linear search.
Unit II - DIVIDE AND CONQUER GREEDY METHOD
Divide and conquer - General method - Binary search - Finding maximum and minimum - Merge sort - Greedy algorithms - General method - Container loading - Knapsack problem
Unit III - DYNAMIC PROGRAMMING
Dynamic programming - General method - Multistage graphs - All-pair shortest - paths - Optimal binary search trees - 0/1 Knapsack - Traveling salesperson problem
Unit IV - BACKTRACKING
Backtracking - General method - 8 Queens problem - Sum of subsets - Graph - coloring - Hamiltonian problem - Knapsack problem.
Unit V - TRAVERSALS, BRANCH AND BOUND
Graph traversals - Connected components - Spanning trees - Biconnected - components - Branch and Bound - General methods (FIFO and LC) - 0/1 Knapsack problem - Introduction to NP-hard and NP-completeness.
TEXT BOOKS
1.Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms / C++, 2nd Edition, Universities Press, 2007.
2.Easwarakumar, K.S., Object Oriented Data Structures Using C++, Vikas
Publishing House, 2000.
REFERENCES
1.Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C., Introduction to Algorithms , 2nd Edition, Prentice Hall of India Pvt. Ltd, 2003.
2.Aho, A.V., Hopcroft J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Pearson Education, 1999.
3.Sara Baase and Allen Van Gelder, Computer Algorithms, Introduction to Design and Analysis, 3rd Edition, Pearson Education, 2009.
MA1252, Probability and Queueing Theory
Subject Introduction / Notes not available
Unit I - RANDOM VARIABLES
Discrete and continuous random variables - Moments - Moment generating - functions and their properties - Binomial - Poisson - Geometric - Negative binomial - Uniform - Exponential - Gamma and Weibull distribution .
Unit II - TWO DIMENSIONAL RANDOM VARIABLES
Joint distributions - Marginal and conditional distributions - Covariance - Correlation and regression - Transformation of random variables - Central limit theorem
Unit III - MARKOV PROCESSES AND MARKOV CHAINS
Classification - Stationary process - Markov process - Markov chains - Transition - probabilities - Limiting distributions - Poisson process.
Unit IV - QUEUING THEORY
Markovian models - Birth and death queuing models - Steady state results - Single and multiple server queuing models - Queues with finite waiting rooms - Finite source models - Littles formula.
Unit V - NON-MARKOVIAN QUEUES AND QUEUE NETWORKS
M/G/1 queue - Pollaczek - Khintchine formula - Series queues - Open and closed networks.
TEXT BOOKS
1.Ibe, O.C., Fundamentals of Applied Probability and Random Processes,Elsevier, First Indian Reprint, 2007.
2.Gross, D. and Harris, C.M., Fundamentals of Queuing Theory, WileyStudent Edition, 2004.
REFERENCES
1.Allen, A.O., Probability, Statistics and Queueing Theory with ComputerApplications, 2nd Edition, Elsevier, 2005.
2.Taha, H.A., Operations Research, 8th Edition, Pearson Education, 2007.
3.Trivedi, K.S., Probability and Statistics with Reliability, Queueing andComputer Science Applications, 2nd Edition, John Wiley and Sons, 2002.
EC1257, Microprocessors and Microcontrollers
Subject Introduction / Notes not available
Unit I - THE 8085 AND 8086 MICROPROCESSORS
8085 Microprocessor architecture - Addressing modes - Instruction set - Programming the 8085.
Unit II - 8086 SOFTWARE ASPECTS
Intel 8086 Microprocessor - Architecture - Signals - Instruction set - Addressing modes - Assembler directives - Assembly language programming - Procedures - Macros - Interrupts and interrupt service routines - BIOS function calls.
Unit III - MULTIPROCESSOR CONFIGURATIONS
Coprocessor configuration - Closely coupled configuration - Loosely coupled - configuration - 8087 Numeric data processor - Data types - Architecture - 8089 I/O processor - Architecture - Communication between CPU and IOP.
Unit IV - I/O INTERFACING
Memory interfacing and I/O interfacing with 8085 - Parallel communication interface - Serial communication interface - Timer - Keyboard / Display controller - Interrupt - controller - DMA controller (8237) - Applications - Stepper motor - Temperature
Unit V - MICROCONTROLLERS
Architecture of 8051 Microcontroller - Signals - I/O Ports - Memory - Counters and timers - Serial data I/O - Interrupts - Interfacing Keyboard - LCD - ADC and DAC.
TEXT BOOKS
1.Gaonkar, R.S., Microprocessor-Architecture, Programming and Applicationswith the 8085, 5th Edition, Penram International Publisher, 2006.
2.Yn - cheng Liu and Gibson, G.A., Microcomputer Systems: The 8086 / 8088 Family Architecture, Programming and Design, 2nd Edition, Prentice Hall ofIndia, 2006.
REFERENCES
1.Hall, D.V., Microprocessors and Interfacing: Programming and Hardware,2nd Edition, Tata Mc-Graw Hill, 2006.
2.Ray, A.K. and Bhurchandi, K.M., Advanced Microprocessor and Peripherals Architecture, Programming and Interfacing, Tata Mc-Graw Hill, 2006.
3.Mazidi, M.A. and Mazidi, J.G., The 8051 Microcontroller and EmbeddedSystems using Assembly and C, 2nd Edition, Pearson Education / Prentice Hall of India, 2007.
CS1252, Computer Organization and Architecture
Subject Introduction / Notes not available
Unit I - BASIC STRUCTURE OF COMPUTERS
Functional units - Basic operational concepts - Bus structures - Performance and metrics - Instructions and instruction sequencing - Hardware - Software interface - Instruction set architecture - Addressing modes - RISC - CISC - ALU design - Fixed point and floating point operations.
Unit II - BASIC PROCESSING UNIT
Fundamental concepts - Execution of a complete instruction - Multiple bus organization - Hardwired control - Micro programmed control - Nano programming
Unit III - PIPELINING
Basic concepts - Data hazards - Instruction hazards - Influence on instruction sets - Data path and control considerations - Performance considerations - Exception handling
Unit IV - MEMORY SYSTEM
Basic concepts - Semiconductor RAM - ROM - Speed - Size and cost - Cache memories - Improving cache performance - Virtual memory - Memory management requirements - Associative memories - Secondary storage devices
Unit V - I/O ORGANIZATION
Accessing I/O devices - Programmed I/O - Interrupts - Direct memory access - Buses - Interface Circuits - Standard I/O interfaces (PCI, SCSI, and USB) - I/O Devices and processors
TEXT BOOKS
1.Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Computer
Organization, 5th Edition, Tata Mc-Graw Hill, 2002.
2.Heuring, V.P. and Jordan, H.F., Computer Systems Design and
Architecture, 2nd Edition, Pearson Education, 2004.
REFERENCES
1.Patterson, D. A., and Hennessy, J.L., Computer Organization and Design:
The Hardware/Software Interface, 3rd Edition, Elsevier, 2005.
2.William Stallings,Computer Organization and Architecture Designing for
Performance, 6th Edition, Pearson Education, 2003.
3.Hayes, J.P.,Computer Architecture and Organization, 3rd Edition, Tata
Mc-Graw Hill, 1998.
CS1253, Operating Systems
Subject Introduction / Notes not available
Unit I - PROCESSES AND THREADS
Introduction to operating systems - Review of computer organization - Operating system structures - System calls - System programs - System structure - Virtual machines - Processes - Process concept - Process scheduling - Operations on processes - Cooperating processes - Interprocess communication - Communication in client server systems - Case study - IPC in linux - Threads - Multi threading - models - Threading issues - Case study - Pthreads library
Unit II - PROCESS SCHEDULING AND SYNCHRONIZATION
CPU scheduling - Scheduling criteria - Scheduling algorithms - Multiple Processor scheduling - Real time scheduling - Algorithm evaluation - Case study - Process scheduling in Linux - Process synchronization - The critical section problem - Synchronization hardware - Semaphores - Classic problems of synchronization - Critical regions - Monitors - Deadlock system model - Deadlock characterization - Methods for handling deadlocks - Deadlock prevention - Deadlock avoidance - Deadlock detection - Recovery from deadlock
Unit III - STORAGE MANAGEMENT
Memory management - Background - Swapping - Contiguous memory allocation - Paging - Segmentation - Segmentation with paging - Virtual memory - Background - Demand paging - Process creation - Page replacement - Allocation of frames - Thrashing - Case study - Memory management in Linux
Unit IV - FILE SYSTEMS
File system interface - File concept - Access methods - Directory structure - File system mounting - Protection - File system implementation - Directory implementation - Allocation methods - Free space management - Efficiency and performance - Recovery - Log structured file systems - Case studies - File system in Linux - File system in Windows XP
Unit V - I/O SYSTEMS
I/O Systems - I/O Hardware - Application IO interface - Kernel I/O subsystem - Streams - Performance - Mass storage structure - Disk scheduling - Disk management - Swap space management - RAID - Disk attachment - Stable storage - Tertiary storage - Case study - I/O in Linux
TEXT BOOK
1.Silberschatz, Galvin and Gagne, Operating System Concepts, 6th Edition,
Wiley India Pvt. Ltd., 2003.
REFERENCES
1.Tanenbaum, A.S., Modern Operating Systems, 2nd Edition, Pearson
Education, 2004.
2.Gary Nutt, Operating Systems, 3rd Edition, Pearson Education, 2004.
3.William Stallings, Operating Systems, 4th Edition, Prentice Hall of India,
2003.
CS1254, Database Management Systems
Subject Introduction / Notes not available
Unit I - FUNDAMENTALS
Purpose of database system - Views of data - Data models - Database languages - Database system architecture - Database users and administrator - Entity Relationship model (E-R Model ) - E-R diagrams - Introduction to relational databases.
Unit II - RELATIONAL MODEL
The relational model - The catalog - Types - Keys - Relational algebra - Domain relational calculus - Tuple relational calculus - Fundamental operations - Additional operations - SQL fundamentals - Integrity - Triggers - Security - Advanced SQL features - Embedded SQL - Dynamic SQL - Missing information - Views - Introduction to distributed databases and client/server databases.
Unit III - DATABASE DESIGN
Functional dependencies - Non loss decomposition - Functional dependencies - First - Second - Third normal forms - Dependency preservation - Boyce/codd normal form - Multi-valued dependencies and fourth normal form - Join dependencies and fifth normal form.
Unit IV - TRANSACTIONS
Transaction concepts - Transaction recovery - ACID properties - System recovery - Media recovery - Two phase commit - Save points - SQL facilities for recovery - Concurrency - Need for concurrency - Locking protocols - Two phase locking - Intent locking - Deadlock - Serializability - Recovery Isolation Levels - SQL Facilities for Concurrency
Unit V - MPLEMENTATION TECHNIQUES
Overview of Physical Storage Media - Magnetic Disks - RAID - Tertiary Storage - File Organization - Organization of Records in Files - Indexing and Hashing - Ordered Indices - B+ Tree Index Files - B Tree index files - Static hashing - Dynamic hashing - Query processing overview - Catalog information for cost estimation - Selection operation - Sorting - Join operation - Database Tuning.
TEXT BOOKS
1.Silberschatz, A., Korth, H.F. and Sudharshan, S., Database System
Concepts, 5th Edition, Tata Mc-Graw Hill, 2006
2.Date, C. J., Kannan, A. and Swamynathan, S.,An Introduction to Database
Systems, 8th Edition, Pearson Education, 2006.
REFERENCES
1.Elmasri, R. and Navathe, S.B., Fundamentals of Database Systems, 4th
Edition, Pearson / Addison Wesley, 2007.
2.Ramakrishnan, R., Database Management Systems, 3rd Edition, Mc-Graw
Hill, 2003.
3.Singh, S. K., Database Systems Concepts, Design and Applications, 1st
Edition, Pearson Education, 2006.
CS1255, Operating Systems Laboratory
Subject Introduction / Notes not available
Unit I - SYSTEM CALLS
Write programs using the following system calls of UNIX operating system: - fork, exec, getpid, exit, wait, close, stat, opendir, readdir - Write programs using the I/O system calls of UNIX operating system (open, - read, write, etc) - Write C programs to simulate UNIX commands like ls, grep, etc.
Unit II - PROCESS SCHEDULING
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 turnaround time. (2 sessions) - 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. (2 sessions)
Unit III - IPC
Developing Application using Inter Process Communication (using shared memory, pipes or message queues) - Implement the Producer ? Consumer problem using semaphores (using UNIX - system calls).
Unit IV - MEMORY MANAGEMENT SCHEMES
Implement some memory management schemes I - Implement some memory management schemes II
Unit V - FILE ALLOCATION
Implement any file allocation technique (Linked, Indexed or Contiguous)
Books information not available
CS1256, Database Management Systems Laboratory
Subject Introduction / Notes not available
Unit I - UNIT 1
Data Definition, Table Creation, Constraints - Insert, Select Commands, Update and Delete Commands
Unit II - UNIT 2
Nested Queries and Join Queries - Views - High level programming language extensions Control structures, Procedures - and Functions
Unit III - UNIT 3
Front end tools - Forms - Triggers - Menu Design - Reports
Unit IV - UNIT 4
Database Design and implementation (Mini Project).
Books information not available
EC1258, Microprocessors Laboratory
List of equipments/components for 30 students (two per batch)
1.8085 Trainer Kit with onboard 8255, 8253, 8279 and 8251 15 nos.
2.TASM/MASM simulator in PC (8086 programs) 30 nos.
3.8051 trainer kit 15 nos.
4.Interfacing with 8086 PC add-on cards with 8255, 8253, 8279 and 8251 15
nos.
5.Stepper motor interfacing module 5 nos.
6.Traffic light controller interfacing module 5 nos.
7.ADC, DAC interfacing module 5 nos.
8.CROs 5 nos.
Unit I - 8085
Programming with 8085
Unit II - 8086
Programming with 8086-experiments including BIOS/DOS calls: - Keyboard control, Display, File Manipulation.
Unit III - Interfacing
Interfacing 8085/8086 with 8255,8253 - Interfacing 8085/8086 with 8279,8251
Unit IV - Micro controller
8051 Microcontroller based experiments for Control Applications - Mini- Project
Books information not available
More by KamatchiPriya
