Syllabi: Master of Computer Applications (M.C.A.)

SYLLABI
Master of Computer Applications

(M.C.A.)
(Two Year Programme)
(2021-2022)
Revised on BoS: 09.09.2023
DEPARTMENT OF COMPUTER SCIENCE

ALIGARH MUSLIM UNIVERSITY
ALIGARH-202002
Page | 1
PROGRAM OUTCOMES
PO1 Apply the knowledge of computer science fundamentals to the solution of complex
engineering problems.
PO2 Design solutions for complex problems and design system components or processes that
meet the specified needs with appropriate consideration for the public health and safety,
and the cultural, societal, and environmental considerations.
PO3 Create, select, and apply appropriate techniques, resources, and modern tools to handle
complex real life systems with an understanding of the limitations.
PO4 Apply ethical principles and commit to professional ethics and responsibilities and
norms of the standard practices.
PO5 Function effectively as an individual, and as a member or leader in diverse teams, and
in multidisciplinary settings.
PO6 Communicate effectively on complex system activities with the concerned community
and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear
instructions.
PO7 Use research-based knowledge and research methods including design of experiments,
analysis and interpretation of data, and synthesis of the information to provide valid
conclusions.
PO8 Identify, formulate, review research literature, and analyze complex problems reaching
substantiated conclusions using principles of mathematics and computer science.
PO9 Recognize the need for, and have the preparation and ability to engage in independent
and life-long learning in the broadest context of technological change.
PROGRAM SPECIFIC OUTCOMES
PSO1 Understand, analyze and develop computer programs in the areas related to algorithms,
Process and solutions for specific application development using appropriate data
modeling concepts.
PSO2 Apply standard Software Engineering practices and strategies in software project
development using open-source programming environment to deliver a quality product
for business success.
PSO3 Be acquainted with the contemporary issues, latest trends in technological development
and thereby innovate new ideas and solutions to existing problems.
Page | 2
ALIGARH-202002
SYLLABUS (1st SEMESTER)

MASTER OF COMPUTER APPLICATIONS (M.C.A.)
COURSE CAMS-1N01: Fundamentals of IS & IT (Bridge Course)
OBJECTIVES OF THE COURSE

• To help learners in developing broad understanding of information systems, seen within
organisational and societal contexts.
• The aim is to provide students with an appropriate balance of technical and organisational
perspectives to serve as the basis for further study in the field of IS and IT.
COURSE OUTCOMES:
After Completing this course the students should be able to:
CO1. Understand Organizational uses of information to improve overall quality.
CO2. Understand concepts of Information Systems.
CO3. Understand the concepts of hardware and software.
CO4. Understand the concepts of database and DBMS software.
CO5. Understand the concepts of Computer Networks.
CO6. To explain the different steps involved in the creation and implementation of
Information Systems.
CO7. To provide concepts and skills for the specification and design or the re-engineering of
organizationally related Systems of limited scope using information technology.
CO8. To show how information technology can be used to design, facilitate, and communicate
organizational goals and objectives.
CO9. Understand different types of Business Information Systems.
CO10. To show career paths in information system.
CO11. To present and discuss the professional and ethical responsibilities of the IS practitioner
Credit: 00
Sessional Marks: 30
Final Marks: 70
UNIT-I
Foundations of Information Systems in Business: Foundation Concepts in Information Systems
and Technologies, Business Applications, Development, and Management, Competing with
Information Technology: Fundamentals of Strategic Advantage, Using Information
Technology for Strategic Advantage.
UNIT-II
Data Resource Management: Managing Data Resources, Technical Foundations of Database
Management, Telecommunications and Networks: The Networked Enterprise,
Telecommunications Network Alternatives, Computer Hardware: Computer Systems; End-
User and Enterprise Computing, Computer Peripherals: Input, Output, and Storage
Technologies, Computer Software: Application Software: End-User Applications, System
Software: Computer System Management.
Page | 3
UNIT-III
Introduction to e-Business Systems: Functional Business, Cross Functional Enterprise Systems,
Applications in Business and Management: a) Enterprise e-Business Systems - Customer
Relationship Management; the Business Focus, Enterprise Resource Planning; The Business
Backbone, Supply Chain Management; the Business Network, b) Electronic Commerce
Systems: Electronic Commerce Fundamentals, its Applications and Issues, c) Decision Support
Systems: Decision Support in Business, Artificial Intelligence Technologies in Business.
UNIT-IV
Developing Business: IT Strategies & IT Solutions; Planning Fundamentals, Implementation
Challenges, Developing e-Business Systems, Implementing e-Business Systems.
Management Challenges: Security, Ethical, and Societal Challenges, Security Management,
Managing Information Technology, Managing Global IT.
BOOKS:
1. James A. O’Brien, George M. Marakas, "Introduction to Information Systems",

McGraw- Hill,2013.
2. Ralph Stair George Reynolds, "Information System Essentials", Seventh Edition, Course
Technology, Cengage Learning.
3. Efraim Turban, R. Kelly Rainer, Richard E. Potter, "Introduction to Information
Technology", Wiley.
4. R. Kelly Rainer, Brad Prince, Casey G. Cegielski, "Introduction to InformationSystems:
Supporting and Transforming Business", Wiley.
5. T. Cornford, M. Shaikh, "Introduction to Information Systems", University of London
Press, 2013.
Program Outcomes
CourseOutcomes
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
CO1 × × ×
CO2 × × × ×
CO3 × ×
CO4 ×
CO5 ×
CO6 × × × × × ×
CO7 × × ×
CO8 × ×
CO9 × ×
CO10 × ×
CO11 ×
Introduced on: 01.02.2021
Page | 4
ALIGARH-202002

COURSE CAMS-1N02: Numerical and Statistical Computing (Bridge Course)
OBJECTIVES OF THE COURSE:

• To develop a thorough understanding of the methods of numerical differentiation and
integration
• To gain knowledge in measures of central tendency and dispersion
• To learn how to formulate and test the hypotheses about means, proportions and standard
deviation to draw conclusions based on the results of statistical tests in large sample.
• To get exposed to finite differences and interpolation
• To develop, debug and document programs for solving numerical and statistical
problems.
COURSE OUTCOMES
Upon successful completion of this course, the student will be able to:
CO1. Apply appropriate methods for finding solutions of Transcendental and simultaneous
system of linear equations and analyse the errors obtained in the numerical solution of
problems.
CO2. Learn application of numerical and statistical method in the field of computer science.
CO3. Develop and implement numerically stable and accurate algorithms for all the basic
tasks of computational science and engineering problems.
CO4. Compare and statistically analyse different datasets.
Credit: 00
Sessional Marks: 30
Final Marks: 70
UNIT-I
Floating Point Arithmetic: Representation of floating point numbers, Operations,
Normalization, Pitfalls of floating point representation. Computer Arithmetic: Significant
Figures, Rounding off, Truncation, Absolute, Relative and Percentage Errors, Function of
Single and Several Variables, Propagation of Errors in Arithmetic Operations.
Numerical Differentiation and Integration: Introduction to Numerical Differentiation,
Numerical Integration: Trapezoidal rule, Simpson’s rules, Numerical Solution of Ordinary
Differential Equations: Taylor’s Series and Euler’s Methods, Modified Euler’s Method,
Runge-Kutta and Predictor-Corrector Methods, Automatic error monitoring, Stability of
solution.
UNIT-II
Solutions of Transcendental and Simultaneous Linear Equations: Solution of Non-linear
Equations: Newton Raphson Method, Bisection Method, Regula-Falsi Method, Discussion on
Convergence of Solution.
Solution of Simultaneous Linear Equations: Iterative Methods, Gauss Jacobi Iterative Method,
Gauss-Seidel Iteration Method, Comparison of Direct and Iterative Methods.
Page | 5
UNIT-III
Interpolation and Approximation: Interpolation with Unequal Intervals: Lagrange’s Method,
Divided Difference Method, Divided Difference Table, Newton’s Divided Difference Method,
Inverse Interpolation, Polynomial and Curve Fittings, Correlation: Partial and multiple
Correlation (for three variables only), Method of least squares, fitting of straight lines,
polynomials, exponential curves.
UNIT-IV
Statistical Computation: Statistical tools and techniques: Measure of central tendencies:
Mean, Mode, Median, Measure of dispersion: Range, Variance and Standard Deviation,
Frequency Distribution and Cumulative Frequency Distributions, Regression Analysis: Linear
and Non linear regression, Multiple regression, Testing of Hypothesis: Test of Significance,
Chi-square test, t-test, ANOVA, F-test.
Laboratory: Using MATLAB in solving problems specified in lab manual.
BOOKS:
1. Keter and Prawel - Numerical Methods for Engineering Students.
2. Rajaraman - Computer Oriented Numerical Methods.
3. Shan S. Kuo - Computer Applications of Numerical Methods.
4. Dodes A. - Numerical Analysis for Computer Science.
5. S. Sastry - Introductory Methods of N.A.
6. M. K. Jain and Lyenger-Numerical Methods for Scientific and Engineering Computation.
7. Dr. M. Shanta Kumar - Computer Based Numerical Analysis.
8. S. P. Gupta- Fundamental of Statistics
10. A.M. Goon, M.K. Gupta and T.S. Das Gupta, Fundamentals of Statistics (7th Ed.), Vol.
I, The World Press Pvt. Ltd., 2000.
11. A.M. Goon, M.K. Gupta and T.S. Das Gupta, An Outline of Statistical Theory (2nd Ed.),
Vol. II, The World Press Pvt. Ltd., 2000.
12. Bradie, A Friendly Introduction to Numerical Analysis, Pearson Education, 2007.
13. S.R. Otto Denier, An Introduction to Programming and Numerical Methods in
MATLAB, and J.P. Springer, 2005.
14. M.K. Jain, S.R.K. Lyengar and R.K. Jain, Numerical Methods for Scientific and
Engineering Computation (7th Ed.), New Age International Publishers, 2007.
Course Program Outcomes

Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
1 X X
2 X X X
3 X X X
4 X X X X X X
Page | 6
ALIGARH-202002

COURSE CAMS-1001: Data Structure using C++

• To develop the understanding of data structures.
• To design and implement algorithms for various operations on data structures.
• To apply concepts and techniques for implementation using C++
COURSE OUTCOMES:
The students would able to:
CO1. Ability to understand various data structures, their representation and applications.
CO2. Ability to write algorithms for different operations like insertion, deletion, traversing
and searching etc. on various data structures.
CO3. Ability to analyze algorithms and determine their complexity.
CO4. Ability to implement algorithms for different operations on Linear and Non-Linear data
structures using a programming language.
CO5. Understand the object oriented programming using C++.
CO6. Implement the various object oriented programming features in real life applications
CO7. Handle the data using the concepts of File Handling.
CO8. Design and Implement the real life complex applications.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Programming Paradigms: Unstructured Programming, Structured Programming, Object
Oriented Programming, Class, Object, Message, Encapsulation, Polymorphism,
Inheritance, Pros and Cons of Object-oriented Methodology, c in and c out, Preprocessor
Directives; Simple C ++ Programming examples.
UNIT-II
Identifiers and Keywords, Constants, Variables, Scope of variables, Type Conversion,
Operators in C++, Library Functions, Input/ Output Statements, Compound statements and
block, Operators in C++, data types in C++ including enumeration, conditional executing
using if, if-else, switch and break, Concept of Loops: for, while and do-while, Functions,
Recursion, Control Statements, functions of the class, Constructor and Destructor,
Parameterized Constructor, Copy Constructors.
UNIT-III
Arrays (one and two dimensional), 2-d array used in matrix computation, Concept of
structures: and union, applications of structures, accessing of structure members, nesting
Page | 7
of structures, concept of pointer and its applications and importance, user-defined and
library function (in-built), function prototype, parameter passing, file handling in C++,
exceptions handlings.
UNIT-IV
Design and Analysis of Algorithm: Algorithm definition, comparison of algorithms, Time
and Space Complexities of Algorithms, Classification of Data Structures: Primitive and
Non- Primitive, Linear and Nonlinear; Data structure Operations, Sorting: Selection sort,
Insertion sort, Bubble sort, Quick sort, merge sort, Radix sort. Searching: Sequential and
binary search, Stack, Queues, Linked Lists
Applications of Stack, Queue and Linked List data structures.
LABORATORY:
PROGRAMMING EXERCISES in C++: Agraded Sheet of assignments/problems will be

given to the students to develop Algorithms/Flowcharts & Programs in C++ related to Data
Structure and real life problems.
BOOKS:
1. R.S. Salaria, “Data Structures and Applications using C”, 5th Edition, 2012, Khanna
Book Publishing.
2. Tremblay & Sorenson, “An Introduction to Data Structures with Applications”,
2ndEdition, 2001, Mcgraw Hill.
3. Lipschutz, “Data Structures”, 1stEdition, 2005, Tata McGraw Hill.
4. Robert L. Kruse & A. J. Ryba, “Data Structures and Program Design in C++”,2000,
Prentice Hall.
5. Robert Lafore, “Object Oriented Programming in C++”, Pearson
6. Herbert Schldt, “C++ - A CompleteReference”,4th Edition, McGraw Hill Education.
7. E Balagurusamy, “Object Oriented Programming with C++”, 6th Edition, McGraw Hill
Education.
8. Bergin Joseph, “Data Abstraction: The Object oriented Approach using C++”,
McGraw Hill Education.

1 x x
2 x
3 x x x x x x
4 x x
5 x x x x x x x x x
Revised on BoS 09.09.2023
Page | 8
ALIGARH-202002

COURSE CAMS-1002: Digital Logic and Computer Architecture

