V Sem Syllabus

16
UIT-RGPV (AUTONOMOUS), BHOPAL BACHELOR OF ENGINEERING INFORMATION TECHNOLOGY Subjec t Code Subject Maximum Marks Credits Theory Practical End Sem. Mid Sem. Tests (Two tests Average) Quiz, assignme nt End Sem Lab assignmen t L T P IT 3601 Theory of Computati on 100 30 20 - - 3 1 - UNIT I Introduction of the theory of computation, Finite state automata – description of finite automata, properties of transition functions, Transition graph, designing finite automata, FSM, DFA, NFA, 2-way finite automata, equivalence of NFA and DFA, Mealy and Moore machines. UNIT II Regular grammars, regular expressions, regular sets, closure properties of regular grammars, Arden’s theorem, Myhill-Nerode theorem, pumping lemma for regular languages, Application of pumping lemma, applications of finite automata, minimization of FSA. UNIT III Introduction of Context-Free Grammar - derivation trees, ambiguity, simplification of CFGs, normal forms of CFGs- Chomsky Normal Form and Greibach Normal forms, pumping lemma for CFLs, decision algorithms for CFGs, designing CFGs, Closure properties of CFL’s. UNIT IV Introduction of PDA, formal definition, closure property of PDA, examples of PDA, Deterministic Pushdown Automata, NPDA, conversion PDA to CFG, conversion CFG to PDA. UNIT V Turing machines - basics and formal definition, language acceptability by TM, examples of TM, variants of TMs – multitape TM, NDTM, Universal Turing Machine, offline TMs, equivalence of

Transcript of V Sem Syllabus

Page 1: V Sem Syllabus

UIT-RGPV (AUTONOMOUS), BHOPALBACHELOR OF ENGINEERING INFORMATION TECHNOLOGY

Subject Code

Subject

Maximum Marks Credits

Theory Practical

End Sem. Mid Sem. Tests(Two tests Average)

Quiz, assignment

End Sem

Lab assignment

L T P

IT 3601Theory of Computation

100 30 20 - - 3 1 -

UNIT IIntroduction of the theory of computation, Finite state automata – description of finite automata, properties of transition functions, Transition graph, designing finite automata, FSM, DFA, NFA, 2-way finite automata, equivalence of NFA and DFA, Mealy and Moore machines.

UNIT IIRegular grammars, regular expressions, regular sets, closure properties of regular grammars, Arden’s theorem, Myhill-Nerode theorem, pumping lemma for regular languages, Application of pumping lemma, applications of finite automata, minimization of FSA.

UNIT IIIIntroduction of Context-Free Grammar - derivation trees, ambiguity, simplification of CFGs, normal forms of CFGs- Chomsky Normal Form and Greibach Normal forms, pumping lemma for CFLs, decision algorithms for CFGs, designing CFGs, Closure properties of CFL’s.

UNIT IVIntroduction of PDA, formal definition, closure property of PDA, examples of PDA, Deterministic Pushdown Automata, NPDA, conversion PDA to CFG, conversion CFG to PDA.

UNIT VTuring machines - basics and formal definition, language acceptability by TM, examples of TM, variants of TMs – multitape TM, NDTM, Universal Turing Machine, offline TMs, equivalence of single tape and multitape TMs. Recursive and recursively enumerable languages, decidable and undecidable problems – examples, halting problem, reducibility. Introduction of P, NP, NP complete, NP hard problems and Examples of these problems.

Reference Books:1. Daniel I.A. Cohen,“Introduction to Computer Theory”,Wiley India.2. John E. Hopcroft, Jeffrey D.Ullman and Rajeev Motwani, “Introduction to Automata Theory, Languages and Computation”, Pearson Education.3. K.L.P Mishra & N.Chandrasekaran,“Theory of Computer Science”, PHI Learning.4. Peter Linz, “Introduction to Automata Theory and Formal Languages”, Narosa Publishing.5. John C Martin, “Introduction to languages and the theory of computation”, TATA McGraw Hill.

Page 2: V Sem Syllabus

UIT-RGPV (AUTONOMOUS), BHOPALBACHELOR OF ENGINEERING INFORMATION TECHNOLOGY

Subject Code

