B.Tech. Degree Programme Computer Science & Engineering

Lingaya’s University, Faridabad2. PROCESS MANAGEMENT AND THREADS:Process concept, Life cycle and implementation ofprocess, Thread usage and implementation in userspace and in kernel, process scheduling, operationon processes; CPU scheduling, scheduling criteria,scheduling algorithms -First Come First Serve(FCFS), Shortest-Job-First (SJF), priority scheduling,Round Robin (RR), multilevel queue scheduling.3. MEMORY MANAGEMENT: Logical & physicaladdress space; swapping; contiguous memoryallocation, non-contiguous memory allocationpaging and segmentation techniques,segmentation with paging; virtual memorymanagement - demand paging & pagereplacementalgorithms; demand segmentation.4. FILE SYSTEM: Different types of files and theiraccess methods, directory structures; variousallocation methods; disk scheduling andmanagement and its associated algorithms;introduction to distributed file system.5. PROCESS-SYNCHRONIZATION &DEADLOCKS: Critical section problems, mutualexclusion with busy waiting, semaphores; methodsfor handling deadlocks: deadlock prevention,avoidance and detection; deadlock recovery;Classical IPC problems: dining philosophers’problem, readers-writers problem.6. I/O SYSTEMS: I/O hardware, device controllers,interrupt handlers, device drivers, application I/Ointerface, kernel, transforming I/O requests,performance issues.7. LINUX/UNIX SYSTEM: LINUX/UNIX architecture;UNIX system calls for processes and file systemmanagement; basic commands of LINUX/UNIX;shell interpreter, shell scripts.TEXT BOOKSilberchatz et al, “Operating System Concepts”, 5thedition, Addison-Wesley, 1998REFERENCE BOOKS1. Tanenbaum A., “Modern Operating Systems”,Prentice-Hall, 19922. Stallings William, “Operating Systems Internals andDesign Principles”, 4th edition, Prentice-Hall, 20013. Dhamdhere D. M., “Operating System”, 2ndEdition, Tata McGraw Hill, 19994. Kernighan Brian and Pike Rob, “The UnixProgramming Environment”, Prentice Hall of India,19845. Bach Maurich, “Design of the Unix OperatingSystem”, Prentice Hall of India, 19866. Muster John, “Introduction to UNIX and LINUX”,Tata McGraw Hill, 20037. Ritchie Colin, “Operating System IncorporatingUnix & Windows”, Tata McGraw Hill, 19748. Madnick Stuart and Donovan John, “OperatingSystems”, Tata McGraw Hill, 20019. Deitel, “Operating Systems”, Addison-Wesley, 199010. Singhal Mukesh and Shivaratri N.G., “OperatingSystems”, Tata McGraw Hill, 2003WEB REFERENCES1. http://en.wikipedia.org/wiki/Operating_system2. http://search.techrepublic.com.com/search/ibm+lotus+notes+and+operating+systems.html3. http://www.dmoz.org/Computers/Software/Operating_Systems/Mainframe/IBM/Software/4. http://www-03.ibm.com/systems/i/software/access/windows/supportedos.htmlCS-303COMPUTER GRAPHICSL T P Cr5 1 0 4OBJECTIVEStudents completing this course are expected to beable to:• Write programs that utilize the OpenGL graphicsenvironment.• Use polygonal and other modeling methods todescribe scenes.• Understand and be able to apply geometrictransformations.• Create basic animations.• Understand scan-line, ray-tracing, and radiosityrendering methodsPRE-REQUISITESKnowledge of computer programming, 2D and 3Dgeometry1. INTRODUCTION: What is computer graphics,computer graphics applications, computer graphicshardware and software, two dimensional graphicsprimitives: points and lines, line drawingalgorithms: DDA, Bresenham’s; circle drawingalgorithms: using polar coordinates, Bresenham’scircle drawing, mid point circle drawing algorithm;polygon filling algorithm, boundary filled algorithm,scan-line algorithm, flood fill algorithm.2. TWO DIMENSIONAL VIEWING: The 2-Dviewing pipeline, windows, viewports, window toview port mapping; clipping: point, clipping line(algorithms): 4 bit code algorithm, Sutherland-Cohen algorithm, parametric line clippingalgorithm (Cyrus Beck).3. POLYGON CLIPPING ALGORITHM: Sutherland-Hodgeman polygon clipping algorithm,homogeneous coordinates system, twodimensional transformations: transformations,translation, scaling, rotation, reflection, shearing,transformation, composite transformation.4. THREE DIMENSIONAL GRAPHICS: Threedimensional graphics concept, matrixrepresentation of 3-D transformations, compositionof 3-D transformation; viewing in 3D: projections,types of projections; the mathematics of plannergeometric projections; coordinate systems.5. HIDDEN SURFACE REMOVAL: Introduction tohidden surface removal; the Z- buffer algorithm,scan-line algorithm, area sub-division algorithm.6. REPRESENTING CURVES AND SURFACES:Parametric representation of curves: Beziercurves, B-Spline curves; parametric representationof surfaces; interpolation method.7. ILLUMINATION, SHADING, IMAGEMANIPULATION: Illumination models, shadingmodels for polygons, shadows, transparency; whatis an image, filtering, image processing, geometrictransformation of images.33