𝑰 & 𝒚 . .𝑹. 𝒚 𝑲 - dr. b. r. ambedkar university · gate. unit ii de morgans...
TRANSCRIPT
𝑰𝒏𝒔𝒕𝒊𝒕𝒖𝒕𝒆 𝒐𝒇 𝑬𝒏𝒈𝒊𝒏𝒆𝒆𝒓𝒊𝒏𝒈 & 𝑻𝒆𝒄𝒉𝒏𝒐𝒍𝒐𝒈𝒚
𝑫𝒓. 𝑩. 𝑹. 𝑨𝒎𝒃𝒆𝒅𝒌𝒂𝒓 𝑼𝒏𝒊𝒗𝒆𝒓𝒔𝒊𝒕𝒚
𝑲𝒉𝒂𝒏𝒅𝒂𝒓𝒊 𝑪𝒂𝒎𝒑𝒖𝒔, 𝑨𝒈𝒓𝒂
Department of Computer Science
COURSE’S STRUCTURE
Each student will be required to complete 5 courses and practical in each semester except the
sixth.
COURSES OF STUDY
FIRST YEAR
Semester – I Papers:
C-101 Introduction to Information Technology
C-102 Digital Electronics
C-103 Programming Concepts Using ‘C’
C-104 Mathematical Foundations
C-105 Introduction to Management Functions
Practical Based on above subjects
Semester – II Papers:
C-201 Data Structure Using C/C++
C-202 Computer Organization and Architecture
C-203 Object Oriented Programming Using C++
C-204 Operating Systems
C-205 Computational Numerical Analysis
Practical Based on above subjects
SECOND YEAR
Semester – III Papers:
C-301 Database Management Systems
C-302 Computer Communication Networks
C-303 Theory of Computation
C-304 Internet and Web Technology
C-305 Optimization Techniques
Practical Based on above subjects
Semester – IV Papers:
C-401 Software Engineering
C-402 Distributed Database Management Systems
C-403 Network Programming
C-404 Artificial Intelligence
C-405 Analysis and Design of Algorithm
Practical Based on above subjects
THIRD YEAR
Semester – V Papers:
C-501 Computer Graphics
C-502 Compiler Design
C-503 Modeling and Simulation Techniques
C-504 Artificial Neural Networks
C-505 Digital Image Processing
Practical Based on above subjects
Semester – VI
Project
SYLLABUS OF MCA COURSE SUBJECTS
Ist YEAR
Semester Ist (Papers) Max M-50
Min M- 20
C-101- Introduction to Information Technology
Unit I
Information Concepts and Processing: Evolution of information processing, data information
language and communication.
Elements of a computer Processing System: Hardware – CPU, storage devices and media, VDU
input-output devices, data communication equipment.
Unit -II
Software – System software, application software.
Programming Languages: Classification, machine code, assembly language, higher level
languages, fourth generation languages.
Unit -III
Operating Systems: Concept as resource manager and coordinator of processor, devices and
memory. Concept of priorities, protection and parallelism. Command interpreter. Typical
commands of DOS / UNIX / Network, GUI-Windows.
Unit -IV
Computers and Communication: Single user, multi-user, workstation, client – server systems,
Computer networks, network protocols, LAN, WAN, Internet facilities through WWW, Mosaic,
Gopher, HTML, elements of Java.
Unit -V
Information Integrity: Definition, Ensuring Integrity, Computer Security – preserve software,
concepts and components of security, preventive measures and treatment.
Range of Application: Scientific, business, educational, industrial, national level weather
forecasting, remote sensing, planning, multilingual applications.
Reference :- P.K. Sinha ( Computer Fundamental)
102- Digital Electronics Max :-50
Min :-
20
Unit I
Number system, codes, logic gates, invertors, OR, AND, NOR. De Morgan’s First theorem. NAND
gate.
Unit II
De Morgan’s Second theorem. Exclusive OR gates. Exclusive NOR gates. Boolean algebra and
Karnaugh Map.
Unit III
Combinational Circuits: Half Adder, Full Adder, Binary Adders, Signed binary numbers. 2’s
complement, 2’s complement adder – subtractor. Unit IV
Parity, parity generators, comparators, BCD converters. Encoder, Decoder, Multiplexers, De-
Multiplexers, PLA & ROM. Unit V
Sequential Circuits: Flip-flops, RS-Latches, D–Latch, Edge–Triggered D flip-flops, Edge–Triggered
JK flip-flops, JK Master Slave flip-flop. Digital Integrated Circuits, IC flip-flops and registers. Binary
counters, shift registers. Memories, random access memories, micro-programs, micro-
processors.
Digital Logics , Design
M.Mano, PH[
103 – Programming Concepts Using ‘C’ Max M :50
Min M:- 20
Unit I
Introduction to Algorithms, Flow charts, C character set, identifiers and keywords, data types,
declarations, expressions, statement and symbolic constants, Input Output: getchar, putchar,
scanf, printf, gets, puts functions. Preprocessors commands: #include, define, if def. Preparing
and running a complete C program.
Unit II
Operators and Expressions: Arithmetic, unary, logical, bit-wise, assignment and conditional
operators, library functions, control statements: while, do-while, for statements, nested loops, if-
else, switch, break, continue, goto statements, comma operator.
Unit III
Functions: Defining and accessing, passing arguments, function prototypes, recursion, use of
library functions, Storage Classes: automatic, external and static variables. Arrays: Defining and
processing, passing to a function, multi-dimensional arrays. Strings, operations on strings.
Unit IV
Pointers: Declarations, passing to a function, operations on pointers, pointers and arrays, arrays
of pointers.
Unit V
Structures: Defining and processing, processing to a function, unions.
Data Files: Open, close, create, process. Unformatted data files.
Reference:- (i) Complete reference by Herbert Scheldt.
C-104 – Mathematical Foundations Max.Marks:50
Min Marks :-20
Unit I
Mathematical Logic: Notation, connectives, normal forms, predicate calculus, truth table.
Unit II
Relations and Ordering: Po-set, functions.
Unit III
Algebraic Structure: Group, ring, field, Boolean algebra.
Unit IV
Combinations: Principle of inclusion and exclusion, recurrence relations, generating functions,
partition, matrix of 0-1.
Unit V
Graph Theory: Definition, paths and circuits, reachability, connectedness, tree, spanning tree,
algorithm for the shortest path, planar and dual graph, matrix representation of graphs.
C-105 – Introduction to Management Functions Max.Marks:50
Min Marks :-20
Unit I
HRD: Selection, appraisal, training and information systems.
Unit II
Marketing: Understand the concept of marketing mix. These marketing mix elements consist of
product policy and design, pricing, choice of marketing intermediaries, methods of physical
distribution, use of personal selling, advertising and sales promotion, marketing research and
marketing organization.
Unit III
Finance: Finance function (concept, scope, and its relationship with other functions). Tools of
financial analysis (funds and cash flow analysis, ratio analysis, risk-return tradeoff). Financial
forecasting (Performa income statement and balance sheet, cash flow forecasting under
uncertainty, financial planning). Estimation and management of working capital (operating cycle
concept, inventory, account receivables, cash and account payables, working capital
requirements).
Unit IV
Manufacturing: Operations, planning and control (aggregate planning, multiple product batch,
production cycles, short term scheduling of job shop, setting production rate in continuous
production systems, activity scheduling in projects, introduction to project time calculations
through PERT/CPM). Management of supply chain, materials management (introduction to
materials management, systems and procedures for inventory management planning and
procurement of materials). Quality management (quality concept and planning, standardization,
quality circles).
Unit V
Strategy: Firm and its environment: strategies and resources: industry structure and analysis;
evaluation of corporate strategy; strategies for growth and diversification; process of strategic
planning.
Note:- Examiner to select minium one question from each unit.
Reference Books:
1. Marketing Management by Dr.M.M.Verma & R.K.Agarwal.
2. Financial Management- by. Dr. M.M. Verma & R.K.Agarwal
3. Accounting Theory – by A.K.Duggal.
4. Introduction to Accountancy- by T.S.Grewal.
5. Financial Management- by M.Y. Khan & P.K.Jain
6. Cost Accounting : Method & Problems – by B.K Bhar
7. Manufacturing Organization and Management by Harold T. Amrine, John A.Ritchey &
Oliver S. Hulley
8. Essentials of Management- by Harold Koontz, Cyril O’ Donnell & Heinz Weihrich.
9. Personnel Management and Industrial Relations- By Dr. M.M Verma & R.K Agarwal.
Semester IInd (Papers)
C-201 – Data Structures Using C and C++ Max M:- 50
Unit I Min M
:- 20
Data Structure – An Overview, Algorithm, Data Types
Arrays – Ordered Lists, One Dimensional Array, Two Dimensional Arrays, Multi – Dimensional
Array, Representation of Array Linked Lists
Introductory Consideration, Operation on linked list; (insertion, deletion….)
Variation on linked list structures: Singly linked lists, Circular linked lists, doubly linked lists.
Unit I I
Queues & Stacks: Introductory Consideration.
Queues: Circular implementation of a queue, Linked list implementation of queue, Priority
queues.
Stacks. Array implementation of a stack, Linked list implementation of a stack Postfix, Prefix &
Infix notation.
Unit I II
Trees & Graphs: Basic Terminology, Binary tree representation, Traversal, Preorder, Post-order &
In-order Traversal.
Unit IV
Introduction to Graphs: Representation.
Unit V
Sorting: Introductory Consideration, Bubble sort, Insertion, Shell sort, Quick sort.Searching:
Binary search, Sequential search, DFS & BFS.
Reference: (i) Data structure by Shaum Services
(ii) DS by Tananbaun
C – 202 Computer Organization and Architecture Max
M :- 50
Unit I Min M :-20
Principle of Computer design software, hardware interaction layers in computer architecture,
Central Processing Unit, Machine Language Instructions, Addressing Modes, Instruction Types,
Instruction Set Selection, Instruction, Cycle and Execution Cycle.
Unit II
Control Unit, Data path and control path design, Microprogramming vs. hardwired control, RISC
vs. CISC,
Pipelining in CPU design, Super scalar processors.
Unit III
Memory system, storage technologies, Memory array organization, Memory hierarchy,
interleaving, cache and virtual memories and architectural aids to implement these.
Unit IV
Input – output device and characteristics.
Input – output processing, bus interface, data transfer techniques, I/O interrupts, channels.
Unit V
Performance evaluation – SPEC marks, Transaction Processing Benchmarks.
C-203 : Object Oriented Programming Using C++:
Unit I:
Overview of Object Oriented Concepts, Introduction: Need of Object Oriented
Programming, Object Oriented Approach, Advantages of OOPS, Characteristics of
OOPL Objects, Inheritance, Reusability, New Data Types, Polymorphism Overloading.
Unit II:
An Overview of C++ Programming: C++ objects, C++ objects as data types, constructor &
Destructors, Object as arguments, Overloaded constructors, member functions outside the
class, objects as argument, Returning object from functions, Structure and classes, static class
data. An introduction to Array, Array as a class member data, Arrays as object, strings, Arrays
of string. Strings as class members, User defined strings.
Unit III:
Operator Overloading: Overloading unary operators, Overloading binary operator, Arithmetic
operator, Concertinaing strings, Multiple Overloading, Comparison Operator, Arithmetic
assignment Operator, Data Conversion: Conversion between (Basic Types, Object and Basic
Types, Between Object of Different Classes).
Unit IV:
Inheritance: Concept of base class and derived class, accessing the base class members,
derived class constructors, overriding member functions, Virtual functions, Abstract base
class, Public and Private Inheritance. Template Function and Template Class.
Pointers: Pointers and Arrays, Pointers and Strings, Pointers and Functions, Memory
management ,New and Delete Operators, Pointer to objects, Pointers to Pointer, Linker-List
Manipulation.
Unit V:
Files and Strings: Stream Class Hierarchy, String I/O, Character I/O, Object I/O, I/O with
multiple objects, File Pointers (tellg). Disk I/O with member functions, Error Handling, I/O
redirection IOS flags, Cerr and Clog Objects, Overloading of insertion and extraction operator,
Command line arguments.
Reference:
C++ Programming by Robert Lafore
Programming in C++ by Bala Guruswamay
C – 204 Operating System
Unit I Max:- 50
Min :-20
Introduction: Evolution of operating system. Types of operating systems. Different views of the
operating system, operating system concepts and structure.
Unit II
Processes: The Processes concept, systems programmer’s view of processes. The operating
system, services for process management. Scheduling algorithms. Performance evaluation.
Unit III
Memory Management: Memory management without swapping or paging, swapping, virtual
memory, page replacement algorithms, modeling paging algorithms, design issue for paging
systems, segmentations.
Unit IV
Inter Process Communication and Synchronization, The need for inter process synchronization,
mutual exclusion, queering implementation of semaphores, classical problems in concurrent
programming, critical region and conditional critical region, monitors, messages, Deadlocks.
Unit V
File Systems: File systems, directories, and file system implementation, security protection
mechanisms.
Input /Output: Principles of I/O Hardware: I/O devices, devices controllers, direct memory access.
Principles of I/O Software: Goals, interrupt handlers, device controllers, direct memory access.
Disks: Disk Hardware, scheduling algorithms, trace – at – a – time caching, RAM Disks.
Case Studies: MS DOS, MS WINDOWS, Linux (UNIX) operating system.
Books: Peterson, PHI Donavan, BPB
C – 205 Computational Numerical Analysis
Unit I
Algebraic & Transcendental Equations: Bisection, iteration, regular – falsi, Newton – rapuson
method, solution of system of non-liner equations.
Unit II
Interpolation: with equal and unequal intervals, central differences, Hermite and Cubie spline
interpolation.
Unit III
Curve Fitting: Least square, Chebysher Ploynomials.
Numerical differentiation and integration – Trapezoidal, Simpon’s and Romberg integration.
Unit IV
Numerical Solutions of Ordinary Differential Equations: Picard, Runge – Kutta, Predicator –
corrector method.
Unit V
Solutions of simultaneous liner equations: Jecobi, Sield iterative method Gauss Sepal. Matrix:
Inversion, eigen values and eigen vectors.
Student should know the C-programs based on all the above.
Books: ??
MCA 2nd Year
Semester – III (Papers)
C-301 Data Base Management Systems
Unit I Max: 50
Min: 20
Basic Concepts: Database and database users, Database Systems Concepts & Architecture, Data
Modeling using the Entity Relationship Model, Record Storage & Primary File Organizations.
Unit II
Relational Model, Languages & Systems. The Relational Data Model, Relational Constraints and
the Relational Algebra, SQL – The relational Database Standard.
Unit III
Data base Design Theory and Methodology Functional Dependencies and Normalization
for Relational Databases, Relational Database Design Algorithms and Further
Dependencies.
System Implementation Techniques
Unit IV
Database System Architecture and the System Catalog, Transaction Processing Concepts
(Introduction to Transaction Processing, Transaction & System Concepts) Con-Currency
Control Techniques (Locking Techniques for Con-currency Control, Con-Currency
Control Bases on Time Stamp Ordering) Database Recovery Techniques (Recovery
Concepts) Database Security and Authorization (Introduction to Data Base Security Issues)
Unit V
Advanced Data Base Concepts & Emerging Application (Introductory Concepts)
Distributed Databases and Client server Architecture, Data Ware housing and Data mining,
Emerging Database Technologies and Application
Reference Books
1. “Fundamental of Database System” by “Elmasri Navathe”, 4th Edition, First Indian Reprint,
(2004), Published by “Perarson Education”.
2. “Database System Concepts” by “Silberschatz, Korth, Sudarshan”, 4th Edition, Fourth Edition,
International Edition (2002), Published by “McGraw – Hill Publication”.
C- 302 Computer Communication Networks
Max: 50
Min: 20
UNIT-I: - Introduction to computer Network, Distributed System Advantages of
Networks, Point to Point and Multi-drop Circuits. Network Topologies-Star, Ring, Bus,
Mesh, Tree, Synchronous and Asynchronous transmission. Serial and Parallel
Transmission simplex Half duplex, full duplex transmission modes.
UNIT - II: - Wide area Networks, Local Area Networks, Multiplexing Time Division
Multiple Access, Time Division Multiplexing, (TDM). Frequency Division Multiplexing
(FDM) Connection-Oriented and Connection-less Networks. Goals of Layered Protocols,
Communication between Layers Introduction to the OSI reference Model Data
transmission in the OSI Model.
UNIT - III: - LANs , Primary attributes of LANs. Broad band and baseband LANS. LAN
topologies and Protocols CSMA/CD, Token Ring, Token Bus Metropolition Area
Networks & ANSI (FDDI) Fiber Distributed Data Interface Aloha protocol- pure and
slotted.
UNIT- IV: - Switching, Message Switching , Circuit Switching, Packet Switching. Routing
– Centralized routing, Distributed routing, static routing, Adaptive routing. Signals :-
Analog and digital Signals Bit rate and baud rate.
UNIT – V: - Polling and Selection Protocols: -The meaning of polling Solution Protocols
Character and Bit Oriented Protocols Binary Synchronous High Level Data Link Control
(HDLC). HDLC frame format code transparency and synchronization. Sliding Window
Protocol Frame format , Go-back –n - protocol selective repeat protocol.
UNIT – VI: - TCP / IP and Internet working concept of ports and sockets IP address
structure Major features of IP. IP data gram major IP services TCP Major features of TCP.
TCP segment UDP (User data gram protocol). Application Layer protocol –Telnet, TFTP,
FTP
Reference Books
1. Computer Network by – Tanenbaum
2. Computer Network by _ Frozen
C-303 Theory of Computation
Max: 50
Min: 20
UNIT – I
Conceptual model of a computer machine, digital and analog automata, theory of
automata, Numerical Computation and automata. Language and aiphabets of the
automata, finite and non-finite automata.
UNIT – II
Classification of automation, man, machines and automata, language accepted by
automata, deterministic automata, theories and axioms of DFA. Conversion of DFA to
NDFA and vice-versa.
UNIT – III
Regular and non regular grammar, DFA and regular expressions accepted by DFA,
Arden’s theorems, Pumping Lemma of regular grammar, problems and practices based
on pumping lemma.
UNIT – IV
Context free grammar, Chomskey’s hierarchies of different types of grammars, derivation
tree, yield, left and right derivation trees, ambiguous grammar, normalization of grammar,
null removal, unit production removal and optimization of CFG,BNF,CNF & GNF,
pumping lemma of context free grammar.
UNIT – V
Push down memory automation, multiple stack automation, LBA and language accepted
by LBA, Turing machine, designing and construction of Turing machine.
Reference Books-
1. theory of Computation, by KLP Mishra.
C- 304 Internet & Web Technology
Max: 50
Min: 20
UNIT –I: - History of the Web, growth of the web, protocols governing the web, web
application, creating web sites for individual and corporate world internet, www, browses.
UNIT – II: - Planning and developing a web site, contents of a web site, Technology and
production planning, communication issues communication with client, communication
breakdowns quality assurance and Testing Study of Technology Advances.
UNIT – III: - Introduction to HTML, Java Script, XML. Introduction to Active Server
Pages.
UNIT – IV: - Introduction to Java Language: Program structure, tokens, statements, JVM,
constants, variables, data types, operators and expressions, decision making, branching, looping.
Classes: Defining java class, objects, methods, constructors, method overloading, and static
members. Inheritance: Extending class, levels of inheritance, overriding methods, abstract classes,
Arrays, Strings, Vectors, Interfaces: Multiple Inheritance.
UNIT – V: - Packages: Introduction, system packages, new packages. Multithreaded
Programming: Introduction to Threads, Multiple threads. Exception Handling. Error
handling.
Managing Input and Output Files in Java: Stream classes, Byte Stream classes, Character Stream
classes and File classes. Input/output exceptions, Random Access Files. Interactive input/output.
Applet Programming: Introduction, Images, drawing.
Reference Books-
1. Mastering java 2 (BPB Publications)
2. HTML by Ivan Byross (BPB Pulications)
C-305 Optimization Techniques
Max: 50
Min: 20
UNIT – I
Linear Programming Graphical method for two dimensional problems central problems
of linear programming various definitions- statements of basic theorems and properties –
phase I and Phase II of the Simplex method – revised simplex method – primal and dual –
dual simplex method – sensitivity analysis – transportation problem and its solution –
assignment problem and its solution by Hungarian method.
UNIT – II
Integer Programming: Gomory cutting plane methods – Branch and Bound methods.
Queuing Theory: Characteristics of queuing systems – steady state M/M/1, M/M1/K
and M/M/C queuing models. UNIT – III
Replacement Theory: Replacement Theory of items the deteriorate – replacement of
items that fail. Group replacement and individual replacement.
UNIT – IV
Inventory theory: Costs involved in inventory problems-single item deterministic
models-economic lot size models without shortages and shortage having production rate
infinite and finite.
UNIT – V
PERT and CPM
Arrow networks – time estimates – earliest expected time, latest allowable occurrence time
and slack – critical path – probability of meeting scheduled date of completion of project
– calculations on CPM network- various floats for activities – critical path updating project
operation time cost trade off curve project time cost trade off curve selection of schedule
based on cost analysis.
Reference Books-
1. Operation Research by Kantiswroop.
Semester – IV (Papers)
C-401 Software Engineering
Max: 50
Min; 20
UNIT – I
Introduction to software, software projects, software engineering, planning of a software
project, software category, characteristics of software, software quality metrics and standards,
manufacturing of software.
UNIT – II
Software development life cycle, milestones, software development process, models of
software manufacturing, developer’s team, software project control, MBO, software baseline
configuration, WIP, time-graph, job assignment and scheduling, software cost estimates,
evaluation techniques, relevant software metrics.
UNIT – III
Prototype and spiral models, evaluation of SRS, refinement of SRS, quality of a good SRS, sketch
of a typical SRS, preparing SRS for different types of applicatory systems, tracing & testing SRS,
SRS review.
UNIT – IV
Conversion of software design from SRS, Software design document, software architecting,
Designing tools, data dictionary, DFD, decision tree, Petri-nets, structured English, primary
design, detailed, OO software design, software design measures, modularization criteria,
software design review.
UNIT – V
Software code development, coding style, programming, programming constraints, software
size metrics, code compilation, software complexity, debugging, error analysis and code
inspection, code review document, software code verification and validation. Software testing,
error and fault finding, reliability measures, different testing methods, integrated testing and
acceptance test, test criteria, testing strategies, testing, psychology, regression testing, software
maintenance, user training, software installation, documentation, performance reporting and
software marketing.
C-402 Distributed Data Base Management System.
Max: 50
Min: 20
UNIT – I
Distributed DBMS features and needs, Reference Architecture. Levels of Distribution
transparency. Replication, Distributed Design- Fragmentation, allocation criteria, Storage
Mechanisms.
UNIT – II
Translation of global queries, query execution and access plan, Global query optimization.
Concurrency Control – 2 phase locks, Distributed dead locks, Time based and quorum
based protocols, Comparison.
UNIT – III
Reliability-non –locking commitment Protocols, Partitioned networks. Heterogeneous
data bases-federated database, loosely & tightly coupled, Alternative Architectures,
Development tasks, Operation-global task Management.
UNIT –I V
Client-Server Databases. SQL Server, Open database connectivity, construction &
application management of distributed transaction – 2 phase unit protocols.
UNIT – V
Node & Link Failure recoveries, Distributed data dictionary Management, Distributed
administration.
Reference Books- ??
C-403 Network Programming
Max: 50
Min: 20
UNIT – I
Communication Protocol. Internet Protocols, Novell, System network architecture. UUCP,
IPX/SPX for LAN’s Protocol comparisons.
UNIT – II
Berkeley Sockets:
Overview. Unix domain protocols. Socket addresses. Socket system calls. Reserved ports. Passing
file description. I/O asynchronous and Multiplexing, socket implementation.
UNIT – III
Winsock programming:
Using the windows socket. API window sockets and blocking I/O. other window
extensions. Network dependent UNRI ( ) DLI. Sending and receiving data over
connections. Terminations.
UNIT –IV
Novell IPX/SPX:
Novel’s windows drivers. Netware C interface for windows. IPX/SPX procedure.
Datagram communication. Connection oriented communication with SPX, IPX/SPX
implementation of DLL.
UNIT – V
Programming applications:
Time and date routines. Ping. Trivial file transfer protocol. Remote login.
Reference Books- ?
C – 404 Artificial Intelligence
Max: 50
UNIT – I Min: 20
Introduction of AI:
General issues in AI, AI tasks, AI& non AI Techniques, knowledge, game playing, theorem
proving.
UNIT – II
Problem solving:
State space search:
Production systems. Search space control: Depth first, search, breath first search, heuristic
search-Hill climbing, OR graphs (Best First Search), A*, problem Reduction (And-OR
graphs), branch and bound. Minimax search: Alpha – Beta cut offs.
UNIT – III
Knowledge representation:
Predicate Logic:
Prepositional logics, first order predicate calculus, Solemnization, Unification, resolution,
Question answering.
UNIT –IV
Rule Based Systems:
Forward Deduction System, Backward Deduction System, Resolving with AND/OR graphs.
Structured Knowledge representation:
Semantic Net, slots, frames, value inheritance.
UNIT – V
Handling uncertainty:
Probabilistic reasoning. Using of certainty factors, Fuzzy logic.
Natural Language processing.
Reference Books- ??
C – 405 Analysis and Design of Algorithms
Max: 50
Min: 20
UNIT – I
Review of Data Structures:
Linked list, Stack, Queue, Binary tree etc.
Divide and conquer method:
Binary search and its time complexity. Quick sort, Merge sort, Harp sort.
Introduction:
Analysis of algorithms, asymptotic behavior of algorithms, asymptotic notations (Big oh,
Big omega and Big Tmta Notations), time and space complexities of algorithms. Average
and worst case analysis of algorithms. Finding Asymptotic Complexities.
UNIT – II
Greedy Method:
General Method, Knapsack Problem spanning trees: primes algorithms, kruskal’s
algorithms, Sollin’s algorithms, Optimal Storage on tapes. Huffman codes.
UNIT – III
Dynamics programming:
General method, Matrix Multiplication. Single source shortest path algorithms (Diskastra’s
algorithm).
Basic search and Traversal Techniques:
Techniques for Binary trees, Depth first search Breadth First search. Adjacency matrix and
list representation of graphs. Biconnected components.
UNIT – IV
Advanced data Structures:
Binary search tree Red Black Tree: Insertion and Deletion on Binary search tree and Red
black tree, B – tree, Basic operation on B – tree. Binominal Heaps and Binominal trees.
UNIT – V
NP – Completeness:
Basic concepts, Polynomial time, Abstract problem, Encoding, Formal – language frame,
polynomial time verification. The complexity class NP. NP – Completeness and
permeability. Hermit domain cycles.
Reference Books- ??
MCA 3rd YEAR
Semester – V (Papers) Max M:- 50
C – 501 Computer Graphics Min M: 20
Unit- I
Advanced computer graphics applications, Hardware graphical tools, CT-scan, CAD/CAM and
movie making software, MAYA and 3D graphical evolutions, GKS, PHIGS standards, micro-arrays
and computer graphics primitives.
Unit- II
Scan conversion, line and point plotting systems, raster, vector, pixel and point plotters,
continual refresh, direct and storage display, frame buffer, plasma panel display, very high
resolution devices, high speed drawing, display processor, character generation, CRT, display
technique, color look up table, annlog false colors, hard copy plotters.
Unit- III
Line generating algorithms, circle & ellipe plotting, plotting non-linear curves, presentation of
thick lines, parallel lines, screen co-ordinates, user co-ordinates, introduction of graph driver,
graph mode, BGI, graphical header files in SDK tools.
Unit- IV
Real world transformation, 2 D & 3 D transformation, reflection, rotation, translation, scaling
and distortion transformation, homogeneous transformation matrix, non linear transformation,
projection, Engineering drawing
And projection,clipped and windowed transformation and their application.
Unit- V
Color fill algorithm: Seed fill, edge fill and soft- fill, graphical functions, display code generation,
graphical data structure, interative graphics techniques: inking, watering, zooming, panning,
scissoring and positioning, display files, segment. Wire frame perspective display, removal of
hidden lines and surfaces, shading, Warnock’s algorithms, A-buffer algorithm, transparent
solids, sweep, surface generation, Bezier &B- spline curve and their application
C – 502 Compiler Design Max-
50 Min
-20
Unit- I
Introduction:
Definition of Compiler and translator, Structure of Compiler, High-level Programming
Language. Lexical and Syntactic Structure of Language – 1 – Values, r-values parameter
passing Bootstrapping, Cross Compiler. Types of errors, lexical errors, syntactic errors
semantic error Phase of the Compiler Token. Unit- II
Finite Automata and Lexical Analysis:
Role of lexical Analyzer, regular expression, Finite Automata. From regular expression to finite automata. Implementation of Lexical Analyzer.
Unit- III
Syntax Analyzer:
CFG, Derivations and parse trees. Parsers, Shift reduce parsing, operator precedence parsing, Top-
Down parsing, predictive parsers. First and Follow. LL (1) grammars. LR parser, LR grammar.
Symbol Table:
Definitions, Contents of Symbol table. Data structure for symbol tables. Unit- IV
Storage Management:
Static storage management, Dynamic storage management, Stack based memory
management, Heap storage management. Major runtime elements requiring storage.
Storage Management phase.
Unit- V
Code Optimization:
Principal source of optimization, Loop optimization, DAG. DAG representation of Basic
Blocks. Domains Reducible flow graphs.
Code Generation:
Object program, Problems in Code generation, Machine Model, Register allocation and
assignment.
C – 503 Modeling and Simulation Technique Max :-50
Unit-I Min :-
20
Introduction to Simulation: Introduction, advantages and disadvantages, areas of
application, system, components of a system, continuous and discrete systems, model of a
system, types of a model. Simulation of inventory systems, queuing systems, concepts in
discrete-event simulation.
Unit- II
Simulation Software: History, Simulation in GPSS, classification of simulation software,
desirable software features.
Unit- III
Simulation of Queuing System: Characteristics, M/G/1, M/M/c//, M/M/c/N/,
Notation, performance of queuing systems.
Unit- IV
Random Number Generation: Linear congruential generators, other generators, testing
of random numbers. Random Variates, continuous and discrete random variates
generation. Generation of arrival process.
Unit- V
Analysis of Simulation Data: Input modeling, verification and validation of simulation
models.
Simulation of Manufacturing and material handling systems, financial management
systems.
1. Discrete Event System simulation ( Banks & Karson) PHI.
2. Simulation and Modeling Techniques ( Law & Kelton) TMH
C – 504 Artificial Neural Networks MPS
Unit- I
Introduction: Applications of Neural Networks, Pattern and data, Characteristics of Neural
Networks, Comparison with human brain, Artificial Neural network terminology, Learning in
Machines, Pattern recognition tasks.
Unit- II
Basic Neuron: Modeling the neuron, Learning in simple neurons, Limitations, Basic Learning Laws,
Multi-layer Models.
Artificial Neural Network
Y. Yegnarayana, PHI publication
Unit- III
Activation and Synaptic Dynamics: Activation dynamic models, dynamic models, stability and
convergence, recall in neural networks.
Unit- IV
Feed forward neural networks: Introduction to feed-forward neural networks, analysis of pattern
classification networks.
Analysis of Pattern Mapping Networks: Back propagation algorithm, Kohonen Self Organization
Networks.
Unit- V
Feedback Neural Networks: Introduction of Pattern storage network – Hopfield model, Stochastic
networks and simulated annealing, Boltzmann machine learning law.
Architecture of artificial neural network for complex pattern recognition tasks, associative
memory, pattern mapping, ART, Temporal patterns
C-505 Digital Image Processing PB Max:- 50
Unit- I Min:- 20
Image digital representation, elements of visual perception, sampling and quantisation. Image
processing system elements.
Unit- II
Fourier transforms: Extension to 2D, DCT, Walsh, Hadamard transforms.
Unit- III
Enhancement and segmentation: Histogram modification, smoothing, sharpening, thresholding,
edge detection, segmentation, and point and region dependent techniques.
Unit- IV
Image encoding: Fidelity criteria, Transform compression, KL, Fourier, DCT, Spatial compression,
Run length coding, Huffman and counter coding.
Unit- V
Restoration: Models, Inverse filtering.
Reference Books-
1. DIP by Gonsalez
2. DIP by Anil kr. jain
Semester – VI
CS -601 – Project (Equivalent to Five Papers)
(PGDCA Programme)
Post Graduate Diploma in Computer Application
Eligibility Criteria:
Any Graduate Degree from recognized University with mathematics as one
subject in Intermediate (10+2)/BCA/B.Sc. (IT)/B. Sc.(CS) with 50%
aggregate marks and relaxation of 5% in marks is permissible for SC/ST
candidates.
Course Duration : 2 Semesters ( 1 Year)
Course Fees : 8500/- (per semester)
Course Structure
PGDCA I Semester
C-101 Computer Organization
C-102 Programming Concept in ‘C’
C-103 PC Software skills
C-104 System Analysis & Design
C-105 E-Commerce
Practical Based on ‘C’ Programming
PGDCA II Semester
C-201 DBMS
C-202 Computer Networks
C-203 Oriented Programming Object (OOPS)
C-204 Visual Programming
C-205 Operating System
1. Practical Based on Data Structure Using C++
2. Major Industrial Project
PGDCA 1st Semester
Paper I
Computer Organization:
Unit I:
Number System: Binary, Octal, Hexadecimal and Computer Arithmetic with them. Addition and
Subtraction for sign machine and 2’s complement numbers. Floating-point representation and
arithmetic. Computer codes binary, ASCII, EBCIDC, Redundant and error correcting codes.
Introduction to the computer as a purposeful collection of inter-linked elements CPU, Memory
and I/O units.
Unit II:
Structure and function of CPU as a collection of Registers, Arithmetic Logic and Control Unit.
Concept of Storage, fetch and execution of instructions via data control and address buses.
Types of main and auxiliary memory. RAM, ROM, PROM, DISK and TAPE memories. Static and
Dynamic RAM.
Unit III:
Logic Design of Computer, Truth Table, Boolean Algebra, AND, OR, NAND, NOR gates,
Multiplexes, Flip-Flops shift registers and counters, decoders, encoders, design of
combinational circuits, Speed mismatch between CPU and peripherals.
Unit IV:
Flow of information among CPU, Memory and peripherals. Handling of interrupt,
Programmed and DMA transfer of data, I/O buffers, handshaking, Design of I/O
channels, Virtual memory, Time Sharing, Multiprogramming systems.
Reference:
Computer System Architecture By Moriss Mano
Paper II
Programming Through C & Data Structures:
Unit I:
Overview of programming: Introduction to computer based problems solving, Program design
and implementation issues, Programming environment.
Unit II:
Fundamental of C Programming: Overview of C, Data Types, Operators, Expression, Control
Constructs, Arrays, Basic I/O, Program Design examples, Advanced features.
Unit III:
Advanced Programming Techniques: Control Constructs, Functions and Recursion.
Unit IV:
Introduction to Pointers, Structures, Union, File Handling: File Pointers, File Accessing
functions, Slandered C Header and Library Files, Command Line Argument, Creating Project
Files.
Unit V:
Basic Concepts of data representation, Introduction to algorithm design and data structure,
representation of arrays, single & multidimensional arrays, its storage. Stacks and Queues:
Representation of stacks and queues, circular queues, application of stacks, introduction to
postfix, priority queues. Link List : Singly linked list, operation on the list circular list, Double
linked list, Simulation using linked lists, garbage collection.
Reference:
Programming in C by Raja Raman.
Data Structures Using C and C++ by Tenanbaum or Schaums Series.
Paper III
Pc Software Skills:
Unit I:
History of Computer and generation of computers, Classification, Hardware, Software,
Representation of Information, Types of Software: System and Application Software.
Unit II:
Windows: Windows Basic, Explorer, Internet Explorer, File Management, Device Management,
OLE Concepts.
Unit III:
Word Processor: Basics of Word Processing, Document enhancement, Graphics using templates
and wizards.
Spread Sheet: Worksheets basics, Formatting and Calculation, Functions and macros, Working
with graphs and charts, Multiple worksheets.
Presentation Tools: (M.S.-Power Point): Presentation of slides, Movement of slides etc.
Unit IV:
Internet Fundamentals: Surfing and usage of Internet, Email, FTP, TELNET, WWW,
etc.
Unit V:
Hypertext Mark Up Language and Dynamic Hypertext Mark Up Language HTML/DHTML &
Designing Tools.
Reference:
Microsoft Office : Reference Book Published By TMH
HTML: Reference Book Published By BPB
Paper IV
System Analysis & Design:
Unit I:
Introduction to system definition and concepts: Real Life business sub system, System
Environment and boundaries, Role and need of System Analyst, Introduction of SDLC (System
Development Life Cycle).
Unit II:
System Planning: Data and fact gathering techniques, Feasibility studies, Feasibility reports,
System selection plan and proposal, Cost benefit and analysis, System Design and modeling,
Data Flow Diagram, I/O from Design, Modular and system design.
Unit III:
System Implementation and maintenance: Planning consideration, System evaluation and
performance, maintenance activities, System Audit and Security.
Unit IV:
Introduction to MIS, Definition of MIS, System approach to MIS, MIS organization
with in a company, Conceptual design of MIS, System Objectives and System
Constraints, Alternative System Design and Selection.
Unit V:
Detailed System Design and Implementation: Basic System Design concept to MIS, Role of MIS
development and System Analyst.
Reference:
System Analysis & Design By Awad.
P.G.D.C.A Paper V
E-commerce:
E-Commerce: An Introduction to E-Commerce and Internet. Portal Site
Development, Multimedia , 3D, Virtual reality (VRML) , E-Commerce –
Business to Business to Consumer, Setting up of an E-Business, Net for
trading, advertising and marketing., Secure Transaction on Net, Various
Protocol used on the Internet to secure the transaction, SET, SSL, Electronic
Fund Transfer, E-Banking, Shopping Mall, Mail Service, Content Service,
Web Advertisement. Content Development & Deployment: News , Free
Email, Chat Rooms, Search Engines, Viruses, Worm, Authentication,
Protection and Access Control, Introduction to ‘Tally’ software.
Reference:
E-Commerce By Kamlesh Bajaj and Nag Published By TMH
PGDCA 2nd Semester
Paper I
Introduction to Database Management System:
Unit I:
Overview of Database Management System, File Oriented Approach Vs Data oriented
approach, Database System, Structure of Database System, Data Independence,
Primary and Secondary Objectives of Database System, Role of DBA.
Unit II:
Entity, Attributes, Tuples, E-R Diagrams, Relationships, Schema, Sub-Schema, View
of Data and DBMS, Components and function of DBMS
Unit III:
Database Models : Hierarchical Model, Network Model, Relational Model, Operations
on RDBMS, Examples of Different Models.
Unit IV:
Functional Dependence, Transitive Dependence, 1NF, 2NF, 3NF, BCNF.
Unit V:
SQL (DDL,DML) Object Oriented DBMS, Protection and Security Mechanism,
Backup and Error Recovery.
Reference:
Introduction to Data Base Management System By Bipin Desai.
Data Base Design By C.J.Date
Paper II
Data Communication And Network:
Unit I:
Introduction to Data Communication, Line Configuration, Topologies, Transmission Modes,
Digital Signals, Encoding, Multiplexing
Network Hardware : Repeaters, Bridges, Routers, Gateways, Network Software, Design Issue,
Interface and Services.
Unit II:
Reference Models(OSI/ISO functions of layers), TCP/IP model, Layered Architecture,
Transmission Media, Wireless Transmission.
Unit III:
Ethernet, Access Method : CSMA/CD, Addressing, Frame Format, Token Bus, Token
Ring: Access Method, Token Passing, Addressing Frames Format, X . 25, Frame
Relay, ATM, ISDN Services: History, Subscriber Access To ISDN, Broad Band ISDN.
Unit IV:
Routing Algorithms: Shortest Path, Flooding, Flow Based, Broadcast, Distinct Vector,
Link State, General Principles of Congestion Control in Virtual Circuit in Datagram
Sub Net, Chock Packets, Loads Shedding, TCP/IP, IP Addressing, Sub Nets.
Unit V:
Application Layer, Network Security, Cryptography, Secret Key Algorithm, DNS,
Email, Usenet, WWW, FTP,HTTP,TELNET.
Reference:
Data Communication and Network by Tenanbaum
Paper III
Object Oriented Programming Systems:
Unit I:
Overview of Object Oriented Concepts, Introduction: Need of Object Oriented
Programming, Object Oriented Approach, Advantages of OOPS, Characteristics of
OOPL Objects, Inheritance, Reusability, New Data Types, Polymorphism Overloading.
Unit II:
An Overview of C++ Programming: C++ objects, C++ objects as data types, constructor &
Destructors, Object as arguments, Overloaded constructors, member functions outside the
class, objects as argument, Returning object from functions, Structure and classes, static class
data. An introduction to Array, Array as a class member data, Arrays as object, strings, Arrays
of string. Strings as class members, User defined strings.
Unit III:
Operator Overloading: Overloading unary operators, Overloading binary operator, Arithmetic
operator, Concertinaing strings, Multiple Overloading, Comparison Operator, Arithmetic
assignment Operator, Data Conversion: Conversion between (Basic Types, Object and Basic
Types, Between Object of Different Classes).
Unit IV:
Inheritance: Concept of base class and derived class, accessing the base class members,
derived class constructors, overriding member functions, Virtual functions, Abstract base
class, Public and Private Inheritance. Template Function and Template Class.
Pointers: Pointers and Arrays, Pointers and Strings, Pointers and Functions, Memory
management ,New and Delete Operators, Pointer to objects, Pointers to Pointer, Linker-List
Manipulation.
Unit V:
Files and Strings: Stream Class Hierarchy, String I/O, Character I/O, Object I/O, I/O with
multiple objects, File Pointers (tellg). Disk I/O with member functions, Error Handling, I/O
redirection IOS flags, Cerr and Clog Objects, Overloading of insertion and extraction operator,
Command line arguments.
Reference:
C++ Programming by Robert Lafore
Programming in C++ by Bala Guruswamay
Paper IV
Visual Programming:
Visual Objects and Application Design:
Object Types: Buttons, Text Boxes, Windows, Frames etc.
Object Structure: Attributes Methods etc. Creating Objects: Placing Objects
to interact using programming or scripting.
Design Strategies: Enabling objects to interact using programming or
scripting.
Visual Development Environment:
Identification of features: Use of advanced features to satisfy the
requirements of an application features available will vary greatly between
different development environments, but typical example might be the use of
drag and drop, simple animation, linking to databases, Internet development.
Reference:
Using Visual Basic 6.0 by Resleman
Visual Basic 6.0 by Paul Sheriff
Paper V
Operating Systems:
Unit I:
Needs and Functions of an Operating System, Evolution of an Operating System, Different
views of an O.S., Types of O.S. O.S. Structure (Monolithic, Layered, Virtual Machines,
Client Server)
Process: The process concept, O.S. view of processes, O.S. Services for process management,
Scheduling algorithms and their performances evolution (Round Robin, FIFO, Priority, Shortest
Job First, Two Level Scheduling, Multiple Queue.
Unit II:
Memory Management: Contiguous management, Partitioned memory management (Static &
Dynamic) Swapping, Memory Management with Bit Map Table, Linked List Allocation, Paging,
Concept of Virtual Memory, Page replacement algorithms (FIFO, NRU,LRU,) Associative Memory.
Unit III:
File System: Command Language User View of File System, Disk Controller and Disk Driver, OS
view of file management, Disk Space Management, Shared Files, File System Reliability, File
System Security.
Unit IV:
Dead Lock Problem: Conditions for dead lock, Dealing with dead lock (detection & recovery,
avoidance, prevention) Banker’s Algo for single resources and for multiple resources. Windows
Operating System.
Unit V:
Case Studies: UNIX & DOS, Overview of UNIX, UNIX Shell, utility programs, files and
directories, overview of DOS, MS-DOS Shell, MS-DOS-Memory Model, File-System,
Processes, I/O Devices.
Reference:
Introduction to Operating System by Tananbaum.
Paper I : Introduction to Database Management System
Paper II : Data Communication And Network:
Paper III: Object Oriented Programming Systems:
Paper IV: Visual Programming:
Paper V: Operating Systems: