Quick Links
| University Papers | University Syllabus | Entrance Exam |
| PSU Papers | Bank Papers | Placement Papers |
| VTU | Anna Univerity Syllabus | Anna Univerity Papers |
Anna University
Question Paper Code : 20369
B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2018.
Fourth Semester
Computer Science and Engineering
CS6402 Design and Analysis of Algorithms
( Common to Electronics and Communication Engineering / Electronics and Instrumentation Engineering / Instrumentation and Control Engineering / Information Technology / Medical Electronics / Information Technology )
( Regulation 2013 )
Question Paper Code : 20369
B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2018.
Fourth Semester
Computer Science and Engineering
CS6402 Design and Analysis of Algorithms
( Common to Electronics and Communication Engineering / Electronics and Instrumentation Engineering / Instrumentation and Control Engineering / Information Technology / Medical Electronics / Information Technology )
( Regulation 2013 )
Download PDF
For More 1st Year Question Papers
For More Question paper of CSE
For More Question paper of IT
For More Question paper of ECE
For More Question paper of EIE
For More Question paper of ICE
For More Question paper of MEE
Books:
Anna university all semester examination books and study material can be accessed through below link. Feel free search for different subject books and authors. The link will provide both local and foreign author books for references. Share the page with friends and college students as required.
GATE:
GATE papers can be a good practice for any competitive technical exams like DRDO, ISRO, REC, BEL, BHEL, GAIL, ONGC, IOC, NTPC, NHPC etc. As candidates we can prepare for GATE exams and try solving the papers for getting good score in other entrance examinations.
CS6401 Operating Systems Syllabus
OBJECTIVES:
The student should be made to:
- Study the basic concepts and functions of operating systems.
- Understand the structure and functions of OS.
- Learn about Processes, Threads and Scheduling algorithms.
- Understand the principles of concurrency and Deadlocks.
- Learn various memory management schemes.
- Study I/O management and File systems.
- Learn the basics of Linux system and perform administrative tasks on Linux Servers.
UNIT I OPERATING SYSTEMS OVERVIEW
Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory Hierarchy, Cache Memory, Direct Memory Access, Multiprocessor and Multicore Organization. Operating system overview-objectives and functions, Evolution of Operating System.- Computer System Organization- Operating System Structure and Operations- System Calls, System Programs, OS Generation and System Boot.
UNIT II PROCESS MANAGEMENT 9
Processes-Process Concept, Process Scheduling, Operations on Processes, Interprocess Communication; Threads- Overview, Multicore Programming, Multithreading Models; Windows 7 – Thread and SMP Management. Process Synchronization – Critical Section Problem, Mutex Locks, Semophores, Monitors; CPU Scheduling and Deadlocks.
UNIT III STORAGE MANAGEMENT 9
Main Memory-Contiguous Memory Allocation, Segmentation, Paging, 32 and 64 bit architecture Examples; Virtual Memory- Demand Paging, Page Replacement, Allocation, Thrashing; Allocating Kernel Memory, OS Examples.
UNIT IV I/O SYSTEMS 9
Mass Storage Structure- Overview, Disk Scheduling and Management; File System Storage-File Concepts, Directory and Disk Structure, Sharing and Protection; File System Implementation- File System Structure, Directory Structure, Allocation Methods, Free Space Management, I/O Systems.
UNIT V CASE STUDY 9
Linux System- Basic Concepts;System Administration-Requirements for Linux System Administrator, Setting up a LINUX Multifunction Server, Domain Name System, Setting Up Local Network Services; Virtualization- Basic Concepts, Setting Up Xen,VMware on Linux Host and Adding Guest OS.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
- Design various Scheduling algorithms.
- Apply the principles of concurrency.
- Design deadlock, prevention and avoidance algorithms.
- Compare and contrast various memory management schemes.
- Design and Implement a prototype file systems.
- Perform administrative tasks on Linux Servers.
TEXT BOOK:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th Edition, John Wiley and Sons Inc., 2012.
REFERENCES:
William Stallings, “Operating Systems – Internals and Design Principles”, 7th Edition, Prentice Hall, 2011.
Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley, 2001.
Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw HillEducation”, 1996.
D M Dhamdhere, “Operating Systems: A Concept-Based Approach”, Second Edition, Tata
McGraw-Hill Education, 2007.
The student should be made to:
- Study the basic concepts and functions of operating systems.
- Understand the structure and functions of OS.
- Learn about Processes, Threads and Scheduling algorithms.
- Understand the principles of concurrency and Deadlocks.
- Learn various memory management schemes.
- Study I/O management and File systems.
- Learn the basics of Linux system and perform administrative tasks on Linux Servers.
UNIT I OPERATING SYSTEMS OVERVIEW
Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory Hierarchy, Cache Memory, Direct Memory Access, Multiprocessor and Multicore Organization. Operating system overview-objectives and functions, Evolution of Operating System.- Computer System Organization- Operating System Structure and Operations- System Calls, System Programs, OS Generation and System Boot.
UNIT II PROCESS MANAGEMENT 9
Processes-Process Concept, Process Scheduling, Operations on Processes, Interprocess Communication; Threads- Overview, Multicore Programming, Multithreading Models; Windows 7 – Thread and SMP Management. Process Synchronization – Critical Section Problem, Mutex Locks, Semophores, Monitors; CPU Scheduling and Deadlocks.
UNIT III STORAGE MANAGEMENT 9
Main Memory-Contiguous Memory Allocation, Segmentation, Paging, 32 and 64 bit architecture Examples; Virtual Memory- Demand Paging, Page Replacement, Allocation, Thrashing; Allocating Kernel Memory, OS Examples.
UNIT IV I/O SYSTEMS 9
Mass Storage Structure- Overview, Disk Scheduling and Management; File System Storage-File Concepts, Directory and Disk Structure, Sharing and Protection; File System Implementation- File System Structure, Directory Structure, Allocation Methods, Free Space Management, I/O Systems.
UNIT V CASE STUDY 9
Linux System- Basic Concepts;System Administration-Requirements for Linux System Administrator, Setting up a LINUX Multifunction Server, Domain Name System, Setting Up Local Network Services; Virtualization- Basic Concepts, Setting Up Xen,VMware on Linux Host and Adding Guest OS.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
- Design various Scheduling algorithms.
- Apply the principles of concurrency.
- Design deadlock, prevention and avoidance algorithms.
- Compare and contrast various memory management schemes.
- Design and Implement a prototype file systems.
- Perform administrative tasks on Linux Servers.
TEXT BOOK:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th Edition, John Wiley and Sons Inc., 2012.
REFERENCES:
William Stallings, “Operating Systems – Internals and Design Principles”, 7th Edition, Prentice Hall, 2011.
Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley, 2001.
Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw HillEducation”, 1996.
D M Dhamdhere, “Operating Systems: A Concept-Based Approach”, Second Edition, Tata
McGraw-Hill Education, 2007.
0 Comments