• To introduce basics of digital logic circuits design and Computer Organization.
• To identify various number systems and work with Boolean Algebra
• To understand various logic gate
• To simplify the Boolean expression using K-Map and Tabulation techniques
• To analyze various types of flip flops used for designing registers and counters
• To understand the basic structure and operation of digital computer
• To study the hierarchical memory system including cache memories and virtual memory
• To study the different ways of communicating with I/O devices and standard I/O
interfaces
COURSE OUTCOMES:
The students would be able to:
CO1 Explain the top-level view of computer.
CO2 Explain and perform arithmetic operations of computer.
CO3 Explain the importance and impacts of memory hierarchy on hardware performance.
CO4 Explain the I/O techniques for communication between computers and I/O devices.
CO5 Demonstrate and explain the knowledge of concepts of pipelining and its impacts on
performance of computer
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction to Digital Computer, Data Representation, Integer Representation, Boolean
Algebra, Simplification of Boolean Expressions, Logic Gates, TTL circuits, Combinational
Circuit, Design Procedures, Some commonly used combinational circuits, Binary Adder,
Binary Subtractor 2’s complement Adder Subtractor, designing with Multiplexers.
UNIT-II
Sequential Circuits, Flip-Flop, RS-FF, JK FF, Master Slave JK FF, D-FF, T-FF, Buffer
Register, Shift Register, Ripple counter, Synchronous counter, Controlled Counter, Ring
counter.
UNIT-III
Memory Device Characteristics, 2D & 3D Memories, Memory Hierarchy, Semiconductor
Memories: RAM, ROM, DRAM, Flash Memory; High Speed Memories: Cache Memory,
Associative Memory, Memory Interleaving.
Page | 9
UNIT-IV
Input/Output Interface, I/O Bus and Interface modules, Data transfer modes (Programmed
mode, Interrupt initiated I/O, DMA), Interrupt structure, Input-Output Processor (IOP), CPU-
IOP Communication, Introduction to advanced computer Architectures, RISC vs CISC
Architectures, Types of Parallel processors,
Flynn’s classification of computer systems, Pipeling, Arithmetic and instruction pipelining,
Multiprocessor organizations (Loosely coupled vs Tightly coupled).
Laboratory: Writing Simple Programs for Logic Circuits.
BOOKS:
1. MANO, M., "Digital Logic and Computer Design"

2. Malvino A.P., "Digital Computer Electronics"
3. Bhujade M.R., "Digital Computer Design Principles"
4. Raja Raman V. and Radha Krishnan T., "An introduction to digital computer design"
5. MANO, M., "Computer System Architecture"
6. Stallings, W., "Computer Organization &Architecture"
7. B. Ram, "Computer System Organization &Architecture"

1 x x x x x x x
2 x x x x x x
3 x x x x x x x
4 x x x x
5 x x x x x x
Page | 10
ALIGARH-202002
COURSE CAMS-1003: Database Management System

• To introduce the concept of DBMS and providing a general introduction to relational,
object and object-relational model.
• To help students learn SQL using ORACLE.
COURSE OUTCOMES:
The student will be able to demonstrate:
CO1. The ability of Data modeling using the Entity-Relationship Approach
CO2. The capability of Relational Database Design of complex system
CO3. The understanding of structured query language(SQL) as well as procedural language
in SQL
CO4. The concepts of normalization and apply it to normalize the database
CO5. The concepts of database transaction and its related concepts to manage the concurrent
transactions.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Basic concepts, Database & Database Users, Characteristics of the Database, Database Systems
Concepts & Architecture, Data Models, Schemas & Instances, Sub-schemas, Data Dictionaries,
DBMS Architecture & Data Independence, Type of Database Languages, Interfaces, Query
Languages, Data modeling using the Entity-Relationship model, UML, Enhanced Entity-
Relationship and Object Modeling, Relational Model, Languages & Systems, Relational Data
Model & Relational Algebra: Relational Model Concepts, Relational Model Constraints,
integrity constraints, Relational Algebra: relational domain & tuple calculus.
UNIT-II
SQL - A Relational Database language (DDL, DML, Views, Embedded SQL) , Data Definition
in SQL, View & Queries in SQL, Specifying Constraints & Indexes in SQL, Specifying
Constraints & Indexes in SQL, Cursor, Triggers, procedure and function in database, Relational
Database Management Systems, Introduction to Conventional Data Model & Systems:
Network Data Model & IDMS Systems, Hierarchical Data Model & IMS System. Object and
Object -Relational Databases: Overview of Object Database Concepts, Object-Relational
Features: Object Database Extensions to SQL. The ODMG Object Model and the Object
Definition Language ODL, Object Database Conceptual Design, The Object Query Language
(OQL).
Page | 11
UNIT-III
Relational Data Base Design, Function Dependencies & Normalization for Relational
Databases, Functional Dependencies, Multi varied & join dependencies, Normal forms based
on primary keys (INF, 2NF, 3NF & BCNF), Loss less join & Dependency preserving
decomposition, Transaction Processing Concepts and Theory, Concurrency Control &
Recovery Techniques, Locking Techniques, Time stamp ordering Granularity of Data items,
Database backup and recovery from catastrophic failures.
UNIT-IV
Database Security & Authorization: Introduction to database security issues, Discretionary
Access control based on granting & revoking privileges, Mandatory Access control & role
based Access Control for multilevel security. Introduction to statistical database security.
Introduction to flow control, Encryption & Public key infrastructure, A case study of Oracle
DBMS and Information system development using Oracle.
BOOKS:
1. Date, C.J., "An Introduction to Database Systems", Narosa Publishing House, New
Delhi.
2. Elmsari and Navathe, "Fundamentals of Database Systems", 7th Edition, Pearson.
3. Desai, B., "An Introduction to Database Concepts", Galgotia Publications, New Delhi.
4. Ullman, J.D., "Principles of Database Systems", Galgotia Publications, New Delhi.
5. James Mortin- Principles of Database Management Object Oriented Modeling & Design
6. A. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts (5th ed.),
McGraw Hill, 2006.
7. Philip Lewis, Arthur Berstein and Michael Kifer, Databases and Transaction Processing
and application oriented approach, Addison Wesley, 2002.

1 x x x
2 x x x
3 x x x
4
5 x
Page | 12
ALIGARH-202002

COURSE CAMS-1004: Analysis and Design of Information Systems

• To learn basic concepts of Systems,
• To learn various tools and techniques related to System Analysis, Design and
Implementation.
• To apply the concepts in analyzing and designing real life systems
COURSE OUTCOMES:
CO1. Identify various types of information systems concepts and terminologies
CO2. Demonstrate phases of the System Development Life Cycle (SDLC) using analytical
tools and quantitative techniques used to identify problems.
CO3. Evaluate information systems projects to identify various aspects of feasibility of these
projects.
CO4. Evaluate a wide range of problems related to the analysis and design of information
systems.
CO5. They able to train, test and review the System.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Data, Information, formal Vs informal information, information attributes. System Concept,
Information Attributes, Data Operations.
Organization perceived as a System. Information requirements for Organization, Management
requirements, Management functions, planning, controlling, decision-making, programmed
decision making, non-programmed decision making.
UNIT-II
Overview of Systems Analysis And Design: System Development Life Cycle. Information
Sources And Gathering Methods, Interviewing Techniques, Questionnaires, Role And Task of
A System Analyst. Attributes of A System Analyst and tools used by S.A.
UNIT-III
Data Flow Diagrams, Feasibility Study And Cost Estimation: Cost-Benefit Analysis, Feasibility
Study Report. Making the System Operational: System Implementation, Conversion And
Support, System Conversion, User Training, Post Implementation review.
Page | 13
UNIT-IV
Output Design: Objective of output, types of Output, Formats of Output, Designing printed
Outputs, Guidelines for designing printed outputs.
Inputs Design: Objective of input design, Capturing data for input, Design of the source
document, Methods for data capture, Input Validation.
LABORATORY:
1. Designing complete Information System Using SSAD Techniques- Case Studies of I.S.
2. Using CASE Tools for Analysis, Design & Implementation of Information Systems (e.g.,
Introduction to Visual Case Tools/Rational Rose).
BOOK:
2. Birch JG And FR Strater, "Information System Theory And Practice", Santa Barbara:
Hamilton
3. Gaines C & R Sarson, "Structure System Analysis Tools And Techniques", PrenticeHall
4. Lundeberg, Mats, Gonan Gold et al, "Information System Development: A Systematic
Approach"
5. Cougher J. D, MA Cotler and RW Knapp, "Advanced System Development and
Feasibility Techniques", Wiley, New York
6. V. Rajaraman, "Analysis and Design of Information System", PHI
7. Haryszkiewycz, I. T. "Introduction to System, Analysis & Design" Whiten, J.K.,
Bentley, L.D., Beslow, V.M., "System Analysis & Design Methods"

1 x x x x
2 x x x x x x
3 x x x x x x x
4 x x x x x x
5 x x x x x x
Page | 14
ALIGARH-202002

COURSE CAMS-1005: Soft Skills Development and Technical Communication

• To help learners develop their soft skills and develop their personality together with
their technical skills.
• To developing professional and Interpersonal skills to harness hidden strengths,
capabilities and knowledge equip them to excel in real work environment and corporate
life.
• To help students achieve proficiency in English and develop their professional
communication and report writing skills to meet the demand in the field of global
communication.
• To enable students successfully communicate verbally and technically with ease and
confidence in any real-life situation
COURSE OUTCOMES:
CO1. To improve personality with positive thinking.
CO2. To improve leadership skills and how to handle team.
CO3. To create skill how to manage utilizes the time.
CO4. To develop a proper plan according to goals and mission of life.
CO5. To maintain balance between technical work and health.
CO6. To reduce the stress while studying at home or library.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction to Soft Skills and Hard Skills
Personality Development: Knowing Yourself, Positive Thinking, Communication Skills,
Non- Verbal Communication, Physical Fitness.
Emotional Intelligence: Meaning and Definition Need for Emotional Intelligence, Intelligence
Quotient versus Emotional Intelligence Quotient, Components of Emotional Intelligence,
Emotion Scales, Managing Emotions. Skills to Develop Emotional Intelligence.
Etiquette and Mannerism: Introduction, Professional Etiquette, Technology Etiquette.
UNIT-II
Professional Skills
Creativity at Workplace: Introduction, Current Workplaces, Creativity, Motivation,
Nurturing Hobbies at Work, The Six Thinking Hat Method
Capacity Building: Learn, Unlearn and Relearn: Capacity Building, Elements of Capacity
Building, Zones of Learning, Ideas for Learning, Strategies for Capacity Building.
Leadership and Team Building: Leader and Leadership, Nature and Types. Qualities and
Page | 15
Functions of good leadership, Skills of a good Leader, Assessment of Leadership skills, Team
Building, Types of Teams, Necessity of Team Work Personally, Socially and Educationally.
Time Management: Value of time, Diagnosing Time Management, Weekly Planner To do list,
Prioritizing work.
Values and Ethics: An Introduction, Goals and Mission of Life, Vision of Life. Ethics and
Society, Theories of Ethics, Correlation between Values and Behaviour, Nurturing Ethics,
Importance of Work Ethics, Problems in the Absence of Work Ethics, Ethical and Unethical
practices in computing
UNIT-III
Fundamentals of Written and Oral Technical Communication: Distinction between
General and Technical communication, Importance of technical communication, Barriers to
Communication. Constituents of Technical Written Communication.
Words and Phrases, Word formation. Synonyms and Antonyms; Homonyms, Homophones;
Eponyms, Phrasal Verbs, Idioms, One-Word Substitutes, Select vocabulary of about 500-1000
New words; Correct Usage: all Parts of Speech; Modals; Concord; Articles; Infinitives;
Requisites of Sentence Construction: Paragraph Development: Techniques and Methods-
Inductive, Deductive, Spatial, Linear, Chronological etc; The Art of Condensation-various
steps.
UNIT-IV
Communicative Grammar: Introduction, Nouns, Gerunds, Infinitives, Subject-Verb
Agreement, Tenses, Active and Passive Voice, Conditional Sentences, Adjectives and Degrees
of Comparison, Adverbs, Conjunctions, Prepositions, Articles, Mood, Emotions, Attitude Oral
Communication.
Technical Report writing: Techniques for Good Technical Writing, Referencing and Styling,
Right Words and Phrases, Sentences, Writing an official / Business letter, Cover Letters,
Emails, Preparation of Bio-Data, Note-making/Memos, Writing Summaries of passage,
Fundamentals of Report Writing: Characteristics of a Report, Categories of Reports, Structure
of Reports, Writing the Report, Characteristics and Components of a Research Paper,
Dissertation, Techniques of writing Technical Proposal, preparing software user manual,
preparing project Documentation.
BOOKS:
1. Gajendra S. Chauhan, Sangeeta Sharma, "Soft Skills: an Integrated Approach to
Maximise Personality", Wiley India.
2. Barun K. Mitra, "Personality Development and Soft Skills", Oxford Press
3. M. S. Rao, "Soft Skills - Enhancing Employability", I. K. International
4. Sherfield, "Cornerstone: Developing Soft Skills", Pearson India.
5. Daniel Coleman, “Emotional Intelligence”, Bantam Book, 2006.
6. Carnegie Dale, “How to win Friends and Influence People”, New York: Simon &
Schuster, 1998.
7. Sandy Blaine, "Yoga for Computer Users: Healthy Necks, Shoulders, Wrists, and Hands
in the Postmodern Age", Rodmell Press, 2008.
8. Meenakshi Raman & Sangeeta Sharma, “Technical Communication–Principles and
Practice”, 2nd Edition, Oxford University Press, 2011.
9. Hedwig Lewis, “Body Language”, Response Books
10. Ashraf Rizvi, “Effective Technical Communication”, TMGH Publication
11. Sharma, "Business Correspondence & Report Writing", TMH
12. Prasad, "Group Discussion & Interview (With Audio Cassette)",TMH
Page | 16
13. Sashi Kumar, "Spoken English (with Cassette)",TMH
14. Raymond Murphy, "English Grammar In Use", Cambridge University Press
15. Martin Hewings, "Advanced Grammar in Use", Cambridge University Press.

