Modalities & Syllabus

May 26, 2018 | Author: Deepak Sakkari | Category: Information System, Databases, Management Information System, System, Internet


Comments



Description

Modalities, Paper pattern and Norms for (M.E./M.Tech.) Examination 1. For post graduate degree programmes (M.E. or M.Tech.), the candidates have to appear in both theory (written) as well as practical papers. 2. Candidates have to pass both the exams (theory and practical) separately. Minimum passing marks shall be 40%. 3. If a candidate fails (getting less than 40% marks) in either theory exam or practical exam, it shall be considered as a failure and shall have to appear again in both theory and practical exam. Only one more chance shall be given to her/him to re-appear in the qualifying exam (theory and practical both) after a gap of six months. No further chance shall be given to the candidates in case of failure in the second attempt / re- appear chance also. 4. The questions in both the papers of the theory exam shall multiple choice (MCQ) type and conducted on OMR sheets. 5. The identified syllabus for the theory exams relevant to each programme (M.E./M.Tech.) will be posted on AICTE website. 6. The theory papers shall comprise of questions of one mark and two marks. 7. There shall be no negative marking in the theory papers. 8. More emphasis shall be given on comprehensive type, application type and analysis type questions in both the theory papers. 9. The details of Theory papers are as follows: Theory Paper I (MCQ Type) Theory paper I shall comprise of core engineering/technology subjects (120 questions) Duration: 3hours (180 minutes) Total Questions: 120 Maximum Marks: 160 Core Engineering / Technology subjects. • 40 questions shall be of 2 marks and • 80 questions of 1 mark each. Theory Paper II (MCQ Type) Theory paper II shall comprise of core engineering/technology subjects (120 questions) Duration: 3 hours (180 minutes) Total Questions: 120 Maximum Marks: 160 Core Engineering / Technology subjects. • 40 questions shall be of 2 marks and • 80 questions of 1 mark each. 10. The details of practical paper are as follows: A List of 25 practical relevant to each PG degree programme (M.E./M.Tech.) will be published and posted on the AICTE website and the candidate has to perform two practical, which shall be identified on a random basis by the examiner from the list of 25 practical uploaded on the AICTE website for each programme. Practical Paper Duration: 4 hours (180 minutes) Maximum Marks: 100 Exam Pattern: Candidate will have to conduct two practical of 50 marks each. The distribution of marks in practical exam is as follows: • Writing process and methodology – 15 marks for each practical • Showing results of the practical – 25 marks for each practical • Viva Voce – 10 marks for each practical. ***** M. Tech. in INFORMATION TECHNOLOGY Syllabus of Paper – 1 ALGORITHM DESIGN Measuring Algorithm Efficiency: Implementation independent measurement of algorithm efficiency, time and space resources, growth in terms of input size, polynomial vs. exponential growth algorithms, worst and average case efficiency, big Oh notation, algorithm efficiency vs. inherent problem (any algorithm) complexity, deterministic and non- deterministic algorithms, algorithm analysis techniques, amortization, standards and implementation dependent resource measurement. Algorithm Design Paradigms: Characterization of algorithm design paradigms, Utilization of design paradigms for problems across application areas of sorting, selection, computer arithmetic and algebraic computation, graphs and networks, computational geometry. Computation Models and Complexity: NP Complete Problems, NP hard problems, Proving of problem to NP Complete, different NP complete problem. Approximation Algorithms, Randomized Algorithms: Some Complexity Classes, Computing π, Numerical Integration, Primality Testing, Randomize Algorithm for Majority Element, Graph Algorithms, Lower Bound Techniques, Nature Inspired Algorithms: Genetic algorithm; Ant Colony Optimization, DNA algorithms, Parallel Algorithms: Memory Multiprocessor. Special topics in algorithms design. DATABASE ENGINEERING Introduction to Database systems: Data Independence, Data Models, levels of abstraction, structure of DBMS, Relational Model, Integrity constraints, Relational Languages, Query Languages: SQL, QUEL, QBE, Aggregate operators, Embedded and Dynamic SQL. File Organization: Storage, Buffer management, Record and page formats, File organization techniques, Indexing. Query optimization: Query processing on various operations, Translating SQL queries, estimating the cost. Database design: E R Model, Functional dependencies, normalization, multi valued dependencies. Concurrency control and recovery: transaction, schedules, Lock based concurrency, Lock management, Concurrency control without locking, Crash recovery log, check pointing, media recoveries. Database Security, Distributed databases design, Object Oriented database design its implementation, Introduction to recent advances in database technology. Special topics in database engineering. DATA MINING & DATA WAREHOUSING Introduction to Data mining: Motivation for Data Mining, its importance, Role Data in Data Mining, Data Mining functionalities, patterns in data mining, Type of patterns, Classification of Data Mining Systems, Major issues in Data Mining; Data Warehousing and OLTP technology for Data Mining, Data Mining Languages, and System Architectures, Concept Description: Characterization and Comparison, Mining Association Rules in Large Databases, Classification and Prediction, Cluster Analysis, Mining Complex Data, Applications and Trends in Data Mining Characteristics of data warehouse, Data Mart, Online Analytical Processing, OLAP tools, Data warehouse Architecture, Organizational Issuer, Tools for Data warehousing, Performance consideration, case studies. Special topics in data mining and data ware housing. Syllabus of Paper - 2 INTERNET AND WEB TECHNOLOGIES Introduction, Evolution of Internet, Internet Applications, Internet Protocol -TCP/IP, UDP, HTTP, Secure Http(Shttp) Internet Addressing – Addressing Scheme – Ipv4 & IPv6, Network Byte Order, Domain Name Server and IP Addresses, Mapping, Internet Service Providers, Types of Connectivity Such as Dial-Up Leaded Vsat Etc. Web Technologies: Three Tier Web Based Architecture; Jsp, Asp, J2ee, .Net Systems. XML: Basic Standards, Schema Standards, Linking & Presentation Standards, Standards that build on XML, Generating XML data, writing a simple XML File, creating a Document type definition, Documents & Data, Defining Attributes & Entities in the DTD, Defining Parameter Entities & conditional Sections, resolving a naming conflict, Using Namespaces, Designing an XML data structure, Normalizing Data, Normalizing DTDS. Security Threats from Mobile Codes, Types of Viruses, Client Server Security Threats, Data & Message Security, Various electronic payment systems, Introduction to EDI, Challenges– Response System, Encrypted Documents and Emails, Firewalls: Hardened Firewall Hosts, Ip- Packet Screening, Proxy Application Gateways, Aaa (Authentication, Authorization and Accounting). Website Planning & Hosting: Introduction, Web Page Lay-Outing, Where to Host Site, Maintenance of Site, Registration of Site on Search Engines and Indexes, Introduction to File Transfer Protocol, Public Domain Software, Types of Ftp Servers (Including Anonymous), Ftp Clients Common Command. Telnet Protocol, Server Domain, Telnet Client, Terminal Emulation. Usenet And Internet Relay Chat. MANAGEMENT INFORMATION SYSTEM Management & Organizational Support Systems: Definition of MIS; Systems approach to MIS: MIS and Human factor considerations, concept of organizational information sub-system, MIS & problem solving. Information Technology Infrastructure for digital firm. Information Systems & Business Strategy: Information Management. Who are the users? Managers, Decision making & information System, Evolution of Computer based information system (CBIS), Model of CBIS. Changing role of Information systems in organization: Trend to End-User computing, justifying the CBIS, Achieving the CBIS, Managing the CBIS, Benefits & Challenges of CBIS implementation. Strategic Information System, Business level & Firm level Strategy. Information Systems in The Enterprise: Systems from Management & Functional perspective & their relationship: Executive Support System, Decision Support System, Sales & Marketing Information System, Manufacturing Information System, Human-Resource Information System. Finance & Account Information System. Information Technology for Competitive Advantage: Firm in its environment, the information resources, who manages the information resources? Strategic planning for information resources. End-User Computing as a strategic issue, Information resource management concept. Knowledge management & their work system, Business value of information system Related Case Studies. SOFTWARE ENGINEERING Software Life Cycle Models, Managing software projects, Project management concepts, Software process and Project metrics, Software Project Planning, Risk Analysis and Management, Project scheduling and tracking, Software Quality Assurance, Software Configuration Management. Conventional methods for software engineering, System Engineering, Requirements Analysis and Specifications, Analysis Modeling, Design Concepts and principles, Architectural design, User Interface Design, Component level Design, Software Testing Techniques, Software testing Strategies, Software Reliability, Technical metrics for software, CASE tools, Software Maintenance, Software Reusability. Object Oriented software engineering: Object Oriented Concepts and principles, Object Oriented analysis, Object Oriented Design, and Object-Oriented testing, Technical metrics for Object Oriented Systems ******** PG - INFORMATION TECHNOLOGY PRACTICAL SYLLABUS 1. Write a program to implement Ceaser Cipher. 2. Write a program to implement Hill Cipher. (Use any matrix but find the inverse yourself) 3. Write a program to implement Advanced Columner Transposition technique. 4. Write a program to implement Simple RSA Algorithm with small numbers. 5. Write a program to implement Data Encryption Standard for encryption and decryption. 6. Write a program to compute the Capacity of Noiseless Binary Channel. 7. Write a program to implement The Huffman- Coding Algorithm. 8. Perform an experiment to grab a Banner with Telnet and perform the Task using Netcat utility. 9. Perform a Wireless Audit of an Access Point / Router and Decrypt WEP and WPA. 10. Perform an Experiment to Sniff Traffic Using Arp Poisoning. 11. Download the current release of snort from snort.org, configure it and install it in your node that has two NIC cards, make sure that you are using the latest rules. Now do the following experiment: Install the vulnerable rootecho from MyPoly into the node that has one NIC card. To install rootecho: a) Log on as root b) Compile the code using gcc c) Move the a.out file to /sbin and rename a.out to rootecho d) Type “chmod 4755 rootecho” to set UID. 12. Perform an experiment to demonstrate how to sniff for router traffic using WIRESHARK. 13. Configure snort to work as Intrusion Prevention System IPS. 14. Demonstrate intrusion detection system (IDS) using any tool (snort or any other s/w). 15. Perform wireless audit on an access point or a router and decrypt WEP and WPA. 16. Run the J48 and 1Bk classifiers using-the cross-validation strategy with various fold levels. Compare the accuracy results. Hold out strategy with three percentage levels. Compare the accuracy results. 17. Demonstrate clustering rule process on datasets using simple k-means algorithms. 18. Run J48 and Naïve Bayes classifiers on datasets and determine the accuracy. 19. Perform SQL queries on Oracle Single Row Functions. 20. Perform SQL queries on Oracle Multiple Row Functions. 21. Write a program to implement Database triggers. 22. Write a program to implement Packages 23. Write a program on Data Recovery using Checkpoints Techniques. 24. Write a program on JDBC. 25. Write a program on Concurrency Control Problems using Lock operations. ******* Exam Schedule Sl. Theory & Prog. Date Time Duration No Practical 1. BE/B.Tech 03.06.2018 Theory Paper-I 09:30 AM to 12:30 PM 3 hours 2. BE/B.Tech 03.06.2018 Theory Paper-II 02:30 PM to 05:30 PM 3 hours 3. BE/B.Tech 04.06.2018 & onwards Practical 09:30 AM to onwards 4 hours 4. ME/M.Tech 10.06.2018 Theory Paper-I 09:30 AM to 12:30 PM 3 hours 5. ME/M.Tech 10.06.2018 Theory Paper-II 02:30 PM to 05:30 PM 3 hours 6. ME/M.Tech 11.06.2018 & onwards Practical 09:30 AM to onwards 4 hours
Copyright © 2024 DOKUMEN.SITE Inc.