Subject

Maximum Marks Credits

Theory Practical

End Sem.

Mid Sem. Tests(Two tests Average)

Quiz, assignment

End Sem

Lab assignme

nt

L T P

IT 3602 Software Engineering 100 30 20 - - 3 1 -

UNIT IIntroduction to software engineering, Software- problem and prospects Software development process: Software life cycle models, Open source software development, the unified process, documentation, configuration management, Safety, risk assessment.

UNIT IIMeasures, Metrics and Indicators, Metrics in the Process and Project Domains, Software Measurement, Metrics of Software Quality, S/W reliability, Software estimation techniques, loc and FP estimation. Empirical models like COCOMO, project tracking and scheduling, reverse engineering.

UNIT IIISoftware requirements Engineering: problem analysis, Software requiement specifications, Object -Oriented Requirements Analysis, function oriented Analysis, state oriented approach to behavioral specifications. feasibility study, pre/post conditions, algebraic specification and requirement analysis models, Specification design tools. Software design and implementation: Software design objectives, design techniques, User interface design, modularity.

UNIT IVIntroduction to Component-based software engineering, Component models and components, component-based development process and Component life cycle, Architectural approaches in component-based development.

UNIT VSoftware Testing Strategies: Verification and Validation, Strategic Issues, test plan, white box, black-box testing, unit and integration testing, system testing test case design and acceptance testing, maintenance activities. Software project management standards, project management and team organization, on managing softare quality: prespectives on quality, software quality assurance, CMM.

Reference Books:1. P,S. Pressman, “Software Engineering. A Practitioner's Approach” New edition TMH.2. Rajib Mall, “Fundamental of Software Engineering”, PHI.3. Hans Van Vliet, “Software engineering”, third edition, wiley india edition.4. James S. Peters, “Software Engineering”, wiley india edition.5. Pankaj Jalote, “Software engineering: A Precise Approach”, wiley india.6. Kelkar, “Software Project Management”, PHI Learning.

Page 3: V Sem Syllabus

UIT-RGPV (AUTONOMOUS), BHOPALBACHELOR OF ENGINEERING INFORMATION TECHNOLOGY

Subject Code

Subject

Maximum Marks Credits

Theory Practical

End Sem. Mid Sem. Tests(Two tests Average)

Quiz, assignment

End Sem

Lab assignment

L T P

IT 3603Computer Networks

100 30 20 30 20 3 1 2

UNIT IImportance of computer networks, broadcast and point to point networks, Local area networks and Wide area networks, network topology, Introduction to ISO-OSI reference model, TCP/IP reference model , function of each layer, interfaces and services, Protocol data unit, connection oriented and connectionless services, service primitives, comparison of TCP/IP and ISO-OSI reference model, Novel Netware, Arpanet, X.25, RJ-45,Network interface card, rack, cable standard-Category 5,6,and 7,cross connection, straight connection cable coding standards.

UNIT IISwitching techniques- Circuit, packet and hybrid switching, Data-Link layer: - Data link layer design issues, framing, flow & error control, Error detection and correction, link layer addressing, Stop & Wait protocol ,Go back N ARQ ,selective repeat ARQ, piggybacking and pipelining ,HDLC LAN Protocol stack-Logical link control and Media Access Control sublayer, IEEE 802.2 LLC Frame format.

UNIT IIIMAC layer Protocols- , static and dynamic allocation , Pure and slotted ALOHA protocols, Carrier sense multiple access, Persistent and non persistent CSMA, IEEE standard 802.3 and Ethernet,802.3 cabling, IEEE 802.4, IEEE 802.5, FDDI.

UNIT IVThe Network layer- logical addressing, classfull & classless addressing, address mapping, packet delivery & forwarding. unicast routing protocols , multicast routing protocols, Routing algorithm- Least Cost, Dijkstra's, Bellman-ford, congestion control algorithms, Internetworking devices, Introduction to Internet protocol IPv4, next generation IP.

UNIT VTransport layer-Transport services , Process to process delivery, UDP ,TCP ,congestion control , quality of service , Integrated services, Differentiated services LAN-WAN Design and implementation-Configuring TCP/IP, using Ipconfig, ping command , study of structured LAN , study of internetworking devices and their configuration– switches, hubs, Bridges, routers and Gateways

