Semester VI. Teaching Schedule. Hours / Week L T P. Total

Transcription

1 Semester VI Sr. No Course No. Course Title Teaching Schedule L T P Hours / Week Theo ry Allotment of Marks Sessiona l Practi cal Total Durati on of Exam (Hrs.) 1. IT-302N Analysis & Design of Algorithms IT-304N Software Engineering IT-306N Computer Networks IT-308N Introduction to Microcontroller 5. IT-310N Data Warehouse & Data Mining IT-312N Software Engineering Lab IT-314N Networking Lab IT-316N Visual Basic.net Lab IT-318N Microcontroller Lab IT-320N Colloquium & Professional Proficiency Total Note: The students will have to undergo another six weeks Industrial Training after VI sem and it will be evaluated during VII sem through submission of certified computerized report to the Head of the Department followed by viva-voce, seminar/presentation.

2 PROGRAM EDUCATIONAL OBJECTIVES (PEOS) PEO: 1 To provide quality computer education to inculcate modern technical skills among the students. PEO: 2 To cultivate the ability to analyze the demand of software industry for carrying out hands on projects. PEO: 3 Inculcate direction qualities to work mutually as a team member with effective briefing skills.

3 Programme Outcomes 1 Engineering Knowledge: Apply knowledge of science, computing, mathematics and fundamentals of engineering appropriate for the solution of engineering problems. 2 Problem Analysis: Analyze and identify the complex problems to formulate and interpret the solutions through the use of research methodology and technical skills to produce meaningful conclusions and recommendations. 3 Design/development of solutions: Design, develop and implement system components for real world problems which results to new innovations in information technology and related interdisciplinary areas like social, cultural, healthy and secure environment. 4 Conduct investigations of complex problems: Make use of research skills and basic principles of engineering and technology for various computing and communication system applications through design of experiments, analysis and implementation of algorithms and unification of information. 5 Modern tool usage: Learn latest hardware and software tools and engineering methodologies to model the complex engineering activities. 6 The engineer and society: Show the impact of engineering practices on the society for assessing social, cultural, secure, healthy and legal issues to demonstrate the knowledge and needs for sustainable development. 7 Environment and sustainability: Create an impact of all the engineering solutions in the context of social and environmental issues. 8 Ethics: Inculcate ethical and moral values in the context of engineering practices. 9 Individual and team work: Work excellently as a team member and/or leader in distinct fields of engineering using management and engineering principles. 10 Communication: Communicate effectively the engineering principles to the society and community through written and oral modes such as report writing, presentations, documentation. 11 Project management and finance: Project completion and cost estimation through management and engineering tools and techniques. 12 Life long learning: Understand the need for, and have the preparation and ability to engage in independent and life-long learning.

4 IT-302 N Analysis & Design of Algorithms Lecture Tutorial Practical Major Test Minor Test Total Time Purpose Describe, apply and analyze the complexity of various sorting and searching algorithms. CO 1 CO 2 Identify and analyze various single source shortest path algorithms. CO 3 CO 4 Demonstrate a familiarity with major algorithms like Back Travelling and Branch & Bound. CO 5 Synthesize efficient algorithms of graphs and trees in common engineering design situations. CO 6 Describe, apply and analyze the complexity of various sorting and searching algorithms. Demonstrate different ways to measure the efficiency of algorithms using Asymptotic notation. Study various algorithms and implementation methods for divide and conquer, greedy and dynamic Unit 1 Introduction: Algorithm, Analyzing algorithm, Designing algorithm, Concept of algorithmic efficiency, Run time analysis of algorithms, Asymptotic Notations. Divide and conquer: Structure of divide and conquer algorithms: examples; binary search, quick sort, Strassen Multiplication; Analysis of divide and conquer run time recurrence relations. Unit 2 Greedy Method: Overview of the greedy paradigm examples of exact optimization solution (minimum cost spanning tree), approximate solution (Knapsack problem), Singles source shortest paths. Dynamic programming: Overview, difference between dynamic programming and divide and conquer, Applications: Shortest path in graph, Matrix multiplication, Travelling salesman problem, longest common sequence. Unit 3 Back tracking: Overview, 8-queen problem, and Knapsack problem Branch and bound: LC searching Bounding, FIFO branch and bound, LC branch and bound application: 0/1 Knapsack problem, Traveling Salesman Problem. Unit 4 Graph searching and Traversal: Overview, Traversal methods (depth first and breadth first search). Trees: Review of trees, Binary search tree, Traversal, Insertion & Deletion in Binary Search Tree, B-Trees, B+ Trees, Basic operations on B Trees. Computational Complexity: Complexity measures, Polynomial Vs non-polynomial time complexity; NP-hard and NP- complete classes, examples. Text Book: 1. E. Horowitz, S. Sahni, and S. Rajsekran, Fundamental of Computer Algorithms, Galgotia Publication

