COURSE: Database Management System SEMESTER: 6 CREDITS: 3

Transcription

1 Course: IT 60- Database Management System PROGRAMME: INFORMATION TECHNOLOGY DEGREE: B. TECH COURSE: Database Management System SEMESTER: 6 CREDITS: 3 COURSECODE: IT 60 COURSE AREA/DOMAIN: Practical knowledge about storage, industry CORRESPONDINGLABCOURSE CODE (IFANY):CS 69 COURSE TYPE: Theory CONTACTHOURS:3 (weekly) LABCOURSENAME: Database Management SystemLab Course Objectives The objective of the course is to enable students to understand and use a relational database system. Introduction to Databases, Conceptual design using ERD, Functional dependencies and Normalization, Relational Algebra is covered in detail. Students learn how to design and create a good database and use various SQL operations. The course concludes with an overview of transaction management and introduction to advanced and non-relational databases. Course Outcomes. Able to master the basic concepts and understand the applications of database systems. 2. Able to construct an Entity-Relationship (E-R) model from specifications and to transform to relational model. 3. Able to construct unary/binary/set/aggregate queries in Relational Algebra. 4. Understand and apply database normalization principles. 5. Able to construct SQL queries to perform CRUD operations on database. (Create, Retrieve, Update, Delete) 6. Understand principles of database transaction management, database recovery, security. 7. Be aware of non relational databases and applications. Department of IT Page

2 Syllabus UNIT DETAILS HOURS Introduction to DBMS I Concept & Overview of DBMS, Data Models, Database Languages, Database Administrator, Database Users, Three Schema architecture of DBMS. 2 II Entity-Relationship Model Basic concepts, Design Issues, Mapping Constraints, Keys, Entity-Relationship Diagram, Weak Entity Sets, Extended E-R features. 4 III Relational Model Structure of relational Databases, Relational Algebra, Relational Calculus, Extended Relational Algebra Operations, Views, Modifications Of the Database. 6 IV SQL and Integrity Constraints Concept of DDL, DML, DCL. Basic Structure, Set operations, Aggregate Functions, Null Values, Domain Constraints, Referential Integrity Constraints, assertions, views, Nested Sub-queries, Database security application development using SQL, Stored procedures and triggers. 4 V Relational Database Design Functional Dependency, Different anomalies in designing a Database., Normalization using functional dependencies, Decomposition, Boyce-Codd Normal Form, 3NF, Normalization using multi-valued dependencies, 4NF, 5NF 8 VI Internals of RDBMS Physical data structures, Query optimization: join algorithm, statistics and cost bas optimization. Transaction processing, Concurrency control and Recovery Management: transaction model properties, state serializability, lock base protocols, two phase locking. 7 Department of IT Page 2

3 VII File Organization & Index Structures File & Record Concept, Placing file records on Disk, Fixed and Variable sized Records, Types of Single-Level Index (primary, secondary, clustering), Multilevel Indexes, Dynamic Multilevel Indexes using B tree and B+ tree. 6 Gaps in the syllabus - to meet industry/profession requirements S.N O. DESCRIPTION PROPOSE D P O Distributed database concept, Data mining, ware housing Extra Class a. Topics beyond syllabus/advanced topics S.NO. DESCRIPTION HOURS Distributed Database concept 3 References S.NO Books Henry F. Korth and Silberschatz Abraham, Database System Concepts, Mc.Graw Hill. 2 Ramakrishnan: Database Management System, McGraw-Hill S.NO URL Delivery/Instructional Methodologies S.NO DESCRIPTION Chalk and Talk 2 Study Material, slide show Assessment Methodologies S.NO DESCRIPTION TYPE Student Assignment Direct 2 Tests Direct Department of IT Page 3

4 3 University Examination Direct 4 Student Feedback Indirect Course Plan. S. NO. Module Topic Introduction to DBMS, Advantages, Users, DBA, Application I 2 2 Data Models, Languages, architecture ENTITY-RELATIOSHIP MODEL: 3- Basic concepts, Design Issues, Mapping Constraints, Keys, Entity- 3 6 Relationship Diagram, Weak Entity Sets, Extended E-R features Relational Model Structure of relational Databases, Relational Algebra, Relational Calculus, Extended Relational Algebra Operations, Views, Modifications Of the Database II SQL and Integrity Constraints Concept of DDL, DML, DCL. Basic Structure, Set operations, Aggregate Functions, Null Values, Domain Constraints, Referential Integrity Constraints, assertions, views, Nested Sub-queries, Database security application development using SQL, Stored procedures and triggers Relational Database Design Functional Dependency, Different anomalies in designing a Database., Normalization using functional dependencies, Decomposition, Boyce-Codd Normal Form, 3NF, Normalization using multi-valued dependencies, 4NF, 5NF Internals of RDBMS Physical data structures, Query optimization: join algorithm, statistics and cost bas optimization. Transaction processing, Concurrency control and Recovery Management: transaction model properties, state serializability, lock base protocols, two phase locking III File Organization & Index Structures File & Record Concept, Placing file records on Disk, Fixed and Variable sized Records, Types of Single-Level Index (primary, secondary, clustering), Multilevel Indexes, Dynamic Multilevel Indexes using B tree and B+ tree.. Department of IT Page 4

5 Course: HU-60 Principles of Management PROGRAMME: INFORMATION TECHNOLOGY DEGREE: B. TECH COURSE: Principles of Management SEMESTER: 6 CREDITS: 2 COURSECODE: HU 60 COURSE TYPE: Theory COURSE AREA/DOMAIN: Theory CONTACTHOURS:2 (weekly) CORRESPONDINGLABCOURSE CODE (IFANY):NA LABCOURSENAME: NA Course Objectives The objective of the course is to enable students to understand how manager manage Business organizations Course Outcomes Having successfully completed the course, student will be able to: CO CO CO2 Description Students would be having knowledge of different theories related to Resource Management, Management Theories, Organizational activities. Student will have a broad idea how to adopt with real life situations through case studies. Department of IT Page 5

