Master of Computer Applications (MCA)
by Atlanta Computer InstituteNagpur |
Request Info |
| Medium of instruction: | English |
MCA First Year (Semester - 1)
1CSA-1 : Computer Organization & Architecture
Principles of computer design:
Software, hardware interaction, layers in computer architecture, Central processing and machine language, instructions, addressing modes, instruction types, instruction set selection, Instruction and execution cycle.
Control Unit:
Data path and control path design, microprogramming v/s hardwired control, Pipelining in CPU designing, RISE v/s CISC, Superscalar processors.
Memory Subsystems:
Storage technologies, memory array organization, memory hierarchy, interleaving, cache memory and virtual memory including architectural aids to implement these.
Input-Output Processing:
Bus interface, data transfer techniques, I/O interrupts and channels.
Performance Evaluation:
SPEC marks, Transaction Processing Benchmarks.
1CSA-2 : OBJECT ORIENTED PROGRAMMING USING C++
UNIT – 1 : Programming Logic :
Problem Analysis, Process Analysis, Conceptual development of solution.
Development tools : Algorithm, flowcharts and pseudo code (definition and its characteristics).
Programming Structure : Sequence, selection iteration, (Problems).
Language evolution : Machine, Assembly, High Level. Translators: Compiler, Interpreter and assembler. The compilation process, linker, Loader. Study of HLL, Characteristics of Good Language, Generation of languages.
UNIT – 2 Object Oriented Concepts, Tokens, Expressions and Control Structures
Object Oriented Methodology, Basic Concepts/ Characteristics Of OOP, Advantages And application Of Oops, Procedural Programming Vs Oops. Introduction: C++ Basics, Character Set, Tokens, Keywords, Identifiers; Basics, ,User Defined And Derived Data Types, Symbolic Constants, variables, Casting , Different Types Of Operators Their Precedence, Expression. Control And Looping Statements, Console I/0 Operation, Manipulators And Enumeration.
UNIT-3 : Functions, Structure, Classes And Object
Function :Function Prototyping ,Call And Return By Reference, Inline Function, Default And Cost Arguments, Function Overloading .Structure, Union And enum: Definition, Passing Structure Of Functions. Classes And Object : Specifying A Class , Creating Objects, Private & Public Data Members And Member Functions. Defining Inline Member Functions, Static Data members And Member Functions. Arrays Within Class, Arrays Of Objects, Objects As Function Arguments, Returning Objects.
Unit-4; Constructor And Destructors, Operators Overloading And Inheritance
Constructor And Destructors: Introduction, Parameterized Constructors, Multiple Constructors In A Class, Constructors With Default Arguments, Dynamic Initialization Of Objects, Copy Constructors, Dynamic Constructors, Const Objects, Destructors.
Operator Overloading: Definition, Unary And Binary Overloading Rules For Operatos Overloading. Inheritance: Defining Derived Classes, Single, Multilevel, Multiple Inheritance, Constructors And Destructors In Derive Classes.
UNIT- 5: Pointers Virtual & friend functions and file handling:
Pointer To Objects, This Pointer ,”New’ And “Delete’ Operator, Virtual Functions, Friend Functions, Opening, Closing A File, File Modes,. File Pointers And their manipulations. Sequential i/p and o/p operations, Updating a file , random access, error handling during file operation, command line arguments.
1 CSA-3 : Operating System
UNIT-1: Introduction:
Operatin G System As An Extended Machine, Operating System As An Resource Manager, History Of Operating System As An Resource Manager, History Of Operating System & Its Generations, Mainframe Operating System, Server Operating System, Multiprocessor Operating System, Personal Computer Operating System, Real Time Operating System, Embedded Operating System, Smart Card Operating System, Processor, Memory, I/O Devices, Buses, Processes, Dead Locks, Memory Management, I/P And O/P Files, Security, The Shell, Systems Calls, Operating System Structure.
UNIT-2: Processess & Threads
Process Model, Process Creation, Process Termination, Process Hierarchies, Process State, Implementation Of Processes, Thread Model, Thread Usage, Implementing Thread In User Space & Kernel, Hybrid Implementation, Scheduler Activation, Pop-Up Threads, Inter Process Communication , Scheduling.
UNIT-3 : File System Concepts In Operating System
File Naming, File Structure, File Types, File Access, File Attributes, File Operations, Memory Mapped Files, Single Level Directory System, Two Level Directory System, Hierarchical Directory System, Path Name, Directory Operations, File System Layouts, Implementing Files, Implementing Directorials, Shared Files, Cd-Rom File System, Ms-Dos File System, Window 98 File System, Unix File System.
UNIT-4 : Unix Operating System
History Of Unix File System: Pdp-11 Unix, Portable Unix, Berkeley Unix, Standard Unix, Linux, Overview Of Unix : Unix Goals, Interface To Unix. The Unix Shell, Unix Utility Program, Kernal Structure.
Processes In Unix: Processes Management System Calls, Implementation Of Processes In Unix, Booting Unix, Memory Management In Unix, I/P & O/P In Unix, The Unix File System, Security in Unix.
Unit- 5 : Window S 2000 Operating System
History Of Windows 2000, Programming Windows 2000, System Structure, Processes And Threads In Windows 2000, Memory Management In Windows 20000, I/P O/P In Window 2000. The Window 2000 File System, Security In Windows 2000.
1CSA-4 : Digital Electronics & Micropocessor
UNIT-1: Number System And Data Representation
Number System: Binary, Octal, Decimal And Hexadecimal Number System And Their Interconversion. Binary Codes: Bcd, Excess 3,Parity , Gray, Ascii And Ebcdic Codes , Their Advantages And Disadvantages. Data Representation: (Related To 8 Bit Number), Real Number Representation, Underflow, Overflow, Range And Accuracy Of Numbers.
UNIT-2: Binary Arithmetic
Binary Addition, Decimal Subtraction Using 9’s And 10’s Complement, Binary Subtraction Using 1’s And 2’nd Compliment, Multiplication And Division .
Logic Gates: Truth Table, Properties And Symbolic Representation Of NOT, AND ,OR,NOR,NAND ,EX-OR,EX – NOR GATES, NOR and NAND GATES As A Universal Gates.
UNIT-3 Boolean Algebra
Laws And Identities Of Boolean Algebra, Demorgan’s Theorem, Use Of Boolean Algebra For Simplification Of Logic Expression, Karnaugh Map For 2, 3, 4 Variable, Simplification Of Sop And Pos Logic Expression Using K-Map.
UNIT-4: Combinational / Sequential Circuits
Half Adder, Full Adder, Parallel Adder, Half Substractor, Full Substractor, 4 Bit Binary Adder/ Substractor, Multiplexer, dEmultiplexer, Decoder, Encoder, Parity Detector.Construction And Working With Timong Diagram Of Bistable, Monostable And Astable Multivibrator Using Logic Gates.
Sequential Circuits : Flip-Flop: Construction And Working Of RSFF, CKRSFF, DFF, TFF, JKFF AND JKMSFF, Counters: Construction And Working Of Asynchronous, Synchronous, Up-Down Counter, Shift Register And Their Types, Ring Counter And Johnson Counter With Their Timing Diagram.
UNIT-5: Architecture Of 8086
Block Diagram Of 8086, Pin Diagram 0f 8086, Minimum And Maximum Mode, Addressing Modes, Instruction Set : Data Transfer, Arithmetic, Logical, String Manipulation, Contril Transfer, Unconditional Branch, Conditional Branch, Flag, Processor Control.
UNIT-6: Assembly Language Programming Assembler Directives And Operators, Assembly Language Programs, Machine Level Programs, Coding The Programs, Programming With Assembler, Masm, Using Debug, Alp Examples
1CSA-5 : System Analysis & Design
Unit-1
System Concept-System Concept , Elements Of The System, Types Of System. The System Development Life Cycle- Introduction , Consideration For Candidate Systems, Prototyping. The Role Of The System Analyst – Introduction , Multi Faceted Role Of The Analyst, The Analyst/ User Interface, Rising Position In System Development .
Unit-2
System Planning & The Initial Investigation- Introduction, Base For Planning In System Analysis, Initial Investigation.
Information Gathering-Introduction , Information Gathering Tools. The Tools Of Structured Analysis - Introduction, The Tools Of Structured Analysis, Pros & Cons Of Each Tool.
Feasibility Study- Introduction, System Performance Definition, Feasibility Study.
Unit-3:
Cost Benefit Analysis - Introduction, Data Analysis, Cost Benefit Analysis, Procedure For Cost Benefit Determination.
System Design –Introduction, The Process Of Design, Design Methodology, Major Development Activities, Audit Considerations
I/P And O/P And Form Design- Introduction, I/P Design, O/P Design, Form Design.
Unit-4:
File Organization & Data Base Design- Introduction, File Structure, File Organization, Database Design, Data structure , Normalization And The Role Of Database Administrator.
System Implementation & Software Maintenance- Introduction, Conversion, Post Implementation Review, Software Maintenance.
Unit-5:
Hardware/ Software Selection & The Computer Contract-
Introduction, The Computer Industry, A Procedure For Hardware/ Software Selection, Financial Considerations In Selection, The Computer Contracts.
Project Scheduling & Software - Introduction, Project Management Security, Disaster/ Recovery- Introduction, System Security, Disaster/ Recovery Planning, Ethics In System Development.
MCA -Master of Computer Applications Second Semester Data Structure
MCA FIRST YEAR (SEMESTER -2)
2CSA-1 : DATA STRUCTURES
UNIT-1 :INTRODUCTION TO DATA STRUCTURES:
ABOUT DATA STRUCTURE
- Information And Meaning, Binary And
Decimal Integer, Concept Of Data
Types, Data Structure Data
Representation / Implementation, Abstract
Data Type, Sequence Of Value Definition, ADT For Varying
Length Data String.
Arrays, Records
& Pointers-About Arrays, Records & Pointers; Their Implementation In Memory, Arrays As An Adt, Using One Dimensional Array & Two Dimensional, About Record & Pointers.
Linked List – Concept Of Singly Linked
List, Operations On Linked List, Inserting And Removing
Nodes Froma List, Array Implementation Of Lists, Limitation Of The
Array,Implementation Over
Linked List, Concept Of Doubly Linked List, Generalized List.
UNIT-2 STACK & QUEUES
Stacks- Definition And Example, Primitive Operations, Stack As An ADT, Implementation Of Stacks As An Array And Linked List, Operations On Stacks, Stack Stored As A Linked List, Arithmetic Expression, Converting An Expression From Infix To Postfix.
Queues - Definition And Examples Of Queues, Queues As An Abstract Data Type, Queues Stored As A Linked List, Circular Queue, Implementation Of Queues As An Array And Linked List, Operations On Queues, Priority Queue & Dequeue.
UNIT-3: RECURSION:
Recursive Definition And Process, Factorial Function, Multiplication Of Natural Numbers, Fabonacci Sequence, Properties Of Recursive Definitions, Writing Recursive Programs (The Tower Of Hanoi Problem, Converting Prefix To Postfix Using Recursion), Simulating Recursion( Return From A Function, Implementing Recursive Function, Simulation Of Factorial)
UNIT-4: TREES & GRAPHS:
Trees- Definition Of Trees, Basic Terminology Of Trees,Binary Tree, Binary Tree Representation As An Array & Linked List, Application Of Trees, Binary Tree Traversal, Threaded Binary Tree, Height Balance Tree, B-Trees, General Trees.
Graphs : Basic Terminology Of Graphs, Implementation Of Graphs As An Arrays& Linked List, Operation On Graphs, Graphs Traversals.
UNIT-5: SORTING AND SEARCHING:
Sorting –Definition Of Sorting , Classification Of Sorting Techniques (Dictionary As An ADT, Sequencial Searching , Efficiency Of Sequential Searching ), Searching An Ordered Table, Binary Search.
MCA -Master of Computer Applications Second Semester Database Management Systems
MCA FIRST YEAR (SEMESTER -2 )
CSA-2 : DATABASE MANAGEMENT SYSTEMS
Unit-1: Database concept- Introduction, Data, Information Metadata, Terminology Of File, Association Between Fields, Entities And Their Attributes, Relationship Record And Files, Abstraction And Data Integration, Association Between Files( Record Types), Conventional File Processing System,Database System, Components Of Database Management System – (Classification Of DBMS Users, The Tree-Level Architecture Proposal For DBMS, Mapping Between View, Data Independence.
Unit-2 : Data Models- Introduction , Data Association-(Entities, Attributes And Associations, Relationship Among Entities, Representation Of Association And Relationship), Data Model Classification-(Approaches To The Relational Model, Hierarchical Model & Network Model Withan Examples), Entity – Relationship Model,
Concept Of File Organization – Sequential Files, Index-Sequential Files, Direct Files,Secondary Key Retrieval.
Unit-3: The Relational Model- Introduction,
Relational Database: Attributes And Domains, Tuples, Relation And Their Schemas Relation Representation, Keys, Relationship, Relational Operations, Integrity Rules.
Relational Algebra: Basic Operations,Relational Algebra Queries , Relational Calculus: Tuple Calculus, Domain Calculus.
Relational Database Manipulations: Introduction, Sql, Data Manipulations In Sql, QUEL, Data Manipulations In QUEL,QBE , Data Manipulations In Qbe.
UNIT-4: Relational Database Design- Relational Schema, Relational Design, Functional Dependency, Normalization, First –Second- Third Normal Forms, Relational With More Than One Candidates Key ,Good And Bad Decomposition, Multivalued Dependency, Fourth Normal Form, Fifth Normal Form.
Network Data Model: The Architecture Of Dbtg System, Schema & Subshcema, And DBTG Data Manipulation Facility.
Hierarchical Data Model: The Tree Concept, Architecture Of Anims System , Data Manipulation.
UNIT -5 : Database Operations And Maintence – Database Administrator (DBA, Database Security, Integrity And Control (User With Password And Complete / Limited Authorization, Encryption Of Data).
Concurrency Control : Problem Of Concurrent Access, Resource Looking, Deadlock.
Database Recovery : Restore, Backward & Forward Recovery.
Distributed Database : Introduction, Data Distribution, Deadlock In Distributed Systems, Security, Security And Protection, Homogeneous And Heterogeneous Systems. Knowledge Base And Database Systems, Expert Database Systems, Object Database System.
MCA -Master of Computer Applications Second Semester Discrete Maths and Graph Theory
MCA FIRST YEAR (SEMESTER -2)
2CSA – 3 DISCRETE MATHEMATICS & GRAPH THEORY
UNIT – 1 FUNDAMENTAL – Sets And Subsets, Operations On Sets Sequences, Division In The Integers, Matrices, Mathematical Strutures.
Logic – Proposition And Logical Operations, Conditional Statements, Methods Of Proof, Mathematical Induction.
UNIT – 2 Mathematical Logic – Statements And Notation, Connectives, Normal Forms, The Theory Of Inference For The Statement Calculus, The Predicate Calculus, Inference Theory Of The Predicate Calculus.
UNIT – 3 : Counting – Permutations, Combinations, The Pigeonhole Principle, Recurrence Relations.
Relations And Digraphs – Product Sets And Partitions, Relations And Digraphs, Relations And Digraphs, Paths In Relations And Digraphs, Properties Of Relations, Equivalence Relations, Computer Representation Of Relations And Digraphs, Manipulation Or Relations, Transitive Closure And Warshalli’s Algorithm.
Function –Definition And Introduction, Function For Computer Science, Permutation Functions, Growth Of Functions. Growth Of Functions.
UNIT – 4 Graph Theory – Basic Concept Of Graph Theory, Euler Paths And Circuits, Hamiltonain Paths And Circuits.
Other Relations And Structure – Partially Ordered Sets, Lattices, Finite Boolean Algebras’, Functions Of Boolean Algebras, Boolean Functions And Boolean Polynomials.
Trees – Introduction, Undirected Trees, Minimal Spanning Trees.
UNIT – 5: Semigroups And Groups- Binary Operations Revisited, Semigroups, Products And Quotients Of Semigrops, Groups, Products And Quotients Of Gropus.
Introduction To Computability Theory – Languages, Finite-State Machines, Semigroups, Machines And Languages.
MCA -Master of Computer Applications Second Semester Discrete Maths and Graph Theory
MCA FIRST YEAR (SEMESTER -2 )
2CSA – 3 DISCRETE MATHEMATICS & GRAPH THEORY
UNIT – 1 FUNDAMENTAL – Sets And Subsets, Operations On Sets Sequences, Division In The Integers, Matrices, Mathematical Strutures.
Logic – Proposition And Logical Operations, Conditional Statements, Methods Of Proof, Mathematical Induction.
UNIT – 2 Mathematical Logic – Statements And Notation, Connectives, Normal Forms, The Theory Of Inference For The Statement Calculus, The Predicate Calculus, Inference Theory Of The Predicate Calculus.
UNIT – 3 : Counting – Permutations, Combinations, The Pigeonhole Principle, Recurrence Relations.
Relations And Digraphs – Product Sets And Partitions, Relations And Digraphs, Relations And Digraphs, Paths In Relations And Digraphs, Properties Of Relations, Equivalence Relations, Computer Representation Of Relations And Digraphs, Manipulation Or Relations, Transitive Closure And Warshalli’s Algorithm.
Function –Definition And Introduction, Function For Computer Science, Permutation Functions, Growth Of Functions. Growth Of Functions.
UNIT – 4 Graph Theory – Basic Concept Of Graph Theory, Euler Paths And Circuits, Hamiltonain Paths And Circuits.
Other Relations And Structure – Partially Ordered Sets, Lattices, Finite Boolean Algebras’, Functions Of Boolean Algebras, Boolean Functions And Boolean Polynomials.
Trees – Introduction, Undirected Trees, Minimal Spanning Trees.
UNIT – 5: Semigroups And Groups- Binary Operations Revisited, Semigroups, Products And Quotients Of Semigrops, Groups, Products And Quotients Of Gropus.
Introduction To Computability Theory – Languages, Finite-State Machines, Semigroups, Machines And Languages.
MCA -Master of Computer Applications Second Semester JAVA
MCA FIRST YEAR (SEMESTER -2)
2CSA-4: JAVA PROGRAMMING
UNIT-1: Introduction To Java, Getting Started With Java, Applets And Application, Creating A Java Application, Creating A Java Applets, Object Oriented Programming In Java, Object And Classes, Behavior And Attributes, Creating A Class, Inhetitance Works, Single And Multiple Inheritance, Creating A Subclass.
Unit-2: Creating A New Object,accessing and setting class& instance variables, calling methods, references to objects, comaining objects, determining the class of an object, java class library, arrays, conditional & loops, how applets and application are different applets, passing parametrers to applets.
Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:
Using Frames, Using Components, Events, Using Windows Listener Interface, Learning About Container, Using Layout, Managers& Handling Awt Events.The Graphic Class Drawing & Filling, Text And Fonts, Creating Font Objects, Using Color Objects, Creating Animation In Java, Threads: What Are They & The Need, Writing With Threads.
Unit-4: Networking In Java, Windows Menu And Dialog Boxes,Creating Links Inside Applets, Opening Web Coonection, The Url Connection Class, Sockets, Package, Programming In Large, Programming In Small, Heading, Class, Interface.
Unit-5 : Exception, Creating And Using Threads, The Runable, Interface, Thread Tester, Thread Scheduling, I/P Stream , O/P Stream.
MCA -Master of Computer Applications Second Semester Stats and Numerical Maths
MCA FIRST YEAR (SEMESTER -2)
2CSA-5 Statistics & NUMERICAL MATHEMATICS
Unit – 1 introduction – definition of statistics, importance and scope of statistics, Limitations of statistics, Distrust of statistics.
Statistical data collection – primary and secondary data, Methods of collecting primary data, sources and secondary data census and sample investigation.
Presentation of statistical data – classification, tabulation, frequency distribution, diagrams and graphs.
Frequency distributions and Measure of Central Tendency – Frequency distribution, continuous Frequency distribution, Graphic Representation of a Frequency Distribution average or measures of central tendency or measures of Locations, Requisites for an ideal measure of central tendency – Arithmetic: Mean, Median, mode, geometric Mean and harmonic mean, eighted average, relationship amongst different averages.
UNIT – 2 Measures of dispersion, skewness and kurtosis – Meaning and significance of dispersion, Methods of measuring Dispersion – Range, quartile, mean deviation, standard deviation, coefficient of skewness, kurtosis, coefficient of dispersion, coefficient of variation.
Correlation and regression – definition of correlation, scatter diagram, karl pearson Coefficient of correlation, limits for correlation coefficient, definition of Regression, lines of Regression, Regression Curves, Regression Coefficients, properties of Regression coefficients, correlation analysis vs. Regression analysis.
UNIT – 3 Probability – Introduction, Definitions of various Terms, Mathematical or classical Probability, statistical or Empirical Probability Statistical or Empirical Probability, Mathematical Tools, sets and Elements of sets, operations on sets, axiomatic Approach to Probability, Probability function, Mathematical law of Addition of Probabilities and Conditional Probabilities, Independent event, bayes Theorem Geometric probability.
UNIT - 4 Random variables and Distribution functions – definition of random variable, distribution function, properties of Distribution function, Discrete Random variable, Probability density function, continuous random variable, continuous density function, continuous distribution function.
Mathematical Expectation and Generation function – Definition of mathematical expectation, addition & multiplication Theorem of expectation, co-variance, Expectation & variance of a Linear combination of random variables, moment generation function, some limits of moment Generating function, theorem of moment generating function, cumulants.
UNIT – 5 Theoretical discrete distributions – Introduction, Bernoulli distribution, Binomial Distribution, Poisson Distribution, Geometric Distribution.
Theoretical Continuous Distributions – Introductions normal distribution, game distribution, cauchy’s Distribution and central limit theorem.
| Classroom - Regular | ||||
| When | Duration | Where | Remarks | Price |
| Not Specified | Not Specified | Dharampeth, Nagpur (Center) | Not Specified | Price On Request |
| Not Specified | Not Specified | Medical Square, Nagpur (Center) | Not Specified | Price On Request |
Nagpur, Medical Square (Center):- 2nd Floor, Selokar Bhavan, Opposite Sangam Sweets Near Petrol Pump Medical Square, Nagpur, Maharashtra, India
Atlanta Computer Institute
ATLANTA COMPUTER INSTITUTE in Nagpur is Central India's Leading and Best Computer Education Institute in Nagpur. Atlanta Computer Institute Nagpur Centers has been conducting Training Classes from last 15 years. Atlanta Computer Institute Nagpur is An ISO 9001 : 2008 Certified Company. The Computer and IT courses taught are Basics, MS-Office, C, C++, Java, Advance Java, Oracle, Visual Basic, VB.Net, ASP.Net, C#.Net, Animation Courses, Web Page Designing, PHP and MySQL, AutoCAD, 3d Studio Max, Revit, Staad Pro, Pro-e, CATIA, Ansys, Unigraphics NX, CAD CAM, ArchiCAD, Hardware, Networking, Photoshop, Flash, Coreldraw, Graphic Design, Web Site Development, Joomla, Wordpress, Search Engine Optimization, Animation Courses, Software Testing, Primavera, MS Project, Embedded Systems, Programming Courses, Dot Net Courses, Multimedia, Action Script, Illustrator, Google Sketchup, Video Editing, Maya, ISTQB Software Testing, CCNA, CCNP, CCIE, MCSE, MCITP, MCP, MCTS, MCDBA, MCPD, MCTP, Red Hat Linux, E-commerce, Android, Ethical Hacking, Java Hibernate, Java Spring, Java EJB, Java UML, University Syllabus of BE, Poly, BCCA, BCA, MCA, MCM, BSc, MSc, 12th Std State CBSE and Live Projects. Project Guidance is provided for Final Year students. Crash and Fast Track and Regular Batches for every course is available.