5 Reference Books: 1. T. H. Cormen, Leiserson, Revest and Stein, Introduction of Somputer algorithm, PHI. 2. Sara Basse, A. V. Gelder, Computer Algorithms, Addison Wesley. NOTE: Eight questions each of 15 marks are to be set in all by the examiner taking two questions from each unit. Students will be required to attempt five questions in all, selecting at least one question from each unit. LESSON PLAN Week Theory Lecture Day Topic 1 st 1 st Introduction to Algorithms. 2 nd Learn how to analyze the algorithms. 3 rd Designing of algorithm. 4 th Concept of algorithmic efficiency. 2 nd 1 st Characteristics of a good algorithm. 2 nd Run time analysis of algorithms. 3 rd Time and Space Complexity. 4 th Asymptotic Notations to analyze the efficiency of algorithms. 3 rd 1 st Divide and conquer: Structure of divide and conquer algorithms. 2 nd Examples of Divide and Conquer: binary search, quick sort, Strassen Multiplication. 3 rd Binary Search. 4 th Recursive Procedure of Binary Search and its Run Time Analysis. 4 th 1 st Iterative Approach of Binary Search and its Run Time Analysis. 2 nd Quick Sort and its Run Time Analysis. 3 rd Strassen Multiplication and its Run Time Analysis. 4 th Analysis of divide and conquer run time recurrence relations. 5 th 1 st Greedy Method: Overview of the greedy paradigm. 2 nd Examples of exact optimization solution. 3 rd Minimum cost spanning tree. 4 th Kruskal s and Prim s Algorithms. 6 th 1 st Approximate solution (Knapsack problem). 2 nd Singles source shortest paths. 3 rd Dynamic programming: Introduction. 4 th Difference between Greedy and Dynamic Programming. 7 th 1 st Difference between dynamic programming and divide and conquer. 2 nd Applications: Shortest path in graph. 3 rd Matrix multiplication. 4 th Run Time Analysis of Matrix Multiplication. 8 th 1 st Traveling salesman problem. 2 nd Solve Travelling Salesman Problem with example. 3 rd Longest common sequence. 4 th Different examples of LCS. 9 th 1 st Back tracking: Introduction of Back Tracking.

6 2 nd 4-queen problem using Back Tracking Approach. 3 rd 8-queen problem using Back Tracking Approach. 4 th Knapsack problem using Back Tracking. 10 th 1 st Brach and bound: Introduction of Branch and Bound. 2 nd LC searching Bounding. 3 rd FIFO branch and bound. 4 th Study of LC branch and bound applications. 11 th 1 st Knapsack problem using Back Tracking & Branch and Bound. 2 nd 0/1 Knapsack problem using Branch and Bound. 3 rd Traveling Salesman Problem using Branch and Bound Approach. 4 th Example of TSP Problem. 12 th 1 st Graph searching and Traversal: Overview. 2 nd Traversal methods: Depth first Search and breadth first search. 3 rd Depth first Search and its Run Time Analysis. 4 th Breadth first Search and its Run Time Analysis. 13 th 1 st Trees: Review of trees and its terminology. 2 nd Binary Search Tree. 3 rd Traversals of Binary Search Tree. 4 th Searching and Insertion of Binary Search Tree. 14 th 1 st Deletion of Binary Search Tree. 2 nd Introduction of B-Trees. 3 rd Introduction of B+ Trees. 4 th Basic operations on B Trees. 15 th 1 st Difference between B-Trees and B+ Trees. 2 nd Computational Complexity: Complexity measures. 3 rd Polynomial Vs non-polynomial time complexity. 4 th NP-hard and NP-complete classes and its examples. Tutorial sheet -1 Q1. What is an algorithm Write the process for analyzing the algorithm. Q2. Explain divide and conquer problem. Q3. Explain quick sort. Q4. Explain Strassen matrix multiplication. Tutorial sheet -2 Q1. What is dynamic programming? Difference between dynamic programming and divide and conquer. Q2. Explain knapsack problem. Q3.Explain travelling salesman problem Q4. Write the applications of dynamic programming? Tutorial sheet -3

7 Q1. Explain 8-Queen problem. Q2. Explain LC searching bounding. Q3.Explain travelling salesman problem Q4. Write the applications of LC branch and bound. Tutorial sheet -4 Q1. Explain graph traversal methods. Q2. How the insertion and deletion can be done in Binary search tree? Q3. Explain B+ trees. Q4. Explain NP Hard & NP Complete classes with example

8

9

10 IT-304 N Software Engineering Lecture Tutorial Practical Major Test Minor Test Total Time Purpose CO 1 To study the fundamental concepts of software engineering. CO 2 Learn the skills to construct efficient software. CO 3 To study the software process models. CO 4 To understand the basic concepts of software requirements and analysis. CO 5 To learn different design techniques and their uses. CO 6 To understand the software testing and maintenance criteria Unit 1 Introduction: Program vs. software products, emergence of software engineering, software life cycle, models: waterfall, prototype, evolutionary and spiral model, Software Characteristics, Applications, Software crisis. Software project management: Project management concepts, software process and project metrics Project planning, project size estimation metrics, project estimation techniques, empirical estimation techniques, COCOMO, A Heuristic estimation techniques, staffing level estimation, team structures, staffing, risk analysis and management, project scheduling and tracking. Unit 2 Requirements Analysis and specification: Requirements engineering, system modeling and simulation Analysis principles modeling, partitioning Software, prototyping, Prototyping methods and tools, Specification principles, Representation, the software requirements specification and reviews Analysis Modeling: Data Modeling, Functional modeling and information flow: Data flow diagrams, Behavioral Modeling, The mechanics of structured analysis: Creating entity/relationship diagram, data flow model, control flow model, the control and process specification, The data dictionary, Other classical analysis methods. System Design: Design concepts and principles: the design process: Design and software quality, design principles, Design concepts: Abstraction, refinement, modularity, software architecture, control hierarchy, structural partitioning, data structure software procedure, information hiding, Effective modular design: Functional independence, Cohesion, Coupling, Design Heuristics for effective modularity; The design model; Design documentation. Architectural Design: Software architecture, Data Design: Data modeling, data structures, databases and the data warehouse, Analyzing alternative Architectural Designs, architectural complexity; Mapping requirements in to software architecture; Transform flow, Transaction flow; Transform mapping; Refining the architectural design. Unit 3 Testing and maintenance: Software Testing Techniques, software testing fundamentals: objectives, principles, testability; Test case design, Unit testing: white box testing, basic path testing: Control structure testing: Black box testing, testing for specialized environments, architectures and applications. Software Testing Strategies: Verification and validation, Integration testing, Validation testing, alpha and beta testing. System testing: Recovery testing, security testing, stress testing performance testing; The art of debugging process debugging approaches. Software re-engineering: Reverse engineering, restructuring, forward engineering.

11 Unit 4 Software Reliability and Quality Assurance: Quality concepts, Software quality assurance, SQA activities; Software reviews: cost impact of software defects, defect amplification and removal; formal technical reviews: The review meeting, review reporting and record keeping, review guidelines; Formal approaches to SQA; Statistical software quality assurance; software reliability: Measures of reliability and availability, The ISO 9000 Quality standards, SEI-CMM Capability Maturity Model. Computer Aided Software Engineering: CASE, building blocks, integrated case environments and architecture, repository. Text Books: 1. Roger S. Pressman, Software Engineering A Practitioner s Approach,, 1966, MGH. 2. Rajib Mall, Fundaments of software Engineering,, PHI Reference Books: 1. Pankaj Jalote, An Integrated Approach to Software Engineering 1991 Narosa. 2. Ian Sommerville, Software Engineering, Pearson Edu, 5th edition, 1999, AW. 3. Ali Behforooz and Frederick J. Hudson. Software Engineering Fundamentals, Oxford University, NOTE: Eight questions each of 15 marks are to be set in all by the examiner taking two questions from each unit. Students will be required to attempt five questions in all, selecting at least one question from each unit. LESSON PLAN Week Theory Lecture Day Topic (Including Assignment/Test) 1. Unit-1: Introduction: Program vs. software products, emergence of 1 software engineering 2 software life cycle, models: waterfall, prototype 3 evolutionary and spiral model, Software Characteristics 4 Applications, Software crisis 2. 5 Software project management: Project management concepts 6 software process and project metrics Project planning, project size estimation metrics 7 project estimation techniques, empirical estimation techniques 8 Class Test 3. COCOMO, A Heuristic estimation techniques, staffing level estimation, 9 team structures 10 staffing, risk analysis and management, project scheduling and tracking 11 Unit-2: Requirements Analysis and specification: Requirements engineering 12 system modeling and simulation Analysis principles modeling, partitioning Software prototyping, Prototyping methods and tools, Specification principles 14 Software Representation, the software requirements specification and reviews Analysis Modeling: Data 15 Class Test 16 Functional modeling and information flow: Data flow diagrams,

12 Behavioral Modeling 5. The mechanics of structured analysis: Creating entity/relationship 17 diagram 18 data flow model, control flow model the control and process specification, The data dictionary, Other classical 19 analysis methods 20 Assignment Class Test 22 System Design: Design concepts and principles: the design process: Design and software quality 23 design principles, Design concepts: Abstraction, refinement, modularity, software architecture control hierarchy, structural partitioning, data structure software 24 procedure, information hiding 7. Effective modular design: Functional independence, Cohesion, Coupling, 25 Design Heuristics for effective modularity The design model; Design documentation. Architectural Design: Software 26 architecture Data Design: Data modeling, data structures, databases and the data 27 warehouse 28 Analyzing alternative Architectural Designs, architectural complexity Class Test 30 Mapping requirements in to software architecture; Transform flow, Transaction flow 31 Transform mapping; Refining the architectural design. 32 Unit-3: Testing and maintenance: Software Testing Techniques software testing fundamentals: objectives, principles, testability 34 Test case design, Unit testing 35 white box testing, basic path testing: Control structure testing: Black box testing 36 testing for specialized environments, architectures and 10. applications Class Test 38 Software Testing Strategies: Verification and validation 39 Assignment-2 40 Integration testing, Validation testing, alpha and beta testing System testing: Recovery testing, security testing 42 stress testing performance testing; The art of debugging process debugging approaches 43 Class Test 44 Software re-engineering: Reverse engineering restructuring, forward engineering Unit-4: Software Reliability and Quality Assurance: 46 Quality concepts, Software quality assurance, SQA activities Software reviews: cost impact of software defects, defect amplification 47 and removal formal technical reviews: The review meeting, review reporting and 48 record keeping, review guidelines Formal approaches to SQA; Statistical software quality assurance 50 software reliability: Measures of reliability and availability 51 Class Test

13 Tutorial sheet -1 Q1. What is Software Engineering? Explain its need. Q2. Explain different life cycle models of a software development. Q3. Explain various project size estimation metrics.. Q4. Explain empirical estimation techniques. Tutorial sheet -2 Q1. What are various software requirements? Q2. State and explain SRS. Q3. What do you mean by cohesion? Explain various types of cohesion. Q4. Explain various types of coupling. Q5. State and explain various types of design approaches. Tutorial sheet -3 Q1. Explain structure analysis & structure design in detail. Q2. What is DFD? Explain with examples. Q3. What are various object oriented design methodologies in detail. Q4. Explain white box and black box testing.. Tutorial sheet -4 Q1. Explain various debugging techniques? Q2. What are different general issues associated with testing. Q3. What do you mean by software defects? Also write the impact of software defect on cost. Q4. Define reliability and availability. What are the different measures of reliability?

14

15

16 IT-306 N Computer Networks Lecture Tutorial Practical Major Test Minor Test Total Time Purpose This course covers the concepts of computer networking and communication. CO 1 To understand OSI layer model in networking protocols and services. CO 2 To understand, differentiate & analyse various high speed LAN, MAN & WAN.. CO 3 Study different protocols of TCP/IP layers with real life applications. CO 4 Learn Mobile IP principles, multicast protocols and security issues for mobile IP. CO 5 Study fundamentals of various routing algorithms. CO 6 Study ATM protocols & Layers design issues. Unit-1 Introduction: Basics of Computer Networks, need and Evolution of computer networks, description of LAN, MAN, WAN &wireless networks. Basics terminology of Computer Networks: Bandwidth, physical and logical topologies, media 10 base A, 10base 5, 10 base 5, 10base-T, 100 base FX, 100base LX and wireless. LAN & WAN devices Router, Bridge Ethernet switch HUB, Modem SCU/DSU. OSI Reference Model: Laying architecture of networks, OSI model, Functions of each layer, Services and Protocols of each Layer. Unit-2 TCP/IP: Introduction History of TCP/IP, Layers of TCP/IP, Protocols, Internet Protocol, Transmission control protocol, User Datagram Protocol, IP Addressing, IP address classes, Subnet addressing, Internet control Protocols, ARP, RARP, ICMP, application layer, Domain Name System, - SMTP, POP, IMAP, FTP, NNTP, HTTP, SNMP,TELNET, overview of IP version 6. OSI and TCP/IP model with description of data encapsulation & peer to peer communication, comparison of OSI and Wireless Unit 3 Physical Layer: Representation of a bit on physical modem that is in wired network, optical network and wireless network. Encoding/Modulation TTL, Manchester Encoding, AM, FM and PM. Dispersion, Jitter, Latency and Collision. Different types of media-twisted pair, unshielded twisted pair, coaxial cable, optical Fiber cable and wireless. Data Link Layer: LLC and MAC sub layer, MAC addressing layer 2 devices, framing error control and flow control. Error detection & correction CRC, block codes parity and checksum, elementary data link protocol, sliding window protocol, channel allocation problem-static and dynamic, Multiple Access protocol- ALOHA, CSMA/CU, Token bus, token ring, FDDI. Unit 4 Network Layer: Segmentations and autonomous system path determination, network layer addressing, network layer data gram, IP addressed Classes. Sub netting Sun network, Subnet Mask, Routing algorithm-optionally principle,

17 Shortest path routing, hierarchical routing, Broadcast routing, Multicast routing, routing for mobile host tunneling, fragmentation and DHCP, Routing protocol- RIP, IGRP, USPF and EIGRP. Transport Layer: TCP & UDP. Three way handshaking. ATM AAL layer protocol. Text Book: 1. Tanenbaum. Computer Networks, PHI Reference Books: 1. Darlx, Computer Network and their protocols, DLA Labs. 2. Freer, Comp. Communication and Networks, East West-Press. 3. Halsall Fred, Data Communications, Computer Networks & open systems Addison Wesley 4. Fitzgerald Jerry, Business data communications, 5. Larry L. Peterson & Bruce S. Davie Computer Networks A system approach,, 2nd Ed TMH. NOTE: Eight questions each of 15 marks are to be set in all by the examiner taking two questions from each unit. Students will be required to attempt five questions in all, selecting at least one question from each unit. LESSON PLAN Week Theory 1 Lecture Day Topic (Including Assignment/Test) Introduction: Basics of Computer Networks, Need and Evolution of computer networks, Description of LAN, MAN, WAN & wireless networks. Basic terminology of Computer

