2021-2022 StudyChaCha

#1
September 27th, 2012, 05:03 PM
 navneet.sonal.d Guest
Pondicherry University Notes

I m student of Master of Computer Applications from Pondicherry University so I am looking for syllabus for MCA kindly provide me.

#2
September 28th, 2012, 11:02 AM
 Super Moderator Join Date: May 2011
Re: Pondicherry University Notes

As you are looking for syllabus of MCA from Pondicherry University. Here as per my knowledge I am providing you syllabus of MCA from Pondicherry University

Here I am providing you syllabus of MCA from Pondicherry University.
I Semester
Mathematical Foundation of Computer Science
Computer Organization and assembly language
Programming
Data Structures
Problem Solving and Programming
Information Technology
Computer Lab I (DS using C)
Computer Lab II (Assembly language
Programming)

UNIT I
Mathematical Logic : Connectives
Negation, Conjunction, disjunction, Statement
Formulas and TT, Conditional and Biconditional, Well formed formulas, tautologies,
Equivalence of statement formulae, Duality law, Tautological implications, Functionally
complete set of connectives; Normal Forms
Disjunctive, Conjunctive, Principal
disjunctive and principal conjunctive normal forms.
UNIT II
The theory of inference for statement calculus, Validity using TT, rules of inference,
consistency of premises and indirect method of proof, Automatic Theorem proving-
Predicate Calculus, Predicates, the statement function, variables and quantifiers.
UNIT III
Set Theory : Basic Concepts of Set theory, Notation, Inclusion and equality , Power set,
Operations on sets, Set identities, Ordered pairs and n-tuples, Cartesian products -
Relations and Ordering , Relations, Properties of binary relation- relation matrix and
graph of a relation, partition and covering of a set, equivalence relations, composition of
binary relations, partial ordering, partially ordered set - Functions, Definition,
composition, Inverse, Binary and n-ary operations, characteristic function of a set,
hashing function- Recursions, Functions, sets and predicates.
UNIT IV
Lattices and Boolean Algebra : Lattices as partially ordered sets, properties of lattices,
Lattices as Algebraic systems, Some special lattices - Boolean algebra, functions,
representation and minimization.
UNIT V
Graph theory : Definition, Examples, Paths and Cycles, Planarity, colouring graphs
TEXT BOOKS
1. J.P. Tremblay and R.Manohar, Discrete Mathematical structures with
applications to Computer Science, Tata McGraw Hill publishers, 2008.
2. Robin. J.Wilson, Introduction to Graph theory. (Fourth edition)
COMS 302: COMPUTER ORGANISATION AND ASSEMBLY LANGUAGE
PROGRAMMING
UNIT I
Digital logic fundamentals: Number systems Boolean algebra gates simplification
of Boolean expressions
subtractors
Decoders
encoders multiplexer / demultiplexers Sequential Logic : Flip-flops - Counters.
UNIT II
Introduction to Intel s 8086/88 : Register model Bus interface Unit Execution unit
Control Unit: hardwired and microprogrammed control. Memory organization: Basic
memory cell
RAM, ROM and DRAM
associative, cache and virtual memory
organizations.
UNIT III
Assembly Language Programming : Instruction formats
Intel
8086/88 instruction mnemonics
timing data transfer arithmetic and machine control
instructions - Introduction to Macro assembler.

UNIT IV
Input/Output organization : Input interface Data transfer techniques : synchronous
asynchronous
Interrupt driven
Intel 8086/88 interrupt organization
types
DMA
I/O processors serial communication.

UNIT V
Processor organization: General register organization
stack organization. IBM PC
architecture: Mother board
power supply.
Architectural overview of Pentium, P-II, P-III and P-4.

TEXT BOOKS
1. M.Morris Mano, Computer Systems Architecture, Pearson Education, 3rd Edition,
2003.
2. Liu Gibson, Microcomputer Systems the 8086/88 family, PHI, 2nd edition, 2001.
3. Govindarajulu, IBM PC and Clones, PHI, 2002.

REFERENCES
1. A.K.Ray, K.M.Bhurchandi, Advanced Microprocessors and Peripherals, TMH,
2000.
2. Peter Abel, IBM PC Assembly language and Programming, PHI,2000,

