DEVI AHILYA VISHWAVIDYALAYA, INDORE

INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES

CURRICULUM (SCHEMES)
&
COURSE OF CONTENTS

2020

MCA 5 YEAR (BCA 3Yrs + MCA 2Yrs)

PROGRAMME

Scheme for MCA 5 year (BCA 3 Yr + MCA 2 Yr)

 INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES DEVI AHILYA
VISHWAVIDYALAYA, INDORE SCHEMES OF MCA 5 Yrs
PROGRAMME

Semester VII

Code Subject L T P C
IC-701 Computer Network 3 1 0 4
IC-702 Computer Architecture 3 1 0 4
IC-703 Artificial Intelligence 3 1 0 4
IC-704 Design and Analysis of Algorithms 3 1 0 4
IC-705 Software Engineering 3 1 0 4
IC-706 Design and Analysis of Algorithms Lab 0 0 4 2
IC-707 Artificial Intelligence Lab 0 0 4 2
Comprehensive Viva 4
Total 28
 INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES, DAVV, INDORE
MCA (5 Years) VII SEMESTER
IC-701: Computer Networks
Aim of Course: To provide a theoretical foundation of computer network and equip the students
with an in-depth knowledge of fundamental techniques involved in computer network, which
helps the students to understand the actual working of computer network.
Objectives:
The course is designed to make students:
• Gain an understanding of the principles of operation of a wide variety of network
technologies.
• Develop an appreciation of how network services are developed and knowledge of their
uses.
• Apply knowledge of computers, software, networking technologies, and information
assurance to an organization's management, operations, and requirements.
• Understand data compression and data security techniques.
Course Contents:
UNIT I
Introduction: - Computer Network, Goals and Applications, Reference models – OSI and
TCP/IP. A Comparative study. Network hardware – LAN, MAN and WAN and topologies,
Network Software –protocol hierarchies, design issues for the layers, Connection Oriented and
connection less services, Switching Techniques – Circuit Switching, Message switching, Packet
Switching.
UNIT II
Data Link Layer :- Design Issues : Framing, Error Control, Flow Control, , Elementary Data
Link Protocols, Sliding window protocol, Example Data link protocols :HDLC, SLIP and PPP.
UNIT III
MAC Sub layer :- Multiple access protocols: Aloha, CSMA Protocols, Collision-Free Protocols,
Binary Exponential Back-off algorithm ,Ethernet MAC Sub layer Protocols: IEEE802.3,
IEEE802.4, IEEE802.5 , High speed LANs – Fast Ethernet, FDDI, Wireless LANs, Bridges.
UNIT IV
Network Layer :- Design issues, Routing Algorithms: OptimalityPrinciple, Shortest Path
Routing, Flooding, Distance Vector Routing, LinkState Routing , Hierarchical Routing,
Broadcasting Routing, MulticastRouting,Congestion control algorithms,Internetworking, The
Network Layer in the Internet: Internet Protocol, Internet addressing and Internet Control
protocols.
UNIT V
Transport Layer :- Services, The Internet Transport Protocols : TCP and UDP,performance
issues
Application layer :- DNS Name Space, Name Servers, FTP, TELNET,WWW, SNMP, HTTP,
SMTP , Network Security : Cryptography,Symmetric- key Algorithms, Public- key Algorithms,
Digital Signatures,E-mail Security

Reference Books:
1. A.S. Tanebaum, Computer Network (III Edition).
2. B.A. Forouzen, Data Communication and Networking (II Edition).
3. William Stalling, Data and Computer Communication.
 INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES, DAVV,
INDORE
MCA (5 Years) VII SEMESTER
IC-702: Computer Architecture