6 Web Source References S.NO. URL Delivery/Instructional Methodologies S.NO. DESCRIPTION Chalk and Talk and Audio Video Aids 2 Study Material and Case studies Assessment Methodologies S.NO. DESCRIPTION TYPE Student Assignment Direct 2 Tests Direct 3 University Examination Direct 4 Student Feedback Indirect Course Syllabus. Basic concepts of management: Definition Essence, Functions, Roles, Level. 2. Functions of Management: Planning Concept, Nature, Types, Analysis, Management by objectives; OrganisationStructure Concept, Structure, Principles, Centralization, Decentralization, Span of Management; OrganisationalEffectiveness. Module-II 3. Management and Society Concept, External Environment, CSR, Corporate Governance, Ethical Standards. 4. People Management Overview, Job design, Recruitment & Selection, Training & Development, Stress Management. 5. Managerial Competencies Communication, Motivation, Team Effectiveness, Conflict Management, Creativity, Entrepreneurship. Module-III 6. Leadership: Concept, Nature, Styles. 7. Decision making: Concept, Nature, Process, Tools & techniques. Department of IT Page 6

7 8. Economic, Financial & Quantitative Analysis Production, Markets, National Income Accounting, Financial Function & Goals, Financial Statement & Ratio Analysis, Quantitative Methods Statistical Interference, Forecasting, Regression Analysis, Statistical Quality Control. Module-IV 9. Customer Management Market Planning & Research, Marketing Mix, Advertising & Brand Management. 0. Operations & Technology Management Production & Operations Management, Logistics & Supply Chain Management, TQM, Kaizen & Six Sigma, MIS. Readings:. Management: Principles, Processes & Practices Bhat, A & Kumar, A (OUP). 2. Essentials for Management Koontz, Revised edition, Tata McGraw Hill (TMH) 3. Management Stoner, James A. F. (Pearson) 4.Management - Ghuman, Tata McGraw Hill(TMH) Course Plan. S. NO. Module Topic Basic concepts of management: Definition Essence I 2 2 Basic concepts of management: Definition Essence Functions of Management: Planning Concept, Nature, Types, Analysis, Management by objectives; OrganisationStructure Concept, Structure, Principles, Centralization, Decentralization, Span of Management; OrganisationalEffectiveness II 3. Management and Society Concept, External Environment, CSR, Corporate Governance, Ethical Standards. 4. People Management Overview, Job design, Recruitment & Selection, Training & Development, Stress Management Managerial Competencies Communication, Motivation, Team Effectiveness, Conflict Management, Creativity, Entrepreneurship Leadership: Concept, Nature, Styles. 7. Decision making: Concept, Nature, Process, Tools & techniques. Department of IT Page 7

8 Economic, Financial & Quantitative Analysis Production, Markets, National Income Accounting, Financial Function & Goals, Financial Statement & Ratio Analysis, Quantitative Methods Statistical Interference, Forecasting, Regression Analysis, Statistical Quality Control III 9. Customer Management Market Planning & Research, Marketing Mix, Advertising & Brand Management. 0. Operations & Technology Management Production & Operations Management, Logistics & Supply Chain Management, TQM, Kaizen & Six Sigma, MIS. Department of IT Page 8

9 Course: IT 603 Software Engineering PROGRAMME:INFORMATION TECHNOLOGY DEGREE:BTECH YEAR:JANUARY204 JUNE 204 COURSE:SOFTWARE ENGINEERING SEMESTER: VI CREDITS:3 COURSECODE: IT 603 REGULATION: 204 COURSE AREA/DOMAIN: SOFTWARE DEVELOPMENT STRATEGIES, PLANNING, UML, TESTING AND PROJECT MANAGEMENT COURSE TYPE: THEORY CONTACTHOURS: 3L/WEEK CORRESPONDINGLABCOURSE CODE(IFANY): IT693 LAB COURSE NAME: SOFTWARE ENGINEERING LAB Course pre-requisites CODE COURSE NAME DESCRIPTION SEM HU50 Economics for Engineer Fundamental concept of Management required for Project Management V IT40 Object Oriented Programming & UML UML basics IV Course Objectives To develop an understanding of software engineering, software crisis, SDLC. Understanding the concept of software project planning feasibility analysis, requirement analysis, SRS documents. Come to know the software designing strategies structured analysis, structured design, DFD, structure chart. Understand concept of Project Management along with software testing, maintenance, back-up. Finally understanding of UML to design effectively a given software. Course Outcomes CO: Evaluate and analyze the SDLC and basic architecture SRS documents. CO2: Help to understand the software design and coding techniques. CO3: Understand the software testing principles. CO4: Understand the concept project management. CO5: Identify various concepts of Advanced UML techniques. Department of IT Page 9

10 Syllabus MODULE DETAILS LECTURE I II III IV V Overview of System Analysis & Design, Business System Concept, System Development Life Cycle, Waterfall Model, Spiral Model, Feasibility Analysis, Technical Feasibility, Cost- Benefit Analysis, COCOMO model. System Design Context diagram and DFD, Problem Partitioning, Top-Down And Bottom-Up design; Decision tree, decision table and structured English; Functional vs. Object- Oriented approach. Coding & Documentation Structured Programming, OOProgramming, Information Hiding, Reuse, System Documentation. [4L] Testing Levels of Testing, Integration Testing, Test case Specification, Reliability Assessment, Validation & Verification Metrics, Monitoring & Control. [8L] Software Project Management Project Scheduling, Staffing, Software Configuration Management, Quality Assurance, Project Monitoring. [7L] Fundamentals of Object Oriented design in UML Static and dynamic models, why modeling, UML diagrams: Class diagram, interaction diagram: collaboration diagram, sequence diagram, state chart diagram, activity diagram, implementation diagram TOTALHOURS 44 Gaps in the syllabus - to meet industry/profession requirements S.NO. DESCRIPTION PROPOSED ACTIONS Intermediate COCOMO Extra Class 2 4 th Generation Process Model Extra Class PO MAPPING Topics beyond syllabus/advanced topics S.NO. DESCRIPTION HOURS 4 th Generations Process Models 2 Project Management Advance Topics (Time, Cost and Scope Management) 3 Web Source References S.NO. URL Department of IT Page 0