DATA STRUCTURES
UNIT I
Introduction, algorithmic notation, Space and Time analysis of an algorithm, information
and its storage representation, Representation and its manipulation of strings, Pattern
Matching. Searching and sorting techniques.
.
UNIT II
Arrays: Array representation, Array processing
single and multi dimension
arrays
Stacks: Stack Representations , stack operations
Queues: Definitions, Implementations of Queues, Circular queues, Application
of Queues.

UNIT III
Trees: nary Trees, Binary Search Trees, Building a Binary Search Tree, Tree
Traversal techniques.
Graphs: Definitions, Undirected and Directed Graphs, Traversal, Minimum cost
spanning tree, topological sorting.

UNIT IV
Hash Table: Hash Functions, Collision Resolution Strategies, Hash Table
Implementation.
Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST,
Complexity of Search Algorithm, Path Length, AVL Trees, B-trees.
UNIT V
File Structures: Physical Storage Media File Organization, Organization of
records into Blocks, Sequential Files, Indexing, Primary indices, Secondary
indices, B+ Tree index Files, B Tree index Files, Indexing and Hashing
Comparisons.

TEXT BOOKS
1. Ellis Horowitz , Sartaj Sahni and Susan Anderson, Fundamentals of Data
Structures using C, Computer Science Press, 1993.
2. Jean Paul Tremblay and Paul G. Sorenson, An Introduction to data structures
with applications 2nd edition, Tata McGraw-Hill, 2001

REFERENCE
1. D. Samanta, Classic Data structures , Prentice-Hall of India private ltd., 2001.

PROBLEM SOLVING AND PROGRAMMING
UNIT 1
Introduction to Problem Solving: Problem solving strategies, Problem identification,
Problem understanding, Algorithm development, Solution planning (flowcharts, pseudocode,
etc.), Modular programming design. Basic program structure in C, Simple data
types, variables, constants, operators, comments, Control Flow; if, while, for, do-while,
switch.

UNIT II
Functions: Types, parameters, prototypes, recursion.
Arrays & Pointers: Array usage, Pointers, addresses and types, call by reference,
Pointer - array duality, Strings , Arrays of pointers, Arguments to main, Pointers to
functions.

UNIT III
Structures: Member accessing, pointers to structures, Structures and functions, Arrays of
Other Data Types: Unions, enumerations and bit fields.

UNIT IV
Bitwise Operators: Usage, device accessing.
Type manipulation: Coercion, typedef, initialisation, Static, global, external, register.
Dynamic Allocation: Uses, pitfalls.
The Pre-processor: Define, include, macro's, ifdef.

UNIT V
Input and Output: Concepts, Character and File I/O, Basic Curses, Simple File I/O, The
Standard I/O Routines, ANSI Standard Libraries.

TEXT BOOKS
1. Brian W.Kernighan and Dennis M.Ritchie, The C Programming Language ,
Pearson Education Inc., 2nd Edition (2005).
2. Byron Gottfried, Programming with C , 2
nd
TMH publications, (2006).
3. Dromey, How To Solve It By Computer , Dorling Kindersley (India) Pvt Ltd,
2008.

REFERENCES
1. Stephen G.Kochan, Programming in C , Third Edition, Pearson Education
India, (2005).
2. E.Balagurusamy, Computing fundamentals and C Programming , Tata
McGraw-Hill Publishing Company Limited, (2008).
3. Behrouz A.Forouzan and Richard.F.Gilberg, A Structured Programming
Approach Using C , II Edition, Brooks-Cole Thomson Learning Publications,

INFORMATION TECHNOLOGY
UNIT I
Introduction: Introduction to IT, Scope for IT, IT Usage, Information System, its
functions and applications.

UNIT II
Hardware: Architecture (Mainframe, Mini, PC, Workstations), Real time system,
Transaction Processing system, Laptop, Palmtop, Client server, N-Tier. Introduction to
Networks: LAN, WAN, MAN, etc. Peripherals: Information about Input devices
(Keyboard, Mouse, Joystick, Track ball, etc.) - Details about Storage devices (Floppy
disk, Hard disk, Tapes (Cartridge, DAT), Compact Disk), Information about Monitors,
Printers (impact, non-impact) - Various types of plotters.