1 x x x
2 x x x x x
3 x x x x x x x
4 x x x x x
5 x x x x x x x
6 x x x x x
Page | 17
ALIGARH-202002

COURSE CAMS-1P01: Laboratory Course–I

• To acquire skills of using Operating Systems (like, Windows /Linux)
• To learn using PC-Packages
• To learn C programming language and DBMS.
• To learn implementation of various Data Structures
• To learn using various tools used for System Analysis and Design
COURSE OUTCOMES
After completing this course, the students would be able to:
CO1. Write, debug and run a sample program in C.
CO2. Create a simple real life applications based on the decision making statements.
CO3. Develop software applications using object oriented programming language in C.
CO4. Understand the concept of System Analysis and Design.
CO5. Create the E-R Diagrams of any real life problems.
Credit: 04
Sessional Marks: 40
Final Marks: 60
LAB:
Introduction to MS-DOS, UNIX/Linux and Windows Operating System Using MS-Office
(Word, Excel, Power Point & MS-Access).
Developing Web Applications using HTML/FrontPage/CSS or Similar Tools.
Developing simple Application Packages using MySQL and HTML.
Programming exercise in C (graded sheets of problems).
Applying data structures in solving real life problems.
NOTE:
For detail Problems/Assignments related to LAB, students are advised to consult the LAB
MANUAL for CAMS-1P01.

CO1 x x
CO2 x x
CO3 x x x
CO4 x
CO5 x x

Page | 18
ALIGARH-202002
SYLLABUS (2nd SEMESTER)

COURSE CAMS-2001: Object Oriented Programming using Java