11 2 Delivery/Instructional Methodologies S.NO. DESCRIPTION Chalk and Talk 2 Power Point guided Lecture 3 Study Material Assessment Methodologies S.NO. DESCRIPTION TYPE Student Assignment Direct 2 Tests Direct 3 University Examination Direct 4 Student Feedback Indirect Course Plan S. NO. Module Topic I Overview of System Analysis & Design 2 2 I Business System Concept, System Development Life Cycle 3 3 I Waterfall Model, Spiral Model 4 4 I Feasibility Analysis, Technical Feasibility 5 5 I Cost- Benefit Analysis 6 6 I COCOMO model 7 7 II System Design Context diagram and DFD 8 8 II Problem Partitioning 9 9 II Top-Down And Bottom-Up design 0 0 II Decision tree and decision table II Functional vs. Object- Oriented approach 2 2 III Coding & Documentation Structured Programming 3 3 III Object Oriented Programming, Information Hiding 4 4 III Reuse, System Documentation 5 5 III Testing Levels of Testing 6 6 III Integration Testing, Test case Specification 7 7 III Reliability Assessment, Validation & Verification Department of IT Page

12 8 8 III Metrics Monitoring 9 9 III Metrics Control IV Software Project Management 2 2 IV Project Scheduling IV Staffing IV Software Configuration Management IV Quality Assurance IV Project Monitoring V Fundamentals of Object Oriented design in UML V Static and dynamic models V Why modeling, UML diagrams V Class diagram V Interaction diagram: collaboration diagram, sequence diagram V State chart diagram V Activity diagram V Implementation diagram Project Management Advance Topics Revision Class Department of IT Page 2

13 Course: IT602 Computer Networking PROGRAMME: Information Technology DEGREE:B. TECH COURSE: Computer Networking SEMESTER: VI CREDITS: 3 COURSECODE: IT602 COURSE TYPE: Theory COURSE AREA/DOMAIN: Communication and Networking CONTACT HOURS: 3 (weekly) CORRESPONDING LAB COURSE CODE (IF ANY): IT692 LAB COURSE NAME: Network Lab Course pre-requisites CODE COURSE NAME DESCRIPTION SEM CS40 Communication Engineering & Coding Theory Knowledge of communication engineering & coding theory IV Course Objectives. To develop an understanding of computer networking basics. 2. To develop an understanding of different components of computer networks, various protocols, modern technologies and their applications. Course Outcomes. Recognize the technological trends of Computer Networking. 2. Discuss the key technological components of the Network. 3. Evaluate the challenges in building networks and solutions to those. Department of IT Page 3

14 Syllabus UNIT DETAILS HOURS I Overview of Data Communication and Networking: [4L] Introduction; Data communications: components, data representation (ASCII,ISO etc.), direction of data flow (simplex, half duplex, full duplex); network criteria, physical structure (type of connection, topology), categories of network (LAN, MAN,WAN); Internet: brief history, Protocols and standards; Reference models: OSI reference model, TCP/IP reference model, their comparative study. Physical Level: [6L] Overview of data(analog & digital), signal(analog & digital), transmission (analog & digital) & transmission media (guided & unguided); Circuit switching: time division & space division switch, TDM bus; Telephone Network; 0 II Data link Layer: [5L] Types of errors, framing(character and bit stuffing), error detection & correction methods; Flow control; Protocols: Stop & wait ARQ, Go-Back- N ARQ, Selective repeat ARQ, HDLC; Medium Access sub layer: [5L] Point to Point Protocol, LCP, NCP, Token Ring; Reservation, Polling, Multiple access protocols: Pure ALOHA, Slotted ALOHA, CSMA, CSMA/CD, CSMA/CA Traditional Ethernet, fast Ethernet(in brief); 0 III Network layer: [8L] Internetworking & devices: Repeaters, Hubs, Bridges, Switches, Router, Gateway; Addressing : IP addressing, subnetting; Routing : techniques, static vs. dynamic routing, Unicast Routing Protocols: RIP, OSPF, BGP; Other Procols: ARP, IP, ICMP, IPV6;. Transport layer: [4L] Process to Process delivery; UDP; TCP; Congestion Control: Open Loop, Closed Loop choke packets; Quality of service: techniques to improve QoS: Leaky bucket algorithm, Token bucket algorithm. 2 IV Application Layer [5L] Introduction to DNS, SMTP, SNMP, FTP, HTTP & WWW; Security: Cryptography (Public, Private Key based), Digital Signature, Firewalls. Modern topics: [5L] ISDN services & ATM, DSL technology, Cable Modem: Architecture & Operation in brief Wireless LAN: IEEE 802., Introduction to blue-tooth. 0 Text Books:. B. A. Forouzan Data Communications and Networking (3rd Ed.) TMH 2. A. S. Tanenbaum Computer Networks (4th Ed.) Pearson Education/PHI 3. W. Stallings Data and Computer Communications (5th Ed.) PHI/ Pearson Education 4. Zheng & Akhtar, Network for Computer Scientists & Engineers, OUP 5. Black, Data & Computer Communication, PHI 6. Miller, data Communication & Network, Vikas 7. Miller, Digital & Data Communication, Jaico 8. Shay, Understanding Data Communication & Network, Vikas Department of IT Page 4

