Karunya University MCA Syllabus

Hello sir, I’m student of Karunya University doing MCA. I want MCA syllabus form Karunya University for my exam preparation? Can any one here provide me PDF of syllabus of Karunya University?

[Pathak]

MCA syllabus has various question subjects in during course you are looking for MCA course syllabus of Karunya University:

Computers and Internet Fundamentals
Introduction to Information Technology
Computer System Architecture
Theory of Programming Languages
Microprocessors

Computers And Internet Fundamentals

Unit I : Introduction To Computer Organization Computer Organisation -Input technology tools -keyboard, mouse, pointing stick, touch screen, sound I/O . Automatic speech recognition system, light pen, par code reader, optical mark recognition, magnetic -ink character recognition, optical character recognition, image scanning- output technology tools.

Unit II : Printer Impact, non impact, ink jet, dot matrix, letter quality printer, laser printer, plotter, Terminal: VDU, Tele printer terminal, smart and intelligent terminals. Types of memories: fundamenta1s of memory concepts -core storage, semi conductor storage, bubble storage, card concepts, card devices, the tape system, tape devices, magnetic tape storage technology. Disk system: Disk concepts -disk storage technologies, magnetic hard disk storage technologies, optical diskstorage technologies – Brief history of micro processors (8088, 80286, 80386, 80486, Pentium etc) -types of computers –PC, mini, mainframe, super computer.
Unit : III Understanding the Internet, overview of the Internet
Unit : IV Connect to the net, Internet addresses, Mail.

Unit : V Using mail well , web , safety, security and privacy