• To understand Object Oriented Concepts using Java Language.
• To develop, debug and document programs in Java using OOP paradigms.
• To learn applications of Java
• To learn about various standard packages available in java and their uses.
• To learn GUI design using Java
COURSE OUTCOMES:
On completion of this course, the students would be able to:
CO1. Understand the basic concept of OO, benefits of object oriented programming and
applications of OOP.
CO2. Understand java programming
CO3. Implement the various object oriented programming features in real life applications
CO4. Create your own package and interface
CO5. Handle exceptions arising in programs
CO6. To gain practical experience on using File I/O
CO7. Use GUI components in your programs;
CO8. Design and Implement the real life complex applications.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction to java, comparison between C, C++ and Java, why java is so important, Compiling
and running java program. Basic structure of java program, Java programming: data types,
variable, constants, operators, control statements (if, switch, loops), break, continue statements,
ternary operator, bit wise operators, user defined data types in Java. Order of evaluation of
different operators in java. How to read input from keyboard?
UNIT-II
Objects, classes and methods, Constructing objects, Accessor and mutator methods, object
references, Java classes: Abstract classes, static classes, Inner classes, Wrapper classes;
Designing classes: Choosing classes, accessors, mutators and immutable classes, side effects,
static methods, static field, scope, introduction to strings, string tokenization, methods, method
overloading, constructor overloading, use of this keyword, use of to String ( ) method, arrays.
Arrays of objects, recursive method.
Page | 19
UNIT-III
Defining an interface, implementing interfaces, using interfaces for code reusing, converting
between class and interface types, using interfaces for callbacks; Polymorphism, Inheritance:
Inheritance hierarchies, Inheriting instance fields and methods, Sub class construction,
converting between sub class and super class types, cosmic super class, Access control: private
access, public access, protected access and package access.
UNIT-IV
Exception handling: Importance of exceptions, throwing exceptions, checked and unchecked
exceptions, catching exceptions, finally clause. Files and Streams: streams, readers, and writes,
reading and writing text files. GUI design through Java, AWT: introduction, labels, buttons,
check boxes, events etc; Layout manager: flow layout, border layout, grid layout, card layout;
Menus: Dialog boxes, File dialog, Introduction of JavaSwing, JavaFX, Collection in Java.
BOOKS:
1. Java Concepts,5th Edition (John Wiley & Sons, Inc.) by Cay Horstmann.
2. Big Java (John Wiley & Sons, Inc.) by Cay Horstmann.
3. Java, How to Program, 6th Edition (Prentice-Hall) by Deitel and Deitel.
4. Java in a Nutshell, 5th Edition (O'Reilly) by David Flanagan.

1 x
2 x x x
3 x x x x x x x x x
4 x x
5 x x x x x
6 x x x x x
7 x x x
8 x x x x x x x x
Page | 20
ALIGARH-202002
COURSE CAMS-2002: Data Communication & Computer Networks
• To introduce the concepts, terminologies and technologies used in data communication
and computer networking.
• To study and analyze the of OSI and TCP/IP Protocol Suites
• To be familiar with the data transmission processes, transmission media and tools
• To get familiarized with different routing protocols, congestion control protocol and
network performance issues
• To help students in understanding the concepts, establishment and administration of
LAN.
COURSE OUTCOMES:
After the course completion, students will be able to:
CO1. Understand the purpose of network, network communication using the layered
concept, and able to compare and contrast Open System Interconnect (OSI) and
TCP/IP Protocol Suites.
CO2. Recognize the technological components and trends of Computer Networking.
CO3. Demonstrate clear understanding of data communication system including digital
transmission of analog and digital data, encoding techniques, modulation and
multiplexing.
CO4. Show clear understanding of the concept, advantages, and analysis of various error
detection and correction techniques including parity check, hamming code, cyclic
redundancy check and checksum.
CO5. Distinguish between and compare the main categories of transmission media as well
as can compare and contrast their subcategories.
CO6. Compare and contrast the data transmission modes: serial and parallel as well as
synchronous and asynchronous with relevant examples.
CO7. Explain the working of various routing protocols and congestion control protocols.
CO8. Evaluate the challenges in building networks and solutions to those.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction to Computer Networks: Evolution of Computer Networks; Networks goals, uses
and applications; Network Hardware and Software; Protocol Hierarchies, Design issues for the
Layer; Reference Models: OSI and TCP/IP; Example Networks-Internet, ARPANET,
NSFNET; Connection Oriented Networks: X.25, Frame Relay, and ATM.
UNIT-II
Fundamentals of Data Transmission: Data Transmission systems and Operations; Encoding:
Standard Encoding Schemes; Line Coding Schemes-Unipolar, Polar and Bipolar; Encoding of
Digital Data into Analog Signal-ASK, FSK, PSK, QAM; Encoding of Analog Data into Digital
Page | 21
Signals-PCM, DPCM, DM; Encoding and Correction Techniques; Multiplexing-TDM, FDM,
STDM, WDM, DAM, CDMA; Techniques; Multiplexing-TDM, FDM, STDM, WDM, DAM,
CDMA; Transmission Media: Magnetic media, Twisted wire-pair, Co-axial Cabler Fibre
optics; Wireless media-Radio and Microwave Transmission; Satellite Communication;
Terminal Handling-Polling Techniques; Switching-Message, Circuit and Packet switching;
Serial and Parallel Transmission-Asynchronous and Synchronous Transmission;
UNIT-III
Routing Algorithms: Introduction and Classification of R.A.; Properties of R.A.; Optimality
Principle; Shortest Path Routing; Multipath (MPA); Centralized Routing; Hot Potato; Flooding;
Distributed-Distance Vector Routing; Link State Routing; Routing in Ad Hoc Networks, etc.
Congestion: Congestion Control Algorithms, General Principle of Congestion Control;
Congestion Prevention Policies; Congestion Control in Virtual Circuit Subnet. and Datagram
Subnet; Techniques for achieving good quality of service (QoS). Networks Performance Issues.
UNIT-IV
Local Area Networks: IEEE-802 Standards; Channel Allocation Schemes in LANs and
MANs -ALOHA, CSMA; Wireless LAN Protocols-MACA and MACAW; Popular LAN
Technologies- Ethernet, Token Ring, ARC Net, ATM LANs etc; Wireless LANs-802.11
Protocol Stack; Broadband Wireless -802.16; Bluetooth; Internetworking-Bridges, Switches,
Routers and Gateways; Virtual. LANs.
BOOKS:
1. Tanenbaum, A.S., Computer Networks,4thEdition PH

2. Stallings, W., Data and Computer Communication, 8th Edition, PHI
3. Kurose, J.F., Ross, K.W., Computer Networking, Pearson Education
4. Forouzan, B. Data Communications and Networks, TMH
5. Forouzan, B. Local Area Networks, TMH.
6. James Martin, Satellite Communication System.
7. W.Tomasi, Introduction to Data Communications and Networking, Pearson Education.

1 x
2 x
3 x
4 x
5 x
6 x
7 x x
8 x x
Page | 22
ALIGARH-202002

COURSE CAMS-2E01: Data Mining Techniques and Applications

• To understand basic concept and applications of data mining.
• To learn pattern recognition, classification and prediction.
COURSE OUTCOMES
The learning outcomes of this course are following:
CO1 To learn the concepts of database technology evolutionary path this has led to the need
for data mining and its applications.
CO2 To examine the types of the data to be mined and present a general classification of tasks
and primitives to integrate a data mining system.
CO3 To compare and evaluate different data mining techniques like classification, prediction,
clustering and association rule mining.
CO4 To identify appropriate data mining algorithms to solve real world problems.
CO5 To understand Data Mining and data warehouse Systems.
CO6 To describe complex data types with respect to spatial and web mining.
CO7 To enhance knowledge towards research and innovation.
CO8 To learn Social impacts of data mining and ethical responsibilities.
Credits: 04
Sessional Marks: 30
Exam Marks: 70
UNIT-I
Basics of data mining, Knowledge Discovery in databases, KDD process, data mining tasks
primitives, Integration of data mining systems with a database or data warehouse system, Major
issues in data mining, Data pre-processing: data cleaning, data integration and transformation,
data reduction etc.
UNIT-II
Architecture and Classification of Data Mining Systems, Data mining tasks: Based on
Predictive Method: Classification, Prediction and Time Series Analysis: Basic concepts,
application and issues, Based on Descriptive Method: Association, Clustering, Summarization:
Basic concepts, application and issues.
UNIT-III
Overview of Data warehouse and OLAP technology, Types of OLAP Servers, Multi-
dimensional data model, data warehouse architectures, Data Warehouse Implementation,
concept of data warehousing to data mining.
Page | 23
UNIT-IV
Graph Mining, Social Network analysis and multi-relational data mining, Spatial data mining,
Multimedia data mining, Text mining, Mining the world wide web (www), Data mining
applications, Social impacts of data mining, Trends in data Mining.
Text Book:
1. Jiawei Han and Micheline Kamber, Data Mining Concepts and Techniques, Morgan
Kaufman Publishers.
2. Elmsari and Navathe, "Fundamentals of Database Systems", 7th Edition, Pearson.
3. M.W. Berry, Survey of Text Mining: Clustering, Classification, and Retrieval Springer.

Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8
CO1 x x x
CO2 x x x
CO3 x x x x x
CO4 x x x x x
CO5 x x
CO6 x x
CO7 x x
CO8 x
Page | 24
ALIGARH-202002

COURSE CAMS-2E02: Microprocessor: Architecture and Applications

• To illustrate the architecture of 8085
• To Program the internal registers of 8085
• To Interface 8085 with support chips
• To write assembly level programs using assembly of 8085.
COURSE OUTCOMES:
On completion of this course the student will be able to:-
CO1. Describe the architecture of 8085.
CO2. Illustrate the organization of registers and memory in microprocessors.
CO3. Identify the addressing modes of an instruction.
CO4. Develop programming skills in assembly language.
CO5. Interface devices to 8085 and write interfacing programs.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction of Microcomputer System: CPU, I/O devices, clock, memory, bussed
architecture, tristate logic, address bus, data bus and control bus.
Architecture of 8-bit Microprocessor: Intel 8085A microprocessor, programmer’s model, pin
description and internal architecture. 8085 Machine Cycles, state transition diagram.
UNIT-II
Instruction Set: Addressing modes, Instruction formats of 8085, Data transfer arithmetic,
logical, branch, stack and machine control groups of instruction set, 8085 based assembly level
programs.
UNIT-III
Interrupts: Interrupts structure of 8085A microprocessor, processing of vectored and non-
vectored interrupts, restart instructions. Data transfer schemes:- DMA mode of Data transfer,
Programmed Data transfer. Interrupt Driven Data transfer schemes,
UNIT-IV
Support Chips: 8155, 8355, 8253, pin configuration and programming.
Page | 25
References:
1. Gaonkar R. S., "Microprocessor Architecture Programming and Applications”, 5th Ed.,
Penram International, 2007.
2. Short k. l., “Microprocessors and Programmed Logic”, 2nd Ed., Pearson Education,
2008.
3. Hall D.V., “Microprocessor and Interfacing-Programming and Hardware”, 2nd Ed.,
Tata McGraw-Hill Publishing Company Limited, 2008.
Course
Outcomes
CO1 x x x x
CO2 x x x
CO3 x x x
CO4 x x x x
CO5 x x x x
Page | 26
ALIGARH-202002

COURSE CAMS-2E03: Computer Graphics

• To introduce the concepts of Computer Graphics
• To develop an understanding of transformation, rotation and scaling of images
• To have a basic understanding of OpenGL.
COURSE OUTCOMES:
CO1. To understand the working of various Computer Graphics Systems.

CO2. To become familiar with algorithms used for curve generation in Computer displays.
CO3. To perform the transformations of graphical objects.
CO4. To use Computer Graphics Tools.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction, fundamentals, Classification of Computer Graphics, Advantages of Computer
Graphics; Raster Scan and Random Scan, graphics storages, displays processors and character
generators, colour display techniques. Beam penetration and shadow-mask color displays.
UNIT-II
Graphics primitives, points and lines, Line drawing algorithms, Criteria for good Computer
generated lines; Simple DDA and Symmetric DDA; Bresenham algorithm; Curve, Circle
generation. 2D viewing and clipping, point clipping, line clipping, Cohen Sutherland line
clipping algorithm, polygon clipping algorithm of Sutherland and Hodgman, viewing
transformations.
UNIT-III
Dimensional transformations: Translation, Rotation and Scaling. Matrix Formulation of
transformations and concatenation. 3D representation, transformations, perspective and parallel
projections. Fractals: Generation, Classification and Dimension. Some basic fractal images-
Koch curve, Spearpinski triangle, Mandelbort and Juliasets.
Page | 27
UNIT-IV
Computer Graphics Tool- OpenGL: Introduction, Objectives of OpenGL, Installing OpenGL,
Running an OpenGL Application, Basics of OpenGL, OpenGL Primitives, Line, Curve, circle,
Implementation of clipping algorithm, Implementation of transformations and viewing.
TEXT BOOKS:
1. Newman W.M. & Sproull R.F. – “Principles of Interactive Computer Graphics”

McGraw Hill Ed. II (1979).
2. Foley J.D. & Van Dam- “Fundamentals of Interactive Computer Graphics”. Addison
Wesley (1982).
Reference Books:
1. Harrington – Computer Graphics-McGraw Hill (1987)

2. Giloi, W. – Interactive Computer Graphics-Data structure and Algorithms Prentice-
Hall1978.
3. Hearn D. & Baker-Computer Graphics-Prentice Hall of India, New Delhi (1990)

1 x x
2 x x x x
3 x x x
4 x x x
Page | 28
ALIGARH-202002

COURSE CAMS-2E04: Web based Programming

• To understand the concept of Web Application Development and its Architecture.
• To understand the Essentials of Web Application Development.
• To understand and practice web page designing techniques.
• To understand the differences between client side & server side technologies to develop
Web Application.
LEARNING OUTCOMES
CO1 Enables the students to learn the basic concepts of Web Application Development and
its Architecture.
CO2 Enables the students to learn the applications of Web Application Development and its
Architecture.
CO3 Enables the students to gain knowledge about emerging Web Application
Development techniques, ideas and best practices.
CO4 Enables the students to examine the important aspects of Web Application
Development and its Architecture.
CO5 Enables the students to have hands-on practice on Web Application Development
Applications.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction: Internet Standards, Introduction to WWW, WWW Architecture, client and
server, web server, web application basic pieces, working of a website, Internet Protocols,
Overview of HTTP, HTTP request – response, Generations of dynamic web pages, Front end
and backend web development, web content management systems: Wordpress, Joomla, web
development life cycle, Guidelines for Indian Government websites.
UNIT-II
Basics of HTML,CSS, JavaScript: HTML and HTML5: Introduction, TML Tags, Formatting
and Fonts, Commenting Code, Anchors, Backgrounds, Images, Hyperlinks, Lists, Tables,
Frames, HTML Forms. Cascading Style Sheet (CSS): Introduction, Basics of CSS, style types.
JavaScript: Introduction, variables, operators, conditionals, looping and validation. Introduction
to Jquery, Ajax and XML.
UNIT-III
Page | 29
Introduction to PHP: PHP structure: basic syntax, variables, operators, multiline commands.
Expression and control flow in PHP, PHP dynamic linking. PHP functions and Objects, PHP
arrays, Practical PHP: Date and time functions, file handling, system calls. Accessing and
manipulating database using PHP, Error handling in PHP, generating images with PHP.
Cookies, sessions and authentication.
UNIT-IV
Introduction to ASP.NET: Getting started with ASP.NET, Building an ASP.NET web site,
designing web pages, working with ASP.NET server controls, programming ASP.NET web
pages, creating consistent looking web sites, navigation: move around web site, navigation
controls. User controls, validating user inputs. Security pitfalls and basic solutions (SQL
injections, cross site scripting (XSS), cross site request forgery, DoS, DDoS).
TEXT BOOKS:
1. Learning PHP, MySQL & JavaScript with JQUERY, CSS & HTML5: Robin Nixon
(O’Reilly).
2. Beginning ASP.NET 4 in C# and VB: Imar Spaanjaars (Wiley-India Edition).
3. Learning Web Design: A Beginner’s Guide to (X) HTML, Style Sheets and Web
Graphics: Jennifer Niederst Robbins (O’Reilly).
Program Outcomes
Course Outcomes
CO1 x x x x
CO2 x x x x x x x x
CO3 x x x x x x x x
CO4 x x x x x x x x x
Page | 30
ALIGARH-202002

COURSE CAMS-2E05: Parallel Computing

• Obtain understanding of the fundamental concepts of parallel computing.
• Obtain understanding of what parallel computers can do.

The students will be able to-
CO1. Explain parallel computers and different classifications of computers.
CO2. Explain limits, costs and performance of parallelism
CO3. Explain interconnections networks
CO4. Explain different Parallel Algorithms.
CO5. Demonstrate and write simple programs using OpenMP compiler directives
NOTE: Laboratory should be an integral part of the course.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT: I
Introduction to Parallel Computing, The Need of Parallel Computing, Von-Neumann
Architecture, Parallelism in conventional machine, Pipelining, Limitations of Von Neumann
Architecture, Flynn's Classification, Parallel computer Memory Architecture-Shared memory,
Distributed memory and Hybrid memory, Structural Classification, Classes of Parallel
Computers, Limits and costs of parallelism, Amdahl’s Law; Gustafson’s Law; Comparison of
two laws, efficiency and speed up Curves, performance measures & metrices.
UNIT: II
Architecture of an Ideal parallel computer, Parallel Random-Access Machines (PRAM) and its
variants; Simple problem-solving using PRAM; An overview of Interconnection networks for
parallel computer, Star, Ring, Mesh, Torus, Crossbar, Clos, Benes network, Shuffle exchange,
Hypercube interconnection networks and information routings.
Principles of parallel algorithm design, Decomposition Techniques-Recursive-, Data-,
Exploratory- and Speculative Decompositions, Mapping Techniques-Static and Dynamic
mappings.
UNIT: III
Programming Shared Address Space Platforms, OpenMP: A Standard for Directive Based
Parallel Programming, Threads Basics: Creation and Termination, Parallel loops, Handling
synchronization and critical sections etc.
Page | 31
Principles of Message-Passing Programming-Send and Receive Operations, MPI: The Message
Passing Interface, Point-to-point Communication, Collective Communication and Computation
Operations.
UNIT: IV
Matrix-Vector multiplication, Row-wise 1-D Partitioning, 2-D Partitioning, Matrix-Matrix
Multiplication-A simple parallel algorithm, Cannon’s Algorithm, The DNS algorithm, Solving
a system of linear equations; Sorting- Issues in Sorting on Parallel Computers, Bitonic Sort,
Quick Sort and its Variants, Graph Algorithms- Prim's Algorithm and others.
TEXT BOOKS:
1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar; Introduction to Parallel
Computing, 2nd Edition, Addison Wesley.
2. Quinn M. J., "Parallel Computing, Theory and practice ", Tata McGraw-Hill, New Delhi
3. Saing Soo, YL. Ching, “Parallel processing and parallel Algorithms, springs
Publications.
4. M.R. Bhujade, Parallel Computing, New Age International Publications, 2011
5. Hwang and Briggs, "Computer Architecture and Parallel Processing", McGraw Hill
International.
6. Kai Hwang, "Advanced Computer Architecture", McGraw Hill International, 2011.

1 x x x x x x x
2 x x x x x x
3 x x x x
4 x x x x x x x x
5 x x x x x x x x x
Page | 32
ALIGARH-202002

COURSE CAMS-2E06: E-Commerce

• To introduce the concepts of E-Commerce infrastructure
• To understand security concerns in E-Commerce
• To gain technical understanding of Electronic Payment Systems
LEARNING OUTCOMES:
On the successful completion of this course, Students will be able to:
CO1. Demonstrate good knowledge of e-commerce, both the business and technical aspects.
CO2. Understand the principles and practices of e-commerce and its related technologies.
CO3. Identify the major electronic payment issues and assess electronic payment systems for
e-commerce.
CO4. Understand security issues and explain procedures used to protect against security
threats.
CO5. Understand the ethical, social, and legal issues etc. underlying e-commerce.
CO6. Design and implement a basic e-commerce application.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction to E-Commerce: Fundamental of e-commerce, Brief history of e-commerce,
Impact of e-commerce, Benefits and limitations of e-commerce, Classification of e-commerce:
Inter organizational e-commerce, Intra organizational e-commerce, Business to Business
electronic commerce, Business to Customer electronic commerce and Collaborative commerce,
Mobile Commerce etc., Applications of e-commerce technologies, E-Commerce Business
models.
UNIT-II
E-Commerce Infrastructure: Framework of e-commerce, I-Way Concept, EC Enablers,
Review of the Internet structure, the TCP/IP Protocol Suite, The client/server model, Review
of the architectural components of World-Wide Web, Proxy servers, Internet call centers,
cookies, Agents in e-commerce and their role, Network infrastructure for e- commerce:
Intranets and their applications, Extranets and their applications, Virtual Private Networks
(VPNs), Internet-based VPNs, Firewalls and their types
UNIT-III
Security in E-Commerce: Issues in Network and Transaction Security, Cryptography and
Cryptanalysis, Symmetric and Public Key Cryptographic systems, Authentication protocols,
Public Key Infrastructure (PKI), Integrity and Non-repudiation, Digital Certificates, Digital
Signatures, Electronic mail security, Security protocols for web commerce: SSL, SET etc.
Page | 33
UNIT-IV
Electronic Payments: Introduction to Money, The nature of money, Overview of electronic
payment systems, Limitations of traditional payment instruments, Electronic payment
requirements, Micro payments, Online payment systems, Card-based paymentsystems.
BOOKS:
1. Ravi KalaKota, Andrew Whinston, "Frontiers of Electronic Commerce", Addition
Wesley
2. Diwan, Sharma, "E-Commerce", Excel Asset International
3. Bajaj and Nag, "E-Commerce: The Cutting Edge of Business", TMH
4. Denlal Amor, "The E Business Revolution", Addition Wesley
5. Sokal, "From EDI to E-Commerce: A Business Initiative", TMH
6. Greeanstein and Feinman, "E-Commerce", TMH
7. Bharat Bhasker, "Electronic Commerce-Framework, Technologies & Applications",
TMH
8. K. C. Laudon and C. G. Traver, "E-commerce: business, technology, society",
Addisonesley
9. David Whiteley, "E-commerce: Strategies Technologies and Applications", TMH
10. P.T. Joseph, "E-Commerce An Indian Perspective", Prentice-Hall of India,2007
11. Norman Sadeh, "M-Commerce : Technologies, Services & Business Module", Wiley
12. O’ Malinoy Donalad, M.A. Peirce, Hitesh Tiwari, "Electronic Payment Systems for E-
Commerce"
COURSE PROGRAME OUTCOME

OUTCOME PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
CO1 x
CO2 x
CO3 x
CO4 x
CO5 x
CO6 x
Page | 34
ALIGARH-202002

COURSE CAMS-2E07: Advanced DBMS and Data Warehouse Design

• To introduce the concept of ADBMS and providing a general introduction to ADBMS
and DBA Concepts,
• Develop the concept of distributed databases and object-relational model.
• To help students learn the idea of Data Structures that are used to Implement the
concepts of ADBMS, Mobile Databases, Biological Databases and WWW Databases.
COURSE OUTCOMES:
The student will be able to demonstrate:
CO1. The ability of Implementing the Idea of Object Oriented Database, Distributed Database
and Temporal Databases.
CO2. The capability for the execution of Phase locking in Distributed Transactions, Decision
support System, Deductive Databases and Parallel Databases.
CO3. The understanding of Database on WWW, Mobile Databases, Expert Databases,
Knowledge Based Systems and Expert Systems.
CO4. The concept of Image and Multimedia Databases, Data Structure for DBMS
Implementation, GIS, Web Databases and XML Databases.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Relational database, Limitations of relational database, need of advanced DBMS, Object
Oriented Database, Object Relational Databases, Temporal Database concept, Distributed
Database Management: Reference Architecture, levels of distribution transparency, Distributed
database design, Distributed Query Processing and Optimization, Distributed Transaction
Modeling.
UNIT-II
Concurrency control2 phase locks, Management of Distributed transactions-2 phase unit
protocols, open database connectivity, Decision Support System: Online analytical processing;
Online transaction processing, Deductive Databases: Introduction and deductive database
system, Data log and Recursion, Deductive object oriented database, Parallel Databases:
Parallel architectures, shared nothing/shared disk/shared memory based architectures, Data
partitioning, pipelining.
Page | 35
UNIT-III
Database on the World Wide Web, Mobile databases: Mobile Computing architecture,
Characteristics of mobile, environments, Data management issues, Genome databases
Management: Biological Sciences & Genetics, Characteristic of Biological data, Existing
Biological databases, Knowledge base system, Expert database system
UNIT-IV
Image and Multimedia Databases: Modeling and Storage of Image and Multimedia Data, Data
Structures – R-tree, k-d tree, Quad trees, Content Based Retrieval: Color Histograms, Textures,
etc., Image Features, Spatial and Topological Relationships, Multimedia Data Formats, Video
Data Model, Audio & Handwritten Data, Geographic Information Systems (GIS). WEB
Database: Accessing Databases through WEB, WEB Servers, XML Databases.
References:
1. Date, C.J., "An Introduction to Database Systems", Narosa Publishing House, New
Delhi.
2. Desai, B., "An Introduction to Database Concepts", Galgotia Publications, New Delhi.
3. Elmsari and Navathe, "Fundamentals of Database Systems", Addison Wesley,
NewDelhi
4. Ullman, J.D., "Principles of Database Systems", Galgotia Publications, New Delhi
5. Hansen & Hansen “Database Management & Design” (PHI)
6. James Mortin- Principles of Database Management Object Oriented Modeling & Design

1 x x x x x x
2 x x x x x
3 x x x x x
4 x x x x x x x
Page | 36
ALIGARH-202002

COURSE CAMS-2E08: Simulation and Modeling

• To understand the need and significance of Simulation and Modeling.
• To develop, debug and document programs using MATLAB.
• To apply concepts of modeling and simulation in real-life problems.
COURSE OUTCOMES:
CO1. Understand the basic concepts of systems, models and simulation using appropriate
statistical methods.
CO2. Implement input and output modeling in simulation.
CO3. Perform parameter estimation and goodness of fit tests in a model.
CO4. Check system’s stability, observability and controllability.
CO5. Apply modeling and simulation in real world using appropriate tools.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Systems, Models and Simulation study: Natural and Artificial Systems, Complex Systems,
Definition and types of model, Mathematical models, Cyber-physical systems and its modeling,
Network models, Steps in simulation study, Advantage and disadvantage of simulation.
Random Numbers: True and pseudo random numbers, Properties of random numbers,
Generation of pseudo random numbers, Tests for randomness, Random variate generation using
inverse transformation, Direct transformation, Convolution method and Acceptance-rejection
method.
UNIT-II
Design and Analysis of simulation experiments: Data collection, Identifying distributions with
data, Parameter estimation, Goodness of fit tests, Selecting input models without data,
Multivariate and time series input models, Verification and validation of models, Steady-state
simulation, Terminating simulation, Confidence interval estimation, Output analysis for steady
state simulation, Stochastic simulation.
UNIT-III
Control Systems: Laplace transform, Transfer functions, State- space models, Order of systems,
z-transform, Feedback systems, Stability, Observability, Controllability.
Page | 37
UNIT-IV
Statistical Models in Simulation: Common discrete and continuous distributions, Poisson
process, Markov chain, Empirical distributions, Queuing systems, Transient and steady-state
behavior, performance, Network of queues. Modeling and Simulation tools: Open Modelica,
Netlogo, Python modules for modeling and simulation, GPSS.
LABORATORY:
PROGRAMMING EXERCISES: A graded Sheet of assignments/problems will be given to
the students to develop Algorithms/Flowcharts & Programs in Matlab.
BOOKS:
1. A.M. Law and W.D. Kelton: Simulation and Modeling and analysis.
2. Frank L. Severance, System Modeling And Simulation: An Introduction, Wiley.
3. Ross, S., Simulation, 5th Edition. Academic Press.
4. Jerry Banks, John S. Carson II, Barry L. Nelson, Devid M. Nicol, P. Shahabudeen:
Discrete Event system simulation.
5. Geoffrey Gordon. System Simulation. Prentice Hall of India, second edition, 1996.
6. Francois E. Cellier. Continuous System Modeling. Springer-Verlag, New York, 1991.
7. Hartmut Bossel. Modeling and Simulation. A.K. Peters, Ltd., 289 Linden Street,
Wellesley, MA 02181, 1994.

1 x x x x
2 x x x
3 x x x x x x
4 x x x x x
5 x x x x x x x x x
Page | 38
ALIGARH-202002
SYLLABUS (2ndSEMESTER)
COURSE CAMS-2P01: Laboratory Course-II

• To learn and implement OOP concepts using Java programming language
• To help students learn programming in SQL and PL/SQL using ORACLE
• To learn using various tools for OOAD
• To help students learn solving numerical and statistical problems using MATLAB
• To learn implementation of various types of algorithms
COURSE OUTCOMES:
After completing this course, the students would be able to:
CO1. Understand how to implement, compile, test and run JAVA programs, comprising more
than one class, to address a particular software problem.
CO2. How to take the statement of a business problem and from this determine suitable logic
for solving the problem; then be able to proceed to code that logic as a program written
in JAVA.
CO3. Use MATLAB for interactive computations.
CO4. Enhance the knowledge and understanding of Database analysis and design.
CO5. Enhance the knowledge of the processes of Database Development and Administration
using SQL and PL/SQL.
CO6. Identify the methodology of conceptual modeling through Entity Relationship model.
CO7. Analyze and design a real database application using Oracle, SQL and PL/SQL.
Credit: 04
Sessional Marks: 40
Final Marks: 60
LAB:
Programming exercise in Java (graded sheets of problems as specified in Lab Manual)
Developing database and writing queries using Oracle
To write, debug and implement programs in PL/SQL using Oracle

Designing complete Information System Using OOAD Techniques- Case Studies of I.S.
Using CASE Tools for Analysis, Design & Implementation of Information Systems (e.g.,
BOUML/Rational Rose/Visual Case Tools).
Using MATLAB for solving Numerical and Statistical Problems
Page | 39
Implementing various algorithms like Travelling Salesman Problem, Knapsack Problem,
Sorting, Kruskals Algorithms, Dijkstra's Algorithms, etc using C/C++
NOTE:
For detail Problems/Assignments related to LAB, students are advised to consult the LAB
MANUAL for CAMS-2P01.

CO1 x
CO2 x x
CO3 x x
CO4 x x
CO5 x x x
CO6 x x
CO7 x x x
Page | 40
ALIGARH-202002
SYLLABUS (3rd SEMESTER)

COURSE CAMS-3001: Operating System and Shell Programming

• To develop the understanding of the structure and functioning of Operating System.
• To learn about Processes, Threads and Scheduling algorithms
• To understand the principles of concurrency and Deadlock
• To learn various memory management schemes
• To study I/O management and File systems
COURSE OUTCOMES
CO1. Grasp fundamental understanding of structure, functions and evolution of operating
systems
CO2. Differentiate between various types of Operating Systems so as to use each of them most
efficiently in the respective application areas.
CO3. Understand the concepts of processes, critical section problem and synchronization
CO4. Describe different techniques for managing computer resources like CPU, main
memory, file and storage devices.
CO5. Learn the main design concepts of UNIX/LINUX OS.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Concept of Operating System (OS); Operating System Structure; Operating System
Architecture; Types of Operating System: Batch Processing, Multiprogramming, Timesharing,
Distributed System, Real Time System, Multitasking System; Functions of OS; System Calls;
Types of System Calls; Virtual Machines; System Boot.
Process Scheduling: Definition, Scheduling Objectives, Scheduling Criteria; Scheduling
Algorithms: Preemptive and Non-preemptive, FCFS- SJF-RR.
UNIT-II
Process: Definition, Concurrent Process, Mutual Exclusion, Race Condition, Critical
Section Problem; Semaphores and Classical Problems of Synchronization (IPC Problems);
Deadlocks:Systemmodel,DeadlockCharacterization;Methodsforhandlingdeadlocks;Deadl
ock Prevention; Deadlock Avoidance with Banker’s Algorithm; Deadlock Detection and
Recovery from deadlock.
Page | 41
UNIT-III
Memory Management: Memory Management Strategies: Background, Swapping;
Contiguous and Non-Contiguous Memory Allocation; Virtual Memory; Static and Dynamic
Memory Allocations; Paging; Segmentation; Memory Fragmentation; Demand Paging; Page
Fault; Page Replacement Policies; Thrashing; Cache Memory Organization; Concept of
Disk Scheduling.
UNIT-IV
Linux: Architecture of Linux, Features of Linux; Introduction to vi editor; Linux
commands. Linux Shells and its Types- Bourne Shell (sh), C Shell (csh), Korn Shell (ksh),
Bourne Again Shell (bash); Linux File System; File handling utilities; Security by file
permissions; Home Directory, pwd, cd, mkdir, rmdir; File handling utilities; Basic File
Attributes: ls options, File Ownership, File Permissions, chmod, Directory Permissions,
File Systems and Inodes; Introduction to Shell programming (With bash), Shell Scripts
examples.
BOOKS:
1. Harvery M. Deitel, "An Introduction to Operating System"
2. P. C. P. Bhatt, "An Introduction to Operating System Concepts and Practice"
3. D. M. Dhamdhere, "Operating System"
4. J. Archer Harris, "Operating System"
5. SumitabhaDas, “UNIX Concepts and Applications”, Tata McGraw Hill
6. A. S. Tanenbaum, "Modern Operating Systems", PHI
7. William Stallings, "Operating Systems – internals and design principles", PHI
8. Silberschatz, Galvin, Gagne, "Operating System Concepts", John Wiley & Sons
9. Harry Harvey, “Shell Scripting, Step-by-Step Guide to Linux Shell Programming”.

1 x x
2 x x x x x
3 x x x
4 x x x x x
5 x x x x
Page | 42
ALIGARH, U.P. - 202002
SYLLABUS (3rd SEMESTER )
COURSE CAMS-3002: Software Engineering

• To introduce the methodologies involved in the development and maintenance of
software (i.e.) over the entire life cycle.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I Introduction to Software Engineering : The Evolving role of Software.

Software characteristics and applications, Evolution of Software Engineering,
Software crisis. The Software Engineering challenges, The Software
Engineering approach.
Software development life cycle. Software Development Process Models
(Paradigms): Waterfall Model. Prototyping, Iterative Development, Spiral
Model. Software Project: Planning a Software Project. Effort Estimation:
(COCOMO and Function Points Model), Project Scheduling, Staffing and
Personnel Planning, Software Configuration Management Plan, Quality
Assurance Plans, Project Monitoring Plans, Risk Management.
UNIT II Software Requirement Analysis And Specification: Need for SRS, Problem
Analysis, Requirements Specification.
Software Design: Design objectives and principles. Module level concepts,
Coupling and Cohesion. Design Notations and specifications. Structured Design
Methodology, Object Oriented Design.
Detailed Design: Detailed Design, Verification (Design Walkthroughs, Critical
Design Review, Consistency Checkers), Metrics.
UNIT-III Software Coding: Programming Principles and Guidelines, Common coding

errors, Some Programming Practices, Coding Standards.
Coding Process: Refactoring, Basic Concepts, Modern programming language
features. Verification and Validation techniques (Code reading, Static Analysis,
Code Inspections or Reviews). Combining different techniques.
Metrics: Size Measures, Complexity Metrics, Style Metrics.
Documentation: Internal and External Documentation.
Page | 43
UNIT-IV Software Testing and Maintenance: Testing Fundamentals: Error, Fault
and Failure, Test Oracles, Test Cases and Test Criteria, Psychology of Testing.
Testing Objectives and Principles.
Approaches to Software Testing: Black Box and White Box testing.
Black Box Testing: Equivalence Class Partitioning, Boundary Value Analysis,
Cause Effect Graphing, Special Cases.
White Box Testing: Mutation Testing, Test Case Generation and Tool Support.
Testing Process: Comparison of Different Techniques, Levels of Testing, Test
Plan, Test Case Specifications, Test Case Execution and Analysis. Software
Maintenance, The Road Ahead.
TEXT BOOKS:
1. Pankaj Jalote, An Integrated Approach to Software Engineering (3rd ed.), Narosa

Publishing House, 2005.
2. R.S. Pressman, Software Engineering: A Practitioner’s Approach (6th ed.), McGraw-
Hill, 2006.
REFERENCE BOOKS:
1. Somerville, Software Engineering (6th ed.), Pearson Education, 2004.

2. Fairley, R.E., Software Engineering Concepts, McGraw Hill.
3. K.K. Agarwal and Y. Singh, Software Engineering (revised 2nd ed.), New Age
International Publishers, 2006.
4. Douglas Bell, Software Engineering for Students (4th ed.), Addison-Wesley, 2005.
5. Rajib Mall, Fundamentals of Software Engineering (2nd ed.), Prentice-Hall of India,
2006.
Page | 44
COURSE CAMS-3003: Theory of Computation

• To introduce the concepts of the Theory of Computation.
• To learn what can and can't be computed.
• To strengthen students' ability to carry out formal and rigorous mathematical arguments
• To introduce the concepts of undecidability.
COURSE OUTCOMES:
The students will be able to
CO1. Identify, analyze, and design various types of automata.
CO2. Identify, analyze, and design different types of grammar and regular expressions.
CO3. Convert grammar/regular expression into respective automata and vice-versa.
CO4. Develop finite state and Turing machines for real-life software applications.
CO5. To identify what can and can't be solved using computers
CO6. Interpret and explain the limits of computing.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Mathematical Preliminaries and Finite Automat: Sets, Functions and Relations, Graphs and
Trees, Proof Techniques; Languages, Grammars, Finite Automata: Deterministic Finite
Automata and Non-deterministic Finite Automata, Equivalence of Deterministic Finite
Automata and Non-Deterministic Finite Automata; Minimization of Finite Automata.
UNIT-II
Regular Languages and Regular Grammars: Regular expressions; Formal Definition of a
Regular Expression, Languages associated with regular expressions, Connection between
Regular Expression and Regular Languages; Finite Automata and Regular Expression; Regular
Grammar; Properties of Regular Languages: Closure properties of Regular languages,
Identifying Non-regular languages.
Page | 45
UNIT-III
Context-Free Languages and Pushdown Automata: Context-Free Grammars, Left most and
right most Derivations, Derivation Trees, Relation between sentential forms and Derivation
Trees; Methods for transforming Grammars; Substitution Rule, Removing useless productions,
Removing λ-productions, Removing unit productions; Two important Normal Forms: Chomsky
Normal Forms-Greibach Normal Form; Non-deterministic Pushdown Automat, Pushdown
Automata and Context-Free Languages; Deterministic Pushdown Automata and Deterministic
Context-Free Languages; Pumping Lemma for Context-Free Languages; Closure of Context-
Free Languages.
UNIT-IV
Turing Machine and their Languages: The Standard Turing Machine: Definition of a Turing
Machine, Turing Machine as Language Accepters; Other Models of the Turing Machine: Multi-
tape Turing Machines, Multidimensional Turing Machines, Non-deterministic Turing
Machines, The Universal Turing Machine, Hierarchy of Formal Languages, Limits of
Algorithmic Computation-Computability and Decidability.
BOOKS:
1. P. Linz, "An introduction to formal languages and automata", 5th Edition, 2011,
Jones & Bartlett Publishers.
2. J. C.Martin "Introduction to Languages and the Theory of Computation", 4th
Edition, 2010, McGraw-Hill.
3. M. Sipser, "Introduction to the Theory of Computation", 3rd Edition, 2012 Cengage
Learning.
4. H.R. Lewis, &C.H. Papadimitriou, "Elements of the Theory of Computation", 2nd
Edition, 1998, Prentice Hall.
5. K.L.P.Mishra "Theory of Computer Science", 3rd Edition, 2008, Prentice Hall.

1 x x x x x
2 x x x x x
3 x x x x x
4 x x x x x x x x x
5 x x x x x x x
6 x x x x x x
Page | 46
COURSE CAMS-3004: Data Science using Python

• To introduce concepts of Python programming language
• To train students in problem solving approach in Python Language
• To introduce machine learning models.
• To make familiar different Python based packages useful for Data Science.
COURSE OUTCOMES:
The students would be able to:
CO1. To develop, debug, and document programs in Python.
CO2. To solve common problems using Python language
CO3. Manipulate and analyze datasets using Python
CO4. Apply basic statistical analysis and machine learning methods.
CO5. Apply different Python based packages for Data Science problems
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction to Python interpreter and interactive mode; values and types: int, float, Boolean,
strings, variables, expressions, statements, tuple assignment, precedence of operators,
comments; Functions- and Recursion. Control Flow- if, if-else, if-elif-else, Loops: while, for,
break, continue, pass; return values, parameters, local and global scope.
UNIT-II
Mutability and immutability. Strings: string slices, immutability, string functions and methods,
string methods; Lists: list operations, list slices, list methods, list loop, mutability, aliasing,
cloning lists, list parameters; Tuples: tuple assignment, tuple as return value; Dictionaries:
operations and methods;
UNIT-III
Machine Learning: Introduction, Machine Learning Techniques, Regression Algorithm:1)
Simple Linear, 2) Multiple Linear; Classification Algorithm:1) Logistic Regression,2) SVM
Algo, 3) KNN Algo, 4) Random Forest Algo; Unsupervised Algorithm: Clustering Algorithm,
Ensemble strategies: AdaBoost, Gradient tree boosting (GTB), Stochastic Gradient Descent
(SGD), Performing Predictions, Training and testing a model.
Page | 47
UNIT-IV
Python Libraries-Pandas: Pandas Series, Pandas DataFrames, Analyzing Data, Cleaning Data,
etc.; Numpy: Numpy Arrays, Random Numbers in NumPy, etc.; SCiPy: SciPy Optimizers,
SciPy Graphs, etc.; Matplotlib: Plotting, Grid, Bars, Histogram, etc; Scikit Learn: Introduction,
Modelling Process, Data Representation, etc.
BOOKS:
1. Bill Lubanovic, Introducing “Python Modern Computing in Simple Packages”, Second
Edition, O’Reilly.
2. Peters Morgan, “DATA ANALYSIS FROM SCRATCH WITH PYTHON Step By Step
Guide”, First Printing, AI Sciences.
3. Alberto Boschetti, Luca Massaron, "Python Data Science Essentials", 2015, PACKT
Publishing.
4. Joel Grus, “Data Science from Scratch”, First Edition, O’Reilly.