15 Reference Books:. Kurose and Rose Computer Networking -A top down approach featuring the internet Pearson Education 2. Leon, Garica, Widjaja Communication Networks TMH 3. Walrand Communication Networks TMH. 4. Comer Internetworking with TCP/IP, vol., 2, 3 (4th Ed.) Pearson Education/PHI Gaps in the syllabus - to meet industry/profession requirements S.NO. DESCRIPTION PROPOSED ACTIONS Applying the theoretical Knowledge Case Study and Assignment PO MAPPING a. Topics beyond syllabus/advanced topics S.NO. DESCRIPTION HOURS Case Study : Asked to present an architectural and implementation solution for a small sized enterprise. Case study for developing a website and hosting it on the web.. 6 Delivery/Instructional Methodologies S.NO. DESCRIPTION Chalk and Talk 2 PPTs Assessment Methodologies S.NO. DESCRIPTION TYPE Student Assignment Direct 2 Tests Direct Department of IT Page 5

16 3 University Examination Direct 4 Student Feedback Indirect Course Plan Module No. Module Name Topic Lecture Hour Overview of Data Communication and Networking Introduction; Data communications: components, data representation (ASCII,ISO etc.), direction of data flow (simplex, half duplex, full duplex). Network criteria, physical structure (type of connection, topology), Categories of network (LAN, MAN,WAN); Internet: brief history, Protocols and standards; Reference models: OSI reference model, TCP/IP reference model, their comparative study. Overview of data (analog & digital), signal (analog & digital). Transmission (analog & digital) Physical Layer Transmission media (guided & unguided) Circuit switching Time division & space division switch, TDM bus Telephone Network 2 Data link Layer Types of errors, framing(character and bit stuffing), Error detection & correction methods; Flow control; Protocols: Stop & wait ARQ, Go-Back- N ARQ, Selective repeat ARQ, HDLC; Medium Access sub layer: Point to Point Protocol, LCP, NCP, Token Ring; Reservation, Polling, Multiple access protocols: Pure ALOHA, Slotted ALOHA, CSMA, CSMA/CD, CSMA/CA Traditional Ethernet, fast Ethernet(in brief) Department of IT Page 6

17 3 Network Layer Internetworking & devices: Repeaters, Hubs, Bridges, Switches, Router, Gateway; Addressing : IP addressing, subnetting; Routing : techniques, static vs. dynamic routing, Unicast Routing Protocols: RIP, OSPF, BGP; Other Procols: ARP, IP, ICMP, IPV6;. Process to Process delivery; UDP; TCP; Transport layer Congestion Control: Open Loop, Closed Loop choke packets; Quality of service: techniques to improve QoS: Leaky bucket algorithm, Token bucket algorithm. Application Layer Introduction to DNS SMTP, SNMP FTP, HTTP & WWW Security: Cryptography (Public, Private Key based) 4 Digital Signature, Firewalls. ISDN services & ATM, DSL technology, Cable Modem: Architecture & Operation in brief 2 Modern topics Wireless LAN: IEEE 802., Introduction to blue-tooth. 2 Department of IT Page 7

18 Course: IT604B- Computer Graphics PROGRAMME: INFORMATION TECHNOLOGY DEGREE:B. TECH COURSE: Computer Graphics SEMESTER: 5 CREDITS: 3 COURSECODE: IT604 B COURSE TYPE: Theory COURSE AREA/DOMAIN: Mathematics, Algorithms CONTACTHOURS: 3 (weekly) CORRESPONDING LAB COURSE CODE (IF ANY): NA LAB COURSE NAME: NIL Course pre-requisites CODE COURSE NAME DESCRIPTION SEM PH 30 Physics Physics III M 40 Mathematics Mathematical Knowledge IV IT 50 Design & Analysis Of Algorithm Concepts of algorithm and design V Course Objectives 3. To develop an understanding of different graphics I/O devices 4. To develop mathematical skills to model graphics primitive 5. To improve the logical ability to model regular and irregular graphics objects 6. To gain the knowledge of colors, shedding, and Texture 7. To build strong foundation for higher studies and research work Course Outcomes CO: understand Raster graphics, vector graphics and various graphics I/O devices CO2: To develop mathematical models for representing various objects ( both regular and irregular) in computer CO3: To understand effects of color, lighting, shading etc. on modeled objects/scenes to make it realistic. CO4: To obtain various operators for performing various affine transformation operations. CO5: To build strong foundation to study advanced courses like Image Processing, Pattern Recognition and research work. Department of IT Page 8

19 Syllabus UNIT DETAILS HOUR Introduction to Computer graphcs & Graphics Systems:[6L] S Overview of computer graphics, representing pictures, preparing, presenting & interacting with pictures for presentations; 2. Visualization & image processing; RGB color model, direct coding, lookup table; 2 storage tube graphics display, Raster scan display, 3D viewing devices, Plotters, printers, digitizers, Light 2 pens etc.; Active & Passive graphics devices; Computer graphics software.. 2. Scan conversion [8L]: Points & lines, Line drawing algorithms; DDA algorithm, Bresenham s line algorithm, Circle generation algorithm; Ellipse generating algorithm; scan line polygon, fill algorithm, boundary fill algorithm, flood fill algorithm. 2D transformation & viewing [5L]: Basic transformations: translation, rotation, scaling; Matrix representations & homogeneous coordinates, transformations between coordinate systems; Reflection, shear; Transformation of points, lines, parallel lines, intersecting lines. Viewing pipeline, Window to view port co-ordinate transformation, clipping operations, point clipping, line clipping, clipping circles, polygons & ellipse. Cohen and Sutherland line clipping, Sutherland-Hodgeman Polygon clipping, Cyrus-beck clipping method D transformation & viewing [5L]: 3D transformations: translation, rotation, scaling & other transformations. Rotation about an arbitrary axis in space, reflection through an arbitrary plane; general parallel projection transformation; clipping, view port clipping, 3D viewing. Curves [3L]: Curve representation, surfaces, designs, Bezier curves, B-spline curves, end conditions for periodic B-spline curves, rational B-spline curves. Hidden surfaces [3L] Depth comparison, Z-buffer algorithm, Back face detection, BSP tree method, the Painter s algorithm, scan-line algorithm; Hidden line elimination, wire frame methods, fractal - geometry Color & shading models [2L]: Light & color model; interpolative shading model; Texture Introduction to Ray-tracing: [3L] Human vision and color, Lighting, Reflection and transmission models. 3 Department of IT Page 9