Reference Books:-1. Tanenbaum, “Computer Networks”, PHI Learning.2. B. Forouzan, F. Moshrrof, “Computer Networks A Top Down Approach”, TMH.3. N Olifer and V Olifer ,“Computer Networks”,Wiley publication.4. Michael A. Gallo & William M. Hancock, “Computer Communications & Networking Technologies”, Cengage pearsen publications.5. Black, “Computer Networks: Protocols, Standards and Interfaces”, PHI learning.

Page 4: V Sem Syllabus

List of Experiments:

1. Establishment and configuration of LAN

2. Colour coding standard of CAT 5,6,7 and crimping of cable in RJ-45

3. Study of WAN

4. Study of various network topologies.

5. Study of sliding window protocol

6. Study of IEEE 802.3 , 802.4 ,802.5

7. Study of LAN Trainer.

8. Study of basic networking commands like ping, ipconfig, etc

9. Case study of various Routing Strategies

10. Establishing & studying the various parameters of a home LAN Network

11. Study of IOS of routers

12. Configuring routers, bridges and switches and gateways

Page 5: V Sem Syllabus

UIT-RGPV (AUTONOMOUS), BHOPALBACHELOR OF ENGINEERING INFORMATION TECHNOLOGY

Subject Code

Subject

Maximum Marks Credits

Theory Practical

End Sem. Mid Sem. Tests(Two tests Average)

Quiz, assignment

End Sem

Lab assignment

L T P

IT 3604Operating System

100 30 20 30 20 4 1 2

UNIT IIntroduction to Operating Systems, Types of operating Systems, Function of operating system, basic concepts of CPU scheduling, Scheduling criteria, Scheduling algorithms, algorithm evaluation, multiple processor scheduling

UNIT IIProcess concept, operations on processes, threads, interprocess communication, precedence graphs, critical section problem, semaphores, classical problems of synchronization, Deadlock problem, deadlock characterization, deadlock prevention, deadlock avoidance, deadlock detection, recovery from deadlock, Methods for deadlock handling.

UNIT IIIIntroduction to memory, concepts of memory management, logical and physical address space, swapping, Fixed and Dynamic Partitions, Best-Fit, First-Fit and Worst Fit Allocation, paging, segmentation, and paging combined with segmentation.

UNIT IVConcepts of virtual memory, Cache Memory Organization, demand paging, page replacement algorithms, allocation of frames, thrashing, demand segmentation, Role of Operating System in Security, Security Breaches, System Protection, and Password Management.

UNIT VDisk scheduling, file concepts, File manager, File organization, access methods, allocation methods, free space managements, directory systems, file protection, file organization & access mechanism, File Management in Linux, introduction to distributed systems.

Reference Books:1. Silberschatz,”Operating system”, Willey Pub.2. Pabitra Pal Choudhury, “Operating System-Principle and Design”, PHI Learning.3. Tanenbaum, “Modern Operating System”, PHI Learning.4. Dhananjay M. Dhamdhere, ”Operating System- A concept- Based Approach”, TMH.

Page 6: V Sem Syllabus

List of Experiment

1. Program to implement FCFS CPU scheduling algorithm.

2. Program to implement SJF CPU scheduling algorithm.

3. Program to implement Priority CPU Scheduling algorithm.

4. Program to implement Round Robin CPU scheduling algorithm.

5.Program to implement classical inter process communication problem(producer consumer).

6. Program to implement classical inter process communication problem(Reader Writers).

7.Program to implement classical inter process communication problem(Dining Philosophers).

8. Program to implement FIFO page replacement algorithm.

9. Program to implement LRU page replacement algorithm

10. Program to implement LFU page replacement.

11. Program to implement Optimal page replacement.

Page 7: V Sem Syllabus

UIT-RGPV (AUTONOMOUS), BHOPALBACHELOR OF ENGINEERING INFORMATION TECHNOLOGY

Subject Code

Subject

Maximum Marks Credits

Theory Practical

End Sem. Mid Sem. Tests(Two tests Average)

Quiz, assignment

End Sem

Lab assignment

L T P

IT 3605Digital Communication