18 s 4 Networks: Bandwidth, physical and logical topologies, Media 10 base A, 10base 5, 10 base 5 5, 10base-t, 100 base FX, 100base LX 2 6 and wireless. LAN & WAN devices 7 Router, Bridge 8 Ethernet 9 Switch, HUB, 3 10 Modem SCU/DSU. 11 OSI Reference Model: Laying architecture of networks, 12 OSI model, Functions of each layer, Services and Protocols of each Layer. TCP/I P: Introduction History of TCP/I P, 4 Layers of TCP/IP Model OSI and TCP/IP model with description of 15 data encapsulation & peer to peer

19 communication, comparison of OSI and wireless. 16 Assignment/Class Test Internet Protocol, Transmission control protocol, User Datagram Protocol, IP Addressing, IP address classes, Subnet addressing, 21 Internet control Protocols, ARP, 22 RARP, 6 23 ICMP, 24 Application layer, Domain Name System, -SMTP, POP, IMAP, FTP, NNTP, HTTP, SNMP, TELNET, Overview of IP version Assignment/Class Test Physical Layer: Representation of a 28 bit on physica l modem that is in wired network, optical network and

20 wireless network. 29 Encoding/Modulation TTL, Manchester Encoding, 30 AM, FM and PM. 8 Different types of media-twisted 31 pair, unshielded twisted pair, coaxial cable, optical Fiber cable and wireless. 32 Dispersion, Jitter, Latency and Collision. Data Link Layer: LLC and MAC sub 33 layer, MAC addressing layer 2 devices, Framing error control and flow control. Elementary data link protocol, Sliding window protocol, 37 Error detection & correction CRC, block codes parity and checksum, Channel allocatio n and dynamic, problem-static

21

22 39 Multiple Access protocol- ALOHA, CSMA/CD, 40 Token bus, 41 Token ring, 42 FDDI Assignment/Class Test Network Layer: Segmentations and 44 autonomou s system path determination, Network layer addressing, network 45 layer data gram, IP addressed Classes. Sub netting Sun network, 12 Subnet Mask, 46 Routing algorithm-optionally princip 47 Shortest path routing 48 Hierarchical routing, 49 Broadcast routing, Multicast routing, 51 Routing for mobile host Concatenated Visual tunneling, fragmentation Circuits,

23 DHCP, RIP 55 IGRP, EIGRP 56 OSPF 57 Transport Layer: Layer 4 protocol TCP & UDP Threeway connection. han d shake s open 59 ATM AAL layer protocol, 60 Assignment/Class Test Tutorial sheet -1 Q1. What are the goals and applications of computer networks? What are various software requirements? Q2.Describe LAN,MAN& Wireless network & difference between them. Q3. What is the difference between OSI & TCP/IP reference model? Q4. Write down the difference between connectionless & connection oriented communication. Tutorial sheet -2 Q1. Explain different types of networks based upon that bandwidth, physical & logical topologies. Q2. Why is a virtual terminal protocol needed & what kind of applications are likely to use it? Distinguish between: a). Twisted Pair & baseband coaxial cable. b). Broadband coaxial cable & fiber optics.

24 Q3. What are different between encoding Techniques? Explain. Q4. Write down the difference between Routers and hubs.. Tutorial sheet -3 Q1. Explain AM, FM and PM modulation techniques. Q2.State and explain different kind of communication Media. Q3. What do you mean by error correcting and detecting codes? Explain with examples? Q4. What is one bit sliding window protocol. Explain it. Q5. Explain different kinds of protocols used in DLL. Tutorial sheet -4 Q1. Explain the difference between IPV4 & IPV6. Q2.Explain multicast routing. Q3. Explain RIP,IGRP routing protocols. Q4. Explain the role of network layer in ATM networks

25

26

27 IT 308 N Introduction to Microcontroller Lecture Tutorial Practical Major Test Minor Test Total Time Purpose To learn programming of 8051 microcontroller and its interfacing CO 1 Study microprocessor architecture and its evaluation CO 2 Understanding the difference between microprocessor & CO 3 mmmmmmmicrocontrollermicrocontroller Understanding 8051 instruction formats & addressing modes CO 4 Study of 8051 serial port programming CO 5 Study of interfacing with keyboard CO 6 Microcontroller interfacing with stepper motor UNIT-1 Introduction: - Evaluation of Microcontrollers; Classification of Microcontroller; Comparison between Microprocessor and Microcontrollers; Overview of 8051 microcontroller family. Block Diagram, Architecture and pin description of ; Types of Registers and flags of UNIT-2 Introduction to programming of Microcontroller: Instruction Format, Addressing modes, Data transfer instructions; Logical operations, Arithmetic operations, looping, jump and call instructions, Programming in C. UNIT-3 Timer Programming and interrupts : timer Programming ; 8051 Serial port programming; 8051 interrupt programming; External memory interfacing. UNIT-4 Interfacing of microcontroller :- LCD, Keyboard interfacing ; A/D, D/A and sensor interfacing; Microcontroller interfacing with a) Relays b) opto-isolators, c) stepper motor d) DC motor