20 Gaps in the syllabus - to meet industry/profession requirements PROPOSED PO S.NO. DESCRIPTION ACTIONS MAPPING Lab Sessions for practical Implementation of concepts Extra Class Topics beyond syllabus/advanced topics S.NO. DESCRIPTION HOURS Demonstration of practical implementation of graphics algorithms. 3 Web Source References S.NO. URL Delivery/Instructional Methodologies S.NO. DESCRIPTION Chalk and Talk 2 Study Material 3 Power Point Presentation 4 Audio Visual Assessment Methodologies S.NO. DESCRIPTION TYPE Student Assignment/Small Projects Direct 2 Mid Semester Examinations Direct 3 Online Tests Direct 4 University Examinations Direct Department of IT Page 20

21 5 Student Feedback Indirect Course Plan Lec. no Week Module Topic Introduction to Computer Graphics & Graphics Systems: Overview of CG, definitions of CG, types of CG. 2 Introduction to Computer Graphics & Graphics Systems contd. storage tubes displays, CRT technologies - Raster Scan Display. 3 Introduction to Computer Graphics & Graphics Systems contd. Other Graphics Input Output Devices- Flat Panel and LCD 4 Introduction to Computer Graphics & Graphics Systems contd. Raster graphics, Vector graphics, Computer graphics software. 5 2 Scan Conversion: Points & lines, Line drawing algorithms; DDA algorithm 6 2 Bresenham s line algorithm 7 2 Circle generation algorithm 8 2 Ellipse generating algorithm 9 3 scan line polygon fill algorithm, 0 3 boundary fill algorithm,., 2 3 flood fill algorithm, Stack based Fill Algorithm; Numerical problems 2D Transformation 3 4 Coordinate Systems, Homogeneous coordinates, Basic transformations: 2 translation, 4 4 2D Transformation Cond.. Rotation, scaling; Matrix representations using homogeneous coordinates 5 4 2D Affine Transformations, Mirror Reflection, Shear 6 4 Numerical problems in 2D Transformation Transformations between coordinate systems; 8 5 Transformation of points, lines, Transformation of parallel lines, intersecting lines. 9 5 Viewing: Viewing pipeline, Window to Viewport co-ordinate transformation Clipping operations, point clipping, line clipping 2 6 Sutherland-Cohen line clipping; Cyrus-beck clipping method for line clipping 23 6 Sutherland-Hodgeman Polygon clipping, Clipping circles, polygons & ellipse 3D Transformation & Viewing 25 7 Different types of 3D Coordinate Systems, 3D transformations: 2 translation, rotation D Transformation Contd. Rotation about an arbitrary axis in space; Department of IT Page 2

22 3D Transformation Contd Scaling & other transformations. reflection through an arbitrary 2 plane 28 7 Projection: Different Types of projections 29 8 General perspective projection transformation; 30 8 Numerical problems of Perspective projection general parallel projection transformation; 32 8 Numerical problems of Parallel projection 33 9 clipping, Viewport clipping, 3D viewing D viewing Contd... perspectives & Depth Cueing 35 9 Curves and Fractals: 3 Curve representation, surfaces and designs 36 9 Bezier curves 37 0 B-spline curves End conditions for periodic B-spline curves, rational B-spline curves 39 0 Hidden Surfaces: Depth comparison, Z-buffer algorithm 40 0 Back face detection, BSP tree method, Painter s algorithm 4 3 Scan-line algorithm; Hidden line elimination, wire frame methods 42 Fractal - geometry 43,44 Color & shading models : Light & color model; interpolative shading model; Texture 3 Introduction to Ray-tracing: Human vision and color, Lighting, Reflection and transmission 45,46,47 2 models Concluding Session- EX 49 3 Concluding Session-2 Department of IT Page 22

23 Course:IT605C Compiler Design PROGRAMME: INFORMATION TECHNOLOGY DEGREE:BTECH YEAR:JAN204 JUN 204 COURSE:COMPILER DESIGN SEMESTER: VI CREDITS:3 COURSECODE: IT605C REGULATION: 204 COURSE AREA/DOMAIN: DESIGNING OF COMPILERS COURSE TYPE: THEORY CONTACTHOURS: 3L/WEEK CORRESPONDINGLABCOURSE CODE(IFANY): NA LABCOURSE NAME: NA Course pre-requisites CODE COURSE NAME DESCRIPTION SEM CS402 Formal Language and Automata Theory Fundamentals and the behaviours of a system IV Course Objectives 4. To understand the task of compilation. 5. To develop the architecture of a compiler. Course Outcomes. Understand lexical analyzer and parser generator tools. 2. Build symbol tables and generating intermediate code. 3. Generate assembly code for a RISC machine. 4. Implement a parser such as a bottom-up SLR and implement semantic rules into a parser that performs attribution while parsing. 5. Understand compiler architecture, register allocation and compiler optimization. Syllabus MODULE DETAILS LECTURE I Introduction to Compiling Compilers, Analysis of the source program, The phases of the compiler, Cousins of the compiler 3 II Lexical Analysis The role of the lexical analyzer, Tokens, Patterns, Lexemes, Input buffering, Specifications of a token, Recognition of a tokens, Finite automata, From a regular expression to an NFA, From a regular expression to NFA, From a regular expression to DFA, Design of a lexical analyzer generator (Lex). 6 Department of IT Page 23