100 30 20 30 20 4 1 2

UNIT IDigital signal, Quantization, Quantization error, Pulse code modulation, signal to noise ratio, Eye pattern, Companding, Data rate and Baud rate, Bit rate, multiplexed PCM signal, Differential PCM (DPCM), Delta Modulation (DM), limitations of DM and Adaptive Delta Modulation (ADM), comparison of various systems.

UNIT IIDigital modulations techniques, Generation, detection, equation and Bandwidth of amplitude shift keying (ASK) Binary Phase Shift keying (BPSK), Differential phase shift keying (DPSK), offset and non offset quadrature phase shift keying (QPSK), M-Ary PSK, Binary frequency Shift Keying (BFSK), M-Ary FSK Quadrature Amplitude modulation (QAM), MODEM,

UNIT IIIInformation theory and coding- Uncertainity, Unit of Information, entropy, Rate of information, Joint & Conditional entropy, Mutual information, channel capacity, Shannon’s Theorem, Continuous channel, Capacity of a Gaussian channel: Shannon Hartley Theorem, Bandwidth S/N ratio trade off.

UNIT IVCoding efficiency, Shanon,Fano and Huffman coding, Error control coding-Block codes, parity check codes, linear block codes, cyclic codes, Convolutional codes.

UNIT VData communication concepts – Data transmission – Parallel and serial transmission, synchronous, and Asynchronous transmission, Simplex,half duplex and fullduplex , unipolar and polar line codes, Nonreturn to zero codes, return to zero codes, bipolar line codes, bauds, modem, Line configurations-Point to point and point to multipoint configuration. Reference Books:1. Singh & Sapre, “Communication System”, TMH2. Taub & shilling, “Communication System”, TMH3. Simon Haykins, “Communication System”, Willy4. Hsu, “Analog and digital communication (Schaum)”, TMH5. B.P. Lathi, “Modern Digital and analog communication system”,6. Wayne Tomasi, “Electronic Communication system’.7. Forouzan, “Data communication and networking”, TMH 4th edition8. Prakash C Gupta, “Data communication and Computer Networks”,PHI Learning.9. Analog & Digital Communication System; Discovery Press.10. Frank R. Dungan, “Electronic Communication System”, Thomson/Vikas.

Page 8: V Sem Syllabus

List of Experiments (Expandable)

1. Study of PCM transmitter and receiver.

2. Study of ASK PSK and FSK transmitter and receiver.

3. Case Study of digital interface RS-232.

4. Case Study of Synchronous and asynchronous transmission.

5. Case Study of various multiplexing techniques.

6. Case Study of Parallel and serial transmission.

7. Study of NRZ and RZ Codes.

Page 9: V Sem Syllabus

UIT-RGPV (AUTONOMOUS), BHOPALBACHELOR OF ENGINEERING INFORMATION TECHNOLOGY

Subject Code

Subject

Maximum Marks Credits

Theory Practical

End Sem.

Mid Sem. Tests(Two tests Average)

Quiz, assignment

End Sem

Lab assignment

L T P

IT 3641Computer Programming III

- 30 20 - - - - 2

UNIT IObject-Oriented Programming , overview of Java, Installation, First Simple Program, Compilation process , Java Keywords , Identifiers , Literals, Comments, Data Types, Variables, Arrays, Declaration a variable, Dynamic initialization, the scope and life time of variable, type conversion and casting, Operators, Control Statements,

UNIT IIClass Fundamentals, Simple Class , Abstract Classes, Declaring Objects, Introducing Methods, Constructors, this Keyword, Garbage Collection, finalize( ) Method, Overloading Methods, Overloading Constructors, Using Objects as Parameters, Inheritance, Creating a Multilevel Hierarchy, Packages and Interfaces, Exception Handling, Multithreaded

UNIT IIThe Applet Class: Applet Basics, The Applet Class, Applet Architecture, Applet Initialization and Termination , Simple Applet Display Methods, Simple Banner Applet, Using the Status Window, The HTML APPLET Tag, Passing Parameters to Applets, Improving the Banner Applet.