Aim of Course: To understand the concepts of design and analysis of the hardware of
a computer system and its components such as control unit, arithmetic and logical
(ALU) unit, input/output, and memory unit.
Objectives:
The course is designed to make students:
• Learn concepts of microprogramming in the design of the central processing
unit of a computer system.
• Understand various ways for interconnecting I/O devices to the system.
• Understand basic concepts of parallel processing
Course Contents:
UNIT I
Introduction and vocabulary, History of computer architecture, Overview of computer
organization, Difference between Computer architecture & organization, von
Neumann/Turing, IBM 360 series, Moore’s law, Performance measurement: IPC, CPI,
MIPS, Amdahl’s law, CPU performance equation, Speeding it up, Performance
Mismatch & Solutions, Instruction cycle, Interrupt cycle, Bus interconnections: Types,
Arbitration, PCI.
UNIT II
CPU Structure, Registers, User Visible Registers, General Purpose Registers,
accumulator organization, general register organization, stack organization of CPU,
High level issues in CPU design, Memory: Location, Capacity, Unit of transfer, Access
method, Performance (Access, cycle, transfer rate), Physical type (semi conductor or
magnetic), Physical characteristics (volatile, erasable etc.), Locality of references,
Cache mapping techniques, Cache write policies, Cache initialization, External
memory, RAID organization of hard disks.
UNIT III
Input/Output: Programmed I/O, Interrupt Driven I/O, Direct Memory Access.
Representing information digitally, Byte Ordering: Big-Endian & Little-Endian.
Instruction sets, Elements of an Instruction, Instruction Representation, Instruction
types, Number of Addresses, Design Decisions [CISC/RISC], Addressing Modes,
Large Register File in RISC.
Register and data flow design, data fetch and instruction fetch in indirect instruction
cycle, CPU control unit, Functions of Control Unit, Micro-Operations, Micro
Programmed Control and Hardwired control unit and their advantages-disadvantages.
UNIT IV
Instruction level parallelism: Pipeline design, Synchronous & Asynchronous Pipeline
conflicts: Resource conflict, Data dependency, and Branch difficulties. Solutions to
deal with pipelining: Hardware interlocks, operand forwarding, Delayed load, Pre
fetch target instruction, Branch target buffer, Loop buffer, Branch prediction, and
Delayed branch. Super scalar design; Super pipelining, and VLIW processors.
UNIT V
Parallel Processing, Flynn’s classification: SISD, SIMD, MISD, MIMD. Vector
processor, Array Processor, Symmetric multi processing, NUMA, Cache coherence in
parallel computing.

Reference Books:
4. William Stallings, Computer Organization and Architecture: Design for
performance 8th Ed., Pearson Education.
5. Rajkamal, Computer Architecture, ISP 2006, Tata McGraw HILL.
6. Andrew Tanenbaum, Structured computer organization, 4th Ed., Prentice –
Hall, Upper Saddle River, NJ, 2000. (Alternate reference)
7. M. Morris Mano, Computer System Architecture, 3rd Ed., Pearson
Education.
8. Kai Hwang, Computer Architecture
 INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES, DAVV, INDORE
M.C.A (5 Years) VII SEMESTER
IC-703 : Artificial Intelligence
Aim of Course: To familiarize students with techniques of representing knowledge required to
build intelligent machines capable of taking decision like human beings.
Objectives:
The course is designed to make students:
• To familiarize students with techniques of solving problems that need human
intelligence.
• To enable students to formulate Artificial Intelligence problems
• To enable students to use heuristic techniques to solve the AI problem.
Course Contents:
Unit-I
Introduction to AI & Problem Solving in AI:
What is AI, AI Techniques, Defining the Problem in AI, Problem Spaces, Problem Characteristics,
Production System and its Characteristics.

Unit-II
Heuristic Search Techniques: Heuristic Search, Criteria for Success, various search techniques-
Generate and Test, Depth and Breadth First, Hill Climbing , Best first Search, A* algorithm.

Unit-III
Knowledge Representation and Issues: Types of Knowledge, Representation and mapping,
approaches and issues in knowledge representation, Predicate Logic- representation of simple
facts, computable functions, resolution, logic programming, matching, control knowledge.

Unit-IV
Prolog Programming:
Introduction and applications, facts, objects and predicates, Linguistic variables, Rules, input-
output operations, controlling execution: Recursion, fail; Arithmetic operations, List, dynamic
databases; expert system design.

Unit-V
Knowledge Representation Techniques and Advanced AI: Slot and filler structure –
introduction, weak and strong structure, semantic nets, frames, conceptual dependency and
Frames; fuzzy logic and robotics, Expert system-concept and design.

Reference Books:-

1. Artificial Intelligence: Elaine Rich and Kevin Knight (TMH publication)

2. Introduction to AI and expert systems: D.W. Patterson (PHI publication)
3. Essential References: Artificial Intelligence: Petric Henry Winston (Addison-Wesley)
4. N.J.Nilson: Principles of Artificial Intelligence, Narosa Publications.
5. Introduction to Turbo Prolog: Carl Townsand(BPB publication)
 INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES, DAVV,