24 III Syntax Analysis The role of a parser, Context free grammars, Writing a grammar, Top down Parsing, Non-recursive Predictive parsing (LL), Bottom up parsing, Handles, Viable prefixes, Operator precedence parsing, LR parsers (SLR, LALR), Parser generators (YACC). Error Recovery strategies for different parsing techniques. 9 IV V VI VII Syntax directed translation Syntax director definitions, Construction of syntax trees, Bottom-up evaluation of S attributed definitions, L attributed definitions, Bottom-up evaluation of inherited attributes. Type checking Type systems, Specification of a simple type checker, Equivalence of type expressions, Type conversions Run time environments Source language issues (Activation trees, Control stack, scope of declaration, Binding of names), Storage organization (Subdivision of run-time memory, Activation records), Storage allocation strategies, Parameter passing (call by value, call by reference, copy restore, call by name), Symbol tables, dynamic storage allocation techniques. Intermediate code generation Intermediate languages, Graphical representation, Three-address code, Implementation of three address statements (Quadruples, Triples, Indirect triples) VIII IX Code optimization Introduction, Basic blocks & flow graphs, Transformation of basic blocks, Dag representation of basic blocks, The principle sources of optimization, Loops in flow graph, Peephole optimization. Code generations Issues in the design of code generator, a simple code generator, Register allocation & assignment. 5 4 TOTALHOURS 45 Department of IT Page 24

25 Gaps in the syllabus - to meet industry/profession requirements PROPOSED PO S.NO. DESCRIPTION ACTIONS MAPPING Worst Case Execution Time Estimation Extra Class a. Topics beyond syllabus/advanced topics S.NO. DESCRIPTION HOURS Worst Case Execution Time Estimation 2 Delivery/Instructional Methodologies S.NO. DESCRIPTION Chalk and Talk 2 Study Material Assessment Methodologies S.NO. DESCRIPTION TYPE Student Assignment Direct 2 Tests Direct 3 University Examination Direct 4 Student Feedback Indirect Course Plan S. NO. Module Topic I Introduction to Compiling Compilers, Analysis of the source program 2 2 I The phases of the compiler 3 3 I Cousins of the compiler 4 4 II Lexical Analysis The role of the lexical analyzer, Tokens, Patterns, Lexemes Department of IT Page 25

26 5 5 II Input buffering, Specifications of a token, Recognition of a Tokens 6 6 II Input buffering, Specifications of a token, Recognition of a Tokens 7 7 II From a regular expression to NFA, From a regular expression to DFA, 8 8 II From a regular expression to NFA, From a regular expression to DFA, 9 9 II Design of a lexical analyzer generator (Lex). 0 0 III Syntax Analysis The role of a parser, III 2 2 III 3 3 III Context free grammars, Writing a grammar Top down Parsing, Non-recursive Predictive parsing (LL), Top down Parsing, Non-recursive Predictive parsing (LL), 4 4 III 5 5 III Bottom up parsing, Handles, Viable prefixes, Bottom up parsing, Handles, Viable prefixes, 6 6 III Operator precedence parsing, LR parsers (SLR, LALR), 7 7 III LR parsers (SLR, LALR), Parser generators (YACC). 8 8 III Error Recovery strategies for different parsing 9 9 IV Syntax directed translation Syntax director definitions, Construction of syntax trees, IV 2 2 IV Bottom-up evaluation of S attributed definitions, Bottom-up evaluation of S attributed definitions, IV L attributed definitions, IV Bottom-up evaluation of inherited attributes V Type checking Type systems, V Specification of a simple type checker, V Equivalence of type expressions, V Type conversions Department of IT Page 26

27 28 28 VI VI Run time environments Source language issues (Activation trees, Control stack, scope of declaration, Binding of names), Storage organization (Subdivision of run-time memory, Activation records), VI Storage allocation strategies, Parameter passing (call by value, call by reference, copy restore, call by name), 3 3 VI Symbol tables, VI Dynamic storage allocation techniques VII Intermediate code generation Intermediate languages, VII Graphical representation, VII VII VIII Three-address code, Implementation of three address statements (Quadruples, Triples, Indirect triples) Three-address code, Implementation of three address statements (Quadruples, Triples, Indirect triples) Code optimization Introduction, Basic blocks & flow graphs, VIII Introduction, Basic blocks & flow graphs, Transformation of basic blocks, VIII Dag representation of basic blocks, The principle sources of optimization, VIII Loops in flow graph, 4 4 VIII Peephole optimization IX Code generations Issues in the design of code generator, IX Issues in the design of code generator, IX A simple code generator, IX Register allocation & assignment. Department of IT Page 27

28 Department of IT Page 28

29 Department of IT Page 29

30 Department of IT Page 30

31 Department of IT Page 3

32 Course: IT693 Software Engineering Lab PROGRAMME: INFORMATION TECHNOLOGY DEGREE:BTECH YEAR:JANY204 JUN 204 COURSE: SOFTWARE ENGINEERING LAB SEMESTER: V I CREDITS: 2 COURSECODE: IT693 REGULATION: 205 COURSE AREA/DOMAIN: DEVELPING SOFTWARE PROJECTS COURSE TYPE: PRCTICAL CONTACTHOURS: 3P/WEEK Course Objectives. To develop an understanding of software engineering basics. 2. To develop an understanding of different components of feasibility study, requirement analysis, designing, coding, testing and maintenance of a software project. Course Outcomes a. Recognize the designing abilities of Software Engineering. b. Discuss the key components for developing the software. c. Evaluate the challenges in building software. Instrumentation: Apply appropriate instruments and/or software tools and handle them carefully and safely to make measurements of physical quantities or perform data analysis. 2 Models: Identify the strength and limitations of theoretical models and establish a relationship between measured data and underlying physical principles. 3 Experiment: Specify appropriate equipment and procedures/algorithms, implement these procedures/algorithms, analyze and interpret the resulting data. 4 Design: Design and build a software/hardware part to meet desired specifications and tests it using appropriate testing strategy and/or equipments. 5 Teamwork: Work effectively in teams to accomplish the assigned responsibilities in an integral manner. 6 Communication: Communicate effectively about laboratory work both orally and in writing journals/technical reports. Department of IT Page 32