CO1 x x x
CO2 x x x x
CO3 x x
CO4 x x
CO5 x x
Page | 48
ALIGARH-202002

COURSE CAMS-3E01: Mobile based Programming

• To make the student understand the concept of mobile computing paradigm, its novel
applications and limitations.
• To understand the typical mobile networking infrastructure through a popular GSM
protocol
• To understand the adhoc networks and related concepts.
LEARNING OUTCOMES
CO1 Enables the students to learn the basic concepts of Mobile Computing.
CO2 Enables the students to gain knowledge about emerging mobile computing ideas and
best practices.
CO3 Enables the students to visualize the various important steps in GSM communications.
CO4 Enables the students to examine the important aspects of Mobile Adhoc Networks.
CO5 Enables the students to understand networking concepts relevant to modern wireless
systems.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction: Mobile computing, Applications, History, Reference model for Mobile
Computing, Wireless transmission, Signal propagation, Multiplexing, Modulation, Spread
spectrum, Cellular systems: 2G, 3G,4G,5G, Medium access control: Hidden and exposed
terminals, Near and far terminals, Satellite systems, Routing, Localization
UNIT-II
Telecommunications systems, GSM: Mobile services, System architecture, Radio interface,
Protocols, Localization and calling, Handover, Security, New data services, DECT: System
architecture, Protocol architecture, TETRA, UMTS and IMT-2000: standardization, System
architecture, Radio interface
UNIT-III
Broadcast systems, Digital audio broadcasting, Digital video broadcasting, Infrastructure and
ad-hoc network, IEEE 802.11: System architecture, Protocol architecture, 802.11a, 802.11b,
HYPERLAN, Bluetooth network, Mobile network layer: Mobile IP, Dynamic host
configuration protocol, Mobile ad-hoc networks.
Page | 49
UNIT-IV
Mobile transport layer, Traditional TCP, improvements: Indirect TCP, Snooping TCP, Mobile
TCP, Transaction-oriented TCP, TCP over 2.5/3G wireless networks, Performance enhancing
proxies, Wireless application protocol (WAP): Architecture, protocol stack, application
environment, Applications., WAP 2.0, Mobile Security: general issues, hardware and software
vulnerabilities and solutions, WEP
References:
1. Jochen H. Schller, “Mobile Communications”, Second Edition, Pearson Education, New

