You are on page 1of 6

Department of Computer Science

,
University of Lucknow
DETAILED SYLLABUS OF MCA (Master of Computer Application)
MCA-I Semester
MCA101- IT AND COMPUTER FUNDAMENTALS
UNIT–I
Computer system concept, computer system characteristics, capabilities and limitations, types
of computers – analog, digital, hybrid, general, special purpose, micro, mini, mainframe, super.
Generations of computers, personal computer (PC) - IBM PC, characteristics, PC/PCXT/PCATconfigurations, Pentium and newer PC specifications and main characteristics. Types of PC-desktop,
laptop, notebook, palmtop, workstations etc, their characteristics, add on cards on PC : sound card,
video card, network card etc. Basic components of a Computer System - Control Unit, ALU, Input
/Output functions and Characteristics, Memory – RAM, ROM, EPROM, PROM and other types of
memory.
UNIT–II
Input devices-Keyboard, Mouse, Trackball, Joystick, Digitizing Tablet, Scanners, Digital Camera,
MICR, OCR, OMR, Bar-code Reader, Voice Recognition, Light Pen, Touch Screen – Working Principles,
Areas of use & characteristics. Output Devices – Monitors, Characteristics and Types of Monitor –
Digital, Analog, Size, Resolution, Refresh Rate, Interlaced / Non Interlaced, Dot Pitch, Video Standard
– VGA, SVGA, XGA etc. Printers - Daisy Wheel, Dot Matrix, Inkjet, Laser, Line Printer, Plotter Storage
Devices –Fundamentals, Primary Vs Secondary, Data Storage and Retrieval Methods - Sequential,
Direct and Index Sequential, Various storage devices - Magnetic Tape, Magnetic Disks, Cartridge Tape,
Hard Disk Drives, Floppy Disks(Winchester Disk), Optical Disks, CD, VCD, CD-R, CD-RW, Zip Drive.
UNIT–III
Need, Types of Software - System Software, Application Software, System Software - Operating
System, Utility Program, Programming Languages, Assemblers, Compilers and Interpreter, Operating
Systems - Functions, Types - Batch, Single, Multiprogramming, Multiprocessing, Programming
Languages- Machine, Assembly, High Level, 4GLs, Their merits and demerits, Application Software –
Word Processing, Spreadsheet, Presentation Graphics, Data Base Management Software,
Characteristics, Uses and examples and area of applications of each of them.Virus, Types of Viruses,
Virus detection and prevention Viruses on Network. Introduction to Multimedia.
UNIT–IV
Data communication and networks, Types of Network – LAN, WAN, MAN, Networks Models –
Client Server, Peer - to - Peer, Intranet, Internet. Topologies of LAN - Ring, Bus, Star, Mesh and Tree
Topologies, Components of LAN – Cable & Wireless Media, Network Interface Card Hub, Routers,
Repeater . Communication Protocols. Analog and Digital Signals. Modem - Working and characteristics,
Types of connections - Dialup, Leased Lines, ISDN, Programming Techniques Various Stages in
Program development. Algorithms, Flow Charts - Symbols, Rules for Making Flow Chart, Types of FlowChart, Advantage & disadvantage, Pseudo codes, Programming Techniques – Top Down, Bottom up,
Modular, Structured - Features, Merits & demerits, Comparative study. Programming Logic- Simple,
Branching, Looping, Recursion.
TEXT & REFERENCE BOOKS:
™
™

BY S.K.BASANDRA, GALGOTIA PUBLICATIONS.
FUNDAMENTALS OF INFORMATION TECHNOLOGY BY ALEXIS LEON & MATHEWS LEON, VIKAS
PUBLISHING HOUSE, NEW DELHI.
COMPUTERS TODAY

Hit ratio. Triggering in flip flops. Full subtractor and decimal adder. Full subtractor. Shift registers. Conditional. D. Ripple counters and Synchronous counters. Page replacement. Gray Code. AND. Sum of Product & Product of Sums. RAM and ROM Working & Circuit UNIT–III Sequential logic. Minimization Techniques. Hierarchy. Disk & Tape. Excess-3 & BCD. Combination & Sequential Circuits. ™ DIGITAL LOGIC AND COMPUTER DESIGN BY MORRIS MANO. Binary Number System. Arithmetic Operation on Binary Numbers. Associative memory. Constant Statement. 1's & 2's Complement. Magnetic Drum. Basic Boolean Law's. Fixed Point Representation. Synchronous & Asynchronous data transfer.Auxiliary Memory. Half adder & Full adder. UNIT–II Boolean algebra and digital logic circuits -Logic Gates. Virtual memory. K Map – Two. Counters and the memory unit. Analysis of Clocked Sequential Circuits. TEXT & REFERENCE BOOKS: ™ COMPUTER SYSTEM ARCHITECTURE BY MORRIS MANO. Codes. Semi-conductor memories. Demorgan's Theorem Map Simplification. Code Conversion.UNIT-I MCA102. . Octal & HexaDecimal Number System. OR. page table. Isolated Vs Memory-mapped I/O. Design procedure and design of counters. JK & T Flip-Flop.I/O Interface. Address space & memory space. ASCII.Point Representation. Error Detection & Correcting Codes Binary Storage and Registers. Overflow & Underflow. Address mapping. Boolean Algebra.RS.Digital Logic & Organization Data representation Data Types and Number Systems. NAND & XOR Gates. Multiplexers and Demultiplexers. Writing into cache.Flip-Flops . Multilevel NAND and NOR Circuits. Mapping techniques. UNIT–IV Registers transfer logic. Don’t care conditions. Registers. Timings sequence digital logic families. NOT Gates and their Truth Tables. Binary Fixed. Properties of simple I/O Devices and their controller. Arithmetic Logic and Shift Micro Operation. Design with equations. EBCDIC Codes. Memory organization . NOR. segmentation. Instruction Codes. Fixed Point Binary Data Floating Point Data. Intel Register Transfer. Floating Point Representation. Three and More variables maps. flip flop excitation tables. Cache memory. Modes of data transfer. memory. Inputoutput organizations. State Reduction and Assignment. Basic Definition and Properties.

Accessing Structure Members.If Statement. SCHAUMS OUTLIE SERIES. fgets. Nesting Of If……. Text file. Array Declaration And Initialization Of Arrays. BALAGURUSWAMI. Pointers. Identifiers. Switch Statement. TMH PUBLICATIONS THINKING IN C BY MAHAPATRA. Functions for File Handling: fopen. circles. Storage Class specifier – Auto. Precedence and associatively of operators. gets.fread. TEXTS & REFERENCE BOOKS: ™ ™ ™ ™ ™ PROGRAMMING IN C BY E. Pointer to functions.Drawing a Point on The Screen. getw. Formatted input/output i.. String : Declaration. Register.Graphics on your PC. PHI PUBLICATIONS GRAPHICS PROGRAMMING IN C BY STEVENS. Relational. Nested Structures. getch(). Array Of Structures. UNIT–II The Need of a Function. Calloc. polygon. putw. Initialize Graphics Mode. Function That Return Structure. Binary file. Variables. ovals. filling colors. Structure As Function Argument.Command Line Argument. Conditional and Bitwise operators. Free. fscanf. Drawing – lines. VIKAS PUBLISHING . rectangle. Initialization. Logical. DoWhile Loops. Calling of Functions. Scope and Life of Variables .e. Union. Preprocessor Directive. Expression. Compound Statement. main(). arcs. Types conversion in expression Basic input/output and library functions Single Character Input/Output i.MCA103 – Programming . Recursion.e.Using ‘C’ language UNIT–I Overview of C. Random access to files : fseek.The & And * Operators. Control structures. Prototype of a Function.Local and Global Variable. Functioning returning pointers. Keywords. Constants. Sizeof. Function Argument. fwrite.Else Statement. While. Using Text in Graphics Display. Realloc Functions Bitwise operator UNIT–IV File management-Defining. Pointers V/s Arrays. Else If Ladder. TMH PUBLICATIONS PROGRAMMING WITH C BY GOTTFRIED. ftell. getche(). Malloc. Extern. Data types. fclose. Pointers expressions. printf() And scanf(). Goto Statement . file name as Command Line Argument. Opening a File & Closing a File. Declaration Of Structure Variable. ? : Operator. Exit. Library Functions – concepts mathematical and character functions. fputs. Operator: Arithmetic. Arrays-Single And Multidimensional Arrays. User Defined and Library Function. Feature of C. getchar(). Structure Assignment . Array as Function Argument. If……. rewind.Dynamic memory allocation Introduction. BPB PUBLICATION PROGRAMMING IN C BY R SUBBURAJ. Static.Else Statement. Return Values and Nesting of Function. Loop Controls – For. Break Continue. Structure of program. fprint. String Functions UNIT–III Structure and union-Defining Structure. Functions used In Graphics . puts. putchar().

