B.Tech. Degree Programme Computer Science & Engineering

More documents

Recommendations

Info

B.Tech. Computer Science & Engineering (Regular)6. Remove, study and replace hard disk.7. Remove, study and replace CD ROM drive.8. Study various monitors, its circuitry and variouspresents and some elementary fault detection.9. Study printer assembly and elementary faultdetection of DMP and laser printers.10. Observe various cables and connectors used innetworking.11. Study parts of keyboard and mouse.12. Assemble a PC13. Troubleshooting exercises related to variouscomponents of computer like monitor, drives,memory and printers etc.REFERENCE BOOKS1. Mines Mark, “Complete PC Upgrade &Maintenance Guide”, BPB Publications, 20052. Zacker Craig & Rouske John, “PC Hardware: TheComplete Reference”, Tata McGraw Hill, 2000.3. Mueller Scott, “Upgrading and Repairing PCs”,Prentice Hall of India, 1999CS-301THEORY OF L T P CrCOMPUTATIONS 5 0 0 3OBJECTIVEThe goal of this course is to provide students with anunderstanding of basic concepts in the theory ofcomputation. At the end of this course students will beable to:• Construct finite state machines and the equivalentregular expressions.• Prove the equivalence of languages described byfinite state machines and regular expressions.• Construct pushdown automata and the equivalentcontext free grammars.• Prove the equivalence of languages described bypushdown automata and context free grammars.• Construct Turing machines and Post machines.• Prove the equivalence of languages described byTuring machines and Post machinePRE-REQUISITESKnowledge of mathematics and ProgrammingLanguages1. FINITE AUTOMATA AND REGULAREXPRESSIONS: Finite state systems; basicdefinitions non-deterministic finite automata(NDFA), deterministic finite automata (DFA),equivalence of DFA and NDFA finite automata withe-moves; regular expressions; equivalence of finiteautomata and regular expressions; regularexpression conversion and vice versa.2. INTRODUCTION TO MACHINES: Concept ofbasic machine; properties and limitations of FSM,Moore and Mealy machines; Equivalence of Mooreand Mealy machines; Conversion of NFA to DFAby Arden’s Method.3. PROPERTIES OF REGULAR SETS: ThePumping Lemma for regular sets; applications ofthe pumping lemma; closure properties of regularsets; Myhill-Nerode theorem and minimization offinite automata; minimization algorithm.4. CHOMSKY HIERARCHIES: Chomsky hierarchiesof grammars, unrestricted grammars; contextsensitive languages; relation between languagesof classes; computability: basic concepts, primitiverecursive functions.5. GRAMMARS: Definition, Context free and contextsensitive grammar; ambiguity regular grammar;reduced forms; removal of useless symbols andunit production; Chomsky Normal Form (CNF),Greibach Normal Form (GNF).6. PUSHDOWN AUTOMATA: Introduction topushdown machines; design of PDA; conversion ofPDA to CFG and vice versa, application ofpushdown machines7. TURING MACHINES: Deterministic and nondeterministicTuring machines; design of Turingmachines; halting problem of Turing machines;PCP problem.TEXT BOOKHopcroft, Ullman O. D. and Mothwani R., “Introductionto Automata Theory, Language & Computations”,Addison Wesley, 2001REFERENCE BOOKS1. Mishra K. L. P. and Chandrasekaran N., “Theory ofComputer Science - Automata, Languages andComputations”, Prentice Hall of India, 20002. Linz Peter, “Introduction to Formal Languages &Automata”, Narosa Publications, 20013. Greenlaw Ramond and Hoover H. James,“Fundamentals of the Theory of Computation -Principles and Practice”, Harcourt India Pvt. Ltd.,19984. Lewis H. R. and Papaditriou C. H., “Elements ofTheory of Computation”, Prentice Hall of India,19985. Martin John C., “Introduction to Languages andTheory of Computations”, Tata McGraw Hill, 2003WEB REFERENCES1. http://www.comp.nus.edu.sg/~sanjay/cs3231.html2. http://en.wikipedia.org/wiki/Theory_of_computation3. http://www.wisdom.weizmann.ac.il/~oded/tocbi.html.CS-302OPERATING SYSTEMSL T P Cr5 0 0 3OBJECTIVETo provide the knowledge of internals, different typesand purpose of operating systemsPRE-REQUISITESKnowledge of computer organization and architecture,programming skills1. INTRODUCTION: Introduction to operating systemconcepts (including multitasking,multiprogramming, multi user, multithreading, etc).;types of operating systems: batch operatingsystem, time-sharing systems, distributed OS,network OS, real time OS, embedded and smartcard OS; various operating system services,architecture, system programs and calls.32
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
Page 1: B.Tech. Degree ProgrammeComputer Sc
Page 6 and 7: B.Tech. Computer Science & Engineer
Page 31 and 32: Lingaya’s University, FaridabadCH
Page 33 and 34: Lingaya’s University, FaridabadWE
Page 35: Lingaya’s University, FaridabadCS
Page 39 and 40: Lingaya’s University, Faridabadpe
Page 41 and 42: Lingaya’s University, Faridabad3.
Page 43 and 44: Lingaya’s University, FaridabadPR
Page 45 and 46: Lingaya’s University, Faridabadco
Page 47 and 48: Lingaya’s University, Faridabadar
Page 49 and 50: Lingaya’s University, Faridabadex
Page 55 and 56: Lingaya’s University, FaridabadRE
Page 86 and 87:
B.Tech. Computer Science & Engineer
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
show all

B.Tech. Degree Programme Computer Science & Engineering

Create successful ePaper yourself

Delete template?

Save as template?