DR. APJ ABDUL KALAM TECHNICAL UNIVERSITY LUCKNOW Evaluation Scheme & Syllabus for ...

15 Pages·2017·0.6 MB·English

DR. A.P.J. ABDUL KALAM TECHNICAL
UNIVERSITY LUCKNOW

Evaluation Scheme & Syllabus
for
MCA (Integrated)
2nd Year
On

Choice Based Credit System

(Effective from the Session: 2018-19)
Dr. A. P. J. Abdul Kalam Technical University, Lucknow
Study and Evaluation Scheme
MCA (Integrated)
(Effective from 2018-19)
THIRD SEMESTER
S.No. Subject Subject Name Periods Evaluation Scheme
Code
Sessional Exam ESE Subject Credit
Total
L T P CT TA Total
1 RCAI 301 Computer Based Numerical & 3 1 0 20 10 30 70 100 4
Statistical Techniques
2 RCAI 302 Data Structures Using C 3 1 0 20 10 30 70 100 4
3 RCAI 303 Operating Systems 3 1 0 20 10 30 70 100 4
4 RCAI 304 Principles of Management 3 1 0 20 10 30 70 100 4
5 *Cyber Security 3 0 0 20 10 30 70 100 3
Practical’s
6 RCAI 351 Computer Based Numerical & 0 0 3 30 20 50 50 100 2
Statistical Techniques Lab
7 RCAI 352 Data Structures Using C Lab 0 0 6 30 20 50 50 100 3
Total 15 4 9 700
24
* Subject Code should allotted by Dean UG as it is a compulsory course for all discipline.
FOURTH SEMESTER

Subject Subject Name Periods Evaluation Scheme
Code
Sessional Exam ESE Subject Credit
Total
L T P CT TA Total
1 RCAI 401 Object Oriented 3 1 0 20 10 30 70 100 4
Programming Using C++
2 RCAI 402 Database Management 3 1 0 20 10 30 70 100 4
System
3 RCAI 403 Introduction to Automata 3 1 0 20 10 30 70 100 4
Theory & Languages
4 RCAI 404 Accounting & Financial 3 1 0 20 10 30 70 100
4
Management
5 From ASD Human Values & 3 0 0 20 10 30 70 100
3
Professional Ethics
Practicals
6 RCAI 451 Object Oriented 0 0 6 30 20 50 50 100 3
Programming Using C++
Lab
7 RCAI 452 Database Management 0 0 3 30 20 50 50 100 2
System Lab
Total 15 5 9 700 24
Year-II (Semester-III)
RCAI 301: COMPUTER BASED NUMERICAL & STATISTICAL TECHNIQUES

UNIT-I
Floating point Arithmetic: Representation of floating point numbers, Operations, Normalization, Pitfalls of floating point
representation. Errors in numerical computation.
Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using Bisection Method, Iteration
Method, Regula-Falsi method, Newton Raphson method, Secant method, Rate of convergence of iterative methods.

UNIT-II
Finite differences and Interpolation: Finite Differences, Difference tables. Polynomial Interpolation: Newton’s forward and
backward formula, Central Difference Formulae: Gauss forward and backward formula, Stirling’s, Bessel’s formula, Lagrange’s
Interpolation, Newton Divided difference formula.

UNIT-III
Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical Integration, Trapezoidal rule,
Simpson’s rules, Boole’s Rule.

UNIT-IV
Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination direct method and pivoting, Ill
Conditioned system of equations, Refinement of solution. Gauss Seidel iterative methods,

Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method, Runge-Kutta methods, Predictor-
corrector methods.

UNIT-IV
Curve fitting, Approximations and Regression Analysis: Method of least squares, fitting of straight lines, polynomials,
exponential curves etc. Approximation of functions by Chebyshev polynomials.Linear, Non-linear and Multiple regressions.
Statistical methods: Sample distributions, Test of Significance: Chi-Square Test, t and F-test.

References:

1. Goyal M., “Computer Based Numerical and Statistical Techniques”, Laxmi Publications.
2. Grewal B. S., ”Numerical Methods in Engineering and Science with programs in C & C++”, Khanna Publishers.
3. Jaiswal A. K. and Khandelwal A., “A Textbook of Computer Based Numerical and Statistical Techniques”, New Age International Publishers.
4. Jain M. K., Iyengar S. R. K and Jain R. K, “Numerical Methods for Scientific and Engineering Computations”, New Age International Publishers.
5. Gupta S. P., “Statistical Methods”, Sultan Chand &Sons.
6. Kapoor, V. K., “Fundamentals of Statistics for Business and Economics”, Sultan Chand & Sons.
RCAI 302: DATA STRUCTURES USING C