Delhi, 2007.
2. Dharma Prakash Agarval, Qing and AnZeng, “Introduction to Wireless and Mobile
systems”, Thomson Asia Pvt. Ltd, 2005.
3. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of
Mobile Computing”, Springer, 2003.
4. William. C.Y. Lee, “Mobile Cellular Telecommunications-Analog and Digital Systems”,
Second Edition, Tata McGraw Hill Edition, 2006.
5. C.K. Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education, 2002.

CO1 x x x x
CO2 x x x x x
CO3 x x x
CO4 x x x x
Page | 50
ALIGARH-202002

COURSE CAMS-3E02: Network Programming

• To learn and understand the various protocols of TCP/IP protocol stack
• To understand the basics associated with IP addressing, device interface, association
between physical and logical addressing, subnetting and supernetting.
• To understand the basic working of various routing protocols used on the Internet such
as RIP, OSPF, and BGP.
• To understand the connection establishment, reliable data transfer and sliding window
protocols, and congestion control techniques used in Internet
• To learn the techniques of internet socket programming.
• To understand the basics of network security techniques.
COURSE OUTCOMES:
After the course completion, students will be able to:
CO1. Understand the basics of the TCP/IP protocol and how some of its widely used
protocols operate.
CO2. Explain and demonstrate the basics associated with various addressing schemes used
in Internet communication along with device interface, association between physical
and logical addressing, subnetting and supernetting.
CO3. Understand the basic working of various routing protocols used on the Internet such
as RIP, OSPF, and BGP.
CO4. Analyze the difference between reliable and unreliable data transfer schemes
including the connection establishment, reliable data transfer and sliding window
protocols, and congestion control techniques used in Internet.
CO5. Understand, design and implement client/server programs using a variety of
protocols and platforms.
CO6. Implement specific network programming constructs on Unix platforms using C
constructs to create robust real-world sockets-based applications.
CO7. Analyze internet security threats and suggest possible means to mitigate these to
ensure secure communication.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Internetworking with TCP/IP: Overview of TCP/IP Protocol stack; Network Interface layer
Protocols -ARP, RARP, BOOTP, DHCP, ATMARP; Internet layer-IP, IP-Addresses -Network
and Host IDs, Subnetting, Masking; IP Datagram, ICMP, IGMP; Overview of Routing in the
Internet : RIP – Routing Information Protocol, OSPF – The Interior Gateway Routing Protocol;
BGP– The Exterior Gateway Routing Protocol; Multicasting.
Page | 51
UNIT-II
Transport Layer : TCP and UDP; Reliable Vrs Unreliable delivering; Connectionless and
Connection-Oriented Data Transfer; Connection Establishment in TCP; Sliding Window
Protocol, TCP Congestion Control, Slow Start Algorithms; Application Layer Protocols of
TCP/IP: Port numbers; Client-Server Model of Interaction, TELNET, DNS, SMTP; SNMP;
FTP; E- Mail; The Future of TCP/IP; IPv4 Vrs IPv6.
UNIT-III
Introduction to Network Programming: Unix I/O Paradigm and Network I/O; Adding
Networks I/O to Unix; The Socket Abstraction; Creating Socket, Socket Inheritance &
Termination; Specifying a Local Address; Connecting Sockets to Destination Addresses;
Sending and Receiving Data through Sockets; Obtaining local and remote Socket Addresses;
Accessing the Domain name system; Obtaining Information about Hosts, Networks, Protocol
and Services; Client-Server Programming, Socket Programming with TCP and UDP.
UNIT-IV
Application Development: Design of file transfer protocol, remote log-in protocol etc. using
socket interface. Communication Security- IP sec, Firewalls, VPNs; Wireless Security-802.11
Security, (WEP), Bluetooth Security, WAP Security.
References:
1. Internetworking with TCP/IP Vol. I, II, & III , By D.E. Comer,3rd Edition, PHI
2. TCP/IP Illustrusted Vol. I, II, & III, By W. Richard Stevens, Addison Wesley, Bragg,
Rhodes-ousley, Strassberg, et.al
3. Network Security-The Complete Reference TMH, A.S. Tanebaum, 4th Edition, PHI
4. Computer Networks
5. Data Communication and Networks Forouzan B., 3rd Edition TMH
6. Adventures in UNIX Network Applications Programming, Bill Rieken andLyle
Weiman, JohnWiley & Sons, 1992.

1 x
2 x
3 x
4 x
5 x
6 x
7 x
Page | 52
ALIGARH-202002

COURSE CAMS-3E03: Compiler Construction
• To develop the understanding of functioning of compilers and enable to write compilers.
NOTE:
1. In all four questions are to be set; at least one from each unit. At least 1/3 more sections
are to be set for choice within each unit.
2. Laboratory should be an integral part of the course.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Introduction to assembler, Compiler and linkers, Structure of Compiler, Overview of
compilation Process, Compiler writing language, Compiler writing tools.
UNIT-II
Programming Languages and grammar, Context free grammar, Ambiguity and Non
ambiguity, Role of Lexical analyzer, Finite automat & regular expressions, Transformation of
the grammar, Simple approach to design of lexicalanalyzer.
UNIT-III
Parsing : Top-down and bottom up approaches, Syntax Directed Translations- Inherited and
Synthesized attributes, Dependency graph, Top Down Parsing Implementation, Predictive
Topdown Parser, Recursive decent parsing, Table Driver Parser, Bottom up Parsing
Implementation, LR Parser, SLR parser.
UNIT-IV
Translation of assignment statement, Boolean expression, Unconditional branching,
Conditional branching and looping, Code Optimization-Source of Optimization, Optimization
of Basic Blocks, Loops, Error Handling.
BOOKS:
1. Compiler Construction Principle and Practice - D.M. Dhamdhere, Mcmillan India Ltd.,
Delhi, Bombay, Madras
2. Compilers-Principle, Techniques & Tools Aho, Ullman & Sethi, 2003, Pearson
Education
3. Introduction to Compiling Techniques- J. P. Bennett
Reference Books:
1. Compiler Design - O.G. Kakde, Laxmi Pub
2. System Programming & O.S-D.M. Dhamdhere, Tata McGraw Hill.
Page | 53
ALIGARH-202002

COURSE CAMS-3E04: Discrete Mathematics