28 Text Books 1. Muhammad Ali Mazidi., The 8051 Microcontroller And Embedded Systems Using Assembly And C, Pearson, 2nd edition 2. Kenneth J. Ayala, The 8051 Microcontroller. Reference Books 1. Mackenzie, The 8051 Microcontroller, Pearson Education. 2. Ghoshal Subrata, 8051 Microcontroller: Internals, Programming & Interfacing, Pearson Education.. Note: The course is introductory in nature. Eight questions each of 15 marks are to be set in all by the examiner taking two questions from each unit. Students will be required to attempt five questions in all, selecting at least one question from each unit. LESSON PLAN Week Theory Lecture Topic (including assignment / test) Day 1 st 1st Introduction to Subject 2nd Unit:1 Evaluation of Microcontrollers 3rd Classification of Microcontroller 4th Comparison between Microprocessor and Microcontrollers 2 nd 1st Overview of 8051 Microcontroller family 2nd Block Diagram and Architecture 3rd Block Diagram and Architecture 4th Class Test 3 rd 1st Pin Description Of 8051

29 2nd Pin Description Of rd Types Of Registers And Flags Of th Class Test 4 th 1st Unit 2: 8051 Instruction Format 2nd Addressing Modes 3rd Data Transfer Instructions 4th Data Transfer Instructions Examples 5 th 1st Logical Operations 2nd Logical Operations Examples 3rd Arithmetic Operations 4th Arithmetic Operations Examples 6 th 1st Looping, Jump and Call Instructions 2nd Looping, Jump and Call Instructions Examples 3rd Programming In C 4th Programming In C 7 th 1st Programming In C 2nd Class Test

30 Tutorial sheet -1 Q1. Explain the evolution of microcontrollers? Q2.Write the classifications of microcontroller. Q3. What is the difference between microprocessor & microcontroller? Q4. Explain the types of registers and flags used in Tutorial sheet -2 Q1.Explain the instruction formats of 8051 microcontroller? Q2.What do you mean by addressing modes? Explain the addressing modes used by Q3. Explain the arithmetic and logical operations in 8051 microcontroller. Q4. Explain the data transfer instructions in Tutorial sheet -3 Q1.Explain Keyboard interfacing with 8051 microcontroller. Q2. Explain 8051 Serial port programming. Q3. Explain 8051 interrupt programming. Q4. Explain external memory interfacing in Tutorial sheet -4 Q1. Explain 8051 timer programming? Q2. Explain Microcontroller interfacing with opto-isolators. Q3. Explain microcontroller interfacing with DC motor Q4. Explain microcontroller interfacing with Relays.

31

32

33 IT-310 N Data Warehouse & Data Mining Lecture Tutorial Practical Major Test Minor Test Total Time Purpose This course provides a way to understand the organization and collection of data. CO 1 Understand the fundamentals of Data Warehousing and Data Mining and its CO 2 Study & understand the architecture & design techniques of data warehousing. CO 3 CO 4 Understand Data Cube Implementation and OLAP. CO 5 CO 6 Understand the rules of mining associations in single dimensional databases & Design & populate the business data warehouse & business information Apply the techniques of clustering, classification, association finding, feature UNIT- 1 Introduction of Data Warehousing: The evolution of Data Warehousing (The Historical Context). The data warehousing a brief history, today s development environment. Principles of Data Warehousing (Architecture and Design Techniques): Types of data and their uses, conceptual data architecture, design techniques, introduction to the logical architecture. Creating the Data Asset: Business Data Warehouse Design. UNIT-2 Unlocking the Data Asset for end users (The use of Business Information) : Designing business information warehouse, populating business information warehouse, user access to information, information data in context. Implementing the Warehouse (Managing the project and environment) : Obstacles to implementation, planning your implementation, justifying the warehouse, organizational implications of data Warehousing, the data warehouse in your organization, data warehouse management, looking to the future. UNIT-3 Introduction of Data Mining: Motivation, importance, data mining, kind of data, functionalities, interesting patterns, classification of data mining system, major issues. Data warehouse and OLAP technology for data mining : data warehouse, operational database systems and data warehouse architecture, implementation, development of data cube technology, data warehousing to data mining, data warehouse usage. UNIT-4 Data Preparation: Preprocess data cleaning, data integration and transformation, data reduction, discrimination and concept hierarchy generation. Data Mining Primitives, languages and system architectures, graphical user interfaces. Concept Description: Characterization and comparison data generalization and summarization based characterization, analytical characterization, and analysis of attribute relevance, mining class comparison, and mining descriptive statistical measures in large databases. Mining association rules in large databases, mining single dimensional Boolean association rules from transactional databases, mining multi-dimensional association rules