UNIT-I
Introduction: Basic Terminology, Elementary Data Organization, Data Structure operations, Algorithm Complexity and Time-
Space trade-off.
Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, address calculation, application of
arrays, Character String in C, Character string operation, Array as Parameters, Ordered List, Sparse Matrices, and Vectors.
Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array Representation of Stack,
Linked Representation of Stack, Operations Associated with Stacks, Application of stack: Conversion of Infix to Prefix and
Postfix Expressions, Evaluation of postfix expression using stack. Recursion: definition and processes, recursion in C, example
of recursion, Tower of Hanoi Problem, simulating recursion. Backtracking, recursive algorithms, principles of recursion, tail
recursion, removal of recursion.

UNIT-II
Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and
Empty; Circular queue, Dequeue and Priority Queue.
Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of
Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, Doubly
linked list, Linked List in Array, Polynomial representation and addition, Generalized linked list, Garbage Collection and
Compaction.

UNIT-III
Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic expressions, Complete Binary Tree, Extended
Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees. Traversing
Threaded Binary trees, Huffman algorithm.
Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision
Resolution Strategies, Hash Table Implementation.

UNIT-IV
Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort, Heap Sort, Sorting on Different Keys, Practical
consideration for Internal Sorting.
Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of Search Algorithm, Path
Length, AVL Trees, B-trees.

UNIT-V
Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs,
Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees.
File Structures: Physical Storage Media File Organization, Organization of records into Blocks, Sequential Files, Indexing and
Hashing, Primary indices, Secondary indices, B+ Tree index Files, B Tree index Files, Indexing and Hashing Comparisons.

References:

1. Langsam Y.and Augenstin M., Tannenbaum A., “Data Structures using C and C++”, PHI.
2. Lipschutz S., “Data Structures”, McGraw Hill Education.
3. Tremblay J-P and Paul. G. S., “An Introduction to Data Structures with Applications”, Tata McGraw Hill Education.
4. Salaria R. S., “Data Structures & Algorithms Using C”, Khanna Book Publishing.
RCAI 303: OPERATING SYSTEMS

UNIT-I
Introduction: Definition and types of operating systems, Batch Systems, multi programming, time–sharing parallel, distributed
and real-time systems, Operating system structure, Operating system components and services, System calls, system programs,
Virtual machines.

UNIT-II
Process Management: Process concept, Process scheduling, Cooperating processes, Threads, Interprocess communication,
CPU scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real-time scheduling and Algorithm evaluation.

UNIT-III
Process Synchronization and Deadlocks: The Critical-Section problem, synchronization hardware, Semaphores, Classical
problems of synchronization, Critical regions, Monitors, Deadlocks-System model, Characterization, Deadlock prevention,
Avoidance and Detection, Recovery from deadlock, Combined approach to deadlock handling.

UNIT-IV
Storage management: Memory Management-Logical and Physical Address Space, Swapping, Contiguous Allocation, Paging,
Segmentation with paging in MULTICS and Intel386, Virtual Memory, Demand paging and its performance, Page replacement
algorithms, Allocation of frames, Thrasing, Page Size and other considerations, Demand segmentation, File systems, secondary
Storage Structure, File concept, access methods, directory implementation, Efficiency and performance, recovery, Disk
structure, Disk scheduling methods, Disk management, Recovery, Disk structure, disk scheduling methods, Disk management,
Swap-Space management, Disk reliability.

UNIT-V
Protection and Security: Goals of protection, Domain of protection, Access matrix, Implementation of access Matrix,
Revocation of Access Rights, language based protection, The Security problem, Authentication, One Time passwords, Program
threats, System threats, Threat Monitoring, Encryption.

References:

1. Abraham S. and Peter B. Galvin., “Operating System Concepts”, Wiley.
2. Milenkovic M., “Operating Systems” Tata McGraw Hill.
3. Harvey M. D., "Operating System", Pearson.
4. Tanenbaum A., “Modern Operating Systems”, PHI.
5. Stalling W., “Operating Systems internals and design principles”, Pearson.
RCAI 304: PRINCIPLES OF MANAGEMENT

UNIT-I
Management: Concept, Nature, Importance; Management: Art and Science, Management As a Profession, Management Vs.
Administration, Management Skills, Levels of Management, And Characteristics of Quality Managers. Evolution of
Management: Early contributions, Taylor and Scientific Management, Fayol’s Administrative Management, Bureaucracy,
Hawthorne Experiments and Human Relations, Social System Approach, Decision Theory Approach. Business Ethics and Social
Responsibility: Concept, Shift to Ethics, Tools of Ethics.

UNIT-II
Introduction to Functions of Management Planning: Nature, Scope, Objectives and Significance of Planning, Types of Planning,
Process of Planning, Barriers to Effective Planning, Planning Premises and Forecasting, Key to Planning, Decision Making.
Organizing: Concept, Organization Theories, Forms of Organisational Structure, Combining Jobs: Departmentation, Span of
Control, Delegation of Authority, Authority & Responsibility, Organisational Design.

UNIT-III
Staffing: Concept, System Approach, Manpower Planning, Job Design, Recruitment &Selection, Training & Development,
Performance Appraisal Directing: Concept, Direction and Supervision Motivation: Concept, Motivation and Performance,
Theories Of Motivation, Approaches for Improving Motivation, Pay and Job Performance, Quality of Work Life, Morale
Building.

UNIT-IV
Leadership: The Core of Leadership: Influence, Functions of Leaders, Leadership Style, And Leadership Development.
Communication: Communication Process, Importance of Communication, Communication Channels, Barriers to
Communication.

UNIT-V
Controlling: Concept, Types of Control, Methods, Pre-control, Concurrent Control: Post-control, An Integrated Control System,
The Quality Concept Factors affecting Quality, Developing a Quality Control System, Total Quality Control, Pre-control of
Inputs, Concurrent Control of Operations. Post Control of Outputs.

References:

1. Stoner, Freeman and Gilbert Jr, “Management”, Pearson Education.
2. Koontz ,”Essentials of Management”, Tata McGraw Hill.
3. Robbins and Coulter,” Management”, Prentice Hall of India.
4. Weihrich H. and Koontz H., “Management: A Global and Entrepreneurial Perspective”, Tata McGraw Hill.
* Cyber Security
UNIT-I
Introduction to information systems, Types of information Systems, Development of Information Systems, Introduction to
information security, Need for Information security, Threats to Information Systems, Information Assurance, Cyber Security,
and Security Risk Analysis.
UNIT-II
Application security (Database, E-mail and Internet), Data Security Considerations-Backups, Archival Storage and Disposal of
Data, Security Technology-Firewall and VPNs, Intrusion Detection, Access Control. Security Threats -Viruses, Worms, Trojan
Horse, Bombs, Trapdoors, Spoofs, E-mail viruses, Macro viruses, Malicious Software, Network and Denial of Services Attack,
Security Threats to Ecommerce- Electronic Payment System, e-Cash, Credit/Debit Cards. Digital Signature, public Key
Cryptography.
UNIT-III
Developing Secure Information Systems, Application Development Security, Information Security Governance & Risk
Management, and Security Architecture & Design Security Issues in Hardware, Data Storage & Downloadable Devices,
Physical Security of IT Assets, Access Control, CCTV and intrusion Detection Systems, Backup Security Measures.
UNIT- IV
Security Policies, Why Policies should be developed, WWW policies, Email Security policies, Policy Review Process-Corporate
policies-Sample Security Policies, Publishing and Notification Requirement of the Policies.
UNIT-V
Information Security Standards-ISO, IT Act, Copyright Act, Patent Law, IPR. Cyber Laws in India; IT Act 2000 Provisions,
Intellectual Property Law: Copy Right Law, Software License, Semiconductor Law and Patent Law.
References:
1. Charles P. Pfleeger, Shari Lawerance Pfleeger, “Analysing Computer Security ”, Pearson Education India.
2. V.K.Pachghare, “Cryptography and information Security”, PHI Learning Private Limited, Delhi India.
3. Dr.Surya Prakash Tripathi, Ritendra Goyal, Praveen Kumar Shukla ,”Introduction to Information Security and Cyber Law” Willey
Dreamtech Press.
4. Michael E.Whitman and Herbert J Mattord "Principle of Information Security" Cengage
5. Mike Chapple and David Seidl "Cyberwarfare: Information operations in a connected world" Jones & Bartlett Learning

* Subject Code should allotted by Dean UG as it is a compulsory course for all discipline.
RCAI 351 : COMPUTER BASED NUMERICAL & STATISTICAL TECHNIQUES LAB
1. WAP to find the absolute, relative and percentage error.
2. WAP to add, subtract, multiply and divide two Normalized Floating-Point Numbers.
3. WAP to find the roots of non-linear equation using Bisection method.
4. WAP to find the roots of non-linear equation using False position method.
5. WAP to find the roots of non-linear equation using Newton’s Raphson method.
6. WAP to find the roots of non-linear equation using Iteration method.
7. WAP to find the real root of any equation by using Secant Method.
8. WAP to illustrate the Forward Difference Table.
9. WAP to illustrate the Backward Difference Table.
10. WAP to interpolate numerically using Newton’s forward difference method.
11. WAP to interpolate numerically using Newton’s backward difference method.
12. WAP to illustrate the Gauss Forward Interpolation.
13. WAP to illustrate the Gauss Backward Interpolation.
14. WAP to interpolate numerically using Stirling’s method.
15. WAP to interpolate numerically using Bessel’s method.
16. WAP to interpolate numerically using Lagrange’s method.
17. WAP to Integrate numerically using Trapezoidal rule.
18. WAP to Integrate numerically using Simpson’s 1/3 rules.
19. WAP to Integrate numerically using Simpson’s 3/8 rules.
20. WAP to find numerical solution of ordinary differential equations by Runge-Kutta method.

Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner.
RCAI 352: DATA STRUCTURES USING C LAB
1. WAP to implement a stack using array to perform PUSH, POP and PEEP operations.
2. WAP to convert infix notation to prefix using stack.
3. WAP to convert infix notation to postfix using stack.
4. WAP to evaluate a postfix notation using stack.
5. WAP to implement a queue using arrays to perform INSERT, DELETE and DISPLAY operations.
6. WAP to implement a circular queue using arrays to perform INSERT, DELETE and DISPLAY operations.
7. WAP to implement a stack using linked list to perform PUSH, POP and PEEP operations.
8. WAP to implement a queue using linked list to perform INSERT, DELETE and DISPLAY operations.
9. WAP to implement a circular queue using linked list to perform INSERT, DELETE and DISPLAY operations.
10. WAP to implement a singly linked list to insert a node in the beginning, end and at a given location.
11. WAP to implement a singly linked list to delete the first node, last node and node at a given location.
12. WAP to implement a doubly linked list to perform INSERT and DELETE operations.
13. WAP to perform preorder traversal of a binary tree using stack.
14. WAP to perform inorder traversal of a binary tree using stack.
15. WAP to perform postorder traversal of a binary tree using stack.
16. WAP to insert an ITEM into a binary search tree.
17. WAP to delete an ITEM from a binary search tree
18. WAP to perform linear searching of a list.
19. WAP to perform binary searching of a list.
20. WAP to sort a list of numbers using Bubble sort.
21. WAP to sort a list of numbers using Insertion sort.
22. WAP to sort a list of numbers using Selection sort.
23. WAP to implement Merge sorting algorithm.
24. WAP to sort a list of numbers using Quick sort.
25. WAP to implement minimum spanning tree of a graph.
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner.
Year-II (Semester-IV)

RCAI 401: OBJECT ORIENTED PROGRAMMING USING C++

UNIT-I
Introduction: Introducing Object – Oriented Approach, Relating to other paradigms {Functional, Data decomposition}.
Basic concepts: Abstraction, Encapsulation, Inheritance, Polymorphism, Review of C, Difference between C and C++, cin,
cout, new, delete operators.

UNIT-II
Classes and Objects: Encapsulation, information hiding, abstract data types, Object &classes, attributes, methods, C++ class
declaration, State identity and behavior of an object, Constructors and destructors, instantiation of objects, Default parameter
value, object types, C++ garbage collection, dynamic memory allocation, Metaclass & abstract classes.

UNIT-III
Inheritance and Polymorphism: Inheritance, Class hierarchy, derivation – public, private & protected, Aggregation,
composition vs. classification hierarchies, Polymorphism, Categorization of polymorphism techniques, Method polymorphism,
Polymorphism by parameter, Operator overloading, Parametric Polymorphism.

UNIT-IV
Generic function: Template function, function name overloading, overriding inheritance methods, Run time polymorphism,
Multiple Inheritance.

UNIT-V
Files and Exception Handling: Streams and files, Namespaces, Exception handling, Generic Classes.

References:

1. James Rumbaugh et. al, “Object Oriented Modeling and Design”, PHI
2. Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User Guide”, Pearson Education
3. Object Oriented Programming With C++, E Balagurusamy, TMH
4. C++ Programming, Black Book, Steven Holzner, dreamtech
5. Object Oriented Programming in Turbo C++, Robert Lafore, Galgotia
6. Object Oriented Programming with ANSI and Turbo C++, Ashok Kamthane, Pearson
7. The Compete Reference C++, Herbert Schlitz, TMH
8. C++ and Object Oriented Programming Paradigm, PHI
9. C++ : How to Program, 9th Edition, Deitel and Deitel, PHI 8. Object Oriented Programming with C++, Saurav Sahay, Oxford