• To learn discrete mathematical structures, functions, group theory, counting, and
relations
• To apply logical reasoning to solve a variety of problems.
• To understand the fundamental concepts in graph theory
• To apply graph theory based tools in solving practical problems
COURSE OUTCOMES:
CO1. Use effectively algebraic techniques to analyze basic discrete structures and
algorithms.
CO2. Understand the notion of mathematical reasoning, mathematical proofs, and apply
them in problem solving.
CO3. Apply principles and concepts of graph theory in practical situations.
CO4. Analyze complex computing problems and apply principles of discrete
mathematics to identify solutions.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT: I
Set Theory and Mathematical Logic: Set Theory: Review of set theory, Relations and
Functions, Group, Monoid, Field, Ring. Mathematical Logic: Propositions, connectives,
conditional and bi-conditional, well formed formulas, tautologies, equivalence of formulas,
duality law, normal forms, inference theory for propositional calculus, Predicate Calculus,
Inference theory of the predicate calculus.
UNIT: II
Order Relations and Structures, Recurrence Relation: Relations and Functions, Partially
Ordered Sets and Lattice, Hasse Diagram, Topological Sorting. Recurrence Relation,
Recurrence relations using substitution and characteristic roots method, Solutions of recurrence
relation using generating function.
Page | 54
UNIT: III
Graph Theory-I: Formal definition of graphs, Directed and undirected Graphs, Sub-graph,
Isomorphism, Circuit Connectivity, Eulerian and Hamiltonian paths and circuits, Elements of
Transport Networks, Flows in Networks. Cut sets.
UNIT: IV
Graph Theory-II: Covering and Matching-Basics, Matchings in bipartite graphs, Perfect
matchings, Vertex Colorings- Chromatic number and cliques, Coloring Algorithms.
BOOKS:
1. Discrete Mathematical Structures for computer science By Kolman, Busby (PHI)
2. Theory of Computer Science By K.L.P. Mishra and N. Chandrasekaran, (PHI)
3. Elements of Discrete Mathematics By C. L. Liu, McGraw-Hill International
4. Discrete Mathematics for Computer Scientists By JoY L. Mott., Abraham Kandel, Theodore
P. Baker Publisher : Reston, A Prentice Hall Company
5. Discrete Mathematical Structures for Computer Science By Bernard Kolman and Robert
C. Busby, Eastern Economy Edition(PHI)
6. Discrete Mathematics By Olympia Nicodemmi, CBS Publication
7. Discrete Mathematical Structures with Applications to Computer Science by J.P.
Tremblay and R. Manohar, (McGraw-Hill).
References:
1. D.E. Knuth ―The Art of Computer Programming‖ (3rd ed.), Vol. 1, Addison
Wesley,1997
2. K.D. Joshi ―Foundations of Discrete Mathematics‖ New Age International
Publishers,2003
3. D.S. Malik and M.K. Sen ―Discrete Mathematical Structures: Theory and
Applications‖ Thomson Learning,2004
4. R.L. Graham, D.E. Knuth, O. Patashnik ―Concrete Mathematics (2nd ed.), Addison-
Wesley, 1994.

1 x x
2 x x
3 x x x
4 x x x x x x
Page | 55
ALIGARH-202002

COURSE CAMS-3E05: Cyber Security

• To sensitize and establish the ‘fundamental concepts and principles of cyber security’.
• To introduce and explain cryptography and its applications in maintaining information
security.
• To introduce and explain Network and Internet security and its mitigation.
• To develop an understanding of ‘web-based threats and countermeasures’
• To develop an understanding of ‘malicious attacks, threats, and vulnerabilities’
COURSE OUTCOMES
After completing this course, the student should be able:
CO1. Demonstrate computer and network security fundamental concepts and principles.
CO2. Demonstrate the workings of popular encryption algorithms, digital signatures, certificates.
CO3. Describe methods for software and web application security.
CO4. Demonstrate the understanding of cybercrimes, Legal perspective of cybercrimes and Indian IT
act.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Cyber Security Concepts: Introduction to cyber security, Types of cyber security, Information
Assurance Fundamentals, Attacker Techniques and Motivations, Cyber security Challenges,
Incident response process, Security policy, Risk Analysis and Management, Cybercrime and
Law: Introduction, Cybercrime and Information security, Cyber criminals, Classification of
cybercrimes, Legal perspective of cybercrimes, planning cyber attacks by cybercriminals,
Cyber Law, Indian IT Act, Careers in Cyber security.
UNIT-II
Data Security: Symmetric Ciphers: Classical Encryption Techniques, Block Ciphers and the
Data Encryption Standard, Basic Concepts in Number Theory and Finite Fields, Advanced
Encryption Standard, Block Cipher Operation; Asymmetric Ciphers: Number Theory, Public-
Key Cryptography and RSA, Other Public-Key Cryptosystems, Quantum Cryptography:
Quantum Physics Photon Reception, Cryptography with Photons, Implementation,
Cryptographic Hash Functions, Message Authentication Codes, Digital Signatures.
Page | 56
UNIT-III
Network and Internet Security: Network Security Concepts, Network Access Control and
Cloud Security: Network Access Control, Extensible Authentication Protocol, IEEE 802.1X
Port-Based Network Access Control, Cloud Security Risks and Countermeasures, Data
Protection in the Cloud, Cloud Security as a Service; Transport-Level Security, Wireless
Network Security: Threats and its counter measures, Electronic Mail Security, IP Security: IP
Security Protocol Suite (IPsec), Bots, Botnets, Firewall and Packet Filters, Password Cracking,
Key loggers and Spyware, DoS and DDoS attack.
UNIT-IV
Software and Web Threats: Programs and Programming Unintentional (Non-malicious)
Programming: Oversights, Buffer Overflow, Incomplete Mediation, Time-of-Check to Time-
of-Use, Integer Overflow, Unterminated Null-Terminated String, Race Condition. Web
Application security, Web vulnerabilities scanning tools: Nikto, W3af etc., Application
inspection tolls: Sql map, DVWA etc., Core Defense Mechanisms, Bypassing Client-Side
Controls, Attacking Authentication, Attacking Session Management, Attacking Access
Controls, Attacking Data Stores, Attacking Back-End Components, Attacking Application
Logic, Attacking Users: Cross-Site Scripting and other Techniques, Exploiting Information
Disclosure.
TEXT BOOKS:
1. Sunit Belapure Nina God bole, “Cyber Security: Understanding Cyber Crimes,
Computer Forensics and Legal Perspectives”, Wiley India Private Limited.
2. William Stallings, “Cryptography and Network Security: Principles and Practice”.
Pearson Publication.
3. Dafydd Stuttard, Marcus Pinto, “The Web Application Hacker’s Handbook: Finding
and Exploiting Security Flaws”, Second Edition, John Wiley & Sons, Inc.
4. Merkow & Breithaupt, “Information Security: Principles and Practices”, 2nd
Edition, 2014, Pearson.
5. Mike Shema, “Anti-Hacker Tool Kit” McGraw-Hill Education.

1 x x x
2 x x x x
3 x x x
4 x x x
Page | 57
ALIGARH-202002

COURSE CAMS-3E06: Introduction to Bioinformatics
OBJECTIVE OF THE COURSE:

• Learn basic concepts related to bioinformatics, understanding biological databases, file
formats, to explore bioinformatics tools for analyzing biological data, Concept of sequence
and alignment, Protein structure prediction and to cover the overview of Application of
Bioinformatics in Computer Aided-Drug Designing (CADD).
LEARNING OUTCOMES
After the course, the student should be able to:
• Understand the basic concepts and applications of bioinformatics, various biological
databases and commonly used file formats.
• Account for the concepts of methods in sequence bioinformatics such as sequence alignment,
phylogenetic analysis and pattern recognition.
• Account for and use methods in structural bioinformatics such as classification of protein
structures, structure prediction(2D, 3D), simulations and conceptual understanding of
structure based drug design.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I Introduction to Bioinformatics and its Application

Bioinformatics: What is bioinformatics and its relation with molecular biology.
Goal, Scope and Limitations of Bioinformatics, Applications of bioinformatics:
Gene therapy, Drug development, personalized medicine, biotechnology,
Evolutionary studies, Central Dogma of cell, Understanding Genomics
Bioinformatics, Basic glossary of bioinformatics, Overview of Omics studies
included in bioinformatics (Genomics, Transcriptomics, Proteomics,
Metabolomics)
UNIT-II Data storage and retrieval and Interoperability

Definition and classification of biological Databases: Nucleic acid sequence
databases, protein sequence databases, Nucleic acid databases (NCBI, DDBJ,
and EMBL). Protein databases (Primary, Composite, and Secondary).
Specialized Genome databases: (SGD, TIGR, and ACeDB). Structure databases
(CATH, SCOP, and PDBsum). Pitfalls of Biological Databases, Biological data
formats, Information Retrieval from Biological Databases for Gene Prediction,
Genome Annotation, Biological Functional Annotation. Various file formats for
bio-molecular sequences (FASTA, FASTQ, VCF, BED, GTF, GFF).
Page | 58
UNIT-III Sequence Analysis and Alignment: Sequence Analysis
Basic concepts of sequence similarity, identity and homology, definitions of
homologues, orthologues, paralogues, Sequence-based Database Searches,
BLAST and FASTA algorithms, various versions of basic BLAST and FASTA.
Sequence Alignment: Substitution matrices, Scoring matrices–PAM and
BLOSUM. Local and Global alignment concepts, Dotplot, Multiple sequence
alignment, Progressive alignment, Pair wise alignment, Gaps.
UNIT-IV Molecular Docking and Computer Aided Drug Designing (CADD):

Protein structures- Identification and classifications, Protein folding and
Ramachandran plot. Protein structure retrieval from databases, the molecular
basis, stability, molecular complexes. Steps in homology modeling, tools
(SWISS-MODEL, I-TASSER), databases, side chain modeling, loop modeling.
Predicting Protein Structures by Threading. Docking - molecular modeling in
drug design – structure based drug design, lig and based drug designing,
AUTODOCK and HEX. Visualization tools for molecular systems: Visualizing
Molecular Dynamics trajectories, VMD, YASARA, PyMOL.
RECOMMENDED TEXTBOOKS:
1. Arthur MLesk,” Introduction to Bioinformatics” Oxford University press, 2014.