UNIT III
Software: Software Classification (System, Application, and Utilities). Operating
System: Introduction, Basic functions of OS, Classification of OS. Programming
Languages: Generation of Languages and their uses. Packages: Spread sheets, DTP
Tools, Presentation tools. Application areas of Software - Commercial, Scientific, Real
time application etc.

UNIT IV
Multimedia and Internet: Introduction to multimedia - Hardware, Software and
applications - Introduction to Internet, Service providers, Internet naming and
HTML. Intranet, Extranet: Introduction to Intranet and Extranet.

UNIT V
Object Oriented System: Concepts, Benefits of OOS over conventional system.
Enterprise Computing: About ERP, Activities under ERP. Mobile Computing - An
Introduction to Mobile Computing.

TEXT BOOKS
1. Brain, K. Williams, et. al., Using Information Technology, Third edition, TMH,
2000.
2. Turban, Rainer, Potter, Introduction to Information Technology, second edition,
Wiley Publications.
3. Dennis P. Curtin, et.al., Information Technology - The Breaking View, TMH,
2000.

FUNDAMENTALS OF ALGORITHMS
UNIT I
INTRODUCTION : Algorithm - pseudo code for expressing algorithms analysis - time
complexity and space complexity - efficiency of algorithms - O-notation - Omega
notation and Theta notation.
DIVIDE AND CONQUER : General method binary search - merge sort - quick sort.

UNIT II
GREEDY METHOD : General method- Knapsack problem - job sequencing with deadlines
- minimum-cost spanning trees : Prim's and Kruskal's algorithms - Single source shortest
paths : Dijkstra's algorithm.

UNIT III
DYNAMIC PROGRAMMING : General method - Multistage Graphs All pairs shortest
paths, Single source shortest paths - optimal binary search trees - O/1 Knapsack problem
- Traveling sales person problem.
-
UNIT IV
BACK TRACKING : General method - n-queen problem - sum of subsets problem - graph
colouring - Hamiltonian cycles - Knapsack problem.

UNIT V
BRANCH AND BOUND : Least Cost(LC) search, Bounding - LC branch and bound - FIFO
branch and bound - Travelling sales person problem.

TEXT BOOK
1. E. Howrowitz , Sahni, S.Rajasekaran, Fundamentals of computer algorithms,
Galgotia publications, 2004.

REFERENCES
1. Gilles Brassard and Paul Bratley, Fundamentals of Algorithmics, Prentice Hall of
India Pvt.Ltd., 1997.
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C,Addition-wesley,
Third Indian Reprint, 2000.

: OBJECT ORIENTED PROGRAMMING
UNIT I
Limitations in structured programming Characteristics of Object Oriented Language data types loops pointers arrays structures functions Classes Objects.

UNIT II
Inheritance
Polymorphism
Templates
Exception Handling
class Hierarchies - library organization and containers
Strings
Stream - Design and
programming.

UNIT III
Java vs. C++ - Java on the Internet
Exception handling
persistence Java keywords and flow control Garbage collection.

UNIT IV
Final declaration
Packages and interfaces
Java I/O classes
Run time type
identification User Interface design basics with swing.

UNIT V
Network programming
Applets
class - architecture - simple applet programs
Abstract window tool kit.

Note: Unit I & II deals with C++ and Java
Unit III , IV & V deals with Java.

TEXT BOOKS
1. Bjarne Stroustrup, The C++ Programming Language, (3rd and Special Edition)
2. Bruce Eckel, Thinking in Java , (3rd Edition) Prentice Hall PTR, 2002

REFERENCES
1. Robert Lafore, Object Oriented Programming in C++ , Galgotia publications, 4th
Edition,2002.
2. E.Balaguruswamy, Programming with Java, Tata McGraw Hill Publications
Limited, 2nd Edition ,1999.

Below I am providing you full syllabus of MCA kindly find the below given attachment.
 Pondicherry University MCA Syllabus all sem.pdf (376.6 KB, 24 views)
__________________

Last edited by Vinodt; February 15th, 2014 at 12:29 PM.