33 Syllabus MODULE DETAILS For Software Engineering Lab,design a project proposal which will be used throughout the lab for performing different experiments using CASE Tools. 2 Preparation of requirement document for proposed project in standard format. 3 Project Schedule preparation using tools like MSProject.Generation of Gnatt and PERT chart from schedule.prepare 4 Project Management Plan in standard format. 5 Draw Use Case diagram,class diagram,sequence diagram and prepare Software Design Document using tools like Rational Rose. 6 Estimate project size using Function Point(FP)/Use Case Point.Use Excel/Open Office template for calculation. 7 Design Test Script/Test Plan(both Black box and WhiteBox approach) for a small component of the proposed project.(develop that component using programming languages like c/java/vb etc.) 8 Generate Test Result and perform defect root cause analysis using Pareto or Fishbone diagram. 9 Familiarization with any Version Control System like CVS/VSS/Pvcs etc. (Following projects can be used as dummy projects: Library Management System Railway Reservation System Employee Payroll Online Banking System Online Shopping Cart Online Examination) Gaps in the syllabus - to meet industry/profession requirements PROPOSED LO S.NO. DESCRIPTION ACTIONS MAPPING UML Usage Extra Class 2,4 Topics beyond syllabus/advanced topics S.NO. DESCRIPTION HOURS Department of IT Page 33

34 UML Usage 3 Delivery/Instructional Methodologies S.NO. DESCRIPTION Practical Experiments and Assignments 2 Lab Material Assessment Methodologies S.NO. DESCRIPTION TYPE Student Assignment Direct 2 Tests Direct 3 University Examination Direct 4 Student Feedback Indirect Course Plan Module No. Topic Practical Hour For Software Engineering Lab,design a project proposal which will be used throughout the lab for performing different experiments using CASE Tools. 2 2 Preparation of requirement document for proposed project in standard format. 6 3 Project Schedule preparation using tools like MSProject.Generation of Gnatt and PERT chart from schedule.prepare 6 4 Project Management Plan in standard format Draw Use Case diagram,class diagram,sequence diagram and prepare Software Design Document using tools like Rational Rose. 6 Estimate project size using Function Point(FP)/Use Case Point.Use Excel/Open Office template for calculation. 6 7 Design Test Script/Test Plan(both Black box and WhiteBox approach) for a small component of the proposed project.(develop that component using programming languages like c/java/vb etc.) 9 Department of IT Page 34

35 8 Generate Test Result and perform defect root cause analysis using Pareto or Fishbone diagram. 4 Familiarization with any Version Control System like CVS/VSS/Pvcs etc. 9 (Following projects can be used as dummy projects: Library Management System Railway Reservation System Employee Payroll Online Banking System Online Shopping Cart Online Examination) 3 Assignment Set S. NO. Question Prepare a SRS document in line with the IEEE recommended standards for any one of the given case/problem statement. Library Management System Railway Reservation System Employee Payroll Online Banking System Online Shopping Cart Online Examination 2 Draw the use case diagram and specify the role of each of the actors. Also state the precondition postcondition and function of the each use case Draw the activity diagram. Identify the classes. Classify the weak and strong classes & draw the case diagram. Draw the sequence diagram for any two scenarios. Draw the collaboration diagram. Draw the chart diagram. Department of IT Page 35

36 8 9 Perform Coding. Perform testing. Department of IT Page 36

37 Course: IT692 Computer Networking Lab PROGRAMME: INFORMATION TECHNOLOGY DEGREE:BTECH YEAR:JANY204 JUN 204 COURSE: Computer Networking LAB SEMESTER: V I CREDITS: 2 COURSECODE: IT692 REGULATION: 205 COURSE AREA/DOMAIN Networking COURSE TYPE: PRCTICAL CONTACTHOURS: 3P/WEEK Course Objectives. To develop an understanding of computer networking basics. 2. To develop an understanding of different components of computer networks, various protocols, modern technologies and their applications. Course Outcomes. Recognize the technological trends of Computer Networking. 2. Discuss the key technological components of the Network. 3. Evaluate the challenges in building networks and solutions to those. Syllabus:.NIC Installation & Configuration (Windows/Linux) 2) Understanding IP address, subnet etc 2. Familiarization with x. Networking cables (CAT5, UTP) xi. Connectors (RJ45, T-connector) xii. Hubs, Switches 3. TCP/UDP Socket Programming Simple, TCP based, UDP based 4.Multicast & Broadcast Sockets Implementation of a Prototype Multithreaded Server Implementation of Data Link Layer Flow Control Mechanism (Stop & Wait, Sliding Window) Data Link Layer Error Detection Mechanism (Cyclic Redundancy Check) Data Link Layer Error Control Mechanism (Selective Repeat, Go Back N) 8) Server Setup/Configuration FTP, TelNet, NFS, DNS, Firewall Gaps in the syllabus - to meet industry/profession requirements S.NO. DESCRIPTION PROPOSED ACTIONS Router Configuration using GNS3 Emulator Extra LAB 2 Design Network and Simulation through OPNET Extra LAB Department of IT Page 37

38 Topics beyond syllabus/advanced topics S.NO. DESCRIPTION HOURS Design a structured network using NETSIM/GNS3 3 2 Simulaltion different network approach using OPNET 3 Web Source References S.NO. URL Delivery/Instructional Methodologies S.NO. DESCRIPTION Computer Lab and Lecture 2 Study Material IX. Assessment Methodologies S.NO. DESCRIPTION TYPE Student Assignment Direct 2 Tests Direct 3 University Examination Direct 4 Student Feedback Indirect Assignments : Part- A. Write a program to find a shortest path. The status of nodes will be given through keyboard 2. Write a program in java to find out the IP of a computer. The name will be given through keyboard/command line. Department of IT Page 38