MCA syllabus from Karunya University
CA102 INTRODUCTION TO INFORMATION TECHNOLOGY
Unit I : Software
Application software system software basics of operating system and networks operating
objectives – operating system as a user/computer interface, operating system a resource
manager – evolution of operating systems – serial processing, simple batch systems,
multiprogramd batch systems, timesharing systems, parallel systems, distributed systems,
real time systems DOS, UNIX, windows.
Unit II : Network Technologies and Concepts
Types of networks, communication media, communication processor – communication
methods, standards and protocols – internet – client/server – client/server as a business
model – types of client/server –implementation, distributed data in client / server
environment, advantages and disadvantages of client / server.
Unit III : Fundamentals of Information Technology
Information technology – information in the new business, a new key business resource,
information in an organization, transaction processing and customer integrated systems,
management information systems, work group support systems, decision support systems
and artificial intelligence, executive information systems, interorganisational systems.\
Unit IV : System Analysis
Definitions of systems analysis – starting a project – generating a broad alternative
solution – economic feasibility – tools and methods of gathering information. System
design : Data flow diagrams – user interface design – program design. Change over
procedures – performance evaluation – quality assurance : Inceptions and walk through
testing.
Unit V : Introduction to Database and Database Management Systems
Relational database model – entity classes and primary keys, defining relationship among
entities, structure or relational database – relational commercial language – SQL – SQL
integrity constrains, referential integrity – functional dependencies – assertions – triggers
– Relational database design : Normalization.
Text Books
1. Haag. Cummings, “Management Information Systems for the Information Age”,
Irwin McGraw Hill, 1998.
Reference Books
1. V. Rajaraman, Radhakrishnan, “An Introduction to digital Computers design”,
PHI 1997
2. Andrews.S Tannenbaum, “Modern Operating Systems, second edition, 1996.
3. Bibnim C. Desai, “An Introduction to Database Systems”, West Publishing
Company.
CA201 COMPUTER SYSTEM ARCHITECTURE
Unit : I
Register transfer and microoperations, Register transfer language, Register transfer, Bus
and memory transfers, Arithmetic, logic and shift micro operations
Basic computer organization and design: Instruction Codes, Computer Instructions,
Timing and Control Instruction Cycle, Memory-Reference Instructions, Input-Output and
Interrupt. (Chapter 4 & 5)
Unit : II
Central Processing Unit : General Register Organization, Stack Organization, Instruction
Formats, Addressing Modes, Data Transfer and Manipulation, Program Control, Reduced
Instruction Set Computer (RISC). (Chapter 8)
Unit : III
Microprogramd control : Control Memory, Address Sequencing.
Processings: Parallel Processing, Pipelining, Vector Processing, Array Processors, and
Characteristics of Multiprocessors
Computer arithmetic: Addition and Subtraction, Multiplication Algorithms, Division
Algorithms. (Chapter 7,10)
UNIT : IV
Input-output organization: Peripheral Devices, Input-Output Interface, Asynchronous
Data Transfer, Modes of Transfer, Direct Memory Access (DMA). (Chapter 11)
Unit : V
Memory organization: Memory Hierarchy, Main Memory, Associative Memory, Cache
Memory, Virtual Memory.(chapter 12)
Text Book
1. M. Morris Mano, Computer System Architecture, Third Edition, Prentice Hall of
India, 1996. (Chapters 4,5,7,8,10-12 only)
Reference book
1. William Stallings, Computer Organization and Architecture, Fourth Edition,
Prentice Hall of India, 1996.
CA202 THEORY OF PROGRAMMING LANGUAGES
Unit I
Defining syntax, character set, BNF, syntax graphs, syntax and program readability.
Programming languages, Variables expression and statements assignment statement.
Unit II
Binding time & storage allocation, constant & initialization, expression, conditional
statements. Interactive statement, go to statement & labels, types, data types and typing,
enumerated types, elementary, pointers.
Unit III
Structured data type, type coersion, type equivalence, scope and extent, basic, run time
implementation, binding scope & extent. Procedure, featers.
Unit IV
Parameter evaluation & parsing, call by name, specification of objects in a procedure,
aliasing, overloading generic functions, coroutines. Data abstraction, Introduction,
abstract data types, examples.
Unit V
Exception handling, need & issues in exception handling. Concurrency, concepts,
semaphores, monitors, message passing, input &output. Concepts & difference between
functional program, data flow programs & Object oriented programs.
Text Book
1. Ellis Horowirz, “Fundamenals of Programming Language”, Galgotia
Publications, 1995.
Reference books
1. Terrance W Pratt, “Theory of Programming Language”
2. Ravi Sethi, “Computer in Programming Language”
CA203 MICROPROCESSORS
Unit I
Intel 8086/8088 Internal Architecture : Architecture of 8086, Bus Interface Unit,
Execution Unit, Instruction Set, Addressing Modes, minimum and maximum modes of
operation.
Unit II
Assembler 86: Reserved Words, Segment Directives, declaratives, macros, simple
assembly language programming.
Unit III
Memory Section : General features of Memory Interface, simple memory sections,
Business structures, memory section for Intel 8086.
Unit IV
Interrupts & DMA : Interrupts in 8086, Programmable Peripheral Interface 8259A,
Single & Cascade, DMA in 8086, Pentium & Pentium Pro (only Architecture).
Text Book
1. Douglas V. Hall, Microprocessor and Interfacing : Programming and Hardware,
Second Edition, Tata McGraw Hill, 1993.
CA204 DATA STRUCTURES AND ALGORITHMS – I
Unit I
Introduction – Overview – How to create programs and analyse them, Arrays – structure
– ordered lists – representation of arrays – simple applications.
Unit II
Stacks : Operations on Stack, Polish Expressions and their Compilation using Stacks.
Queues : Representation of Queues, operation on Queues, priority queues. (Chapter 3)
Unit III
Linear Linked List : Operations on Linear List using Singly Linked Storage structures,
circular linked lists. (Chapter 4)
Unit IV
Doubly linked lists, polynomial manipulation using linked list, garbage collection and
compaction using linked list. (Chapter 4).
Unit V
Trees: operation on binary tree, storage representation & manipulation of binary trees,
conversion of general tree to binary tree, manipulation of arithmetic expression using
Trees, sparse matrices.
Graphs: Matrix representation of graphs, list structures, breadth first search, depth first
search, spanning trees, shortest path algorithm.
Test Book
1. Jeen-Paul Tremblay and Paul G Sorenson, An Introduction to Data structures with
Applications, Second Edition, McGraw Hill Book Company, 1998.
Reference Book
1. Ellis Horowitz & Sartaj Sahni, “Fundamentals of Data Structures”, 1983,
Computer Science.

Here I’m attaching PDF format of MCA from Karunya University: