Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
INTEGRATED M.TECH(ICT) 3rd SEM 2010 Course Code: No. of Lectures (Hrs/Week): Total No. of Lectures: OPERATING SYSTEM ICT-4041 Credits: 3 Mid Sem Exam Hours: 45 End Sem Exam Hours: 3 2 3 Introduction: Operating system is the interface between computer hardware and a user. It is responsible for hardware and software resource management. Aim: The aim of this course is to familiarize the student with the basic issues relating to operating systems. Evaluation Scheme:Assignment Quiz Study of recent topics and Presentation by using web tools 2.0 Mid Sem Exam End Sem Exam 10% 05% 10% 25% 50% UNIT I INTRODUCTION TO OPERATING SYSTEM Importance of operating systems, basic concepts and terminology, an operating system resource manager, memory management functions, processor management functions, device management functions, information management functions. UNIT II PROCESS MANAGEMENT Processes: concept, job scheduler, process scheduling, operation on process, threads, overview of inter process communication CPU scheduling, scheduling criteria, scheduling algorithms, algorithm evaluation process synchronization, synchronization hardware, semaphores, classical problem of synchronization, monitors and atomic transaction deadlocks: system model, deadlock characterization, deadlocks prevention, deadlocks avoidance, deadlocks detection, recovery from deadlock. UNIT III STORAGE MANAGEMENT Memory management, logical versus physical address space, swapping, contiguous allocation, paging, segmentation and segmentation with paging virtual memory, demand paging, page replacement, page replacement algorithms, allocation of frames, thrashing, and demand segmentation. UNIT IV INFORMATION MANAGEMENT File concept, directory structure, protection, file-system structure, allocation method, freespace management, directory implementation. UNIT V I/O SYSTEMS I/O hardware, application of I/O interface, overview of Kernel I/O subsystem, disk structure, disk scheduling, disk management, swap-space management, disk reliability, case studies of LINUX and Windows based OS. BINDHYACHAL KUMAR SINGH 1 INTEGRATED M.TECH(ICT) 3rd SEM 2010 UNIT VI INTERPROCESS COMMUNICATION Events, synchronization, monitors, condition variables, pipe model, message passing mechanisms, mailboxes, message protocols, Reference Books: 1. Operating Systems Concepts, Galvin, Wiley, 8th edition, 2009. 2. Operating Systems Concept, James L Peterson, John Wiley & Sons Inc, 6Rev edition, 2007 3. An Introduction to Operating Systems, Deitel H. M., Addison-Wesley, 1990. 4. Operating Systems, Stallings William, PHI New Delhi, 1997. 5. Operating Systems, Madnick and Donavon, McGraw Hill, International edition, 1978. 6. Modern Operating Systems, S. Tanenbaum, Pearson Education, 3rd edition, 2007. 7. Operating System, Nutt, Pearson Education, 2009 8. Distributed Operating Systems, S. Tanenbaum, Prentice Hall, 2nd edition, 2007. 9. Advanced Concepts in Operating Systems, M. Singhal & N. Shivaratri, McGraw Hill, 2003 BINDHYACHAL KUMAR SINGH 2 INTEGRATED M.TECH(ICT) 3rd SEM 2010 DATA BASE MANAGEMENT SYSTEM Course Code: ICT-5032 Credits: No. of Lectures (Hrs/Week): 3 Mid Sem Exam Hours: Total No. of Lectures: 45 End Sem Exam Hours: 3 2 3 Introduction: Database management is a computerized record keeping system which stores information and allows users to add, delete, change, retrieve and update that information on demand. Aim: The aim of this course is to familiarize the student with the information systems design and implementation within a database management system environment. Evaluation Scheme:Assignment Quiz Study of recent topics and Presentation by using web tools 2.0 Mid Sem Exam End Sem Exam 10% 05% 10% 25% 50% UNIT I DATA BASE SYSTEM Data base system vs. file system, view of data, data abstraction, instances and schemas, data models, ER model, relational model, other models, database languages, DDL, DML, database access for applications programs, data base users and administrator, transaction management, data base system structure, storage manager, the query processor, history of data base systems, data base design and ER diagrams, beyond ER design entities, attributes and entity sets, relationships and relationship sets, additional features of ER model, concept design with the ER model, and conceptual design for large enterprises. UNIT II RELATIONAL MODEL Introduction to the relational model, integrity constraint over relations, enforcing integrity constraints, querying relational data, and logical data base design, destroying /altering tables and views. relational algebra and calculus: relational algebra, selection and projection set operations, renaming, joins, division, examples of algebra overviews, relational calculus, tuple relational calculus, domain relational calculus, expressive power of algebra and calculus. UNIT III BASIC SQL QUERY Examples of basic SQL queries, nested queries, correlated nested queries set, comparison operators, aggregative operators, NULL values, comparison using null values, logical connectivity’s, AND, OR and NOTR, impact on SQL constructs, outer joins, disallowing NULL values, complex integrity constraints in SQL triggers and active data bases. UNIT IV SCHEMA REFINEMENT Problems caused by redundancy, decompositions, problem related to decomposition, reasoning about FDS, FIRST, SECOND, THIRD normal forms, BCNF, lossless join BINDHYACHAL KUMAR SINGH 3 INTEGRATED M.TECH(ICT) 3rd SEM 2010 decomposition, dependency preserving decomposition, schema refinement in data base design, multi valued dependencies, forth normal form. UNIT V OVERVIEW OF TRANSACTION MANAGEMENT ACID properties, transactions and schedules, concurrent execution of transaction, lock based concurrency control, performance locking, and transaction support in SQL, crash recovery, concurrency control, serializability and recoverability, lock management, lock conversions, dealing with dead locks, specialized locking techniques, concurrency without locking, crash recovery: ARIES, the log, other recovery related structures, the write, ahead log protocol, check pointing, recovering from a system crash, media recovery, other approaches and interaction with concurrency control. UNIT VI OVERVIEW OF STORAGE AND INDEXING Data on external storage, file organization and indexing, cluster indexes, primary and secondary indexes, index data structures, hash based indexing, tree base indexing, and comparison of file organizations, indexes and performance tuning, Disks and files: the memory hierarchy, redundant arrays of independent, disks, disk space management, buffer manager, files of records, page formats, record formats. tree structured indexing: intuitions for tree indexes, Indexed Sequential Access Methods (ISAM), B trees: a dynamic index structure, hash based indexing: static hashing, extendable hashing, linear hashing, extendible vs. liner hashing. Reference Books: 1. Data base Management System, Elmasri Navrate, Pearson Education, 2008. 2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TMH, 3rd edition, 2008. 3. Introduction to Database Systems, C. J. Date, Pearson Education, 2009 4. Data base System Concepts, Silberschatz, Korth, McGraw hill, 5 th edition, 2005. 5. Data base Systems design, Implementation, and Management, Rob & Coronel, Thomson, 5th edition, 200. 6. Data base Systems, Connoley, Pearson education, 2009 BINDHYACHAL KUMAR SINGH 4 INTEGRATED M.TECH(ICT) 3rd SEM 2010 Course Code: No. of Lectures (Hrs/Week): Total No. of Lectures: COMPUTER NETWORK ICT-4043 Credits: 3 Mid Sem Exam Hours: 45 End Sem Exam Hours: 3 2 3 Introduction: A computer network is a group of interconnected computers to exchange information in interactive environment. Aim: The aim of this course is to familiarize the student with the principles of computer networks and network programming. Evaluation Scheme:Assignment Quiz Study of recent topics and Presentation by using web tools 2.0 Mid Sem Exam End Sem Exam 10% 05% 10% 25% 50% UNIT I INTRODUCTION OF NETWORK MODEL Data communication, networks, the Internet, protocols and standards, network models, layered task, internet model, peer-peer processes, functions of layers, OSI model. UNIT II ANALOG AND DIGITAL SIGNALS Analog and digital, analog signals, digital signals, analog vs. digital, data rate limit, transmission, digital transmission, line coding, block coding, sampling, transmission mode, modulation and digital data, telephone modem, modulation of analog signals, multiplexing: FDM, WDM, TDM. UNIT III TRANSMISSION MEDIA Guided media, unguided media, radio waves, microwaves, infrared, circuit switching, and telephone network. UNIT IV CIRCUIT SWITCHING Space division switch, time division switch, TDM bus, telephone network, high-speed digital access: DSL, cable modems and SONET, DSL technology, types of errors, detection, error correction. UNIT V DATA LINK LAYER Flow and error control, ARQ, HDLC, point-to-point access, PPP stack, multiple access, ALOHA, random access, controlled access, channelization, LAN, Ethernet, wireless LANs, IEEE 802.11, Bluetooth, connecting device, cellular telephone and satellite network circuit switching, frame relay. UNIT VI NETWORK LAYER BINDHYACHAL KUMAR SINGH 5 INTEGRATED M.TECH(ICT) 3rd SEM 2010 Routing algorithms, congestion control algorithms, QoS requirement, integrated services, internetworking, network layer in the internet. Reference Books: 1. Data Communications and Networking, Forouzan, 4th edition, McGraw Hill, 2007. 2. Data and Computer Communications, W. Stallings, 8th edition, Prentice Hall, 2007. 3. Computer Networks, S. Tanenbaum, 4th edition, Prentice Hall, 2003. 4. Internetworking With TCP/IP Volume 1: Principles Protocols, and Architecture, Douglas E Comer, 5th edition, PHI. 5. TCP/IP Protocol Suite, B.A. Forouzan, TMH, 3rd edition, 2006. BINDHYACHAL KUMAR SINGH 6 INTEGRATED M.TECH(ICT) 3rd SEM 2010 Course Code: No. of Lectures (Hrs/Week): Total No. of Lectures: SOFTWARE ENGINEERING ICT-4044 Credits: 3 Mid Sem Exam Hours: 45 End Sem Exam Hours: 3 2 3 Introduction: Software engineering is an engineering discipline that concerned with all aspects of software development from a systematic, disciplined, quantifiable approach to the development, operation, and maintenance of software. Aim: The aim of this course is to familiarize the students with concepts of software engineering. Evaluation Scheme:Assignment Quiz Study of recent topics and Presentation by using web tools 2.0 Mid Sem Exam End Sem Exam 10% 05% 10% 25% 50% UNIT I SOFTWARE ENGINEERING Introduction to software engineering: definitions, size factors, quality and productivity factors, managerial issues, planning a software project, defining the problem, developing a solution strategy, planning the development process, planning an organization structure, software engineering process paradigms, principles of software engineering, project management, process and project metrics, software estimation, risk analysis, software project scheduling. UNIT II REQUIREMENTS ANALYSIS AND MODELS Software Development Life Cycle (SDLC), SDLC models, waterfall model and its variations, prototype model, iterative enhancement model, spiral model, software development teams, software development environments, functional and non-functional requirements, requirement engineering and management, validation and traceability, maintenance, use case modeling, use case diagrams, sequence diagrams, prototyping requirements, software requirements specification document, problem statement and requirements document. UNIT III SOFTWARE DESIGN AND CODING Software design, fundamental design concepts, high-level, architectural, and detailed design, design documentations, design heuristics, structured design: top-down refinement and modularity, modular design, modules and modularization criteria, design notations, design techniques, detailed design considerations, software design, abstraction, modularity, software architecture, effective modular design, cohesion and coupling, architecture design and procedural design, data flow oriented design, code review, structured coding techniques, coding style, standards and guidelines, documentation guidelines, type checking, scoping rules. BINDHYACHAL KUMAR SINGH 7 INTEGRATED M.TECH(ICT) 3rd SEM 2010 UNIT IV SOFTWARE PROJECT MANAGEMENT Scope of project management, product, process and project, product life cycle, project life cycle, management of project life cycle, software project management activity: cost estimation, project scheduling, staffing, software configuration management, quality assurance, project monitoring, risk management, problem with software projects, roles and responsibilities of software project manager. UNIT V SOFTWARE QUALITY AND TESTING Software quality assurance, walkthroughs and inspections, static analysis, quality metrics, software reliability, testing levels: unit testing, integration testing, system testing, acceptance testing, testing techniques: white box testing, black box testing, thread testing, regression testing, alpha testing, beta testing, static testing, dynamic testing, performance testing, ad hoc testing, smoke testing, gorilla testing, monkey testing, exhaustive testing, structural testing, mutation testing; V model, Testing Maturity Model (TMM), verification process, defect tracking, severity and priority, defects, fault, failure, bug, bug life cycle, bug report and bug reporting tools. UNIT VI SOFTWARE MAINTENANCE Evolution of software products, economics of maintenance, category of software maintenance, product development life cycle, deployment model, adaptive maintenance, enhancement request, proactive defect prevention, maintenance process, problem reporting, problem resolution, fix distribution, software maintenance from customers’ perspective, maintenance standard: IEEE-1219, ISO-12207. Reference Books: 1. An Integrated Approach to Software Engineering, Pankej Jalote, Narosa Publishing House, New Delhi 1997. 2. Software Engineering, Ian Sommerville, Pearson Education, 2009. 3. Software Engineering, James F. Peters, Witold Pedrycz, Willey, 2008. 4. Software Engineering: Practitioner's Approach, Pressman Roger S., McGraw-Hill Inc., 2004. 5. Software Engineering: Software Reliability, Testing and Quality Assurance, Nasib S. Gill, Khanna Book Publishing Co (P) Ltd., New Delhi, 2002. 6. Fundamental of Software Engineering, Rajib Mall, Prentice Hall of India, 2003. 7. Software Engineering Concepts, Richard E. Fairley, Tata McGraw Hill, 1997. 8. Software Engineering: Theory and Practice, Shari Lawrence Pfleeger, Joanme M. Atlee, Pearson Education, 2009. 9. Software Quality Engineering: Testing, Quality Assurance, and Quantifiable Improvement, Jeff Tian, John Wiley and Sons Inc., and IEEE Computer Society Press, 2005. 10. Software Testing in the Real World, Edward Kit, Pearson Education, 2003. 11. Metrics and Models in Software Quality Engineering, Stephan H. Kan, Pearson Education, 2006. 12. Black-Box Testing : Techniques for Functional Testing of Software and Systems, Boris Beizer, John Wiley & Sons, 1995. BINDHYACHAL KUMAR SINGH 8 INTEGRATED M.TECH(ICT) 3rd SEM 2010 Course Code: No. of Lectures (Hrs/Week): Total No. of Lectures: INFORMATION SECURITY ICT-5033 Credits: 3 Mid Sem Exam Hours: 45 End Sem Exam Hours: 3 2 3 Introduction: Information security is the protection of data against unauthorized access and it is implemented by using different mechanism for authorized users. Aim: The aim of this course is to familiarize the student with the different information security techniques. Evaluation Scheme:Assignment Quiz Study of recent topics and Presentation by using web tools 2.0 Mid Sem Exam End Sem Exam 10% 05% 10% 25% 50% UNIT I INTRODUCTION Management of malicious intent, threat scenarios, critical infrastructures, security targets and policies, security mechanisms, examples of applications and their different security requirements, multi-lateral security, privacy and data protection, computer misuse legislation, operating system and network security, cyber laws. UNIT II SECURITY MODELS Military and civil security, vulnerability and threat models, end-end security (COMSEC), link Encryption (TRANSEC), compartments, privacy, authentication, denial of service, no repudiation, private-key and public-key cryptographic algorithms: DES, RSA, encapsulation, encryption principles, issues in multi-level secure systems, Internet security models: IPv4/IPv6 encapsulation header. UNIT III SECURITY POLICIES AND DESIGN GUIDELINES Policies, policy creation, regularity considerations, and privacy regulations, security: infrastructure and components, design guidelines, authentication: authorization and accounting, physical and logical access control, user authentication: biometric devices. UNIT IV NETWORK LAYER SECURITY Routing algorithm vulnerabilities: route and sequence number spoofing, instability and resonance effects, information hiding: DMZ networks, route aggregation and segregation ICMP redirect hazard: denial of service, ARP hazard: phantom sources, ARP explosions and slow links, defending against Chernobyl packets and meltdown, Fragmentation vulnerabilities and remedies: ICMP Echo overrun, Network partitioning, firewall platforms, partitioning models and methods, secure SNMP, Secure routing interoperability: virtual networks (DARTnet/CAIRN), Transparent and opaque network services, Source masking and hidden channels. BINDHYACHAL KUMAR SINGH 9 INTEGRATED M.TECH(ICT) 3rd SEM 2010 UNIT V TRANSPORT AND APPLICATION LAYER SECURITY Techniques for fault detection, isolation and repair, secure network infrastructure services: DNS, NTP, SNMP, Privacy Enhanced Mail (PEM), Secure binding of multimedia streams, Secure RTP, Secure RSVP, Mobile systems: Address Export and re-use, Session key management: Blind Key Cryptosystems (NTP). UNIT VI KEY AND CERTIFICATE MANAGEMENT Secure binding of public and private values: DNS certificates, making and distributing key media: randomization, lifetime issues, key agreement protocols: STS protocol and IETF work orders, key Escrow: the Clipper chip, One-time passwords: schemes based on S/KEY, PKI components and applications, Exploiting diversity and redundancy: Byzantine generals, time stamping and reliable ordering of events: NTP, consensus and agreement protocols, security in wireless networks, How it is different, methods and procedures, MIN/ESN, shared secret data authentication, token based, public key based. Reference Books: 1. Computer Security, Gollmann, D., Wiley, 1999. 2. Cryptography and Network Security: Theory and Practice, Stallings, John Wiley, 2nd edition, 2006 3. Cryptography, Theory and Practice, Stinson D., CRC Press, Boca Raton, FA, 1995. 4. Security Engineering: A Guide to Building Dependable Distributed Systems, Anderson R., Wiley, 2nd edition, 2008. 5. Web Security: A Step-by-Step Reference Guide, Stein L., Addison Wesley Longman, Inc., 1998. BINDHYACHAL KUMAR SINGH 10 INTEGRATED M.TECH(ICT) 3rd SEM 2010 Course Code: No. of Lectures (Hrs/Week): Total No. of Lectures: ARTIFICIAL INTELLIGENCE ICT-5046 Credits: 3 Mid Sem Exam Hours: 45 End Sem Exam Hours: 3 2 3 Introduction: Artificial intelligence refers to the concepts / theories / software tools and techniques used for making the computer work in an intelligent manner like human being. Aim: The aim of this course is to familiarize students with concepts and related theories, which contribute to the human intelligence. Evaluation Scheme:Assignment Quiz Study of recent topics and Presentation by using web tools 2.0 Mid Sem Exam End Sem Exam 10% 05% 10% 25% 50% UNIT I INTRODUCTION TO ARTIFICIAL INTELLIGENCE Basic concept of artificial intelligence, history of AI, AI and consciousness, Weak and strong AI, physical symbol system hypothesis, comparison of computer and human skills, practical systems based on AI, the development of logic, components of AI, the mind body problem, Chinese room experiment, artificial life, parallel and distributed AI. UNIT II PROBLEM SOLVING THROUGH AI Defining problem as state space search, analyzing the problem, representing the problems from AI viewpoint, production system: salient features of production rules, characteristics of production system, algorithm for problem solving, examples of some standard AI problems, and nature of AI problems. UNIT III SEARCH TECHNIQUES Use of search in AI problem solution, blind search techniques, heuristic search techniques, concept of heuristic knowledge, designing of the heuristic function, types of heuristic search techniques: generate and test, best first search, problem reduction using AND – OR graph, local search technique, branch and bound search, memory bounded search technique, local beam search, properties of heuristic search techniques, overestimation and underestimation of heuristic function, hill climbing search, simulated annealing search, constraint satisfaction, means ends analysis. UNIT IV INTRODUCTION TO KNOWLEDGE Basic concept of knowledge, types of knowledge: declarative knowledge, procedural knowledge, inheritable knowledge, inferential knowledge, relational knowledge, heuristic knowledge, commonsense knowledge, explicit knowledge, tacit knowledge, uncertain knowledge, knowledge representation, knowledge storage, knowledge acquisition. UNIT V INTRODUCTION TO LOGIC BINDHYACHAL KUMAR SINGH 11 INTEGRATED M.TECH(ICT) 3rd SEM 2010 Introduction, propositional calculus, syntax of propositional calculus, the semantics of propositional calculus, well formed formula, properties of statements, inferencing of propositional logic, predicate logic, the syntax of predicate logic, semantics of predicate logic, representation of facts using First Order Predicate Logic (FOPL), inferencing in predicate logic, resolution: the concept of resolution, resolution algorithm, skolmisation, types of resolution unit resolution, binary resolution. UNIT VI GAME PLAYING The theory of game playing, formulation of problem from viewpoint of game playing, Minimax search procedure, ply of a search process, the secondary effect, the horizon effect, the credit assignment problem, alpha – beta pruning, example game playing theories: chess program, checker’s program, card game, deep blue. Reference books: 1. Artificial Intelligence by Ela Kumar: IK international pub., New Delhi, 2008. 2. Artificial Intelligence by Elanie Reich : Tata mcgraw Hill publishing house, 2008. 3. Artificial intelligence by Peterson, TataMcGraw Hill, 2008. 4. Artificial intelligence by Russel and Norvig, Pearson printice Hall pub. 2006 5. Artificial Intelligence by Winston, PHI publication, 2006 BINDHYACHAL KUMAR SINGH 12