TEXTS & REFERENCE BOOKS: ™ ESSENTIALS OF MANAGEMENT BY H. Qualities of an Efficient Management. relevant case studies. qualities of a effective leader. UNIT–II Planning -Plan.Meaning and Functions. UNIT-IV Controlling Meaning and basic principles. Leadership. inventory control and quality control. relevant case study. factors affecting motivation. Relevant Case Study UNIT–III Directing-Motivation and team building. leadership styles. Quality Circles. F. theories of motivation. WEIHRICH TMH PUBLICATION ™ PRINCIPLES OF MANAGEMENT BY O. steps in planning & decision making. types of controls.P. Gantt chart and PERT/CPM. policies. Organizational Structure. relevant case studies. KHANNA . forecasting . W. Kaizen. Organizing-Organizational Design. Taylor And Herry Fayol’s Theories of Management.MCA104–Principles of Management UNIT–I Management practices. qualities of an effective planner. Management Principles Of Modern Times (Empowerment. Development of Management Thought. Centralization & Decentralization. Total Quality Management. strategies and programs. Delegation. theories of leadership. budget and budgetary control. KOONZ & H. effective communication and presentation skills.

Variables and the Assignment statements. TMH PUBLICATION PROGRAMMING DESIGN BY PETER JULIFF (4TH EDITION) CONCEPTS OF PROGRAMMING LANGUAGES BY ROBERT W. Call by text. Binding Scope and Extent Revisited. BNF. Type Equivalence. Specifications of Objects in a Procedure. Iterative Statements. Syntax and Program Reliability Variables. Binding time & the Storage Allocation. UNIT-IV Object Oriented Programming Language – Object Oriented Programming Concepts. Type Coercion. Messages. Concepts of Input . FUNARGs and FEXPRs. Object Oriented Programming Compared to Traditional Programming Objects. Message Passing. Parameter Evaluation and Passing. Call by value. Monitors. Syntax Graphs.The character Set. The GOTO Statements and Labels. Data Abstraction. Data Flow. Generic Functions. and Language Design Goals. Enumerated Data types. Procedures . Conditional statements.Basic Concepts.output. Call by reference. overloading. UNIT-II Data types and Typing. Methods and Classes. Functional Programming . Aliasing. UNIT-III Concurrency .The Basics of LISP. Classes Compared to Abstract Data Type.General Features. SEBESTA : LOW PRICED EDITION(4TH EDITION) . the PROG Features. Constants and Initialization. The LIST Interpreter.MCA105. TEXT & REFERENCE BOOKS: ™ ™ ™ ™ FUNDAMENTAL OF PROGRAMMING LANGUAGE BY ELLIS HOROWITZ GALGOTIA PUBLICATION PROGRAMMING LANGUAGES BY ALLEN B. Inheritance and Polymorphism. Generic Functions. Expressions and statements . Co-routine. Control Structures. The Data Flow Model. Call-by-name.Computer Programming and Problem Solving Principles UNIT-I Criteria for the design of a good programming language. Defining Syntax . Elementary Data types. Expressions.TUCKER. Programming Languages. overloading.

Equivalent Machines. Relations. Homomorphism and Normal Groups. Distributive and Complemented Lattices. UNIT. a job Scheduling problems and the pigeonhole principles. principles of inclusion and exclusion. Principles of Duality. ™ APPLIED DISCRETE STRUCTURE FOR COMPUTER SCIENCE BY ALAN DOERR AND KENNETH LEVASSURGALGOTIA PUBLICATION . Finite State Machine as Language Recognizers. UNIT. Prepositional Calculus.Introduction. Cosets and Lagrange Theorem. Integral Domains and Fields. Groups and ring-Groups and Subgroups. Total Solutions. Linear Recurrence with Coefficient Solutions. Generators and Evaluations of Powers. particular solutions. TEXTS & REFERENCE BOOKS: ™ ELEMENTS OF DISCRETE MATHEMATICS BY C. Properties of binary relations.IV Finite state machines-Introduction. propositions. Boolean Lattices and Boolean Algebra’s . Boolean algebra’s-Lattices and Algebraic System.MCA106. Permutation.I Sets & preposition . combinations of sets. UNIT-III Isomorphism and Automorphisms. Polynomial Ring and Cyclic Codes. Boolean Functions and Boolean Expressions. Chain and antichains. finite and infinite sets.II Recurrence relations and recursive algorithm-Introduction. a relation model for database.Discrete Mathematics and its Applications UNIT. Recurrence. Defined by Lattices. Finite State Machine as Model of Physical System. Basic Properties of Algebra’s of System. Relations and functions– introduction. partial ordering relations and lattices .L. Uniqueness Finite Boolean Algebra’s. Groups and Codes. Finite State Machines.LIU–MCGRAW–HILLS PUB. Rings. Equivalence relations and lattices. unacceptable indefinite sets.