Semester 5
CE301 Principles of Operating Systems Class Work:40 Exam: 60 Total: 100 Duration of Exam: 3 Hrs. Note: Five questions will be set in all by the examiner. At most two internal choices can be provided. Unit-1: Introduction: Introduction to Operating System Concepts (including Multitasking, multiprogramming, multi user, Multithreading etc)., Types of Operating Systems: Batch operating system, Time-sharing systems, Distributed OS, Network OS, Real Time OS; Various Operating system services, architecture, System programs and calls. Unit2: Process Management: Process concept, process scheduling, operation on processes; CPU scheduling, scheduling criteria, scheduling algorithms -First Come First Serve (FCFS), Shortest-Job-First (SJF), Priority Scheduling, Round Robin(RR), Multilevel Queue Scheduling. Unit3: Process-Synchronization & Deadlocks: Critical Section Problems, semaphores; methods for handling deadlocks-deadlock prevention, avoidance & detection; deadlock recovery Unit4: Memory Management: Logical & Physical Address Space, swapping, contiguous memory allocation, non-contiguous memory allocation paging and segmentation techniques, segmentation with paging; virtual memory management - Demand Paging & PageReplacement Algorithms; Demand Segmentation. Unit5: File System: Different types of files and their access methods, directory structures, various allocation methods, disk scheduling and management and its associated algorithms, Introduction to distributed file system. Unit-6: I/O Systems: I/O Hardware, Application I/O Interface, Kernel and Transforming I/O requests, Performance Issues. Unit7: Case Study Unix/Linux system call for processes and file system management, Shell programming, Overview of Windows XP
Text Books: Operating System Concepts by Silberchatz et al, 5th edition, 1998, Addison-Wesley. Modern Operating Systems by A. Tanenbaum, 1992, Prentice-Hall.
Operating Systems Internals and Design Principles by William Stallings,4th edition, 2001, Prentice-Hall
Reference Books: Operating System By Peterson , 1985, AW. Operating System By Milankovic, 1990, TMH. Operating System Incorporating With Unix & Windows By Colin Ritche, 1974, TMH. Operating Systems by Mandrik & Donovan, TMH Operating Systems By Deitel, 1990, AWL. Operating Systems Advanced Concepts By Mukesh Singhal , N.G. Shivaratri, 2003, T.M.H Unix Shell Programming by Yashwant Kanetkar
CE303
Internet Fundamentals & Web Technology
Class Work:40 Exam: 60 Total: 100 Duration of Exam: 3 Hrs. Note: Five questions will be set in all by the examiner. At most two internal choices can be provided.
Unit-1: Introduction to Netwroks : Classification of Networks, Networking Models, Packet Switching, Introduction to internet, history, Working of Internet, Modes of Connecting to Internet ,Internet Protocols: Internet Protocol (IP) , Transmission Control Protocol (TCP), Internet Address , standard address, DNS. Internet Service Providers(ISPs),Subnetting ,Supernetting
Unit-3 : World Wide Web : Introduction, Miscellaneous Web Browser details, searching the www: Directories search engines and meta search engines, search fundamentals, search strategies, working of the search engines, Telnet and FTP, E Mail, Chat Servers, net meeting, video conferencing.
Unit-4: Hypertext markup language: The anatomy of an HTML document: Marking up for structure and style: basic page markup, absolute and relative links, ordered and unordered lists, embedding images and controlling appearance, table creation and use, frames, nesting and targeting. Unit 5: Separating style from structure with style sheets: Internal style specifications within HTML, External linked style specification using CSS, page and site design considerations. Unit 6: Client side programming: Introduction to the Java Script syntax, the Document object model, Event handling, Output in JavaScript, Forms handling, miscellaneous topics such as cookies, hidden fields and images; Applications Unit 6: Server Side Programming: Introduction to Server Side Technologies ASP/JSP, Programming languages for server Side Scripting, applications; Input/output operations on the WWW, Forms processing (VBSCRIPT/Java SCRIPT)
Unit 7: Other dynamic content technologies: Delivering multimedia over web pages, the VRML idea. \ Text Book: Fundamentals of the Internet and the World Wide Web, Raymond Greenlaw and Ellen Hepp 2001, TMH Internet & World Wide Programming, Deitel,Deitel & Nieto, 2000, Pearson Education Reference Books: Complete idiots guide to java script,. Aron Weiss, QUE, 1997 Network firewalls, Kironjeet syan -New Rider Pub.
CE 305
Computer Graphics & Multimedia technology Class Work: 40 Exam: 60 Total: 100 Duration of Exam: 3 Hrs.
Note: Five questions will be set in all by the examiner. At most two internal choices can be provided.
Unit-1: Introduction to Computer Graphics: What is Computer Graphics, Computer Graphics Applications, Computer Graphics Hardware and software, Two dimensional Graphics Primitives: Points and Lines, Line drawing algorithms: DDA, Bresenhams; Circle drawing algorithms: Using polar coordinates, Bresenhams circle drawing, mid point circle drawing algorithm; Filled area algorithms: Scanline: Polygon filling algorithm, boundary filled algorithm. Unit-2: Two/Three Dimensional Viewing: The 2-D viewing pipeline, windows, viewports, window to view port mapping; Clipping: point, clipping line (algorithms):- 4 bit code algorithm, Sutherland-cohen algorithm, parametric line clipping algorithm (Cyrus Beck). Polygon clipping algorithm: Sutherland-Hodgeman polygon clipping algorithm. Twodimensional transformations: transformations, translation, scaling, rotation, reflection, and composite transformation. Three-dimensional transformations: Three-dimensional graphics concept, representation of 3-D Transformations, Composition of 3-D transformation. Matrix
Unit-3: Viewing in 3D: Projections, types of projections, the mathematics of planner geometric projections, coordinate systems. Unit-4: Hidden surface removal: Introduction to hidden surface removal. The Z- buffer algorithm, scan line algorithm, area sub-division algorithm.
Unit 5: Image Compression & Standards: Making still images; editing and capturing images; scanning images; computer color models; color palettes; vector drawing; 3D drawing and rendering; JPEG-objectives and architecture; JPEG-DCT encoding and quantization, JPEG statistical coding, JPEG predictive loss less coding; JPEG performance; overview of other image file formats as GIF, TIFF, BMP, PNG etc. Text Books: Computer Graphics Principles and Practices second edition by James D. Foley, Andeies van Dam, Stevan K. Feiner and Johb F. Hughes, 2000, Addision Wesley. Computer Graphics by Donald Hearn and [Link] Baker, 2nd Edition, 1999, PHI
Reference Books:
Procedural Elements for Computer Graphics David F. Rogers, 2001, T.M.H Second Edition Fundamentals of 3Dimensional Computer Graphics by Alan Watt, 1999, Addision Wesley. Computer Graphics: Secrets and Solutions by Corrign John, BPB Graphics, GUI, Games & Multimedia Projects in C by Pilania & Mahendra, Standard Publ. Computer Graphics Secrets and solutions by Corrign John, 1994, BPV Introduction to Computer Graphics By N. Krishanmurthy T.M.H 2002
CE307
Analysis and Design of Algorithms
Class Work:40 Exam: 60 Total: 100 Duration of Exam: 3 Hrs. Note: Five questions will be set in all by the examiner. At most two internal choices can be provided.
Unit-1: Brief Review of Graphs, Sets and disjoint sets, union, sorting and searching algorithms and their analysis in terms of space and time complexity. Unit-2: Divide and Conquer: General method, binary search, merge sort, quick sort, selection sort, Strassens matrix multiplication algorithms and analysis of algorithms for these problems. Unit-3: Greedy Method: General method, knapsack problem, job sequencing with dead lines, minimum spanning trees, single source paths and analysis of these problems. Unit-4: Dynamic Programming: General method, optimal binary search trees, O/I knapsack, the traveling salesman problem. Unit-5: Back Tracking: General method, 8 queens problem, graph coloring, Hamiltonian cycles, analysis of these problems. Unit-6: Branch and Bound: Method, O/I knapsack and traveling salesman problem, efficiency considerations. Techniques for algebraic problems, some lower bounds on parallel computations,NP hard ,NP complete Text Books: Fundamental of Computer algorithms, Ellis Horowitz and Sartaj Sahni, 1978, Galgotia Publ., Introduction To Algorithms, Thomas H Cormen, Charles E Leiserson And Ronald L Rivest: 1990, TMH Reference Books: The Design and Analysis of Computer Algorithm, Aho A.V. Hopcroft J.E., 1974, Addison Wesley. Algorithms-The Construction, Proof and Analysis of Programs, Berlion, [Link], P., 1986. Johan Wiley & Sons, Writing Efficient Programs, Bentley, J.L., PHI Introduction to Design and Analysis of Algorithm, Goodman, S.E. & Hedetnieni, 1997, MGH.
CE309
Wireless Communication
Class Work:40 Exam: 60 Total: 100 Duration of Exam: 3 Hrs. Note: Five questions will be set in all by the examiner. At most two internal choices can be provided.
Unit-1: Introduction to Wireless Communication System: Evolution of mobile radio communications, examples of wireless communication systems, paging systems, Cordless telephone systems, comparison of various wireless systems. Unit-2: Modern Wireless Communication System: Second generation cellular networks, third generation wireless networks, wireless in local loop, wireless local area networks, Blue tooth and Personal Area Networks. Unit-3: Introduction to Cellular Mobile Systems: Spectrum Allocation, Basic cellular Systems, performance criteria, Operation of Cellular systems, Analog cellular systems, Digital cellular systems. Unit-4: Cellular System Design Fundamentals: Frequency Reuse, channel assignment strategies, hand off strategies, Interference and system capacity, tracking and grade off service, improving coverage and capacity. Unit-5: Multiple Access Techniques for Wireless Communication: Introduction to Multiple Access, FDMA, TDMA, spread Spectrum multiple Access, space division multiple access, packet ratio, capacity of a cellular systems. Unit-6: Wireless Networking: Difference between wireless and fixed telephone networks, development of wireless networks, fixed network transmission hierarchy, traffic routing in wireless network, wireless data services, common channel signaling, ISDN (Integrated Service Digital Networks), Advanced Intelligent Networks. Unit-7: Intelligent Cell Concept and Application: Intelligent cell concept, applications of intelligent micro cell systems, in-building communication, CDMA cellular radio networks. Bluetooth,GSM Text Books: Wireless Communications: Theodore S Rappaport; Pearsons Mobile Cellular Telecommunication: W.C.Y. Lee; McGraw Hill Reference Books: Mobile Communications: Jochen Schiller; Pearson
CE311
System Software Design
Class Work:40 Exam: 60 Total: 100 Duration of Exam: 3 Hrs. Note: Five questions will be set in all by the examiner. At most two internal choices can be provided. Unit-I Evolution of the Components of Systems Programming: Assemblers, Loaders, Linkers, Macros, Compilers. Software Tools : Variety of Software tools, Text editors, Interpreters and program generators, Debug Monitor, Programming environment. Loader Schemes, compile and go loader, general loader schemes, absolute loader, Subroutine linkage, Reallocating loader, Direct Linkage Loader, Binders, Linkage loader, overlays. Unit-II Compiler : Phases of Compiler, Compiler writing tools, Lexical Analysis, Finite Automata, Regular Expression, From a Regular expression to an NFA, NFA to DFA, Design of Lexical Analyzer. Syntax Analyzer, CFG, Role of the Parser, CFG, Top Down Parsing, Recursive descent parsing, predictive parsers, Bottom up Parsing, Shift reduce, operator precedence parsers, LR Parsers. Unit-III Syntax directed definition : Construction of Syntax trees, Intermediate code generation, Intermediate Languages, Syntax trees, post fix form. Symbol table : contents of Symbol table, Data Structures for Symbol table; Runtime storage Administration. Unit-IV Code optimization and code generation : Principles sources of optimization, loop optimization, Dag Representation of Basic blocks, Code generation problems in code generation, a simple code generator, Register allocation and Assignment, Peephone optimization. Suggested Readings : 1. Donovan : Systems Programming, Tata McGraw Hill. 2. Dhamdhere: System Software, Tata McGraw Hill. 3. Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman: Compilers Principles, Techniques and Tools, Addison Wesley. 4. Alfred V. Aho and Jeffrey D. Ullman : Principles of Compiler Design, Addison Wesley.