UNIT IVIntroducing the AWT: Working with Windows, Graphics, and Text, AWT Classes, Window Fundamentals, Component, Container, Panel, Frame, Working with Frame Windows, Handling Events in a Frame Window, AWT Controls, Layout Managers, and Menus, Adding and Removing Controls, GridLayout, BorderLayout, introduction to swing and servlet.

UNIT VEvent Handling, Two Event Handling Mechanisms, The Delegation Event Model, Events, Event Sources, Event Listeners, Event Classes, The MouseEvent Class and others, JDBC: JDBC-ODBC bridge, the connectivity model, the driver manager, navigating the result set object contents, the JDBC exceptional classes, connecting to remote database.

Reference Books:1. Ivor Horton’s, “Beginning Java 2, JDK 5 Ed.”, Wiley India. 2. Naughton & Schildt, “The Complete Reference Java 2”, Tata McGraw Hill.3. Deitel, “Java- How to Program:” Pearson Education, Asia.4. Horstmann & Cornell, “Core Java 2” (Vol I & II ) , Sun Microsystems.5. lvan Bayross, “Java 2.0” : BPB publications. 6. Russell, “Java Programming for the absolute beginners”, PHI Learning.

Page 10: V Sem Syllabus

List of Experiments:

1. Write a program that accepts two numbers from the user and print their sum.

2. Write a program to calculate addition of two number using prototyping of methods.

3. Program to demonstrate function overloading for calculation of average.

4. Program to demonstrating overloaded constructor for calculating box volume.

5. Program to show the detail of students using concept of inheritance.

6. Program to demonstrate package concept.

7. Program to demonstrate implementation of an interface which contains two methods

declaration square and cube.

8. Program to demonstrate exception handling in case of division by zero error.

9. Program to demonstrate multithreading.

10. Program to demonstrate JDBC concept using create a GUI based application for student

information.

11. Program to display “Hello World” in web browser using applet.

12. Program to add user controls to applets.

13. Write a program to create an application using concept of swing.

14. Program to demonstrate student registration functionality using servlets with session

management.

Page 11: V Sem Syllabus

UIT-RGPV (AUTONOMOUS), BHOPALBACHELOR OF ENGINEERING INFORMATION TECHNOLOGY

Subject Code

Subject

Maximum Marks Credits

Theory Practical

End Sem. Mid Sem. Tests(Two tests Average)

Quiz, assignment

End Sem

Lab assignment

L T P

IT 3642Open Source Software Lab I

- - - - 50 - - 2

………………..UNDER CONSTRUCTION, IT MAY BE CHANGE…………………….

UNIT IIntroduction of open source software – linux, PHP, MySQL. Overview of Linx, Various types of linux operating system – Red Hat, suse, fedora, Ubuntu etc. Distributions, Devices and Drives in Linux, File system Hierarchy, Components: Kernel, XFree86, Sawfish, Gnome, installation of linux (Fedora/Ubuntu).

UNIT IICommands like mkdir, touch, ls, pwd, cd, chmod, df, du, dd,  adduser, sort, passwd, rm/rmdir, date, cal, echo, printf, bc, xcalc, scritpt, who, man, chmod, chown, cp, mv, rmdir, cat, tac, more, less, wc, cmp, comm, gzip, gunzip, tar, zip, unzip, cut, paste, sort, grep, ssh, scp, ping, traceroute, telnet, fdisk, mount, unmount, quota, reboot, poweroff etc., Types of Shell, Shell script, executing and debugging shell script, performing arithmetic in shell script, use programming construct in shell script

UNIT IIISystem Administration- root user, super user, overview of GUI tool, configuration files, log files, graphical administration tools, administrative commands, configuring hardware- managing hardware with device kit, configuring modules, listing loaded modules, removing modules, Managing file system and disk space, mounting file system, fstab, mkfs.

UNIT – IVSetting up server setup – connection to network with network manager, connecting to wireless and wired network, network manager command line, configuring TCP/IP for LAN, Host, DNS, Setting up NFS file server, setting up FTP file server.

UNIT - VCreating and formatting documents using Latex.

Reference Books:1. Christopher Negus and Eric Foster Johnson, “Fedora 2011 Edition”, Wiley India.2. Harley Hahn, “Guide to Unix and Linux”, Tata Mc-Graw Hill.