2. Richard Durbin, SeanEddy, Anders Krogh, and Graeme Mitchison, “Biological
Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids”, Cambridge
University Press, 2008.
3. Raquell M. Holmes, “A Cell Biologist’s Giode to Modeling and Bioinformatics” Boston
University, 2007.
4. Bioinformatics: Basic algorithm and application, Ruchi Singh and Ruchi Sharma,
Universities Press, Hydrabad.
5. Bioinformatics Sequence and Genome analysis; Mount DW, Cold Spring Harbor,
Laboratory Press.
6. Bioinformatics: A practical guide to the analysis of Genes and Proteins; Baxevanis, AD
and Ouellette BFF, Wiley-Liss.
7. Andrew R. Leach, Molecular Modeling, Principles & Applications, 2nd ed. (Dorling
Kindersley (India) (P) Ltd. with pearson education Ltd, UK, 2010.
8. Alan Hinchliffe, Molecular Modelling for Beginners, 2nd ed., John-Wiley, 2010.
9. S.C. Rastogi, Namita Mendiratta, Parag Rastogi, Bioinformatics: Methods And
Applications: (Genomics, Proteomics and Drug Discovery), 3rd ed., PHI learning (P)
Ltd, 2010.
Page | 59
ALIGARH-202002

COURSE CAMS-3E07: Optimization Techniques

• To introduce the general concept of Optimization Techniques.
NOTE: 1. In all four questions are to be set; at least one from each unit. At least 1/3 more
sections are to be set for choice within each unit.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I Linear Programming: Introduction, Assumption of linear programming.

Generallinear programming problem. Simplex Method: Theory of Simplex
method, Computational Procedure, Artificial variable Technique (Big-M’
Method), Concept of duality in LP and Dual Simplex Method. Transportation
Problems(TP): Introduction, The Transportation Tableau, Selection of the
Initial Basic Feasible Solution to a TP, U-V Method, Degeneracy in TP,
Unbalanced TP. Assignment Problems (AP):Introduction, The Assignment
Algorithm( Hungarian Method), Unbalanced AP.
UNIT-II Project Management and Network Analysis: An overview of project

management and network analysis. Phases of project management Network and
basic components. Rules for Network construction Time estimation in Network
analysis. Gantt Chart. Critical Path Method and PERT. Algorithm for
formulating and solving Critical Path Methods and Program Evaluation and
Review Technique.
Inventory Management : Introduction, direct & indirect inventories, inventory

control, objectives of inventory control, Techniques of inventory control with
known demands. Economic lot size problems, fundamental problem of EOQ.
Problem of EOQ with finite rate of replenishment. The problem of EOQ with
shortage. Multi item deterministic problem, limitation on inventories.
UNIT-III Replacement Problems and System Reliability: Introduction, Types of

replacement problem, Replacement Policies for items whose efficiency
deteriorates with times. Replacement of items whose maintenance cost increase
with time and the value of money also change with time. .Replacement policies
for items that fail completely. Individual replacement and group replacement
policy. Equipments Renewal Problem. Reliability and System Failure Rates;
Bath-tub-shaped failure rate. Instantaneous failure rate. Mean Time Between
Failure .
Page | 60
UNIT-IV Dynamic Programming: Introduction, Multi stage decision processes.
Concept of sub-optimization and the principle of optimality. The recursive
equation approach. Computational Procedure in dynamic Programming.
Conversion of a final value problem into an initial value, problem.
Simulation: Introduction. Need for Simulation, Types of Simulation
Methodology of Simulation. Monte-Carlo Simulation. Generation of Random
Numbers Simulation of Queuing System, Simulation of an Inventory System.
Simulation of Networks. Advantages and Limitation of Simulation.
Text Books:
1. Buffa, E. S.: Management Science/Operations Research–Model formation, Simulation
Methods (Wiley, 1997).
2. Taha A: Operation Research (2nd Ed) (University of Arkansas, (1976).
3. Wagner, H.: Principle of Operation Research (Prentice Hall). New Jensey, (1969).
4. Kantiswaroop: Principle of Operation Research Sultan Chand & Co. Manmohan and
Gupta. p162.
5. Rao: Optimization Theory and application
Page | 61
ALIGARH-202002

COURSE CAMS-3E08: Artificial Intelligence and Soft Computing

• To introduce the concepts of Artificial Intelligence.
• To learn machine learning techniques in detail.
• To introduce the Soft Computing techniques such as neural networks,
• Fuzzy logic, genetic algorithm etc.
• To apply the AI algorithms on various practical scenarios.
COURSE OUTCOMES:
CO1. To understand the formulation of an AI problem.
CO2. To identify the relevant algorithm/tool to solve the problem.
CO3. To understand the process of data analysis and handling.
CO4. To apply the algorithms to solve real-life problems.
CO5. To develop intelligent software’s.
Credit: 04
Sessional Marks: 30
Final Marks: 70
UNIT-I
Basics of AI:
Natural and Artificial Intelligence, definitions of artificial intelligence, applications,
Underlying Assumptions about intelligence, Physical Symbol System Hypothesis; its
importance in AI, AI Techniques, Criteria of success, Control strategies and heuristic search ,
Problem characteristics, state and search space, Problem Solving Methods: Generate-and–Test,
Hill climbing, Breadth-first search and Best-first search, A*, AO*, Games playing-Minimax
search procedure, alpha-beta pruning.
UNIT-II
Machine Learning:
Introduction, Types of machine learning: supervised, unsupervised and reinforcement learning,

Supervised learning: Classification: Two class and Multiclass classification, Regression,
Decision boundary Techniques: Linear Regression, K-nearest neighbor, Decision Trees:
Entropy and information gain, Logistic Regression, Artificial neural network: perception,
multilayer perception, back-propagation algorithm, Unsupervised learning: Clustering,
Techniques: K-means clustering and Hierarchical clustering.
Page | 62
UNIT-III
Soft Computing:
Introduction, Hard computing vs Soft Computing, Components of Soft Computing,
Evolutionary Computation, Genetic Algorithm, Methods for crossover, mutation, Roulette
wheel selection, Tournament selection, Applications of genetic algorithm, Swarm intelligence,
Particle swarm optimization, Fuzzy logic: introduction, crisp set vs fuzzy set, Linguistic
variables, representation of fuzzy terms, discrete method, piecewise linear method, Fuzziness
vs. probability, Fuzzy logic operations, fuzzy rules, Fuzzy inferencing: fuzzification,
evaluation, defuzzification, applications of fuzzy logic.
UNIT-IV
Important concepts and Applications:
Under fitting, Over fitting, intensification, diversification, linearly separable and non-linearly
separable dataset, Training set vs Testing set, Validation set, K-fold cross validation, Data
normalization: importance and techniques, Treatment of missing values, Feature significance,
Irrelevant features, Performance matrices: classification accuracy, Confusion matrix, recall,
precision, error measures. Applications: Flower data classification, Spam filtering,
Handwritten-digit recognition, Readymade cloth grouping. Test functions for optimization,
Rastrigin function, Ackley function, Bukin function.
REFERENCES:
1. Elaine Rich: Artificial intelligence-McGraw Hill International Book Company, Japan

2. Tom Mitchell: Machine Learning- McGraw Hill.
3. S.N. Sivanandam, S.N. Deepa: Principles of Soft Computing, Wiley India; 2editions.
4. Christopher Bishop: Pattern Recognition and Machine Learning, Springer.

1 x x x x
2 x x x
3 x x x
4 x x x x
5 x x x x x x

Page | 63
ALIGARH-202002

COURSE CAMS-3P01: Laboratory Course-III (Mini Project)

• To develop window based applications using Visual Programming techniques.
COURSE OUTCOMES:
Upon successful completion of this course students will be able to:
CO1. Identify project/research problems; understand information and grasp meaning;
translate knowledge into new context; use information, methods, concepts, and theories
of fundamental topics in computer science in new situations (Knowledge,
Comprehension);
CO2. Apply computer science principles and practices to a real-world problem; demonstrate
in-depth knowledge in the area of the project they have undertaken; solve problems
using required knowledge and skills; implement and test solutions/algorithms
(Application and Evaluation);
CO3. Identify potential solutions/algorithms for the project problem; see patterns and
modularize the problem, recognize hidden meanings and identify components, show
proficiency in software engineering principles (Analysis);
CO4. Apply a software development methodology currently practiced in industry to produce
software system in a rigorous and systematic way using different software life cycle
phases (specification, architecture, design, implementation, validation, documentation)
(Synthesis);
CO5. Show evidence (group collaboration, regular meetings, email communications,
significant knowledge and skills contributions, etc.) of working productively as an
individual and in a team on a project that produces a significant software product (Team
Work);
CO6. Show evidence of competency in oral and written communications skills through oral
presentations (project presentation, department seminar or conferences, client
interactions), technical reports and/or published research papers in conferences and/or
journals (Communications);
CO7. Use modern techniques, skills and tools necessary for computer science practices
relevant to the project they undertake; use techniques in recent research papers to solve
problems (Lifelong Learning).
Credit: 04
Sessional Marks: 40
Final Marks: 60
Page | 64
LAB:
Besides completing the subject/Lab assignments, the students will be required to complete one
mini project as follows:
2. MINI-PROJECT in VB, VC++ or Java under Linux(UNIX)/Windows
In addition to completing Mini-Project, the students will be doing the exercises

provided by the respective teachers in their class rooms. The individual teachers who
are teaching the courses will be responsible for completing their respective lab
assignments.
Some of the representative areas/problems may include the following:
• Developing Window Based Applications using recent technologies using .NET
Platform or Java Technologies like Java Servlet, Java Beans, COM, CORBA etc.
• Students should learn languages such as PROLOG or LISP to solve the Laboratory
exercises.
• An expert system shell such as IITM rule be used to create a small expert system
for, say, trouble shooting moped, VCR etc. Some suggested experiments are : Tour
of India, Stable marriage problem, Game playing (such as bridge), coin change
problem etc.
NOTE:
• Students are advised to consult the LAB MANUAL of CAMS-3P01 for details
related to Mini-Project development.
BOOKS:
1. Robert Lafore, “Object Oriented Programming in C++”, Pearson
2. R. Brown, "Visual Basic .NET – Your Visual Blueprint for Building Versatile
Programs on the .NET Framework", Wiley Publishing, Inc.
3. Ivan Bayross, "Oracle", BPB
4. E.N. Mackay, "Developing user Interfaces for Windows", WP Publishers &
Distributors Pvt. Ltd.
COURSE PROGRAM OUTCOME

OUTCOME PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
CO1 x x
CO2 x x
CO3 x x x
CO4 x x x
CO5 x x x
CO6 x
CO7 x x x

Page | 65
ALIGARH-202002
SYLLABUS (4th SEMESTER)

COURSE CAMS-4491: Fundamentals of IT (Open Elective)
NOTE:
1. In all four questions are to be set; atleast one from each unit. Atleast 1/3 more sections
are to be set for choice within each unit.
COURSE OUTCOMES:
The students will be able
CO1 To explain the Information systems and its types and application.
CO2 To explain the number systems and components of computer.
CO3 To explain and use various operating systems and utility software’s.
CO4 To explain and use different types of networks, Emails and blogs.
Credit: 00
Sessional Marks: 30
Final Marks: 70
UNIT - I
Computer Hardware: Computer System as Information processing System; Computer System
Difference- types of Computer Systems, hardware Option- CPU, Input Devices, Output
Devices, Storage Devices, Communication Devices, Configuration of Hardware Devices.
UNIT-II
Personal Computer: PC and its main Components, Hardware Configuration, CPU and Clock
Speed, Basics of memory, types of memory, cache and registers, RAM and Secondary Storage
Devices, memory management, virtual memory Management, Other Peripherals Used With
PC, Factor Influencing PC Performance; PC as a virtual Office.
UNIT-III
Modern Information Technology: basic Ideas of local Area Networks (LAN) and Wide Area
Networks (WAN); E-mail; Internet technologies, access devices, Concept of a World Wide
Web and Internet Browsing; Multimedia.
UNIT-IV
Introduction to Operating System: Software Need, operating System, Application Software,
Programming Language; DOS; Window, Window Explorer, print Manager, Control Panel,
Paintbrush, Calculator, Desk Top, My Computer, Setting, Find, Run; UNIX.
Page | 66
Applications of Information Technology: Wide range of applications in; home, education
and training, Entertainment, Science, medicine, Engineering etc. its applications are; E-
judiciary, E-security, E- legislature, Urban and rural development; E- environment, creating
secure wireless network for the military.
Text Book:
• Bokhari & Kuraishy "Fundamentals of Information Technology", Dhanpat Rai & Co.

Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8
1 x x x
2 x x x x
3 x x x x x x x
4 x x x x x x
Page | 67
ALIGARH-202002
SYLLABUS (4th SEMESTER)

COURSE CAMS-4D01: Dissertation/Project

• To help students develop openness to new ideas in computer science, develop the ability
to draw reasonable inferences from observations and learn to formulate and solve new
computer science problems using analytical and problem-solving skills;
• To help students develop the ability to synthesize and integrate information and ideas,
develop the ability to think creatively, develop the ability to think holistically and
develop the ability to distinguish between facts and opinion;
• To help students acquire the necessary competences to build a real-life software system
by completing different software life cycle phases (like, specification, architecture,
design, implementation, validation, documentation, etc);
• To help students develop the ability to work individually and as part of a team, develop
a commitment to accurate work, develop management skills, improve speaking and
writing skills, improve the ability to follow directions, instructions and plans, and
improve the ability to organize and use time effectively;
• To help students develop a commitment to personal achievement, the ability to work
skillfully, informed understanding of the role of science and technology, a lifelong love
of learning, and cultivates a sense of responsibility for one's own behavior and improves
self-esteem/self confidence.
Credit: 20
Sessional Marks: 40
Final Marks: 60
Course Content
This course consists of the development of a realistic application, representative of a typical

real-life software system or to carry a research based project in an area related to CS & IT.
1. The students are expected to propose, analyze, design, develop, test and implement a
real life software system using recent technologies.
2. In case of a research based project, the students are required to follow a proper
research methodology to propose a solution (in terms of a model/ framework/
algorithm, etc) of a research problem related to computer science and IT.
3. The student will deliver oral presentations, progress reports, and a final report.
A. Depending on the topic of the project and the chosen software development methodology,
the following themes may be addressed to some extent:
• Software development methodologies, static (products) and dynamic aspects

(processes);
Page | 68
• Requirement analysis (goals, use cases), software architectures, architectural styles
and patterns, model-driven engineering(MDE);
• Programming techniques, software development environments, refactoring;
• Software validation through unit tests, integration tests, functional and structural tests,
and code reviews.
• Project management, planning, resource estimation, reporting.
• Version management by using a version management tool.
• Examples of kinds of systems to be developed are distributed systems, client/server
systems, web based systems, secure systems, mobile systems, adaptable systems,
optimizations of existing systems or data-intensive systems, etc.
B. Typical process of research based problems may include, selection of a research topic
followed by an extensive literature survey with an aim to find the research gap. Proposing
a solution based on the findings (i.e., research gap) and publishing the research work.
Page | 69

Syllabi: Master of Computer Applications (M.C.A.)

Uploaded by

Copyright:

Available Formats

Syllabi: Master of Computer Applications (M.C.A.)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Syllabi: Master of Computer Applications (M.C.A.)

Uploaded by

Copyright:

Available Formats

SYLLABI

Master of Computer Applications

DEPARTMENT OF COMPUTER SCIENCE

PROGRAM SPECIFIC OUTCOMES

SYLLABUS (1st SEMESTER)

COURSE CAMS-1N01: Fundamentals of IS & IT (Bridge Course)

OBJECTIVES OF THE COURSE

1. James A. O’Brien, George M. Marakas, "Introduction to Information Systems",

Introduced on: 01.02.2021

SYLLABUS (1st SEMESTER)

COURSE CAMS-1N02: Numerical and Statistical Computing (Bridge Course)

OBJECTIVES OF THE COURSE:

Laboratory: Using MATLAB in solving problems specified in lab manual.

Course Program Outcomes

Introduced on: 01.02.2021

SYLLABUS (1st SEMESTER)

COURSE CAMS-1001: Data Structure using C++

OBJECTIVES OF THE COURSE:

PROGRAMMING EXERCISES in C++: Agraded Sheet of assignments/problems will be

Course Program Outcomes

Revised on BoS 09.09.2023

SYLLABUS (1st SEMESTER)

COURSE CAMS-1002: Digital Logic and Computer Architecture

OBJECTIVES OF THE COURSE:

1. MANO, M., "Digital Logic and Computer Design"

Course Program Outcomes

Introduced on: 01.02.2021

COURSE CAMS-1003: Database Management System

Course Program Outcomes

Introduced on: 01.02.2021

SYLLABUS (1st SEMESTER)

COURSE CAMS-1004: Analysis and Design of Information Systems

OBJECTIVES OF THE COURSE:

Course Program Outcomes

Introduced on: 01.02.2021

SYLLABUS (1st SEMESTER)

COURSE CAMS-1005: Soft Skills Development and Technical Communication

OBJECTIVES OF THE COURSE:

Course Program Outcomes

Introduced on: 01.02.2021

SYLLABUS (1st SEMESTER)

COURSE CAMS-1P01: Laboratory Course–I

OBJECTIVES OF THE COURSE:

Course Program Outcomes

Introduced on: 01.02.2021

SYLLABUS (2nd SEMESTER)

COURSE CAMS-2001: Object Oriented Programming using Java

OBJECTIVES OF THE COURSE:

Course Program Outcomes

Revised on BoS 09.09.2023

1. Tanenbaum, A.S., Computer Networks,4thEdition PH

Course Program Outcomes

Introduced on: 01.02.2021

SYLLABUS (2nd SEMESTER)

OBJECTIVES OF THE COURSE:

Course Program Outcomes

Introduced on: 01.02.2021

SYLLABUS (2nd SEMESTER)

COURSE CAMS-2E02: Microprocessor: Architecture and Applications