39 3. Write a program to send a text message to another computer through TCP/IP protocol. 4. Write a program which works like ping command. 5. Write a program to send a file to another computer. 6. Create a : chat program through java. 7. Create a :n chat program through java. 8. Write a program to count how many nodes are running. Part B. Create a peer to peer network by using Ethernet card, cat 5 cable & RJ45 connectors 2. Design & configure local area network using switch/hub 3. Design & configure a wireless network using AP. 4. Configure a DNS Server. 5. Configure a FTP server and client. 6. Design a structured network using NETSIM/GNS3 Department of IT Page 39

40 CODE:IT68 Seminar PROGRAMME: Information Technology DEGREE: B.Tech COURSE: Seminar SEMESTER: VI CREDIT: 2 COURSE CODE:IT68 COURSE AREA/DOMAIN: Language and Communication CORRESPONDING LAB COURSE CODE IF ANY: NA COURSE TYPE: Lab CONTACT HOURS: 3 (weekly) LAB COURSE NAME: Seminar Course pre-requisites CODE COURSE NAME DESCRIPTION SEM HU 0 & HU 8 English Language The students must have basic command of English to talk about day to day events and experiences of life. I Course Objectives. Understand how to critically analyze data from research; incorporate it into a presentation, 2. Understand the ethical, international, social, and professional constraints of audience, style, and content 3. Researching contemporary technical topics, analyzing quantifiable data discovered by researching, and constructing finished professional workplace documents. a) among managers or co-workers and colleagues of an organization, and b) between organizations, or between an organization and the public. 4. Understand the current resources (such as search engines and databases) for locating secondary information, and also understand the strategies of effective primary data gathering. Course Outcomes. Ability to use the unique qualities of professional rhetoric, such as sentence conciseness, clarity, accuracy, honesty, avoiding wordiness or ambiguity, using direct order organization, readability, coherence and transitional devices; ability to revise and edit effectively in all assignments. 2. Ability to recognize, explain, and use the rhetorical strategies and the formal elements of these specific genres of technical communication: technical abstracts, data based research reports, instructional manuals, technical descriptions, web pages, wikis, and correspondence. Department of IT Page 40

41 Syllabus Unit Details Hours. Pre-Seminar Content Launch Activity, Background information, Inspectional read, Analytical read, Vocabulary Seminar questions-opening: Identifying main ideas from the text, Core: analyse textual details, Closing: Personalising and applying the ideas. 2. Post Seminar Process Have participants do a written self-assessment of the personal participation, a group assessment of the social and intellectual goals of seminar. 3. Practice sessions Individual presentations, tackling questions on the topic discussed Final Presentations 6 Gaps in the syllabus - to meet industry/profession requirements S.No. Description Proposed actions Developing Analytical and Problem Solving Skills Observing, Making notes, researching, Evaluate information or situations Break them down into their key components Consider various ways of approaching and resolving them 2 Reading skills Updating on current issues relating to field of study Web Source References Department of IT Page 4

42 S.No. URL Information Technology Syllabus(Revised New Syllabus:Updated) Delivery/Instructional Methodologies S.No. DESCRIPTION Lecture (LT) 2 Power Point Presentation (PP) 3 Laboratory Session (LS) 4 Chalk Board (CB) 5. Group Discussion (GD) Assessment Methodologies S. No. Description Type. Oral and PPTs Direct Course Plan S. No. Module Topic Presentation: Purpose, Types of Presentations Media & Means of Presentation: OHP/POWER POINT/ Other Audio-Visual Aids A Teaching Presentation as a skill, Strategies and Standard Practices of Individual /Group Presentation Basics of Slide Preparation Font, Font size, Colour and background Identify the problem/topic Define the problem Examine the options Act on a plan Look at the consequences Department of IT Page 42

43 4 4 Evaluate information or situations Break them down into their key components Consider various ways of approaching and resolving them Decide on the most appropriate of these ways 5 5 Analytical Ability Lateral Thinking Initiative Logical Reasoning Persistence Evaluating the problem 6 6 Clarifying the nature of a problem Formulating questions Gathering information systematically Collating and organising data Condensing and summarising information Defining the desired objective Managing the problem 7 7 Using the information gathered effectively Breaking down a problem into smaller, more manageable, parts Using techniques such as brainstorming and lateral thinking to consider options Analysing these options in greater depth Identifying steps that can be taken to achieve the objective Decision-making 8 8 deciding between the possible options for what action to take deciding on further information to be gathered before taking action deciding on resources (time, funding, staff etc) to be allocated to this problem Department of IT Page 43

44 Resolving the problem 9 9 Implementing action Providing information to other stakeholders; delegating tasks Reviewing progress 0 0 Examining the results Monitoring the outcome of the action taken Reviewing the problem and problem-solving process to avoid similar situations in future Practice sessions- Review of topics for seminar, how to handle questions Practice sessions- Review of topics for seminar, how to handle questions Practice sessions Practice sessions Practice sessions Final Evaluation Final Evaluation Final Evaluation Final Evaluation Final Evaluation Final Evaluation Final Evaluation Final Evaluation Final Evaluation Department of IT Page 44

45 Final Evaluation Final Evaluation Final Evaluation Final Evaluation Final Evaluation Final Evaluation Final Evaluation Assignment Problem Solving Skills Putting together an argument for an essay Debugging a computer program Dealing with an awkward customer when working part-time in a shop or restaurant Thinking about how you are going to manage your budget to keep you going until the end of term Working out why your printer won t respond Developing a strategy to reach the next level of a computer game. Most problem-solving skills are developed through everyday life and experience. However, the following interests and activities may be useful in demonstrating a high level of these skills - this may be particularly important when applying to employers in areas such as engineering, IT, operational research and some areas of finance. Mind games such as cryptic crosswords, Sudoku, chess, bridge, etc; Computer games the best of these can involve strategic planning, critical and statistical analysis and assessing the pros and cons of different courses of action; Practical interests such as programming, computer repairs, car maintenance, or DIY; Working with sound or lighting equipment for a band, event or show; Academic study: evaluating different sources of information for essays, designing and constructing a microshelter for an architecture project; setting up a lab experiment. ***** Department of IT Page 45