INDORE
MCA (5 Years) VII SEMESTER
IC-704: Design & Analysis of Algorithms
Aim of Course: Aim of Course: This course aims to introduce the classic algorithms in
various domains, and techniques for designing efficient algorithms.
Objectives:
The course is designed to make students:
• Learn to analyze the running time of the algorithms
• Understand the application of algorithms and design techniques to solve
problems.
• Learn to analyze the complexities of various problems in different domains and
design efficient algorithms.
• Understand asymptotic notation to provide a rough classification of algorithms
• Study algorithms for fundamental problems in computer science and
engineering work and compare with one another.
• Understand the problems for which it is unknown whether there exist efficient
algorithms or even algorithm
Units 1.
Introduction to Algorithms, What is an Algorithm, Algorithm Specification,
Performance analysis., Review of Data Structures, Stacks and Queues, Trees ,Graphs
Units 2.
Divide and Conquer, Genaeral Method, Binary Search, Finding the Maximum and
Minimum , Merge Sort , Strassen’s Matrix Multiplication ,
Units 3.
The Greedy Method , General Method , Knapsack Problem , Job Sequencing with
deadlines , Minimum Cost Spanning Trees , Prim’s Algorithm, Kruskal’s Algorithm
Units 4.
Dynamic Programming, The General Method, Multistage Graphs, All Pairs Shortest
Paths, Single Source Shortest Paths, 0/1 Knapsack, Traveling Salesperson Problem
Units 5.
Basic Traversal and Search Techniques, Techniques for Binary Trees, Techniques for
Graphs , Back Tracking, The Genaral Method , The 8-Queens Problem ,
Sum of Sub sets , NP-Hard and NP-Complete Problems, The Basic Concepts , Non-
Deterministic Algorithms , The Classes NP-Hard & NP-Complete.

RECOMMENDED BOOKS
[1] T.H. Coreman, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms,
Prentice Hall of India, 1990.
[2] E. Horowitz, S. Sahni, S Rajasekaran, Computer Algorithms, Galgotia
Publications.
[3] Saara Base, Computer Algorithms: Introduction to Design and Analysis, Addision
Wesley, 2/e, 1988.
[4] Knuth, D, The art of computer programming, Vols. 1-2-3, Addision Wesley 1968-
73.
[5] A V Aho, J E Hopcroft & J D Ullman, The Design and Analysis of Computer
Algorithms, Addison Wesley, 1974.

INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES, DAVV,

INDORE
MCA (5 Years) VII SEMESTER
IC-705: Software Engineering
Aim of Course: To gain a broad understanding of the discipline of software engineering
and its application to the development of and management of software systems.
Objectives:
The course is designed to make students:
• Understand the various activities undertaken for a software development
project.
• Develop and write a software project proposal
• Develop and write a Software Requirements Specification and design document.
• Learn to work within a team and understand team dynamics
• Be able to effectively communicate the work (Presentation skills)
Course Contents:
UNIT I
Introduction to Software Engineering: Software problem, Software engineering
problem, Software engineering approach, Software characteristics and Applications.
Software Processes: Software processes and its components, characteristics of software
processes, Software development processes: Linear Sequential model, Prototyping
model, RAD model, Iterative Enhancement model, Spiral model, Component based
development, Comparative study of various development models
UNIT II
Project management process: The people, product, process and project, Phases of
project management process, the W5HH principle. Software configuration management
process, Process management process: Capability Maturity Model (CMM).
UNIT III
Software Requirement Analysis and Specification: Software requirements, Problem
analysis, Requirements specifications, Validation and Verification, Metrics.
Project Planning: Project estimation (Size & Cost), Project Scheduling, Staffing and
personnel planning, Software configuration management plans, Quality assurance
plans, Project monitoring plans, Risk management.
UNIT IV
Software Design: Design principles: Problem partitioning and hierarchy, Abstraction,
Modularity, Top-down and Bottom-up strategies. Effective Modular design: functional
independency, Cohesion, Coupling. Structured design methodology.
UNIT V
Software Quality Assurance: Quality concept, Quality management system, movements
and assurance, Software reviews: formal and technical, Formal approaches to SQA,
Statistical software quality assurance, Software reliability, ISO 9000, SQA plan.
Software Testing: Software testing techniques: Testing fundamentals, White box
testing, Black box testing, testing for specialized environments, architectures and
applications. Software testing strategies: A strategic approach to software testing,
Strategic issues, Unit testing, Integration testing, Validation testing and system testing,
the art of debugging

Reference Books:
1. Dr. Ugrasen Suman, Software Engineering: Concepts and Practices,
Published by Cengage Learning.
2. Ian Sommerville, Software engineering, Ninth edition Pearson
3. Pankaj Jalote, An Integrated Approach to Software Engineering, Narosa
Publishing House.
4. R. S. Pressman, Software Engineering-A practitioner’s approach, Tata
McGraw-Hill International Editions, New York.
5. Richard E. Fairly, Software Engineering Concepts, Tata McGraw Hill Inc.
New York.
6. W. S. Jawadekar, Software Engineering: Principle & Practice, Tata
McGraw-Hill, New York