FirstRanker.com FirstRanker.com
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
--- Content provided by FirstRanker.com ---
KAKINADA – 533 003, Andhra Pradesh, India
MASTER OF COMPUTER APPLICATIONS (MCA)
COURSE STRUCTURE & SYLLABUS
(Applicable for batches admitted from 2019-2020)
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
--- Content provided by FirstRanker.com ---
MCA I SEMESTER
S.No | Code | Courses | L | T | P | C | |
---|---|---|---|---|---|---|---|
1 | R19MCA1101 | Problem Solving with C | 3 | 0 | 0 | 3 | |
2 | R19MCA1102 | Computer Organization | 3 | 0 | 0 | 3 | |
3 | R19MCA1103 | Discrete Mathematical Structures | 3 | 0 | 0 | 3 | |
4 | R19MCA1104 | Probability and Statistics | 3 | 0 | 0 | 3 | |
5 | R19MCA1105 | Accounting and Financial Management | 3 | 0 | 0 | 3 | |
6 | R19MCA1106 | English Language Communication Skills Lab | 0 | 0 | 3 | 1.5 | |
7 | R19MCA1107 | Problem Solving with C Lab | 0 | 0 | 3 | 1.5 | |
8 | R19MCA1108 | IT Workshop (Lab) | 0 | 0 | 3 | 1.5 | |
Total Credits | 19.5 |
MCA II SEMESTER
S.No | Code | Courses | L | T | P | C | |
---|---|---|---|---|---|---|---|
1 | R19MCA1201 | Data Structures | 3 | 0 | 0 | 3 | |
2 | R19MCA1202 | Operating Systems | 3 | 0 | 0 | 3 | |
3 | R19MCA1203 | Software Engineering | 3 | 0 | 0 | 3 | |
4 | R19MCA1204 | OOP Through Java | 3 | 0 | 0 | 3 | |
5 | R19MCA1205 | Optimization Techniques | 3 | 0 | 0 | 3 | |
6 | R19MCA1206 | OOP Through Java Lab | 0 | 0 | 3 | 1.5 | |
7 | R19MCA1207 | Data Structures Lab | 0 | 0 | 3 | 1.5 | |
8 | R19MCA1208 | Operating Systems and Linux Lab | 0 | 0 | 3 | 1.5 | |
Total Credits | 19.5 |
MCA III SEMESTER
--- Content provided by FirstRanker.com ---
S.No | Code | Courses | L | T | P | C | |
---|---|---|---|---|---|---|---|
1 | R19MCA2301 | Database Management Systems | 3 | 0 | 0 | 3 | |
2 | R19MCA2302 | Computer Networks | 3 | 0 | 0 | 3 | |
3 | R19MCA2303 | Design and Analysis of Algorithms | 3 | 0 | 0 | 3 | |
4 | R19MCA2304 | Advanced Java Programming | 3 | 0 | 0 | 3 | |
5 | R19MCA2305 | Object Oriented Analysis and Design | 3 | 0 | 0 | 3 | |
6 | R19MCA2306 | Database Management Systems Lab | 0 | 0 | 3 | 1.5 | |
7 | R19MCA2307 | Advanced Java Programming Lab | 0 | 0 | 3 | 1.5 | |
8 | R19MCA2308 | OOAD through UML Lab | 0 | 0 | 3 | 1.5 | |
Total Credits | 19.5 |
MCA IV SEMESTER
S.No | Code | Courses | L | T | P | C | |
---|---|---|---|---|---|---|---|
1 | R19MCA2401 | Data Warehousing and Data Mining | 3 | 0 | 0 | 3 | |
2 | R19MCA2402 | Full Stack Technologies | 3 | 0 | 0 | 3 | |
3 | R19MCA2403 | Python Programming | 3 | 0 | 0 | 3 | |
4 | R19MCA2404 | Elective-1
| 3 | 0 | 0 | 3 | |
5 | R19MCA2405 | Elective-2
--- Content provided by FirstRanker.com --- | 3 | 0 | 0 | 3 | |
6 | R19MCA2406 | Full Stack Technologies Lab | 0 | 0 | 3 | 1.5 | |
7 | R19MCA2407 | Data Mining with R Lab | 0 | 0 | 3 | 1.5 | |
8 | R19MCA2408 | Python Programming Lab | 0 | 0 | 3 | 1.5 | |
Total Credits | 19.5 |
MCA V SEMESTER
S.No | Code | Courses | L | T | P | C | |
---|---|---|---|---|---|---|---|
1 | R19MCA3501 | Cryptography and Network Security | 3 | 0 | 0 | 3 | |
2 | R19MCA3502 | Big Data Analytics | 3 | 0 | 0 | 3 | |
3 | R19MCA3503 | Machine Learning | 3 | 0 | 0 | 3 | |
4 | R19MCA3504 | Elective-3
--- Content provided by FirstRanker.com --- | 3 | 0 | 0 | 3 | |
5 | R19MCA3505 | Elective-4
--- Content provided by FirstRanker.com --- | 3 | 0 | 0 | 3 | |
6 | R19MCA3506 | Cryptography and Network Security Lab | 0 | 0 | 3 | 1.5 | |
7 | R19MCA3507 | Big Data Analytics Lab | 0 | 0 | 4 | 2 | |
8 | R19MCA3508 | Machine Learning with Python Lab | 0 | 0 | 3 | 1.5 | |
Total Credits | 20 |
MCA VI SEMESTER
S.No | Code | Courses | L | T | P | C | |
---|---|---|---|---|---|---|---|
1 | R19MCA3601 | Project Seminar | 0 | 0 | 0 | 2 | |
2 | R19MCA3602 | Dissertation/Thesis | 0 | 0 | 0 | 10 | |
Total Credits | 12 |
MCA I Semester
Problem Solving with C
Course Objectives: This course is aimed at enabling the students to
--- Content provided by FirstRanker.com ---
- Formulate simple algorithms for
- ms (in C language).
- Test and execute the programs and correct syntax and logical errors.
- Implement conditional branching, iteration and recursion.
- Decompose a problem into functiarithmetic and logical problems.
- Translate the algorithms to prograons and synthesize a complete program using divide and conquer approach.
- Use arrays, pointers and structures to formulate algorithms and programs.
- Apply programming to solve matrix addition and multiplication problems and searching and sorting problems.
- Apply programming to solve simple numerical method problems, namely root finding of function, differentiation of function and simple integration.
--- Content provided by FirstRanker.com ---
Course Outcomes (COs): At the end of the course, student will be able to
--- Content provided by FirstRanker.com ---
- Understand the basic concepts used in computer programming
- Write, compile and debug programs in C language
- Design programs involving decision structures, loops and functions.
- Understand about the application and implementation of 2-dimentional array, structures and strings
- Understand the dynamics of memory by the use of pointers.
- Develop solutions to problems using derived data types and files.
--- Content provided by FirstRanker.com ---
UNIT – I:
Introduction to Computers: Introduction to computer programming, Algorithm, flow chart, Program development steps. Computer languages: Machine level, Assembly level and High-level language. Number System: Conversions- decimal, binary, octal, hexadecimal. 'C' Fundamentals: Structure of a C-program, C-character set, C Tokens- variables, constants, identifiers, data types and sizes, operators
UNIT – II:
I/O Functions: Header files, Standard I/O library functions-formatted I/O functions. Decision making statements: simple if, if-else, nested if-else, else-if ladder, switch-case statements and sample programs. Iterative Statements: for, while, do-while. Jump Statements-break, continue, goto
--- Content provided by FirstRanker.com ---
UNIT – III:
Arrays: declaration, initialization, storing and accessing elements of 1-D, 2-D and multidimensional arrays, Array Applications: addition, multiplication, transpose, symmetry of a matrix, Strings: declaration, initialization, reading and writing characters into strings, string operations, character and string manipulation functions
UNIT – IV:
Functions- declaration, definition, prototype, function call, return statement, types of functions, parameter passing methods, and function recursion, Pre-processor: #define, #include Statement, #ifdef, #endif, and storage classes.
--- Content provided by FirstRanker.com ---
UNIT – V:
Structure and Union: Declaration, initialization, storing and accessing elements by using structure and union, Pointers: Introduction to pointers, defining a pointer variable, Pointer to Pointer, Examples of pointers, using pointers in expressions, pointers and arrays. Files: Definition, Input and output operation into file.
Text Books:
1. Programming in C, 3rd edition, Ashok N. Kamthane, Pearson
2. Computer science, A structured programming approach using C, Third edition, B.A. Forouzan and R. F. Gilberg, Thomson
--- Content provided by FirstRanker.com ---
Reference Books:
1. The C Programming Language, B.W. Kernighan, Dennis M. Ritchie, PHI/ Pearson.
2. C Programming with problem solving, J.A. Jones & K. Harrow, Dreamtech Press
3. Programming in C,, 3rd Edition, Stephen G. Kochan, Pearson
--- Content provided by FirstRanker.com ---
MCA I Semester
Computer Organization
Course Objectives:
The objectives of this course are to
--- Content provided by FirstRanker.com ---
- Conceptualize the basics of organizational and architectural issues of a digital computer.
- Learn the function of each element of a memory hierarchy.
- Study various data transfer techniques in digital computer.
Course Outcomes(COs): At the end of the course, student will be able to
- Understand the basic organization of computer and different instruction formats and addressing modes
- Analyze the concept of pipelining, segment registers and pin diagram of CPU.
- Understand and analyze various issues related to memory hierarchy
- Evaluate various modes of data transfer between CPU and I/O devices
- Examine various inter connection structures of multi processors
--- Content provided by FirstRanker.com ---
UNIT I:
--- Content provided by FirstRanker.com ---
Basic Structure of Computers: Functional unit, Basic Operational concepts, Bus structures, System Software, Performance- Processor clock, basic performance equation, pipelining and super scalar operations, clock rate, CISC,RISC, performance measurement, the history of computer development- generations.
UNIT II:
Instruction and Instruction Sequencing: Register Transfer Notation, Assembly Language Notation, Basic Instruction Types, Addressing Modes, Basic Input/output Operations, role of Stacks and Queues in computer programming equation. Component of Instructions: Logic Instructions, shift and Rotate Instructions.
UNIT III:
Type of Instructions: Arithmetic and Logic Instructions, Branch Instructions, The Memory Systems: Basic memory circuits, Memory System Consideration, Read-Only Memory: ROM, PROM, EPROM, EEPROM, Flash Memory, Cache Memories: Mapping Functions, interleaving, Secondary Storage: Magnetic Hard Disks, Optical Disks
--- Content provided by FirstRanker.com ---
UNIT IV:
Input/Output Organization: Accessing I/O Devices, Interrupts: Interrupt Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices, Direct Memory Access, Buses: Synchronous Bus, Asynchronous Bus, Interface Circuits, Standard I/O Interface: Peripheral Component Interconnect (PCI) Bus, Universal Serial Bus (USB)
UNIT V:
Processing Unit: Fundamental Concepts: Register Transfers, Performing an Arithmetic or Logic Operation, Fetching a Word from Memory, Execution of Complete Instruction, Hardwired Control, Micro programmed Control: Microinstructions, Micro program Sequencing, Wide Branch Addressing Microinstructions with next –Address Field
--- Content provided by FirstRanker.com ---
Text Books:
1. Computer Organization, 5th Edition, Carl Hamacher, Zvonks Vranesic, Safea Zaky, McGraw Hill
2. Computer Architecture and Organization, 3rd Edition, John P. Hayes, McGraw Hill
Reference Books:
1. Computer Organization and Architecture, Sixth Edition, William Stallings, Pearson/PHI
--- Content provided by FirstRanker.com ---
2. Structured Computer Organization, 4th Edition, Andrew S. Tanenbaum, PHI/Pearson
3. Fundamentals or Computer Organization and Design, Sivaraama Dandamudi Springer Int. Edition
MCA I Semester
--- Content provided by FirstRanker.com ---
Discrete Mathematical Structures
Course Objectives:
The objective of this course is to provide the necessary back ground of discrete structures with particular reference to the relationships between discrete structures and their data structure counterparts including algorithm development.
Course Outcomes(COs): At the end of the course, student will be able to
- Perform operations on various discrete structures such as sets, functions, relations, and sequences.
- Ability to solve problems using Counting techniques, Permutation and Combination, Recursion and generating functions
- Apply algorithms and use of graphs and trees as tools to visualize and simplify Problems
- Use of K-Maps and Truth Tables to construct and verify correctness of a Boolean expression
- Create the various properties of algebraic systems like Rings, Monoids and Groups
--- Content provided by FirstRanker.com ---
UNIT I:
--- Content provided by FirstRanker.com ---
Mathematical Logic: Statements and notations, Connectives, Well formed formulas, Truth tables, tautology, equivalence implication, Normal forms, Theory of inference for the statement calculus, Rules of inference, Consistency of premises and indirect method of proof, Automatic Theorem Proving Predicate calculus: Predicates, statement functions, variables and quantifiers, predicate formulas, free & bound variables, universe of discourse, inference theory of predicate calculus
UNIT II:
Set theory & Relations: Introduction, Relations and ordering, Properties of binary Relations, Equivalence, Compatibility Relations, Partial ordering, Hasse diagram. Functions: composition of functions, Inverse Function, Recursive Functions, Lattice and its Properties, Pigeon hole Principles and its application. Algebraic structures: Algebraic systems, Examples and general properties, Semi groups and monoids, groups, sub groups, Definitions, Examples, mom orphism, Isomorphism and related problems.
UNIT III:
Elementary Combinatorics: Basis of counting, Enumeration of Combinations & Permutations, Enumerating of Combinations & Permutations with repetitions and constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, principles of Inclusion – Exclusion
--- Content provided by FirstRanker.com ---
UNIT IV:
Recurrence Relations: Generating Function of Sequences, Calculating Coefficient of generating functions, Recurrence relations, Solving recurrence relation by substitution and Generating functions, the method of Characteristic roots, Solution of Inhomogeneous Recurrence Relation.
UNIT V:
Graph Theory: Representation of Graph, Spanning Trees, BFS, DFS, Kruskals Algorithm, Binary trees, Planar Graphs, Graph Theory and Applications, Basic Concepts, Isomorphism and Sub graphs, Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers
--- Content provided by FirstRanker.com ---
Text Books:
1. Discrete Mathematical Structures with Applications to computer science J.P Tremblery, R.Manohar, TMH
2. Discrete Mathematical for computer Scientists & Mathematicians “ J.L. Molt, A.Kandel, T.P.Baker, PHI
Reference Books:
1. Elements of Discrete Mathematics, C L Liu, DP Mohanpatra, TMH
--- Content provided by FirstRanker.com ---
2. Discrete Mathematics, Schaum's Outlines, Lipschutz, Lipson, TMH
3. Discrete Mathematical Structures, 6th edition, Kolman, Busby, Ross, PHI, 2009
4. Discrete Mathematics, 6th edition Johnsonbaugh, Pearson, 2005
5. Discrete Mathematics, Malik, Sen, 6th ed., Cengage Learning, 2004
6. Discrete Mathematics for computer science, Bogart, Stein and Drysdale, Springer, 2005
--- Content provided by FirstRanker.com ---
MCA I Semester
Probability and Statistics
Course Objectives:
--- Content provided by FirstRanker.com ---
This course aims to provide an understanding of the basic concepts in probability theory and statistical analysis. Students will learn the fundamental theory of distribution of random variables, the basic theory and techniques of parameter estimation and tests of hypotheses. After taking this course, students will be able to use calculators and tables to perform simple statistical analyses for small samples and use popular statistics packages, such as SPSS, S-Plus, R or Mat Lab, to perform simple and sophisticated analyses for large samples.
Course Outcomes(COs): At the end of the course, student will be able to
- Demonstrate the basic knowledge on fundamental probability concepts, including random variable, probability of an event, additive rules and conditional probability.
- Derive the probability density function of transformations of random variables and use these techniques to generate data from various distributions
- Demonstrate the basic statistical concepts and measures
- Discuss several well-known distributions, including Binomial, Geometrical, Negative Binomial, Normal and Exponential Distribution
- Prove hypotheses testing
--- Content provided by FirstRanker.com ---
UNIT I:
Probability: Sample space and events, Probability - the axioms of probability, Some Elementary theorems - Conditional probability, Baye's theorem, Random variables, Discrete and continuous distributions - Distribution function.
UNIT II:
--- Content provided by FirstRanker.com ---
Binomial, Poisson, normal distribution - related properties, Moment generating function, Moments of standard distributions – properties.
UNIT III:
Population and samples, Sampling distribution of mean (with known and unknown variance), proportion, variances, Sampling distribution of sums and differences, Point and interval estimators for means, variances, proportions.
UNIT IV:
Statistical Hypothesis – Errors of Type I and Type II errors and calculation, One tail, two-tail tests, Testing hypothesis concerning means, proportions and their differences using Z-test, Tests of hypothesis using Student's t-test, F-test and x² test.. Test of independence of attributes, ANOVA for one-way and two-way classified data.
--- Content provided by FirstRanker.com ---
UNIT V:
Statistical Quality Control methods, Methods for preparing control charts, Problems using x-bar, p, R charts and attribute charts, Simple Correlation and Regression, Queuing Theory: Pure Birth and Death Process M/M/1 Model and Simple Problems.
Text Books:
1. Probability and Statistics for Engineers, Miller and John E. Freund, Prentice Hall of India
--- Content provided by FirstRanker.com ---
2. Probability and Statistics, D. K. Murugeson & P. Guru Swamy, Anuradha Publishers
Reference Books:
1. Probability, Statistics and Random processes. T. Veerrajan, Tata Mc.Graw Hill, India
2. Probability, Statistics and Queuing theory applications for Computer Sciences, 2 ed, Trivedi, John Wiley
--- Content provided by FirstRanker.com ---
MCA I Semester
Accounting and Financial Management
Course Objectives:
The main objectives of this course are
--- Content provided by FirstRanker.com ---
- To understand the basic concepts and processes used to determine product costs
- To be able to interpret cost accounting statements
- To be able to analyze and evaluate information for cost ascertainment, planning, control and decision making
Course Outcomes (COs): At the end of the course, student will be able to
- Understand the balance sheet preparation and perform analysis
- Understand the budget preparation and control of a company
- Decide about the state of affairs of a particular firm / company
- Ensure the preparation of fiscal policies of the organization
- Ensure the factors to be considered in investment policies
--- Content provided by FirstRanker.com ---
UNIT I:
--- Content provided by FirstRanker.com ---
Accounting Generally Accepted Accounting Principles (GAAP) & accounting standards, Characteristics and limitations of single entry system, double entry system of accounting, introduction of basis books of accounts, ledgers, Preparation of trail balance, Final accounts, company final accounts, Users of Accounting Information, Role of Accountant in modern Organizations.
UNIT II:
Financial Management, meaning and scope, role, objectives of time value of money over vitalization, under capitalization, profit maximization, wealth maximization, EPS maximization. Ration Analysis, advantages, limitations, Fund flow analysis, meaning, importance, preparation and interpretation of Funds flow and cash flow statements, statements of changes in working capital
UNIT III:
Costing: nature and importance and basic principles, Elements of cost, Absorption costing Vs. Marginal costing, financial accounting Vs. cost Accounting Vs. management accounting. Marginal costing and Break, even Analysis: nature, scope and importance, practical applications of marginal costing, limitation and importance of cost, volume, profit analysis, short run decisions
--- Content provided by FirstRanker.com ---
UNIT IV:
Standard costing and budgeting : nature, scope and computation and analysis, materials variance, labour variance and sales variance, cash budget, sales, budget, flexible Budgets, master budgets.
UNIT V:
Introduction to computerized accounting system: coding logic and codes, master files, transaction files, introduction documents used for data collection, processing of different files and Outputs obtained.
--- Content provided by FirstRanker.com ---
Text Books:
1. Accounting for Managers, P. Vijaya Kumar, and Himalaya Publications
2. Accounting for Management. Vijaya Kumar.TMH
3. Financial Accounting, S.N Maheswari and S.K. Maheswari, Vikas
4. Financial Accounting, A. Mukherjee and M. Heneef, TMH
--- Content provided by FirstRanker.com ---
Reference Books:
1. Basic Financial Accounting for Management, Ambaresh Gupta, Pearson
2. Accounts And Finance for Non accounts, Chatterjee, D.K.Himalaya
--- Content provided by FirstRanker.com ---
This download link is referred from the post: RGUHS MBBS 1st Year Last 15 Years 2010-2025 Previous Question Papers (Rajiv Gandhi University of Health Sciences)