Semester - V * Not for IT Students Branch: Information Technol BIN. [code ‘ourse Title Credit 1 [CSSO1 [Operating Systems 4 2 [ess02 [pa Base Management Systems 3 3__| ECT ofessional Elective -I 3 4 | PEC 5 | OBC-T n 3 0 0 6 | HUSO1 Professional Communication 1 0 2 0 7 ~|1TSS1 ~~ Operating Systems Lab. 0 0 3 2 8 [11552 DBMS Lab. 0 0 3 1 9 [11533 Programming LabI 0 0 3 1 10 [1T554 | Internship Assessment I 0 0 2 2 Total Credits 2 Code a Elective-I (Any Code Capen) CS5i1 | Compiler Design ECS524 | Analog and Digital Communication TTS] _ | Internetworking TTS21__ | Principles of Programming Languages C8512 _ | System Analysis and Design 1T522__| Semantic Web Code | Open Elective-T (Any One) S531 Web Technology CS532_| *Computer Architecture CS533 | *Data Structure and Algorithms:‘Computer Science & Engineering and Information Technology Coder COT] Operating Stem a 3 eS a course outcome: 1. Apply optimization techniques forthe improvement of system performance. 2. Ablty to design and solve synctronization problems. 3. Learn about minimization of tumaround time, walting time and response time and also ‘maximization of throughput by keeping CPU as busy as possible Ability to change access contrast protect fies. 5. Ability to compare the cilferent operating systems c0-PO Mapping: For [Pox [Pos [POs [POs [POs [POT [POR [Poo [Pio [PHT [PIE csoaj2 j2 j2 j2 [ | - | i f bp ia essi0a2 [2 } [3 |= 2 aie ess0a3 [1[2 [32 _[2 = a essi0a4 |] tt 51035 r =z = ht ‘averse [i [i |i@ [os [os fo [o[o laa fo [aa [a (MODULE 1: FUNDAMENTALS ‘Overview: Role and purpose of erating systems: history of operating system development ‘unetonalty ef a plea operating system’ design ses (ficiency, robustness, flxibity, poabity, security, compat) ‘Basic principles: Stcturng methods: abetracions, processes, and resources; dasign of tao roramming teers (APs device panto. rroTus, seem Sate MODULE 2: PROCESS MANAGEMENT ‘Scheduling: Preemptive and non: proomplve scheduling scheduling polices; processes and ‘eeads, ral ~ime iesues ‘Goneurrency: Tha tea of concurrent exeextion states and stato dag‘ams; implementation Structures (fea Isis, process conta blocks, and so fr): dispatching and context switching: Inmerupt hanaing in a concurentenvrcement, ‘Mutual exclusion: Detinton the "nua! exclusion” problem: ceadiock detection {and reversion; sein sategies; models and mechanisms (semaphores, manors, condtion ‘Variables, rendezvous) precucer-consumer probloms; synchronization, muliprocessor Ssuas MODULE 3: MEMORY MANAGEMENT Review of physical memory and memory management hardware; overlays, swapping, ad partons; ‘paging and segmentation; page placement and replacement polices; working sats and thrashing acting MODULE &: SECONDARY STORAGE MANAGEMENT Device management: Characteristics of stil and parallel devices; abstracting device clerences; butlerng stateges: direct emery access; recovery rom flues. File systems: Fundamental concepts (dai, metadata, operations, organization, buffing, ‘Sequental vs nan-sequentia les); cortent ana structure of decors fe system tecnigues. {oartioning, mounting and ur-mouning, vitua fie systems): memory-mapped fies; seca-pupose fle systoms; naming, searching, and access; backup staloges [MODULE 5 SECURITY AND PROTECTION ‘Ovenow of systom secury: polymechanism separation; saul methods and doves protection, actess, ond authentication; madels of protection; memory protector. encryption ecovery maragomont ‘Toxt/Roteronce Books 4. Slbersehstz, P.. Galvin &.G, Gagne, Operating system concepts, John Wiley, Edtion 2012 2. W. Stalings, Operating systems, Prontcn-Hal, 2012nee a nol Cae HE] ‘aha Manama Sem, SS) ‘ie maagenen system 22 Mast he be ome apron oguenent sng theo He ER ming wa ate 4. Stl amar wih eb petiole consis ml i iy tthe sapiksion Ive 44 Ma besa he raat cng and er ppt dae dig 4. Silliness ig pocorn of wach io sf du pert. coro mapping: or Fle & Dts ate Cone, Overview DBMS, Dts Model, Scns datum, Independence MODULE 3: ENTITY-RELATIONSINIP MODE. Ie cnc Ke, Hky-Rltomtup Diagram, Cay rae, Steg A Wonk Fatey Se, Soculiaton Genenioaion Angennon, ‘Poca on Pactual Langwpes, Reno Ale, Exe Haba Alps Opin Vices Modest OF the Dah Raton Ck MODULE $01 as Conce,Set pera, Ages Fac, Nell Vas, sens, views Neel Sub gus, (hse Set peee rsa iga Ingity Conus natin RDBMS ‘oma Cemaas Rete iegty Conti, Co le MODULE : FUNCTIONAL DEPENDENCIES AND NORMALIZATION Feta Depndn:y, Armavong’s som, Cool Cv, Chu, Fall and Parl Fatal ‘ene ime © Ne ess, SNF BENE Ma se ney [MODULE 5: TRANSACTION & CONCURRENCY CONTROL “Transco cone ACID pope, Cooler & View saleby, Tot or Cl eral, ‘cre Cana, Lak tse ptr, To pan cag, MODULE 6: STORAGE STRATEGIES Singletevel tnx rie. seco css Mui! dees, Dyna Maeve Ines, ising Tacha, Be ad Be ety Option Rl Table som, Indexes san, Merge jin Not lap join Egan len, Mow pinto Ca Had Opiate, yh ep act, Taman gs Caso ales Rene shige ase Coney Ia Fagnetain, Repcain oad Alban Tenis, Types of Deets tne yen Quy fang. Ova of Cea Aaa ean TEXTBOOKS: 2. Funan of Dh Syem, Ela Neate Penn Edson REFERENCES: 1 Duns) design, ponent, Margene Peter Rb & Cros Caw 7 hn 2. tuoditna Dass Stns C1 Dae Peron Easton“Computer Science & Fngineering and Tnformation Technology Code: SESE Compiler Design TTyFyle spopols COURSE OUTCOMES 1. densify the issue that arises in the design and construction of translator for programming inp 2. Ante Rand CPt psi he xl nd yaa sae of programming tangue Design deren poner rom sven pciaton, Ase he rn rogram strains Design compe fra poganning lngag, yee MODULE 1: INTRODUCTION TO COMPILER ‘Compilers, Analysis of source programs, Tokens, patterns, lexemes, Phases of compilers, Parsing Parse tees, Ambiguity, Asociativity and precedence of operators Top-down parsing. Bottom-up parsing, Let recursion, Syntax directed ransltion, MODULE 2: FINITE AUTOMATA ‘Clasification of grammars, NFA, DFA, Comersion of NFA to DFA, RE to NFA (Thompson's Construction), Optimization of NFA/DFA using FIRSTPOS, LASTPOS, FOLLOWPOS, MODULE: CONTEXT FREE GRAMMAR RE vs, CFG, Eliminating ambiguity and lft recursion, Left factoring. “MODULE 4: COMPILER PARSER ‘Top dowa puning-LL parser, LL grammars, Bottom up parsing- LR parser, SLR parser, CLR. parser, LALR parser. Polishing expressions Operator precedence grammar. LR. grammars CComprson of parsing methods, Error handling, ‘MODULE $: RUN TIME ENVIRONMENTS Symbol tables, Language files for dynamic storage allocation, Dynamic storage allocation technique, Organization for now-block and block structure languages MODULE 6: INTERMEDIATE CODE GENERATION Intermediate languages, graphical representations, Symhesized and inherited atuibutes, Dependency graph, Symax directed trunslation, $ and L- attributed definitions, Polish notation “Throe adress, quadruples, triples, inet pls Flow of congo statement MODULE 7: CODE OPTIMIZATION AND CODE GENERATION Basic hocks an Now graphs, Optinization of asic locks, Code optimization techniques, Hues 1n design of code generator, Target machine code and simple code generator ‘TEXTBOOKS, + Aft V, Aho, Ravi Sethi, fefiey D. Utlaan, Monica S. Lam, Comper: Principles Techniques, and Tools. Addison-Wesley, 2006 (optional, ‘© Thomas W. Parsons Irduetion 10 Compiler Construcrion. Computer Science Press 1992. REFERENCE BOOKS ‘Compiler design in, A.C. Holub, PH ‘© Compiler eonstwetion (Theory and Practice), A.Barvet Willig anal RM. Bates, Galgotia Publication Compiler Design, Kak‘Computer Science & Engineering and Information Technology Code: TSI I Tnternctworking TF 3lolo Course Outcomes: (CO 1: Students willbe able wo classify the routing protocols and analyse how to assign the IP adresses for the given network, ‘CO2: Students will beable w understan the architecture of different iatrnet servers, (CO: Students will be able to configure the firewall in the network. MODULE 1:- AN OVERVIEW ON INTERNET "The nce for an Interne, The TCPAP Internet, Intern services, Iternet protocols and standardization, Review of Network technologies. MODULE 2: - INTERNETWORKING CONCEPTS Architectural model inoduction, Application level interconnection, Network level interconnection, Properties of the Internet, Internet Architecture, Interconnccion tough IP Gateways o Fours Invert and franc. MODULE 3: - INTERNET ADDRESS Introduction, Universal identifiers, Three primary classes of IP adresses, Classless IP adress [Network and Broadcast addresses, Mapping internet auesses to physical adresses (ARP), ARP preccol forma, Transport Gateways and subnet addressing, Multicast addressing MODULE 4: - INTERNET PROTOCOL Inemet Architecture and Philosophy, The concept of unreliable delivery, Connectioniss delivery system, The Intemet Datagram, Routing direct and indirect delivery, Table driven IP routing. Protocol layering, Reliable stream tanspoet, TCP performance, Bootstrap protocol (BOOTP). MODULE ROUTING, ‘The origin of Gateway routing tables, Orginal lternet Architecture and Cores, Core Gateways, Automatic route propagation, Vector distance (Beliman-Foed), routing. Gateway to Gateway Protocol (GGP), Autonomous system concept, Exterior Gateway Protocol (EGP), Interior Gateway Protocol (RIP, OSPF. HELLO), Routing Information Protocol (RIP), Combining RIP, HELLO, and EGP, Routing with partial information. MODULE 6: - ENTERPRISE NETWORKING AND INTERNET SERVERS, Corporate neiworking, Broadband at the Metropolitan area level, High speed dedicated WAN services and switched WAN services, ISDN, BISDN ani ATM services, Frame relay technology and services, Viral private network concepts PPTP protocol. DNS, DHCP Servers, FTP, ‘TELNET. E-Ma, MODULE 7: - FIREWALL & NETWORKING Inrodvction, Implementation of Firewall, Activities of Firewall, Configuration of firewall, Firewalls & SSL_ SSL implementation, Bit implementation of SSL, Use of SSL. REFERENCE BOOKS. 4. Computer Networks and Internets - Douglas E. Comer; PE. 2 Communication Networks - Leon-Garcia-Wijja: TMEL 3 —_Tntemetworking with TCP / IP - Douglas E Comer; PE. 4 TCPAP protocol suite - Frouzan Behrour A: TMH. 5. Computer Networks ~ Andrew 8. Tanenbaum; PHL 6 Data anal Computer Communication - William Stallings: PHI 2 ‘The Complete reference of Neaworking - Craig Zacker: TMH,