- Date:17 Sep 2020
- Views:2
- Downloads:0
- Pages:90
- Size:1.09 MB

Transcription:

SEMESTER III,S Course Code,Course L T P C,1 ITC7301 Internet of Things 3 0 0 3. 2 Elective 2 9 0 0 9,3 General Elective 3 0 0 3,4 ITC7302 Project Phase I 0 0 12 6. Total Credits 15,SEMESTER IV,S Course Code,Course L T P C. 1 ITC7302 Project Phase II 0 0 36 18,Total Credits 6 18 24. Credits for Project Work Phase I to be accounted along with Project Work Phase II in. IV Semester,Total Credits 78,SEMESTER II ELECTIVES.

S No Course Code Course L T P C,1 ITCY01 Multicore Programming 3 0 0 3. 2 ITCY02 Software Requirements Management 3 0 0 3,3 CSCY54 Service Oriented Architecture 3 0 0 3. 4 ITCY03 Programming with Hadoop 0 0 2 1,5 CSCY01 Mobile Computing 3 0 0 3. 6 ITCY04 Social Network Analysis 3 0 0 3,7 Advanced Databases 3 0 0 3. 8 ITCY05 Multimedia Technology Applications 3 0 0 3. 9 ITCY06 Distributed Systems 3 0 0 3,10 ITCY07 IT Infrastructure Management 3 0 0 3.

11 ITCY08 Applied Cryptography 3 0 0 3,12 ITCY09 Video Processing 3 0 0 3. 13 ITCY10 High Speed Networks 3 0 0 3,14 ITCY11 Virtualization Techniques 2 0 0 2. 15 SSB7181 Society Technology Sustainability 3 0 0 3. SEMESTER III ELECTIVES,S No Course Code Course L T P C. 1 ITCY12 Data Science Analytics 2 0 0 2,2 ITCY13 Big Data Analytics Tool 1 0 0 1. 3 ITCY14 Machine Learning 3 0 0 3,4 ITCY15 Green Computing 1 0 0 1.

5 ITCY16 Wireless Networks 3 0 0 3,6 ITCY17 Enterprise Resource Planning 3 0 0 3. 7 ITCY18 Soft Computing 3 0 0 3,8 ITCY19 Web Design Management 3 0 0 3. 9 ITCY20 Design Patterns 3 0 0 3, 10 ITCY21 Data Warehousing and Data Mining 3 0 0 3. 11 ITCY22 Wireless Mobile Communication 3 0 0 3,12 ITCY23 Digital Image Processing 3 0 0 3. 13 ITCY24 Software Metrics 3 0 0 3,14 ITCY25 Security in BigData 3 0 0 3.

15 ITCY26 Multimedia Communication Networks 3 0 0 3. 16 ITCY27 Adhoc and Sensor Networks 3 0 0 3,17 ITCY28 Ontology and Semantic Web 3 0 0 3. 18 ITCY29 Human Computer Interface 2 0 0 2,19 ITCY30 Software Project Management 3 0 0 3. SEMESTER I, ITC6101 COMPUTER FORENSICS AND INFORMATION L T P C. OBJECTIVES, To have a fundamental understanding of security techniques. To apply appropriate skills and knowledge to identify and solve security issues. in network, To apply theoretical and practical knowledge to provide security for operating.

systems and database,To understand the basics of computer forensics. To apply theoretical and practical knowledge in computer forensics for. investigation,MODULE I CRYPTOGRAPHY 9, Security problem in computing Elementary Cryptography Symmetric Key Encryption. Public Key Encryption Uses of Encryption,MODULE II PROGRAM NETWORK SECURITY 9. Security Programs Non malicious program Errors Virus and other Malicious Code. Targeted Malicious Code Control against program threats Threats in Networks. Network Security Controls firewalls Intrusion Detection Systems Secure E Mail. MODULE III OPERATING SYSTEM AND DATABASE 9, Memory and Address Protection File Protection Mechanisms User. Authentication Trusted Operating Systems Designing Trusted Operating Systems. Database Security Requirements Multilevel Databases and Multilevel Security. MODULE IV INTRODUCTION TO COMPUTER FORENSICS 9, History of Forensics Computer Forensic Flaws and Risks Rules of Computer.

Forensics Legal issues Digital Forensic Principles Digital Environments Digital. Forensic Methodologies Forensics Software and Hardware tools. MODULE V AN OVERVIEW OF COMPUTER FORENSICS INVESTIGATION 9. Router Forensics and Network Forensics An overview of Routers Hacking Routers. Investigating Routers Investigating Wireless Attacks Basics of wireless Wireless. Penetration Testing Direct Connections to Wireless Access Point Wireless Connect. to a Wireless Access Point,Total Hours 45, On completion of the course students will be able to. Have a fundamental understanding of cryptographic techniques. Display their competence in choosing securing mechanisms to protect the. networks from threats, Apply security techniques to protect operating systems and databases. Have a fundamental understanding of computer forensics. Perform computer forensic investigation in an organization. REFERENCES, 1 Charles B Pfleeger Shari Lawrence Pfleeger Fourth Edition Security in Computing. Pearson Education 2006, 2 William Stallings Cryptography and Network Security Principles and Practices. Sixth Edition Pearson Education 2013, 3 Anthony Reyes Jack Wiles Cybercrime and Digital Forenscis Elseiver Publications.

4 John Sammons The Basics of Digital Forensics Elesvier 2012. 5 Linda Volonins Reynalds Anzaldua Computer Forensics for dummies Wiley Publishing. CSC6101 ADVANCED COMPUTER ARCHITECTURE L T P C,OBJECTIVES. to understand the functional requirements and their role in the system design. to understand the various parameters that contribute to the performance of a computer. system and the technology of achieving the best performance through these parameters. to acquire essential knowledge to measure or predict system performance. to understand how the memory hierarchy and optimization contribute to the. performance of the system, to understand the approaches in designing a new system through Instruction level. parallel processing and to improve the Performance overcoming the hazards meeting. the functionality, to understand the data level parallel processing and Vector Processing for performance. MODULE I FUNDAMENTALS OF COMPUTER DESIGN 9 4, Functional Requirements and architecture Measuring and reporting performance. Quantitative principles of computer design Classifying instruction set architecture. Operands and operations for media and signal processing Graphic processing. Encoding an instruction set Example architecture MIPS and TM32. MODULE II MEMORY HIERARCHY DESIGN 9 3, Memory Hierarchy Cache performance Reducing cache miss penalty and miss rate.

Reducing hit time Main memory and performance Memory technology and. optimization Virtual memory and Virtual Machine and protection. MODULE III INSTRUCTION LEVEL PARALLELISM 9 3, Concepts of ILP Pipelining and hazards Compiler techniques for exposing ILP. Dynamic scheduling Dynamic hardware prediction Multiple issues Hardware based. speculation Limitations of ILP Case studies lP6 Micro architecture Compiler. techniques for exposing ILP Static branch prediction Static multiple issues VLIW. Advanced compiler support Hardware VS software speculation Case study Intel core. i7 and ARM Cortex A8,MODULE IV DATA LEVEL PARALLELISM 9 2. Vector Architecture SIMD Instruction Set Extensions for Multimedia Graphic. Processing Units Detecting and Enhancing Loop Level Parallelism Mobile verses. Server GPUs Case Studies,MODULE V THREAD LEVEL PARALLELISM 9 3. Centralized Symmetric and shared memory Multiprocessor architectures Performance. issues Distributed Shared Memory architecture Directory based architecture. Synchronization Cache Coherence and memory consistency Trends in processor. design Need for multi core processor difference between multiprocessor and. multicore processor Thread level processing Simultaneous multi threading. L 45 T 15 Total Hours 60,REFERENCES, John L Hennessey and David A Patterson Computer Architecture A Quantitative. Approach Morgan Kaufmann Elsevier 5th Edition 2012. David A Patterson and John L Hennessy Computer Organization and Design The. Hardware Software Interface 4th Edition Morgan Kaufmann Elsevier 2009. D Sima T Fountain and P Kacsuk Advanced Computer Architectures A Design. Space Approach Addison Wesley 2000, Vincent P Heuring and Harry F Jordan Computer System Design and Architecture.

Addison Wesley 2nd Edition 2004, B Govindarajalu Computer Architecture and Organization Tata McGraw Hill Education. Pvt Ltd 2010,Students who complete this course will be able to. Suggest the requirements for a new instruction set to meet the functional requirement. and to contribute to performance,to test the performance of a computer system. to analyze changes in performance with various configurations and Memory Hierarchy. analyze code for instruction level Parallel Processing and modify the code for out of. order execution for better performance, modify the code to exploit SIMD architecture and improve the performance of the. analyze how multi threading in multiple processors and multi core processors will share. the resources for performance, MAC6181 APPLIED ALGEBRA AND DISCRETE ALGORITHMS L T P C.

OBJECTIVES,The aim of this course is to, make the students familiarize on the concepts of mathematical induction and codes. motivate the students to solve problems applying techniques of logic. to have a knowledge on the concepts of Formal languages and Automata theory. familiarize students with basics of graph theory, train the students in applying the basic concepts of Cryptography. MODULE I INTEGERS COMPUTER ALGEBRA AND CODES 9 3, Integers computer algebra versus numerical analysis sums and products. mathematical induction Binary Hexadecimal ASCII Morse Braille Two out of Five. and Hollerith Codes,MODULE II LOGIC 9 3, Propositional logic logical connectives truth tables normal forms conjunctive and. disjunctive solving word problems predicate logic universal and existential. quantifiers proof techniques direct and indirect proof by contradiction applications. MODULE III MODELING COMPUTATION AND LANGUAGES 9 3, Finite state machines deterministic and non deterministic finite state machines classes.

of grammars phrase structure grammar context sensitive context free regular. grammars formal languages ambiguity Turing machines. MODULE IV GRAPH THEORY 9 3, Multigraphs applications of graph theory classes of graphs subgraphs and. morphisms Hamilton circuits planar graphs shortest paths and spanning. MODULE V CIPHERS 9 3, Cryptography cryptanalysis substitution and permutation ciphers block cipher the. playfair cipher unbreakable ciphers applications,L 45 T 15 Total Hours 60. TEXT BOOKS, 1 Hopcraft J E R Motwani and Ullman J D Introduction to Automata theory. Languages and Computation Narosa publishing House 4th edition 2006. 2 Kenneth H Rosen Discrete Mathematics and its Applications 7th edition Tata. McGraw Hill Publishing Company Limited New Delhi 2015. 3 J P Tremblay and R Manohar Discrete Mathematical Structures with Applications to. Computer Science Tata McGraw Hill 1997,REFERENCES, 1 JurajHromkovic Theoretical Computer Science Introduction to Automata Computability.

Complexity Algorithmics Randomization Communication and Cryptography Springer. 2 Darel W Hardy Fred Richman Carol L Walker Applied Algebra Codes Ciphers and. Discrete Algorithms Second Edition Discrete Mathematics and Its Applications CRC. Press Newyork 2009, 3 David Gries and Fred B Schneider A Logical Approach to Discrete Math Springer. 3rdEdition 1993,At the end of the course students will be able to. authenticate the correctness of the a given statement using mathematical induction. test and analyze the logic of a program, apply the concept of finite state machines and to generate languages. analyze the types of graphs solve problems using the concepts of graph theory. apply encryption and decryption techniques to send messages securely. ITC6102 ADVANCED DATA STRUCTURES L T P C,OBJECTIVES. Introduce the student to the concept of data structures through abstract data. structures including lists stacks queues sets maps trees and graphs. To introduce the fundamental concept of data structures and to emphasize the. importance of data structures, To choose the appropriate data structure for a specified application.

Solve problems using data structures such as linear lists stacks queues hash. tables binary trees heaps binary search trees and graphs and writing programs for. these solutions,MODULE I Lists Stacks Queues 9, Abstract Data Types The List ADT Implementation of List The Stack ADT Stack. Model Implementation of Stacks Applications The Queue ADT Queue Model Array. Implementation of Queues Applications of Queues,MODULE II Trees 10. Preliminaries Binary Trees Expression Trees Binary Search Trees AVL Trees. Splay Trees Tree Traversals B trees,MODULE III Hashing Heaps 8. General idea of Hashing Hash function Separate Chaining Hash Tables without. Linked lists Rehashing Binary Heap Applications of Priority Queues d Heaps. MODULE IV Sorting The Disjoint Sets Class 7, Insertion Sort Shell Sort Heap Sort Merge Sort Quick Sort The Disjoint Sets Class. Equivalence Relations The Dynamic Equivalence Problem Basic Data Structure. Path Compression,MODULE V Advanced Data Structures Graphs Trees 11.

Graphs Definitions Topological Sort Shortest Path Algorithm Network Flow Problems. Minimum Spanning Tree Trees Sets Maps Top Down Splay Trees Red Black. Trees Treaps,Total Hours 45, On completion of the course students will be able to. Discuss the abstract properties of various data structures such as lists stacks and. Demonstrate the working of different types of trees. Outline the concepts of hashing and heaps, Explain the various sorting techniques and assess the working of disjoint sets class. Assess the different techniques employed by various types of graphs and trees. REFERENCES, 1 Mark Allen Weiss Data Structures and Algorithm Analysis in C 4th Ed Addison. Wesley 2012, 2 Horowitz Sahni Anderson Freed Fundamentals of Data Structures in C 2nd edition. 1 b s abdur rahman university department of information technology curriculum 2016 m tech information technology semester i s no course code course l t p c

Recent Views: