Osmania University

------------------------------
Faculty of Informatics
------------------------------

Master of Computer Applications (MCA)

Semester I and II
2019 – 2020

Scheme of Instruction
and
Syllabi

Osmania University
Hyderabad
 With effect from the academic year 2019-2020

PROPOSED SCHEME OF INSTRUCTION

MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER- I
Scheme of
Cate No of
SN Course Course Hours/ Examination
- Credi
o Code Title Week Max Duration
gory ts
Marks (hrs)
THEORY L/T P SEE C SE CI
I E E
E
1 MCA101B Discrete Mathematics BSC 4 - 4 70 3 3 1
S 0
2 MCA102P Introduction to Logic PCC 4 - 4 70 3 3 1
C Theory 0
3 MCA103E Python Programming ETC 4 - 4 70 3 3 1
T 0
4 MCA104P Data Structures with PCC 4 - 4 70 3 3 1
C CPP 0
5 MCA105P Data Communications PCC 4 - 4 70 3 3 1
C 0
PRACTICAL
6 MCA151L Python Programming LTC - 4 2 50 2 3 2
T Lab 5
7 MCA152L Data Structures with LCC - 4 2 50 2 3 2
C CPP Lab 5
8 MCA153L Soft Skills Lab LHC - 4 2 50 2 3 2
H 5
2
Total 20 12 26 500 2 - -
5

Category
BSC Basic Science Course
PCC Professional Core Course
ETC Emerging Technological Course
HSC Humanities and Social Science
Course
MGC Management Course
PEC Professional Elective Course
LCC Laboratory Core Course
LTC Laboratory Technological Course
LPC Laboratory Professional Course
LHC Laboratory Humanities Course
Examinations
CIE – Continuous Internal Evaluation
SEE – Semester End Evaluation
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM I – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA101 Discrete Mathematics BS
4 - 4 70 30 3 1
BS C

UNIT- I
Fundamentals of Logic: Basic Connectives and Truth Tables, Logical Equivalence, Logical
Implication, Use of Quantifiers, Definitions and the Proof of Theorems.
Set Theory: Set and Subsets, Set Operations, and the Laws of Set theory, Counting and Venn
Diagrams.
Properties of the Integers: The well – ordering principle, Recursive Definitions, Division
Algorithms, Fundamental theorem of Arithmetic.
UNIT-II
Relations and Functions: Cartesian Product, Functions onto Functions, Special Functions,
Pigeonhole Principle, Composition and Inverse Functions, Computational Complexity.
Relations: Partial Orders, Equivalence Relations and Partitions.
Principle of Inclusion and Exclusion: Principles of Inclusion and Exclusion, Generalization of
Principle, Derangements, Rock Polynomials, Arrangements with Forbidden Positions.
UNIT–III
Generating Functions: Introductory Examples, Definition And Examples, Partitions Of
Integers, Exponential Generating Function, Summation Operator.
Recurrence Relations: First – order linear recurrence relation, second – order linear
homogenous recurrence relation with constant coefficients, Non homogenous recurrence
relation, divide and conquer algorithms.
UNIT-IV
Algebraic Structures: Algebraic System – General Properties, Semi Groups, Monoids,
Homomorphism, Groups, Residue Arithmetic, Group Codes and their Applications.
UNIT -V
Graph Theory: Definitions and examples, sub graphs, complements and graph Isomorphism,
Vertex degree, Planar graphs, Hamiltonian paths and Cycles, Graph Coloring, Euler &
Hamiltonian graphs, and Chromatic number.
Trees: Definitions, properties and Examples, Rooted Trees, Spanning Trees and Minimum
Spanning Trees.

Suggested Reading:
1) Mott Joe L Mott, Abraham Kandel, and Theodore P Baker, Discrete Mathematics for
Computer Scientists & Mathematicians, Prentice Hall NJ, 2nd Edition, 2015.
2) Jr. P. Tremblay and R Manohar Discrete Mathematical Structures with Applications to
Computer Science, McGraw Hill, 1987.
3) R.K.Bisht and H.S.Dhami, Discrete Mathematics Oxford Higher Education, 2015
4) Bhavanari Satyanarayana, Tumurukota Venkata Pradeep Kumar and Shaik Mohiddin Shaw,
Mathematical Foundation of Computer Science, BSP, 2016
5) Ralph P. Grimaldi Discrete and Combinatorial Mathematics, 5th Edition, Pearson, 2004.
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM I – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA102 Introduction to Logic Theory PC 4 - 4 70 30 3 1
PC C

UNIT-I
Boolean Algebra: Axiomatic definition of Boolean Algebra Operators, Postulates and
Theorems, Boolean Functions, Canonical Forms and Standard Forms, Simplification of
Boolean Functions Using Theorems and Karnaugh Map Method.
UNIT-II
Minimization of Switching Functions: Quine-McCluskey Tabular Method, Determination of
Prime Implicants and Essential Prime Implicants.
Combinational Logic Design: Single-Output and Multiple-Output Combinational Circuit
Design, AND-OR, OR-AND and NAND/NOR Realizations, Exclusive-OR and Equivalence
functions.
UNIT–III
Design of Combinational Logic Circuits: Gate Level design of Small Scale Integration (SSI)
circuits, Modular Combinational Logic Elements- Decoders, Encoders, Priority encoders,
Multiplexers and De-multiplexers.
Design of Integer Arithmetic Circuits using Combinational Logic: Integer Adders – Binary
Adders, Subtractors, Ripple Carry Adder and Carry Look Ahead Adder, and Carry Save
Adders.
UNIT-IV
Design of Combinational Circuits using Programmable Logic Devices (PLDs): Programmable
Read Only Memories (PROMs), Programmable Logic Arrays (PLAs), Programmable Array
Logic (PAL) devices.
Introduction to Sequential Circuit Elements: Latch, Various types of Flip-Flops and their
Excitation Tables.
UNIT -V
Models of Sequential Circuits: Moore Machine and Mealy Machine, Analysis of Sequential
Circuits-State Table and State Transition Diagrams. Design of Sequential Circuits-Counters.
Moore and Mealy State Graphs for Sequence Detection, Methods for Reduction of State
Tables and State Assignments.

Suggested Reading:
1) M Morris Mano and Michael D Ciletti, Digital Design, Prentice Hall of India, Fourth Edition,
2008.
2) Zvi Kohavi, Switching and Finite Automata Theory, Tata McGraw Hill, 2nd Edition,
1979.
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM I – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA103 Python Programming ET 4 - 4 70 30 3 1
ET C

UNIT I
Algorithmic Problem Solving
Algorithms, building blocks of algorithms (statements, state, control flow, functions), notation
(pseudo code, flow chart, programming language), algorithmic problem solving, simple
strategies for developing algorithms (iteration, recursion).
Data, Expressions, Statements
Python interpreter and interactive mode; values and types: int, float, boolean, string, and list;
variables, expressions, statements, tuple assignment, precedence of operators, comments;

UNIT II
modules and functions: function definition and use, flow of execution, parameters and
arguments
Control Flow, Functions
Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained
conditional (if-elif-else); Iteration: state, while, for, break, continue, pass; functions: return
values, parameters, local and global scope, function composition, recursion; Strings: string
slices, immutability, string functions and methods, string module; Lists as arrays.

UNIT III
Lists, Tuples, Dictionaries
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; advanced list processing - list comprehension.

UNIT IV
Files, Modules, Packages
Files and exception: text files, reading and writing files, format operator; command line
arguments, errors and exceptions, handling exceptions, modules, packages.

UNIT V
Object Oriented Programming
Classes and Objects, Classes and Functions, Classes and Methods, Working with instances,
Inheritance and Polymorphism.
Suggested Reading:
1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist‘‘, 2nd edition,
Updated for Python 3, Shroff/O‘Reilly Publishers, 2016.
(http://greenteapress.com/wp/thinkpython/)
2. Guido van Rossum and Fred L. Drake Jr, ―An Introduction to Python – Revised and
updated for Python 3.2, Network Theory Ltd., 2011.
References: 1. John V Guttag, ―Introduction to Computation and Programming Using
Python‘‘, Revised and expanded Edition, MIT Press , 2013
2. Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming in
Python: An Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016.
With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM I – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA104 Data Structures with CPP PC 4 - 4 70 30 3 1
PC C

UNIT–I
Performance and Complexity Analysis: Space Complexity, Time Complexity, Asymptotic
Notation (Big-Oh), Complexity Analysis Examples.
Linear List-Array Representation: Vector Representation, Multiple Lists Single Array. Linear
List-Linked Representation: Singly Linked Lists, Circular Lists, Doubly Linked Lists, Applications
(Polynomial Arithmetic).
Arrays and Matrices: Row And Column Major Representations, Sparse Matrices.
UNIT –II
Stacks: Array Representation, Linked Representation, Applications (Recursive Calls, Infix to
Postfix, Postfix Evaluation).
Queues: Array Representation, Linked Representation.
Skip Lists and Hashing: Skip Lists Representation, Hash Table Representation, Application-
Text Compression.
UNIT- III
Trees: Definitions and Properties, Representation of Binary Trees, Operations, Binary Tree
Traversal.
Binary Search Trees: Definitions, Operations on Binary Search Trees. Balanced Search Trees:
AVL Trees, and B-Trees.
UNIT –IV
Graphs: Definitions and Properties, Representation, Graph Search Methods (Depth First
Search and Breadth First Search)
Application of Graphs: Shortest Path Algorithm (Dijkstra), Minimum Spanning Tree (Prim’s
and Kruskal's Algorithms).
UNIT -V
Sorting and Complexity Analysis: Selection Sort, Insertion Sort, Quick Sort, Merge Sort,
Closest Pair Of Points, and Heap Sort.

Suggested Reading:
1) Sartaj Sahni, Data Structures--Algorithms and Applications in C++, 2nd Edition,
Universities Press (India) Pvt. Ltd., 2005.
2) Mark Allen Weiss, Data Structures and Problem Solving using C++, Pearson Education
International, 2003.
3) Michael T. Goodrich, Roberto Tamassia, David M. Mount, Data Structures and
Algorithms in C++, John Wiley & Sons, 2010.
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM I – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA105 Data Communications ET 4 - 4 70 30 3 1
PC C

UNIT – I
Data Communication and Networking Overview, Protocol Architectures: OSI, TCP/IP and
ATM. Data transmission, Guided and Wireless transmission. Data Encoding: digital data-
digital signals, digital data-analog signals, analog data-digital signals, analog data-analog
signals.
UNIT – II
Multiplexing, Circuit switching and Packet switching, Digital Data Communication
Techniques, Asynchronous and Synchronous transmission, DSL and ADSL.
UNIT – III
Data Link Control: Error detection techniques, Interfacing. Line configurations, Flow control,
Error control, Data link control protocols, Protocol verification.
UNIT – IV
Local Area Networks, LAN Technologies, MAC sub layer, CSMA/CD, Token Ring, Fibre
channel, IEEE Standards, High Speed LAN: Switched, Fast, Gigabit Ethernets.
UNIT – V
Wireless LANs, 802.11 Broadband wireless, 802.16 Bluetooth, Bridge, Spanning Tree Bridge,
Source Routing Bridge, Repeaters, Hubs, Switches, Routers and Gateways, Virtual LANs.

Suggested Readings:
1. William Stallings, Data and Computer Communications, 8th Edition, Prentice Hall of India,
2012
2. Andrew S. Tanenbaum, David J. Wetherall, Computer Networks, 5th Edition, Pearson, 2012
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM I – Laboratory
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA151 Python Programming Lab LT - 4 2 50 25 3 2
LT C

1. Write a program to demonstrate different number data types in Python.

2. Write a program to perform different Arithmetic Operations on numbers in Python.
3. Write a program to create, concatenate and print a string and accessing sub-string from a
given string.
4. Write a python script to print the current date in the following format “Sun May 29 02:26:23
IST 2017”
5. Write a program to create, append, and remove lists in python.
6. Write a program to demonstrate working with tuples in python.
7. Write a program to demonstrate working with dictionaries in python.
8. Write a python program to find largest of three numbers.
9. Write a Python program to convert temperatures to and from Celsius, Fahrenheit.
[ Formula : c/5 = f-32/9 ]
10. Write a Python program to construct the different pattern, using a nested for loop.
11. Write a Python script that prints prime numbers less than 20.
12. Write a python program to find factorial of a number using Recursion.
13. Write a program that accepts the lengths of three sides of a triangle as inputs. The program
output should indicate whether or not the triangle is a right triangle (Recall from the
Pythagorean Theorem that in a right triangle, the square of one side equals the sum of the
squares of the other two sides).
14. Write a python program to define a module to find Fibonacci Numbers and import the
module to another program.
15. Write a python program to define a module and import a specific function in that module
to another program.
16. Write a script named copyfile.py. This script should prompt the user for the names of two
text files. The contents of the first file should be input and written to the second file.
17. Write a program that inputs a text file. The program should print all of the unique words in
the file in alphabetical order.
18. Write a Python class to convert an integer to a roman numeral. 19. Write a Python class to
implement pow(x, n)
20. Write a Python class to reverse a string word by word

Note: Use of Python IDEs like PyCharm, Spyder or Anaconda should be used for executing
programs.
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM I – Laboratory
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA152 Data Structures with CPP Lab LC - 4 2 50 25 3 2
LC C

1) Implementation of Singly Linked List, Doubly Linked List and Circular List.
2) Implementation of Stacks, Queues (using both arrays and linked lists).
3) Infix to Postfix conversion, evaluation of postfix expression.
4) Polynomial arithmetic using linked list.
5) Implementation of Binary Search and Hashing.
6) Implementation of recursive and iterative traversals on binary tree.
7) Implementation of Binary Search Tree.
8) Implementation of operations on binary tree (delete entire tree, copy entire tree, mirror
image, level order, search for a node etc.)
9) Implementation of Selection, Shell, Merge and Quick sorts.
10) Implementation of Heap Sort.
11) Implementation of Liner Search and Binary Search.
12) Implementation of operations on AVL trees.
13) Implementation of traversal on Graphs.
14) Implementation of B-Trees.

Note: Visual Studio is recommended for the development of programs.

To debug these programs it is recommended to use a debugging tool.
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM I – Laboratory
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA153 Soft Skills Lab LH - 4 2 50 25 3 2
LH C

Activities

1. Conversation skills, Listening dialogues from TV/radio/Ted talk/Podcast

2. Group discussion
3. Interview skills, Making presentation
4. Listening to Lectures and News Programmes, Listening to Talk show
5. Watching videos on interesting events on Youtube,
6. Reading different genres of tests ranging from newspapers to philosophical
treatises
7. Reading strategies - graphic organizers, Reading strategies - summarizing
8. Reading strategies – interpretation, Reports
9. Cover letter, Resume,
10. Writing for publications, Letters, Memos, Emails and blogs
11. Civil Service (Language related), Verbal ability
12. Motivation, Self image
13. Goal setting, Managing changes
14. Time management, Stress management
15. Leadership traits
16. Team work
17. Career and life planning.
18. Multiple intelligences
19. Emotional intelligence
20. Spiritual quotient (ethics)
21. Intercultural communication
22. Creative and critical thinking
23. Learning styles and strategies

Suggested Reading:

1. Business English Certificate Materials, Cambridge University Press.

2. Graded Examinations in Spoken English and Spoken English for Work downloadable
materials from Trinity College, London.
2. International English Language Testing System Practice Tests, Cambridge University
Press.
3. Interactive Multimedia Programs on Managing Time and Stress.
4. Personality Development (CD-ROM), Times Multimedia, Mumbai.
5. Robert M Sherfield and et al. “Developing Soft Skills” 4th edition, New Delhi: Pearson
Education, 2009.

Web Sources:

http://www.slideshare.net/rohitjsh/presentation-on-group-discussion
http://www.washington.edu/doit/TeamN/present_tips.html
http://www.oxforddictionaries.com/words/writing-job-applications
http://www.kent.ac.uk/careers/cv/coveringletters.htm
http://www.mindtools.com/pages/article/newCDV_34.htm
 With effect from the academic year 2019-2020

PROPOSED SCHEME OF INSTRUCTION

MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER- II
Scheme of
Cate No of
SN Course Course Hours/ Examination
- Credi
o Code Title Week Max Duration
gory ts
Marks (hrs)
THEORY L/T P SEE C SE CI
I E E
E
1 MCA201B Probability and BSC 4 - 4 70 3 3 1
S Statistics 0
2 MCA202P Operating Systems PCC 4 - 4 70 3 3 1
C 0
3 MCA203P Computer Organization PCC 4 - 4 70 3 3 1
C 0
4 MCA204P Java Programming PCC 4 - 4 70 3 3 1
C 0
5 MCA205P Database Management PCC 4 - 4 70 3 3 1
C Systems 0
PRACTICALS
6 MCA251L Operating Systems Lab LCC - 4 2 50 2 3 2
C 5
7 MCA252L Java Programming Lab LCC - 4 2 50 2 3 2
C 5
8 MCA253L Database Management LCC - 4 2 50 2 3 2
C Systems Lab 5
2
Total 20 12 26 500 2 - -
5

Category L/T: Lecture/Tutorial

P: Practical
BSC Basic Science Course
PCC Professional Core Course
ETC Emerging Technological Course
HSC Humanities and Social Science
Course
MGC Management Course
PEC Professional Elective Course
LCC Laboratory Core Course
LTC Laboratory Technological Course
LPC Laboratory Professional Course
 LHC Laboratory Humanities Course
Examinations
CIE – Continuous Internal Evaluation
SEE – Semester End Evaluation
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM II – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA201 Probability and Statistics BS 4 - 4 70 30 3 1
BS C

UNIT-I
Grouping and displaying data to convey meaning - arrangement of data, examples of raw data,
frequency distribution, graphing frequency distribution Measures of central tendency - arithmetic
mean, weighted mean, geometric mean, Median, mode, Dispersion, measures of dispersion, average
deviation
measures, coefficient of variation, exploratory data analysis
UNIT-II
Probability - Basic terminology, Three types, Probability rules, Statistical independence,
statistical
dependency, Bayes’ theorem
Probability distributions - random variables, expected values, binomial distribution, Poisson
distribution, normal distribution, choosing correct distribution Sampling and sampling distributions
- Random sampling, design of experiments, sampling distributions, operational considerations in
sampling
UNIT-III
Estimation - Point estimates, interval estimates, confidence intervals, calculating interval estimates of
the mean and proportion, t-distribution, determination of sample size in estimation
Testing Hypotheses - one sample tests, hypotheses testing of mean when the population standard
deviation is know, powers of hypotheses test, hypotheses testing of proportions, hypotheses testing of
means when std is not known
UNIT-IV
Testing Hypotheses - Two sample tests - tests for difference between means - large sample, small
sample, with dependent samples, testing for difference between proportions, probe values Chi-square
and analysis of variance - chi-square as test of independence, chi-square as a test of goodness of fit,
analysis of variance, inferences about a population variance, inferences about two population variances.
UNIT-V
Simple regression and correlation - Estimation using regression line, correlation analysis, making
inferences about population parameters, limitations, errors and caveats in regression and correlation
analysis multiple regression and modeling - finding multiple regression equations, inference about
population parameters, modeling techniques.

Suggested Reading:
Richard I Levin, David S Rubin - Statistics for Management, Seventh Edition, PHI -1997
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM II – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA202 Operating Systems PC 4 - 4 70 30 3 1
PC C

UNIT-I
Introduction to Operating Systems: OS structure and strategies, Process concepts,
Multithreaded Programming, Process scheduling, Process synchronization, Deadlocks.
UNIT-II
Memory management strategies with example architectures: Swapping, Contiguous allocation,
Paging, Segmentation, Segmentation with paging, Virtual memory management : Demand
paging, Page replacement, Thrashing.
UNIT-III
File system interface: File concepts, Access methods and protection. File system
implementation: File system structure, Allocation methods, Directory implementation of file
systems, Mass storage structures, I/O systems 11
UNIT-IV
System Protection : Principles and Domain, Access Matrix and implementation, Access
control and access rights, Capability based systems, Language based Protection, System
Security: Problem, Program threats, cryptography, user authentication, implementing security
defenses, Firewalling, Computer security Classification
UNIT-V
Case Studies: The Linux System–Design principles, Kernel modules, Process management,
Scheduling, Memory management, File systems, Input and Output, Inter process
communication. Windows 7 –Design principles, System components, Terminal services and
fast user switching File systems, Networking, Programmer interface.

Suggested Reading:
1. Abraham Silberschatz, Peter B Galvin, Operating System Concepts, 9th edition, Wiley,
2016
2. William Stallings, Operating Systems-Internals and Design Principles, 8th edition, Pearson,
2014
3. Andrew S Tanenbaum, Modern Operating Systems, 4th edition, Pearson, 2016.
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM II – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA203 Computer Organization PC 4 - 4 70 30 3 1
PC C

UNIT -I
Data Representation: Data types, Complements, Fixed and Floating Point representations,
and Binary codes.
Overview of Computer Function and Interconnections: Computer components,
Interconnection structures, Bus interconnection, Bus structure, and Data transfer.
UNIT-II
Register Transfer Micro operations: Register Transfer Language, Register Transfer, Bus and
Memory Transfers, Arithmetic, Logic and Shift micro operations, Arithmetic Logic Shift Unit.
Basic Computer Organization and Design: Instruction Codes, Computer Registers, Computer
Instructions, Timing and Control, Instruction Cycle, Memory reference instruction, Input-
Output and Interrupt.
UNIT-III
Micro programmed Control: Control memory, Address Sequencing, Micro program example,
Design of Control Unit.
Central Processing Unit: General Register Organization, Stack Organization, Instruction
formats, Addressing modes, Data Transfer and Manipulation, and Program control.
Computer Arithmetic: Addition and Subtraction, Multiplication, Division, and Floating Point
Arithmetic Operations.
UNIT-IV
Memory Organization: Memory Hierarchy, Main Memory, RAM and ROM, Auxiliary memory,
Associative memory, Cache memory, Virtual memory, Memory Management hardware.
UNIT–V
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous data
transfer, Modes of Transfer, Priority Interrupt, Direct Memory Access (DMA), I/O Processor,
Serial Communication.
Pipeline Processing: Arithmetic, Instruction and RISC Pipelines.
Assessing and Understanding Performance: CPU performance and its factors, Evaluating
performance.
Suggested Reading:
1) Morris Mano M, Computer System Architecture, Pearson Education India, 3rd Edition,
2007.
2) William Stallings, Computer Organization and Architecture, PHI, 7th Edition, 2008.
3) David A Patterson, John L Hennessy, Computer Organization and Design, Morgan
Kaufmann, 5th Edition, 2013.
4) Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization, Tata
McGraw-Hill Education , 5th Edition, 2002
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM II – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA204 Java Programming PC 4 - 4 70 30 3 1
PC C

UNIT-I
Object Oriented System Development: Understanding Object Oriented Development,
Understanding Object Concepts, Benefits of Object Oriented Development.
Java Programming Fundamentals: Introduction, Overview of Java, Data Type, Variables and
Arrays, Operators, Control statements, Classes, Methods, Inheritance, Packages and
Interfaces, Inner Classes.
UNIT-II
I/O basics, Stream and Byte classes, Character Streams, Reading Console input and output,
Print Writer Class, String Handling, Exceptions Handling, Multithreaded Programming.
UNIT-III
Exploring Java Language, Collections Overview, Collections Interfaces, Collections Classes,
Iterators, Random Access Interface, Maps, Comparators, Arrays, Legacy classes and
interfaces, Sting Tokenizer, BitSet, Date, Calendar, Timer.
UNIT-IV
Introducing AWT working With Graphics: AWT Classes, Working with Graphics.
Event Handling: Two Event Handling Mechanisms, The Delegation Event Model, Event
Classes, Source of Events, Event Listener Interfaces.
AWT Controls: Control Fundamentals, Labels, Using Buttons, Applying Check Boxes,
CheckboxGroup, Choice Controls, Using Lists, Managing Scroll Bars, Using TextField, Using
TextArea, Understanding Layout Managers, Menu bars and Menus, Dialog Boxes, FileDialog,
Handling events by Extending AWT Components, Exploring the controls, Menus and Layout
Managers.
UNIT-V
Introduction to Swing Package, Java I/O classes and interfaces, Reading and Writing Files,
Serialization, Introduction to Java Network Programming, Object Class, Exploring Image
package.

Suggested Reading:
1) Herbert Schildt, The Complete Reference Java, 9th Edition, Tata McGraw Hill, 2005.
2) Bruce Eckel, Thinking in Java, 4th Edition, Pearson Education
3) Dietel and Dietel, Java: How to Program, 5th Edition, Prentice Hall
4) James M Slack, Programming and Problem solving with JAVA, Thomson Learning, 2002
5) C Thomas Wu, An Introduction to Object Oriented programming with Java, Tata McGraw
Hill, 2005.
6) Kathy Sierra, Bert Bates ,Head First Java, 2nd Edition, A Brain-Friendly Guide,
Publisher: O'Reilly Media, February 2005.
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM II – THEORY
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA205 Database Management Systems PC 4 - 4 70 30 3 1
PC C

UNIT – I
Introduction: Database System Applications, Purpose of Database Systems, View of Values,
Nested Sub-queries, Complex Queries, Views, Modification of the Database, Joined Relations
Data, Database Languages, Relational Databases, Database Design, Object–based and Semi-
structured Databases, Data Storage and Querying, Transaction Management, Data Mining and
Analysis, Database Architecture, Database Users and Administrators. Database Design and the
E-R Model: Overview of the Design Process, The Entity- Relationship Model, Constraints,
Entity-Relationship Diagrams, Entity – Relationship Design Issues, Weak Entity Sets,
Extended E-R Features, Database Design for Banking Enterprise, Reduction to Relational
Schemas, Other Aspects of Database Design
UNIT – II
Relational Model: Structure of Relational Databases, Fundamental Relational-Algebra
Operations, Additional Relational – Algebra Operations, Extended Relational - Algebra
Operations, Null Values, Modification of the Databases. Structured Query Language: Data
Definition, Basic Structure of SQL Queries, Set Operations, Aggregate Functions, Null
UNIT – III
Advanced SQL: SQL Data Types and Schemas, Integrity Constraints, Authorization,
Embedded SQL, Dynamic SQL, Functions and Procedural Constructs, Recursive Queries,
Advanced SQL Features. Relational Database Design: Features of Good Relational Design,
Atomic Domains and First Normal Form, Functional-Dependency Theory, Decomposition
using Functional Dependencies.
UNIT – IV
Indexing and Hashing: Basic Concepts, Ordered Indices, B+-tree Index Files, B-tree Index
Files, Multiple-Key Access, Static Hashing, Dynamic Hashing, Comparison of Ordered
Indexing and Hashing, Bitmap Indices. Index Definition in SQL Transactions: Transaction
Concepts, Transaction State, Implementation of Atomicity and Durability, Concurrent
Executions, Serializability, Recoverability, Implementation of Isolation, Testing for
Serializability
UNIT – V
Concurrency Control: Lock-based Protocols, Timestamp-based Protocols, Validation-based
Protocols, Multiple Granularity, Multi-version Schemes, Deadlock Handling, Insert and Delete
Operations, Weak Levels of Consistency, Concurrency of Index Structures. Recovery System:
Failure Classification, Storage Structure, Recovery and Atomicity, Log-Based Recovery,
Recovery with Concurrent Transactions, Buffer Management, Failure with Loss of Nonvolatile
Storage, Advanced Recovery Techniques, Remote Backup Systems

Suggested Readings:
1. Abraham Silberschatz, Henry F Korth, S Sudarshan, Database System Concepts, McGraw-
Hill International Edition, 6th Edition, 2010
2. Ramakrishnan, Gehrke, Database Management Systems, McGraw-Hill International
Edition, 3rd Edition, 2003
3. Elmasri, Navathe, Somayajulu, Fundamentals of Database Systems, Pearson Education, 4th
Edition, 2004

With effect from the academic year 2019-2020

Scheme of
Hours / Examination
MCA SEM II – Laboratory
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA251 Operating Systems Lab LC - 4 2 50 25 3 2
LC C

1-3. Memory Management Algorithms

4-5. Examples of Multithreading
6. Producer & Consumer problem using Semaphores and Shared memory
7-8. Processor Scheduling algorithms
9. Dining Philosophers problem using Semaphores
10. Readers and Writers problem using Semaphores
11. Shell-programming exercises
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM II – Laboratory
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA252 Java Programming Lab LC - 4 2 50 25 3 2
LC C

1) Write a program to calculate salary of n employees using concept of classes with

constructors and methods.
2) Write a program to demonstrate e-commerce website using inheritance, abstract class and
dynamic polymorphism.
3) Write a program to demonstrate various arithmetic calculations using packages.
4) Write a program to demonstrate client-server environment using multithreading.
5) Write a program to demonstrate mutual exclusion using thread synchronization.
6) Write a program to demonstrate Linked list class.
7) Write a program to demonstrate Hash set and Iterator classes.
8) Write a program to demonstrate Enumeration and Comparator interfaces.
9) Write a program to accept data and display output in key, value pair.
10) Write a program to create a registration form with different controls, menus and
demonstrate event handling.
11) Write a program to copy data from one file to another file.
12) Write a program to merge contents of two files and display output on console.
13) Write a program to illustrate Serialization.
14) Write a program to retrieve web page using URL class.
15) Write a program to load and display image and perform gray scale.
Note: A minimum of Ten Programs should be done by the end of the semester.
 With effect from the academic year 2019-2020
Scheme of
Hours / Examination
MCA SEM II – Laboratory
week MaxMar Duration(hr
ks s)
Cat Cr
Course Course e- L/ e- SE CI
P SEE CIE
Code Title gor T dit E E
y s
MCA253 Database Management Systems LC - 4 2 50 25 3 2
LC Lab C

Creation of database (exercising the commands for creation).

1. Simple to Complex condition query creation using SQL Plus.
2. Usage of Triggers and Stored Procedures.
3. Creation of Forms for Student information, Library information, Pay roll etc.
4. Writing PL/SQL procedures for data validation.
5. Report generation using SQL reports.
6. Creating password and security features for applications.
7. Usage of File locking, Table locking facilities in applications.
8. Creation of small full- fledged database application spreading over 3 sessions.
Note: The creation of sample database for the purpose of the experiments is expected to be
pre-decided by the instructor.