34 from relational databases and data warehouses, from association to correlation analysis, constraint based association. Text Books 1. J. Han & M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann/Elsevier, India, D. Hand, H. Mannila, & P. Smyth. Principles of Data Mining, MIT Press, Reference books 1. M. Jarke et al. Fundamentals of Data Warehouses (2nd ed.), Springer, 2003, ISBN C. Seidman, Data Mining with Microsoft SQL Server 2000 Technical Reference Microsoft Press, ISBN NOTE: Eight questions each of 15 marks are to be set in all by the examiner taking two questions from each unit. Students will be required to attempt five questions in all, selecting at least one question from each unit. LESSON PLAN Week Theory Lecture Day Topic (Including Assignment/Test) 1 Introduction of Data Warehousing: The evolution of Data Warehousing (The Historical Context). 1 2 The data warehousing a brief history, today s development environment. 3 Principles of Data Warehousing (Architecture & design techniques)

35 4 Types of data and their uses 5 conceptual data architecture 6 design techniques introduction to the logical architecture. Creating the Data Asset: Business Data Warehouse Design, Populating the Data Warehouse 10 Assignment No Unlocking the Data Asset for end users Designing business information warehouse populating business information warehouse 4 14 user access to information 15 information data in context. 16 Implementing the Warehouse 17 Obstacles to implementation 18 planning your implementation, 5 19 justifying the warehouse organizational implications of data Warehousing, the data warehouse in your organization warehouse management,

36 23 looking to the future 24 Assignment No Introduction of Data Mining: Motivation 7 26 importance, data mining kind of data, 27 functionalities 28 interesting patterns, 29 classification of data mining system 30 major issues 8 31 Data warehouse and OLAP technology for data mining : data warehouse operational 32 database systems and data warehouse architecture 33 implementation development of data 34 9 cube technology 35 data warehousing to data mining 36 data warehouse usage. 37 Assignment No Data Preparation: Preprocess data cleaning 40 data integration and transformation 41 data reduction 42 discrimination and concept hierarchy generation

37 11 43 Data Mining Primitives 44 languages and system architectures, graphical user interfaces 45 Concept description: characterization & comparison data generalization & summarization based characterization analytical characterization, & analysis of attribute relevance mining class comparison & minimg 47 descriptive statistical measures in large databases. 48 mining association rules in large databases mining single dimensional boolean 49 association rules from transactional database mining multi-dimensional association rules from relational databases & data warehouses 51 from association to correlation analysis 52 constraint based association. 53 Revision Revision 55 Revision 56 Revision 57 Revision Revision 59 Test

38 60 Test Tutorial sheet -1 Q1.What do you mean by data warehouse? Discuss in detail about the conceptual architecture of data warehouse. Q2.Explain the concept of historical evolution of data warehouse. Q3. How can you design and populate business data in data warehouse? Explain. Q4. Explain various types of data and their uses in data warehouse. Tutorial sheet -2 Q1.What are data assets? Explain in detail about the designing and populating business information in data warehouse. Q2.How a user can access the information from business information warehouse. Explain in detail. Q3. Explain in detail about the organizational and management of data in data warehouse Q4. Explain the role of timer function in a real time OS? Briefly explain. Tutorial sheet -3 Q1. What do you mean by OLAP? Discuss the typical OLAP operations with an example. Q2.Discuss the process of extraction of data from data warehouse using data mining.. Q3. What are the major issues in data mining? Discuss different types of data mining systems in detail. Q4. Discuss in detail the obstacles in implementing data warehouse

39 Tutorial sheet -4 Q1.Why does timing problems arise in an embedded system working? How these can be resolved? Q2.Write use an example of embedded system to show the steps involved in its design. Q3. Is it possible to achieve saving in space and power using embedded systems? Discuss how? Q4. What are the phases of data preparation? Discuss each in detail.

40

41

42 IT-312 N Software Engineering Lab Lecture Tutorial Practical Minor Test Practical Exam Total Time Purpose To familiarize - the students with the concept of designing the software applications. CO 1 Implement the concept of designing the software applications. CO 2 CO 3 CO 4 Study and implement testing and maintenance phase of software development. CO 5 Understand the software metrics. CO 6 Study requirement and designing phase of software development & learn about the reasons for the Understand & implement different software life cycle models and software testing techniques. Study, analyze and implement quality assurance and reliability of software. LIST OF EXPERIMENTS 1. Study and categorize the generic phases of software development and maintenance. 2. Study various software development models. 3. Study various types of feasibility study and steps in doing feasibility study. 4. Study various steps for doing the requirement analysis of any project. 5. Write algorithm and draw flow chart to implement the constructive cost estimation model (COCOMO). 6. Making use of Graphical Design notation, study the concept in developing data flow diagram (DFD) for any selected project. 7. Making use of object oriented design, implement a student & employee record system using the concept of inheritance. 8. Select an appropriate programming language & translate the detailed design made in experiment 7 in appropriate programming language. 9. Develop a complete test strategy for the project selected in exp-8. Document it in a test specification. 10. Apply the debugging process to the project selected in exp-9 in accordance with the result generated from its testing in exp Study various concepts involved in cost / benefit analysis. 12. Draw flow chart and write algorithm for designing an editor. Note: A student has to perform 10 experiments. At least seven experiments should be performed from the above list. Three experiments may be designed & set by the concerned institution as per the scope of the syllabus.

43 IT-314 N Networking Lab Lecture Tutorial Practical Minor Test Practical Exam Total Time Purpose This - course covers the concepts of computer networking and communication. CO 1 Understand the concept of computer networking and communication. CO 2 Learn the basic concept of networking model for effective communication. CO 3 Study different protocols used for transmitting data. CO 4 Study and implement physical and data link layer of networking model. CO 5 Study Network and transport layer of networking model. CO 6 Study and implement Virtual Network. LIST OF EXPERIMENTS 1. Study the physical media of connectivity. 2. Study the pin-structure of cross-over cable. 3. Study the different LAN Technologies. 4. Study the functioning of a Switch. 5. Study the Functioning of a Router. 6. Establishing LAN (Star topology) for your LAB using Hubs (18 ports, 16 ports). 7. Study and install the media converting using optical fiber. 8. Install and configure the LAN card. 9. Install and configure window 200 Server. 10. Study and implement the virtual network. Note: A student has to perform 10 experiments. At least seven experiments should be performed from the above list. Three experiments may be designed & set by the concerned institution as per the scope of the syllabus.

44 IT-316 N Visual Basic.net Lab Lecture Tutorial Practical Minor Test Practical Exam Total Time Purpose This course covers the concepts of.net programming. CO 1 Learn and implement the basic concept of GUI. CO 2 Study and implement SMTP to send and receive mails. CO 3 Implement code to retrieve a web page source from the Internet. CO 4 Implement techniques for encryption and decryption of data. CO 5 Implement how to create drawing application in VB.Net CO 6 Implement an application in VB.NET to play MP3 files. LIST OF EXPERIMENTS 1. Create a calculator that can be used for adding, subtracting, multiplication and division. 2. Write an application to use WMI to retrieve information about your PC. 3. Write an application to create a File and Folder browser. 4. Write a program in VB.NET to send an via SMTP. 5. Write a program to create a MDI web browser. 6. Write an application to access registry in VB.NET. 7. Write a program to retrieve a web page source from the Internet. 8. Create a slot machine game using standard controls and random number generator. 9. Write a program to create a word processor. 10. Write a program for encryption and decryption. 11. Write an application to capture screen. 12. Create a drawing application in VB.NET. 13. Write an application in VB.NET to play MP#3 files. Note: A student has to perform 10 experiments. At least seven experiments should be performed from the above list. Three experiments may be designed & set by the concerned institution as per the scope of the syllabus.

45 IT-318 N Microcontroller Lab Lecture Tutorial Practical Minor Test Practical Exam Total Time Purpose To train the student on how to use Microcontroller. CO 1 To introduce the student to Microcontroller programming CO 2 To control LCD module. CO 3 Use of microcontroller in controlling stepper motor CO 4 Practical approach in interfacing of microcontrollers with different devices. CO 5 Top design displays using 8051 CO 6 To implement the interfacing of keyboard with microcontroller LIST OF EXPERIMENTS 10. Introduction to microcontroller trainer and interfacing modules. 2. To display the digital output of ADC on 16*2 LCD Module. 3. To display character A on 8*8 LED Matrix. 4. To display the data and time on LCD Module 5. To interface the seven segment display with microcontroller To create a series of moving lights using 8051 on LEDs. 7. To interface the stepper motor with microcontroller. 8. To switch on and off relay by using keys. 9. To interface the DC motor using H-Bridge. 10. To interface a keypad with microcontroller. Note: A student has to perform 10 experiments. At least seven experiments should be performed from the above list. Three experiments may be designed & set by the concerned institution as per the scope of the syllabus.

46 IT-320 N Colloquium & Professional Proficiency Lecture Tutorial Practical Minor Test Practical Exam Total Time Purpose To enhance holistic view of students so as to improve their employability skills. CO 1 To develop inter personal skills and be an effective goal oriented team player. CO 2 To develop communication skills. CO 3 To develop aptitude CO 4 To enhance general knowledge of students in various domains of life. CO 5 To develop the presentation skills of students CO 6 To develop problem solving skills A practical and activity oriented course with continuous assessment for 100 marks. The course will comprise of: a) Class room interaction and activities: Technical Quiz, aptitude tests, extempore speech, general knowledge test etc. b) Seminars c) Presentation The student will submit a course report comprising of credits / results based on the above