MCAsyllbus (09-07-2009)

GITAM UNIVERSITY
(Declared as Deemed to be University U/S 3 of UGC Act, 1956)
REGULATIONS & SYLLABUS

OF
Master of Computer Applications (M.C.A.)
(w.e.f. 2008 -09 admitted batch)
Gandhi Nagar Campus, Rushikonda

VISAKHAPATNAM – 530 045
Website: www.gitam.edu
REGULATIONS
(w.e.f. 2008-09 admitted batch)
1.0 ADMISSIONS
1.1 Admissions into Master of Computer Applications (MCA) programme of GITAM

University are governed by GITAM University admission regulations.
2.0 ELIGIBILTY CRITERIA
2.1 A pass in any Degree with 50% Marks and Mathematics at +2 level or Degree level or
equivalent examination.
2.2 Admissions into M.C.A. will be based on the following:
(i) Score obtained in GAT (PG), if conducted.

(ii) Performance in Qualifying Examination/Interview.
The actual weightage to be given to the above items will be decided by the authorities
before the commencement of the academic year.
3.0 STRUCTURE OF THE M.C.A. PROGRAMME
3.1 The Programme of instruction consists of:
(i) A core programme imparting to the student specialization of computer

applications.
(ii) An elective programme enabling the students to take up a group of
courses of interest to him/her.
(iii) Carry out a technical project approved by the Department and submit a
report.
3.2 Each academic year consists of two semesters. Every branch of the M.C.A. programme
has a curriculum and course content (syllabi) for the courses recommended by the Board
of Studies concerned and approved by Academic Council.
3.3 Project Dissertation has to be submitted by each student individually.
4.0 CREDIT BASED SYSTEM
4.1 The course content of individual courses - theory as well as practicals – is expressed in
terms of a specified number of credits. The number of credits assigned to a course
depends on the number of contact hours (lectures & tutorials) per week.
4.2 In general, credits are assigned to the courses based on the following contact hours per
week per semester.
One credit for each Lecture hour.

One credit for two hours of Practicals.
Two credits for three (or more) hours of Practicals.
4.3 The curriculum of M.C.A. programme is designed to have a total of 150 credits for the
award of M.C.A. degree. A student is deemed to have successfully completed a particular
semester’s programme of study when he / she earns all the credits of that semester i.e., he
/ she has no ‘F’ grade in any course of that semester.
5.0 MEDIUM OF INSTRUCTION
The medium of instruction (including examinations and project reports) shall be English.
6.0 REGISTRATION
Every student has to register himself/herself for each semester individually at the time specified by
the College / University.
7.0 CONTINUOUS ASSESSMENT AND EXAMINATIONS
7.1 The assessment of the student’s performance in each course will be based on continuous
internal evaluation and semester-end examination. The marks for each of the component
of assessment are fixed as shown in the Table 1.
Table 1: Assessment Procedure
S.No. Component of Marks allotted Type of Scheme of Examination

assessment Assessment
(i) Two mid semester
examinations shall be
conducted for 10 marks each.
Continuous (ii) Two quizzes shall be
40 evaluation conducted for 5 marks each.
(iii) 5 marks are allotted for
1 Theory assignments.
(iv) 5 marks are allotted for
attendance
The semester-end examination
Semester-end in theory courses will be for a
60 examination maximum of 60 marks.
Total 100
(i) 40 marks are allotted for
record work and regular
performance of the student in
the lab.
Continuous (ii) One examination for a
2 Practicals 100 evaluation maximum of 20 marks shall be
conducted by the teacher
handling the lab course at the
middle of the semester
(iii) One examination for a
maximum of 40 marks shall be
conducted at the end of the
semester (as scheduled by the
Head of the Department
concerned).
(i) 50 marks are allotted for

continuous evaluation of the
project work throughout the
3 Project work 100 Project evaluation semester by the guide.
(ii) 50 marks are allotted for the
presentation of the project work
& viva-voce at the end of the
semester.*
Comprehensive 100 marks are allotted for
Viva 100 Viva-voce comprehensive viva to be
5 conducted at the end of
programme.*
* Head of the Department concerned shall appoint two examiners for conduct of the examination.
8.0 REAPPEARANCE
8.1 A Student who has secured ‘F’ Grade in any theory course / Practicals of any semester
shall have to reappear for the semester end examination of that course / Practicals along
with his / her juniors.
8.2 A student who has secured ‘F’ Grade in Project work shall have to improve his report and
reappear for viva – voce Examination of project work at the time of special examination
to be conducted in the summer vacation after the last academic year.
9.0 SPECIAL EXAMINATION
9.1 A student who has completed the stipulated period of study for the degree programme
concerned and still having failure grade (‘F’) in not more than 5 courses ( Theory /
Practicals), may be permitted to appear for the special examination, which shall be
conducted in the summer vacation at the end of the last academic year.
9.2 A student having ‘F’ Grade in more than 5 courses (Theory/practicals) shall not be
permitted to appear for the special examination.
10.0 ATTENDANCE REQUIREMENTS
10.1 A student whose attendance is less than 75% in all the courses put together in any
semester will not be permitted to attend the end - semester examination and he/she will
not be allowed to register for subsequent semester of study. He /She has to repeat the
semester along with his / her juniors.
10.2 However, the Vice Chancellor on the recommendation of the Principal / Director of the
University College / Institute may condone the shortage of attendance to the students
whose attendance is between 66% and 74% on genuine medical grounds and on payment
of prescribed fee.
11.0 GRADING SYSTEM
11.1 Based on the student performance during a given semester, a final letter grade will be
awarded at the end of the semester in each course. The letter grades and the
corresponding grade points are as given in Table 2.
Table 2: Grades & Grade Points

Grade Grade points Absolute Marks
O 10 90 and above
A+ 9 80 – 89
A 8 70 – 79
B+ 7 60 – 69
B 6 50 – 59
C 5 40 – 49
F Failed, 0 Less than 40
11.2 A student who earns a minimum of 5 grade points (C grade) in a course is declared to
have successfully completed the course, and is deemed to have earned the credits
assigned to that course. However, a minimum of 24 marks is to be secured at the semester
end examination of theory courses in order to pass in the theory course.
.
12.0 GRADE POINT AVERAGE
12.1 A Grade Point Average (GPA) for the semester will be calculated according to the
formula:
Σ[Cx G]
GPA = ----------------
ΣC
Where
C = number of credits for the course,
G = grade points obtained by the student in the course.
12.2 Semester Grade Point Average (SGPA) is awarded to those candidates who pass in all the
courses of the semester.
12.3 To arrive at Cumulative Grade Point Average (CGPA), a similar formula is used
considering the student’s performance in all the courses taken in all the semesters
completed up to the particular point of time.
12.4 The requirement of CGPA for a student to be declared to have passed on successful
completion of the M C A programme and for the declaration of the class is as shown in
Table 3.
Table 3: CGPA required for award of Degree
Distinction ≥ 8.0*
First Class ≥ 7.0
Second Class ≥ 6.0
Pass ≥ 5.0
* In addition to the required CGPA of 8.0, the student must have necessarily passed all the courses of
every semester in first attempt.
13.0 ELIGIBILITY FOR AWARD OF THE MASTER OF COMPUTER APPLICATIONS
(M.C.A.) DEGREE
13.1 Duration of the programme:

A student is ordinarily expected to complete the M.C.A. programme in six semesters of
three years. However a student may complete the programme in not more than five years
including study period.
13.2 However the above regulation may be relaxed by the Vice Chancellor in individual
cases for cogent and sufficient reasons.
13.3 Project dissertation shall be submitted on or before the last day of the course. However, it
can be extended up to a period of 6 months maximum, with the written permission of
the Head of the Department concerned.
13.4 A student shall be eligible for award of the M.C.A. degree if he / she fulfils all the
following conditions.
a) Registered and successfully completed all the courses and projects.

b) Successfully acquired the minimum required credits as specified in the curriculum
corresponding to the branch of his/her study within the stipulated time.
c) Has no dues to the Institute, hostels, Libraries, NCC / NSS etc, and
d) No disciplinary action is pending against him / her.
13.5 The degree shall be awarded after approval by the Academic Council.
RULES
1. With regard to the conduct of the end-semester examination in any of the practical courses of the
programme, the Head of the Department concerned shall appoint one examiner from the
department not connected with the conduct of regular laboratory work, in addition to the teacher
who handled the laboratory work during the semester.
2. In respect of all theory examinations, the paper setting shall be done by an external paper setter
having a minimum of three years of teaching experience. The panel of paper setters for each
course is to be prepared by the Board of Studies of the department concerned and approved by the
Academic Council. The paper setters are to be appointed by the Vice Chancellor on the basis of
recommendation of Director of Evaluation / Controller of Examinations.
3. The theory papers of end-semester examination will be evaluated by two examiners. The
examiners may be internal or external. The average of the two evaluations shall be considered for
the award of grade in that course.
4. If the difference of marks awarded by the two examiners of theory course exceeds 12 marks, the
paper will have to be referred to third examiner for evaluation. The average of the two nearest
evaluations of the three shall be considered for the award of the grade in that course.
5. Panel of examiners of evaluation for each course is to be prepared by the Board of Studies of the
department concerned and approved by the Academic Council.
6. The examiner for evaluation should possess post graduate qualification and a minimum of three
years teaching experience.
7. The appointment of examiners for evaluation of theory papers will be done by the Vice Chancellor
on the basis of recommendation of Director of Evaluation / Controller of Examinations from a
panel of examiners approved by the Academic Council.
8 Project work shall be evaluated by two examiners at the semester end examination. One examiner
shall be internal and the other be external. The Vice Chancellor can permit appointment of second examiner
to be internal when an external examiner is not available.
9. The attendance marks ( maximum 5) shall be allotted as follows :
Percentage of Attendance Marks

76% to 80% 1
81% to 85% 2
86% to 90% 3
91% to 95% 4
96% to 100% 5
SYLLABUS
PROGRAM CODE: SPRCA200700
First Semester
Course Name of the Course Hrs. C
Code per Scheme of Examination
week
L P Duration Sem End Continuous
Exam Evaluation
SPRCA101 Fundamentals of Computer 4 0 3 hrs 60 40 4
Science
SPRCA102 Mathematical Foundations of 4 0 3 hrs 60 40 4
Computer Science
SPRCA103 Digital Logic Design 4 0 3 hrs 60 40 4
SPRCA104 Probability and Statistics 4 0 3 hrs 60 40 4
SPRCA105 Programming with C 4 0 3 hrs 60 40 4
SPRCA111 Programming with C Lab 0 3 3 hrs - 100 2
SPRCA112 Digital Logic Design Lab 0 3 3 hrs - 100 2
Total Credits 24
Second Semester
Course Code Name of the Course Hrs. C
per Scheme of Examination
week
Exam Evaluation
SPRCA201 Data Structures 4 0 3 hrs 60 40 4
SPRCA202 Computer Architecture 4 0 3 hrs 60 40 4
SPRCA203 Object Oriented Programming 4 0 3 hrs 60 40 4
in C++
SPRCA204 Optimization Techniques 4 0 3 hrs 60 40 4
SPRCA205 Accounting and Financial 4 0 3 hrs 60 40 4
Management
SPRCA211 Data Structures Lab using C++ 0 3 3 hrs - 100 2
SPRCA212 OOP with C++ Lab 0 3 3 hrs - 100 2
Total Credits 24
Third Semester
week
Exam Evaluation
SPRCA301 Computer Networks 4 0 3 hrs 60 40 4
SPRCA302 Operating Systems 4 0 3 hrs 60 40 4
SPRCA303 File Structures 4 0 3 hrs 60 40 4
SPRCA304 Design and Analysis of 4 0 3 hrs 60 40 4
Algorithms
SPRCA305 Unix programming 4 0 3 hrs 60 40 4
SPRCA311 FS Lab 0 3 3 hrs - 100 2
SPRCA312 UNIX Programming Lab 0 3 3 hrs - 100 2
Total Credits 24
L – Lectures P– Practicals C - credits
Fourth Semester
Course Name of the Course Hrs. per C
Code week Scheme of Examination
L P Duration S C
SPRCA401 Computer Graphics 4 0 3 hrs 60 40 4
SPRCA402 Data Base management Systems 4 0 3 hrs 60 40 4
SPRCA403 Java Programming 4 0 3 hrs 60 40 4
SPRCA404 Network Security 4 0 3 hrs 60 40 4
SPRCA405 Software Engineering 4 0 3 hrs 60 40 4
SPRCA411 DBMS Lab 0 3 3 hrs - 100 2
SPRCA412 Java Programming Lab 0 3 3 hrs - 100 2
SPRCA413 Minor Project 50` 50 3
Total Credits 27
Fifth Semester
Course Name of the Course Hrs. C
Code per Scheme of Examination
week
Exam Evaluation
SPRCA501 Web Technologies 4 0 3 hrs 60 40 4
SPRCA502 Multi Media Systems 4 0 3 hrs 60 40 4
SPRCA503 Object Oriented Software 4 0 3 hrs 60 40 4
Engineering
SPRCA521 Elective I: Distributed 4 0 3 hrs 60 40 4
Systems
SPRCA523 2. Advanced Database
Management Systems
SPRCA531 Elective II: 1. Data Mining 4 0 3 hrs 60 40 4
SPRCA532 2. E-Commerce
SPRCA511 OOSE Lab 0 3 3 hrs - 100 2
SPRCA512 WEB Programming Lab 0 3 3 hrs - 100 2
Total Credits 24
Sixth Semester
week
Exam Evaluation
Elective III: 4 0 3 hrs 60 40 4
SPRCA641 1.Mobile& Wireless Networks
SPRCA642 2. Embedded Systems
SPRCA643 3. Bio Informatics
Elective IV: 4 0 3 hrs 60 40 4
SPRCA651 1.Fuzzy Logic & Neural
SPRCA652 Networks
SPRCA653 2. Image Processing
3.Advanced Network Security
SPRCA611 Project 12 weeks 50 50 12
SPRCA612 Seminar 100 3
SPRCA613 Comprehensive Viva 100 4
Total Credits 27
Total Credits: 24 + 24+ 24+ 27+ 24+27 = 150
MASTER OF COMPUTER APPLICATIONS (M.C.A.) I Semester
SPRCA101 FUNDAMENTALS OF COMPUTER SCIENCE
L P C
4 0 4
Aim and Objective: The Name of the Course is designed to provide foundation of Computers and
Information technology and enable the students to understand the role of computer science in various
fields.
UNIT - I
Introduction: Characteristics of Computer, The Evolution of Computers, The Computer
Generations.
Basic Computer Organization: Input Unit, Output Unit, Storage Unit, Arithmetic Logic Unit, Control
Unit, Central Processing Unit, The System Concept.
UNIT - II
Secondary Storage Devices: Magnetic Tape, Magnetic Disk, Optical Disk, Magneto optical Disk, Mass
Storage Devices and Other related Concepts.
Computer Software: Types of Software, Logical systems Architecture, Acquiring Software, Software
developmental Steps, Software Engineering.
UNIT -III
Computer Languages: Machine Language, Assembly Language, High Level Language, Some High Level
Languages, Characteristics of good Programming Language.
Operating Systems: What is an Operating System, Process Management, Some Popular Operating
Systems.
UNIT – IV
Data Communications And Computer Networks: Basic Elements of a Communication System, Data
Transmission Modes, Data Transmission Speed, Data Transmission Media, Digital and Analog Data
Transmission, Data Transmission Services, Asynchronous and Synchronous Transmission, Network
Topologies, Network types (LAN, WAN, and MAN), Internetworking Tools, Wireless Networks,
Distributed Computing Systems.
UNIT - V
The Internet: Definition- Brief History, Basic Services, Internet Search Tools, WWW Browsers, Internet
Search Engines, Uses of Internet, How to get Connected to Internet and Other related Concepts.
Multimedia: What is Multi Media, What is multi media Computer system, Multi Media Components,
Multi Media Applications, Data Compression.
Classification Of Computers:
Notebook Computers, Personal Computers, Workstations, Main frame systems, Super Computers, Client-
server Systems.
Text Book:
1. Computer Fundamentals - Pradeep .K.Sinha : BPB Publications.
Reference Books:
1. Computer Fundamentals- Rajaraman V.
2. Introduction To Computers -Peter Norton
3. Fundamentals Of Information technology Alexis Leon, Methew Leon, Vikas publications
4. Internet–Margaret Levine Young–The Complete Reference–Millennium Edition–TMH Edition–1999.
5. Harley Hahn, The Internet – Complete Reference – Second Edition – TMH
SPRCA102 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
L P C
4 0 4
Aim and Objective: This paper is introduced in the curriculum to understand the concept and importance
of basic mathematical concepts and numerical methods. On completion of this paper, the student shall be
able to understand the concepts and results in Mathematical Logic, Set Theory, Lattices and Boolean
Algebra, Graph Theory and Numerical methods.
UNIT-I
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-II
Set Theory: Basic concepts of Set Theory - Relations and Ordering - Functions : Definitions and
Introduction, composite of Functions, Inverse functions, Binary and n-ary operations- Characteristic
Function of a Set.
UNIT-III
Lattices And Boolean Algebra: Lattices : Definition and examples – properties of lattices- sub lattices,
direct product and Homomorphism-some special lattices.
Boolean Algebra : Definition and examples – subalgebra , direct product and homomorphism-Boolean
functions.
UNIT-IV
Graph Theory: Graphs and Multigraphs- Subgraphs, Isomorphic and Homeomorphic Graphs- Paths,
Connectivity- The Bridges of Konigsberg, Traversable Multigraphs- Labeled and Weighted Graphs-
Complete, Regular, and Bipartite Graphs- Tree Graphs- Planar Graphs-Graph Colorings-Directed Graphs-
Basic Definitions- Rooted Trees- Sequential Representation of Directed Graphs- Warshall’s Algorithm;
Shortest Paths.
UNIT-V
Numerical Methods: Solution of Algebraic and Transcendental Equations : The Bisection Method – The
method of False Position – The Iteration Methods – Newton Raphson Method. Solutions to Systems of
Nonlinear Equations: The Method of Iteration – Newton-Raphson method . Numerical Integration :
Trapezoidal Rule- Simpson’s 1/3 – rule, Simpson’s 3/8th rule.
Text Books:
1. Discrete Mathematical Structures with applications to computer Science – J.P. Tremblay &
R. Manohar, Tata McGraw-Hill .
2. Discrete Mathematcs–Seymour Lipschutz & Marc Lipson, Schaum’s outlines–Tata McGraw Hill.
3. Introductory Methods of Numerical Analysis- S.S.Sastry, Prentice-Hall India.
Reference Books:
1. Discrete Mathematics and its Applications – Kenneth H.Rosen , Tata McGraw-Hill.
2. Numerical Methods for Engineers – Steven C.Chopra and Raymond P.Canale,Mc Graw Hill.
SPRCA103 DIGITAL LOGIC DESIGN

L P C
4 0 4
Aim and Objective: The Name of the Course aims to impart the knowledge about digital logic
fundamentals, design steps involved in flip-flop, shift register, Counters etc. The students shall be able to
understand Boolean laws, Boolean algebra, Boolean logic, logic gate fundamentals, function of flip-flop
and shift register.
UNIT - I
Number Systems: Number systems – converting number from one base to another-Complements –
Algorithms for r’s and r-l’s complements signed binary numbers, Binary codes - decimal, error
detection – reflected code– alphanumeric codes.
UNIT - II
Boolean algebra : Basic Definition, Axiomatic Definition, theorems and properties – Boolean functions –
canonical and standard forms logical operations – logic gates – Digital Logic families-Karnaugh map
up to 6 variables – Sum of Products (SOP) and Product of Sums (POS) simplification with don’t care
condition – tabulation method- Prim implicants.
UNIT - III
Combinational Circuit : Adder – Subtractor – code conversion – analyzing a combinational circuit-multi
level NAND and NOR circuits – binary parallel adder- decimal adder -BCD adder – Magnitude comparator
– decoders –Encoder-multiplexer- demultiplexer, ROM-PLA Design.
UNIT - IV
Sequential Circuit - Flip flops – triggering of flip flops – analyzing a sequential circuit state reduction
-excitation tables – counters – design with state equations.
UNIT - V
Registers, Counters and Memory Unit : Registers, Shift Registers- Ripple and synchronous counters,
Timing sequences, Memory Unit, Examples of Random Access memory..
Text Book:
1. Morris M. Mano, "Digital Logic and Computer Design", Prentice Hall India, Third Edition
Reference Books:
1. Thomas C. Bartee, "Computer Architecture Logic Design", Tata McGraw Hill 1997.
2. A. P. Malvino and D. P. Leach, “Digital Principles and Applications”, 4th edition,
McGraw Hill 1999.
3. T.L.Floyd “Fundamentals of Digital system”, Pearson Publications
MASTER OF COMPUTER APPLICATIONS (M.C.A)I Semester
SPRCA104 PROBABILITY AND STATISTICS

L P C
4 0 4
Aim and Objective: To expose the students to apply certain statistical concepts in practical
applications of computer science areas. On completion of this course the student will be familiar
with basic concepts of probability and random variables, distribution of random variables ,
correlation and regression analysis and to know the concepts of sampling, tests based on
hypothesis.
UNIT –I
Probability: Sample space – Events – Axiomatic approach to probability –conditional
probability Independent events – Baye's formula with applications.
Random Variables – Continuous and discrete random variables – Distribution function of a
random variable- conditional and marginal distributions- – Expectation, variance, coefficient of
variation, moment generation function.
UNIT – II
Probability Distribution: Discrete distributions – Binomial poison and geometric Distributions
– Continuous distributions – Uniform, Normal, Exponential.
UNIT – III
Correlation and Regression: Correlation coefficient – Rank Correlation coefficient of
determination – Linear Regression – Method of Least squares – Fitting of the curve of the form
ax + b, ax2+bx+c, abx ,axb and ae bx.
UNIT – IV
Sampling Theory: Concept of sampling – Methods of sampling – simple random sampling –
Systematic sampling and stratified random sampling (descriptions only) – concepts of sampling
distributions and standard error – point estimation (concepts only) – Interval estimation of mean
and proportion.
UNIT – V
Test of Hypotheses: Critical region – Two types of Errors – Level of significance – power of the
test – Large sample tests for mean and proportion – Exact tests based on t, F and Chi–square
distributions.
Text Books:
1. S.C. Gupta & V.K. Kapoor – Fundamentals of Mathematical Statistics – Sultan
Chand& Sons-2002.
2. “Probability and Statistics“, 2./e Spiegel , TMH .
Reference Book:
1. Irwin Millor and John E.Freund “ Probability and Statistics for Engineers”, PHI
SPRCA105 PROGRAMMING WITH C
L P C
4 0 4
Aim and Objective: To acquaint the student to learn C programming Language.
UNIT - I
Introduction : Writing Algorithms – Top Down Design – Some Simple Examples For Writing
Algorithms – Flowcharts, Structured Programming – Features Of C – Basic Input/Output – Single
Character Input/Output – String Input/Output – General Input/Output – Format Specifies.
Variables And Expressions : Character Set – Identifiers And Keywords – Variables – Constants
– Data Types – Data Type Conversions – Operators And Expressions.
UNIT – II
Control Structures : Decision Making And Branching - If, If-Else, Nested If, Switch, Go To –
Decision Making And Looping – For, While, Do-While.
UNIT - III
Arrays And Strings : Accessing Array Elements – Initializing Of Array – Multidimensional
Arrays – Strings – Arrays Of Strings – String Functions – Storage Classes.
Functions And Recursion : Introduction – User Defined And Library Functions – Function
Declaration – Function Definition – Return Values – Recursion – Towers Of Hanoi.
UNIT - IV
Pointers : Definition And Use Of Pointers - Address Operator – Pointer Variables –
Dereferencing Pointers – Pointers To Pointers – Pointers And Arrays – Array Of Pointers –
Pointers And Two Dimensional Arrays – Pointers And Character Strings.
Structures And Unions : Declaring And Using Structures – Structure Initialization – Structure
Within Structure – Operations On Structures – Array Of Structures – Array Within Structure –
Differences Between Structures And Unions.
UNIT - V
File Management :Introduction – Defining And Opening File –Closing A File – Input/Output
Operations On Files – Error Handling During I/O Operations – Random Access To Files –
Command Line Arguments
Dynamic Memory Allocation : Library Functions For Dynamic Memory Allocation – Malloc( ),
Calloc( ), Realloc( ).
Text Books:
1. Mastering C – By K.R.Venugopal , S.R.Prasad , Tata Mcgraw Hill Publishers,
New Delhi
2. How To Solve It By Computer – By Dromey R.G, Prentice Hall Of India Ltd.,
New Delhi.
References:
1. Programming Techniques Through C – By N.G.Venkatesh Murthy, Pearson
Education, New Delhi.
2. Programming With C , Schuam’s Outline Series – By Byron S.Goltfried
Tata Mcgraw Hill Publishers, New Delhi.
SPRCA111 PROGRAMMING WITH C LAB

L P C
0 3 2
1. Determining a given number is prime or not.
2. Pascal's triangle.
3. String Manipulation.
4. Matrix Multiplication.
5. Finding determinant of a Matrix.
6. Finding inverse of a Matrix.
7. Euclidean’s Algorithm for finding GCD.
Computing Combinations.
9. Creating database for telephone numbers and related operations. Use file concepts.
10. Creating database for Mailing addresses and related operations. Use structures.
11. Creating database for web page addresses and related operations. Use pointers.
12. File Processing.
13. Finding roots of equations: Bisection Method.
14. Finding roots of Equations: Newton–Raphson Method.
15. Finding roots of Equations: Secant Method.
16. Simpson’s 1/3rd Rule & Trapezoidal Rule.
Reference Books: Computer Oriented Numerical Methods – V. Raj Raman, - Prentice Hall
SPRCA112 DIGITAL LOGIC DESIGN LAB

L P C
0 3 2
1 Verification Of Logic Gates : AND, OR, NOT, NAND, NOR, Ex-OR, 3
Input AND on the Bread Board Trainer.
2. Implementation of AND , OR, NOT, Ex-OR gate functioning using NAND,

NOR Gates.
3.Design Adders, Subtractors Using Logic Gates.
4.Design of a Three Bit Comparator Circuit.
5.Design a 3 * 8 Decoder Using Two 2 * 4 Decoders.
6.Design a 4 * 1 Multiplexer Using Logic Gates.
7.Design RS, JK, D, T Flips Flops Using Logic Gates.
8.Design a Shift Register that performs shift left and Shift right operations..
9.Design a three bit Binary Up Counter.
10. Design a Mod -9 counter.
11Design a counter with the following series 0, 4, 2, 1, 6 and repeat using JK flip flop.
12. Design a BCD Counter.
Reference Book: Morris M. Mano “Digital Logic & Computer Design” Prentice
Hall India, 3rd Edition
MASTER OF COMPUTER APPLICATIONS (M.C.A.) II Semester
SPRCA201 DATA STRUCTURES

L P C
4 0 4
Aim and Objective

To introduce students to the different data structures and their applications. The emphasis is on
the following: stacks, queues, linked lists, trees and graphs, hashing, sorting techniques and tree
indexing techniques.
UNIT - I
Arrays and Abstract Data Types
Abstract Data Types – Asymptotic Notations– Complexity Analysis – Arrays – Representation of
Arrays – Operations on Arrays – Ordered Lists – Polynomials.
UNIT - II
Linked Lists
Singly Linked Lists – Circular Linked Lists – Doubly Linked Lists – Stacks – Queues – Circular
Queues – Evaluation of Expressions.
UNIT - III
Trees and Graphs
Trees – Binary Trees – Binary Tree Traversals – Binary Tree Representations – Binary Search
Trees – Threaded binary Trees – Application of Trees (Sets) – Representation of Graphs – Graph
Implementation – Graph Traversals– Application of Graph Traversals– Minimum Cost Spanning
Trees – Shortest Path Problems.
UNIT - IV
Searching & Sorting Techniques
Linear Search & Binary Search, Bubble Sort Selection Sort, Insertion Sort, Quick Sort, Merge
Sort, Heap Sort
UNIT - V
Hashing and Tree Indexing
Hashing – AVL Trees – Splay Trees –B Trees
Text Book:
Data Structures and Algorithm Analysis in C++ - Mark Allen Weiss
Reference Books:
1. Data Structures in C++, N.S.KUTTI & P.Y.PADHYE, Prentice Hall India, 2003
2. Data Structures & Algorithms in C++, Adam Drozdek, Vikas Publishing House, 2002.
SPRCA202 COMPUTER ARCHITECTURE

L P C
4 0 4
Aim and Objective: To introduce students to the architecture of a computer system with main
emphasis on pipeline & vector processing, arithmetic operations on integer, decimal
data and floating point data, IO organization, Memory organization.
UNIT - I
Central Processing Unit : Central Processing Unit General Register and Stack Organization –
Instruction Formats – Addressing Modes– Data Transfer and manipulation – Program Control –
RISC.
UNIT -II
Pipelining and Vector Processing: Pipelining – Arithmetic Instruction and RISC Pipelining–
Vector Processing – Array Processors.
UNIT - III
Computer Arithmetic: Addition and Subtraction – Multiplication and Division Algorithms –
Floating-Point and decimal Arithmetic operations.
UNIT - IV
Input–Output Organization : Peripheral devices – I/O Interface – Asynchronous Data Transfer
– Modes of Transfer – Priority Interrupt – Direct Memory Access -I/O Processor – Serial
Communications.
UNIT - V
Memory Organization: Memory Hierarchy – Main Memory- Auxiliary Memory– Associative
Cache and Virtual Memory
Text Book:
M. M. Mano – Computer System Architecture – 3rd Edition – PHI – 1994.
Reference Book:
J. P. Hayes – Computer Architecture and Organization – McGraw–Hill , 3rd Edition, 1998.
SPRCA203 OBJECT ORIENTED PROGRAMMING WITH C++

L P C
4 0 4
Aim and Objective : To introduce students to the concept of Object Oriented Programming
namely operator Over Loading , Inheritance, Polymorphism. The student will be able to develop
application programs applying object oriented Concepts.
UNIT - I
Principles of Object Oriented Programming: Software Evolution, Procedure oriented Vs
Object Oriented Programming Paradigm, Basic Concepts of OOPs, Benefits of OOP, Features
and Applications of OOP, Structure of C++ program.
Data Types, Operators and Expressions:
Character set, tokens, Keywords, Identifiers and Constants,, Data types and Sizes, Variables ,
Operators , Expression and their types, Implicit Conversion, Operator Overloading, Operator
precedence , Control Structures.
UNIT - II
Functions in C++: Function Prototype, Call by reference, Inline functions, Default Arguments,
const Arguments, Function Overloading, friend and Virtual functions, Library Functions.
Classes and Objects : Class, access specifies, Accessing Class members, Defining Member
functions, Memory Allocation for Objects, array of Objects, Static Data Members, Static Member
Functions, Friend Functions, Constructor, Parameterized Constructor, Dynamic initialization of
objects, Copy Constructor, Multiple Constructors in a class, Constructor with default arguments,
Dynamic Constructors, Destructors.
UNIT - III
Operator Overloading: Definition, Overloading Unary, Binary operators, Overloading Binary
Operators using Friends, String Manipulation using operators.
UNIT - IV
Inheritance, Virtual Functions, Templates : Base class, derived class, Single, Multiple, Multi
Level , Hierarchical , Hybrid Inheritance, Need for Virtual functions, Virtual base classes, Pure
Virtual Functions, Virtual Destructors. Generic Classes, Function Templates, Class template.
UNIT - V
I/O and Files : Streams and Stream Classes, Unformatted and Formatted I/O operations,
Manipulators. File – Operations, Modes, Sequential and Random Access Files.
Exception Handling: Basics of Exception handling, Exception handling Mechanism, Throwing

and Catching Mechanism.
Text Book:
Object Oriented Programming in C++ , E. Balaguruswamy, Third Edition, Tata McGraw Hill
Publication.
Reference Book:
Mastering C++ , K.R.Venu Gopal , Tata McGraw Hill Publication.
Object Oriented Programming in C++ , Bhave , Patekar.
SPRCA204 OPTIMIZATION TECHNIQUES

L P C
4 0 4
Aim and Objective: To introduce various optimization techniques and their computer
implementation.
UNIT - I
Overview of operations Research: OR models – OR Techniques.
Linear Programming: Introduction – Mathematical Formulation - Graphical solution; Basic
feasible solutions -simplex algorithm – artificial variables – Big M and two phase method –
Degeneracy - alternative optima – unbounded solutions – infeasible solutions.
Dual problems: Relation between primal and dual problems – Dual simplex method.
UNIT - II
Integer Programming: Cutting plan algorithm - Branch and Bound Algorithms
Job Sequencing: Introduction – Solution of sequencing problems – processing of n jobs through
2 Machines, n jobs through 3 machines and n jobs through m machines.
UNIT - III
Transportation model: initial solutions. North West corner Rule - lowest cost method –Vogels
approximation method – Optimal solution – MODI method –Assignment problem –Hungarian
Method - Traveling Sales man problem.
UNIT - IV
Game theory: Two person Zero Sum Games – Mixed strategy games and their Algorithms.
UNIT - V
Network Models : Definitions – CPM and PERT – Their Algorithms
Dynamic Programming: Recursive nature of dynamic programming – Forward and Backward
Recursion
Text Books:
1. Operations Research – An Introduction, Handy A Taha – Pearson Education .

2. Operations Research–Kanti Swaroop, Manmohan and P.K.Gupta–Sultan
Chand Company Ltd.
Reference Book:
1. Sharma. S.D., “Operation Research”, Keder Nath Ram Nath & co., 1989.
L P C
4 0 4
SPRCA205 ACCOUNTING AND FINANCIAL MANAGEMENT
Aim and Objective

The main objective of this Name of the Course is to provide basic working knowledge of
accounting and financial management and to know how accounting and financial management
helps the management to take decision.
UNIT-I
Principles of Accounting
Principles of Double entry – Journalizing, Ledger – Posting and preparation of Trial Balance –
Preparation of Trading Account, Profit and loss Account and Balance Sheet including
Adjustments (Simple problems only), Bank Reconciliation Statement – Concepts, Conventions
and Basic Accounting Assumptions.
UNIT-II
Analysis Interpretation of Financial Statements
Ratio analysis – uses of ratios in interpreting the Final Accounts (Trading a/c–Profit and Loss A/c
and Balance Sheet) – Final Accounts to as well as Ratios to Final Accounts Problems. (Simple
problems only).
UNIT-III
Break–even Analysis and Marginal Costing
Meaning of variable cost and fixed cost – Cost–Volume – Profit Analysis – Calculation of Break–
even point, Profit Planning, Sales planning and other decision – making Analysis involving
Break–even Analysis.
UNIT-IV
Budget/Forecasting
Preparation of and Characteristics of functional Budgets – Production, Sales, Purchases, Cash and
Flexible budgets, Zero Based Budgeting.
UNIT-V
Project Appraisal
Method of Capital investment decision making: Pay back Method, ARR Method – Discounted
Cash Flow – Methods including Net Present Value and IRR Method.
Text Book:
1. R. L. Gupta and Radhaswamy, Advanced Accountancy, Volume One, Sultan Chand & Co.,
2003.
Reference Books:
1. B. K. Bhar, Cost Accounting–Methods and Problems, Academic Publisher,
1995.
2. S. N. Maheswari, Elements of Management Accountancy, Sultan Chand & Co., 3 rd
Edition, 1996.
3. P.C. Tulisan–Financial Accounting–Tata McGraw Hill Publication, New Delhi–First
Edition, 2002.
SPRCA211 DATA STRUCTURES LAB USING C++
L P C
0 3 2
For the implementation of the following problems, the students are advised to use all
possible object oriented features. The implementation based on structured concepts will
not be accepted.
1. Implementation of Stack (using Arrays and Pointers).
2. Conversion of Infix to postfix and prefix .
3. Evaluation of Postfix expression.
4. Implementation of Queue (using Arrays and Pointers).
5. Implementation of Circular Queue (using Arrays and Pointers)
6. Singly Linked List.
7. Doubly Linked list.
8. Circular Linked List.
9. Binary Tree implementations and Traversals.
10. Binary Search Trees.
11. Bubble sort, Selection Sort, Insertion Sort, Merge sort , Quick Sort and Heap Sort.
12. Graph Implementation using Adjacency Matrix and Adjacency List and display using
Depth First Search and Breadth First Search.
13. Dijkstra’s , Kruskal’s, and Warshall Algorithm
L P C
SPRCA212 OOP WITH C++ LAB 0 3 2
1. Write a program to illustrate the Class Declarations, Definition and accessing Class
members.
2. Write a program to implement a class student having the following members :
Data Members Member Functions
Name of the student To assign Initial Value
Marks of the Student Compute Total and Average
To Display the Data
3. Write a program to demonstrate Operator OverLoading.
4. Write a program to demonstrate Function OverLoading.
5. Write a program to demonstrate Friend Function and Friend Class.
6. Write a program to access members of a student class using pointer to object members.
7. Write a Program to demonstrate containership.
8. Write a Program to generate Fibonacci Series by Using Constructor to initialize the data
members.
9. Write a program to demonstrate multiple Inheritance.
10 .Write a program to invoking derived class member through base class pointer.
11 .Write a template based program to sort the given list of elements.
12. Write a program to demonstrate the catching of all exceptions.
13. Write a program containing a possible exception. Use a try block to throw it and a catch
block to handle it properly.
14. Write a program to demonstrate Dynamic Binding through Virtual Functions.
15. Write a program to perform insertion, deletion, updation of student records using
sequential and random access files.
Reference Books: Object Oriented Programming in C++ E-Balaguruswamy
MASTER OF COMPUTER APPLICATIONS (M.C.A.) III Semester
SPRCA301 COMPUTER NETWORKS
L P C
4 0 4
Aim and Objective : To produce a core knowledge of networking concepts and techniques to
design simple network, provide in-depth knowledge about the various communication
technologies and enable the student to understand how information are transmitted in networks.
UNIT - I
Introduction: Data Communications, Networks, The Internet, Protocols and Standards
Network Models: Layered Tasks, The OSI Model, Layers in the OSI Model, TCP/IP Protocol
Suite, Addressing.
Digital Transmission: Transmission Modes.
UNIT- II
Transmission Media: Guided Media, Unguided Media: Wireless Transmission.
Switching: Circuit Switched Networks, Datagram Networks, Virtual- Circuit Networks,
Structure of a Switch.
Data Link Layer, Error Detection and Correction: Introduction, Block Coding, Linear Block
Codes, Cyclic Codes, Checksum.
UNIT-III
Data Link Control: Framing, Flow and Error Control, Protocols, Noiseless Channels, Noisy
Channels, HDLC, Point-to-Point Protocol
Wired LANs: Ethernet: IEEE Standards, Standard Ethernet, Changes in the Standard, Fast
Ethernet, Gigabit Ethernet.
Connecting LANs, Backbone Networks and Virtual LANs: Connecting Devices, Backbone
Networks, Virtual LANs.
UNIT –IV
Network Layer: Address Mapping, Error Reporting and Multicasting: Address Mapping,
ICMP, IGMP,ICMPv6
Delivery, Forwarding and Routing: Delivery, Forwarding, Unicast Routing Protocols,
Multicast Routing Protocols.
UNIT – V
Transport Layer:
Process to Process Delivery: UDP,TCP and SCTP
Application Layer:
Domain Name System: Namespace, Domain Name Space, Distribution of Name Space, DNS in
the INTERNET, RESOLUTION, DNS Messages, Types of Records, Registrars, Dynamic
Domain Name System(DDNS), Encapsulation.
Text book:
Data Communications and Networking : Behrouz A Forouzan, TMH (4th Edition)
Reference Book:
1. Computer Network : Andrew S. Tennanbaum,
SPRCA302 OPERATING SYSTEMS
L P C
4 0 4
Aim and Objective: To provide a core knowledge of operating system concepts and techniques
and to help designing a new system. Case study on Unix Windows XP, illustrate how the
techniques are used or implemented in practice
UNIT – I
Introduction: What is an Operating System? Mainframe systems, Desktop systems,
Multiprocessor systems, Distributed systems, Clustered systems, Real-Time systems,
Handheld systems, Feature migration, Computing environments.
Operating System Structures: System components, Operating-system services,
System calls, System programs, System structure, Virtual machines, System design
and implementation, System generation.
Processes: Process concept, Process scheduling, Operations on processes,
Cooperating processes, Interprocess communication, Communication in client-server
Systems.
UNIT – II
Threads: Overview, Multithreading models, Threading issues, Linux threads,
Java threads.
CPU Scheduling : Basic concepts, Scheduling criteria, Scheduling algorithms,
Multiple-processor scheduling, Real-Time scheduling, Algorithm evaluation,
Process scheduling models.
Process Synchronization : Background, The Critical-section problem, Synchronization
hardware, Semaphores, classic problems of Synchronization, Critical regions,
Monitors.
UNIT – III
Deadlocks: System model, Deadlock characterization, Methods for handling deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from
Deadlock.
Protection: Goals of protection, Domain of protection, Access matrix, Implementation
of access matrix, Revocation of access rights, Capability-based systems, Language-
based protection.
UNIT – IV
Memory Management: Background, Swapping, Contiguous memory allocation,
Paging, Segmentation, Segmentation with paging.
Virtual Memory: Background, Demand paging, Process creation, Page replacement,
Allocation of frames, Thrashing, Operating-system examples, Other considerations.
UNIT – V
Case Studies:
The Linux System: History, Design principles, Kernel modules, Process management,
Scheduling, Memory management, File systems, Input and output, Interprocess
Communication, Network structure, Security.
Windows XP: History, Design principles, System components, Environmental
subsystems, File system, Networking, Programmer interface.
Text Book:
1. Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin, Greg
Gagne,
John Wiley & Sons, Inc.
References:
1. Operating Systems, Achyut S. Godbole, Tata McGrawHill.
2. A Practical Guide to Linux, Mark G. Gobel, Addison-Wesley.
MASTER OF COMPUTER APPLICATIONS (M.C.A.) III Semester L P C
SPRCA303 FILE STRUCTURES 4 0 4
Aim and Objective: It gives the students the knowledge about file structure design. It is an
object oriented approach in implementing file structures using C++.
UNIT-I
File Processing Operations: Physical and logical files, opening, reading & writing and closing
files in C, seeking and special characters in files, physical devices and logical files, file related
header files in C ; Secondary Storage : Disks – organization, tracks, sectors, blocks, capacity,
non-data overhead, cost of a disk access, Magnetic Tape – types, performance, organization
estimation of tape length and data transmission times, disk vs. tape, CD-ROM-CD-ROM as a file
structure, physical organization, strengths and weakness of CD-ROMS, storage hierarchy. Byte
Journey and buffer Management: File manager, I/O buffer I/O processing, buffer strategies and
bottlenecks.
UNIT-II
File Structure Concepts: A stream file, field structures, reading a stream of fields, record
structures and that uses a length indicator, Mixing numbers and characters – use of a hex dump,
reading the variable length records from the files. Managing records in C files: Retrieving
records by keys, sequential search, direct access, choosing a record structure and record length,
header records, file access and file organization Organizing files for performance: Data
compression, reclaiming space – record deletion and storage compaction, deleting fixed length
records for reclaiming space dynamically, deleting variable – length records, space fragmentation,
replacement strategies.
UNIT-III
Indexing: Index, A simple index with an entry sequenced file, basic operations on an indexed,
entry sequenced file, indexes that are too large to hold in memory, indexing to provide access by
multiple keys, retrieval using combination of secondary keys, improving the secondary index
structure – inverted lists.
Multilevel Indexing and B-trees: Introduction, indexing with binary search trees, multilevel
indexing, a better approach to tree indexes, B_trees: working up from the bottom Example or
creating a B-tree an object-oriented representation of B-Trees, B-tree methods search, insert and
others, B-tree nomenclature, formal definition of B-tree properties worst case search depth,
deletion, merging and redistribution, Redistribution during insertion, B* trees, Buffering of
pages: Virtual B_trees, variable length records and keys.
UNIT-IV
Indexed sequential file access and prefix B + Trees: Indexed sequential access, maintaining a
sequence set, adding a simple index to the sequence set, the content of the index: separators
instead of keys, the simple prefix B+tree, simple prefix B+tree maintenance, index set block size
internal set block size, internal structure of index set blocks: a variable order B-tree, loading a
simple prefix B+tree
UNIT-V
Hashing: Collisions in hashing, a simple hashing algorithms, hashing functions and record
distributions, memory requirements, collision resolution by progressive overflow, buckets and
deletions.
Extendable hashing: Working of extendable hashing, implementation, deletion, extendable
hashing performance, Implementation in C++
Text Book:
File Structures – An Object Oriented Approach with C++, Michael J./folk, Bill Zoe lilck
and Greg Rig Riccardi, Pearson Education.
SPRCA304 DESIGN AND ANALYSIS OF ALGORITHMS
L P C
4 0 4
Aim and Objective:

To introduce students, the concepts of algorithm analysis to find out the space and time
complexity of different algorithms. Different design techniques such as greedy method, divide
and conquer, backtracking, dynamic programming, branch and bound are to be studied for
finding the solution to the different problems. It also provides an insight into the basic concepts
of NP and NP-hard problems and their relevance in research.
UNIT-I
Introduction to Algorithms
Introduction and Divide and Conquer: Algorithm – Complexity analysis – Introduction to random
algorithms – General Method – Finding maximum and minimum – Strassen's matrix
multiplication – Quick sort – Selection sort.
UNIT-II
Greedy Method and Dynamic Programming
Greedy Method: General Method – Tree vertex splitting – Job sequencing with dead lines –
Shortest Path – Knapsack 01.
Dynamic Programming: General Method – multistage graphs – String Editing – Travelling
Salesman Problem.
UNIT-III
Back Tracking
Back Tracking: General Method – Sum of Subsets – Graph Coloring – Depth First Search –
Breadth First Search.
UNIT-IV
Branch and Bound
Branch and Bound: General Method – 01 Knapsack Problem – Travelling Salesperson –
Algebraic Manipulation.
UNIT-V
Lower Bound Theory
Lower Bound Theory: Comparison trees – Oracles and advisory arguments – Lower bounds
through reduction – Basic Concepts of Np–Hard and Np–Complete.
Text Book:
E. Horowitz, S.Sahni and S. Rajasekaran – Computer Algorithms – Galgotia – 2005.
Reference Books:
1. “Fundamentals of Algorithms “ - G. Brassard and P. - PHI – 2002
2. “Introduction to Algorithms”- T. Cormen, C.E. Leiserson, R.L. Rivest & C. Stein –
Introduction to Algorithms – PHI – 2nd Edition, 2005.
SPRCA305 UNIX PROGRAMMING L P C
4 0 4
Aim and Objective: To introduce students, the concepts of UNIX programming
giving exposure to various features of UNIX programming like developing Programs
using Semaphores, Process Scheduling etc.
UNIT- I
Unix Utilities – Introduction to Unix file system, vi editor, file handling utilities, security by file
permissions, process utilities, disk utilities, networking commands, cp, mv ln, rm, unlink, mkdir,
rmdir, du, df, mount, umount, find, unmask, ulimit, ps, who, w, finger, arp, ftp, telnet, rlogin, text
processing utilities and backup utilities, detailed commands to be covered are cat, tail, head, sort,
nl, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg, comm., cmp, diff, tr, awk, tar, cpio.
Problem solving approaches in Unix: using single commands, using compound Commands,
shell scripts, C programs building own command library of programs. Working with the Bourne
shell: what is a shell, shell responsibilities, pipes and input Redirection, output redirection, here
documents, the shell as a programming language, shell meta characters, shell variables, shell
commands, the environment, control structures, shell script example.
UNIT-II
Unix Files: Unix file structure, directories, files and devices, system calls, library functions, low
level file access, usage of open, create, read, write, close, lseek, stat, fstat, octl, umask, dup, dup2.
The standard I/O (fopen, fclose, fflush, fseek, fgetc, getc, getchar, fputc, putc, putchar, fgets,
gets), formatted I/O stream errors, streams and file descriptors, file and directory maintenance
(chmod, chown, unlink, link, symlink, mkdir, rmdir, chdir, getcwd), Directory handling system
calls (Opendir, readdir, closedir, rewinddir, seekdir, telldir)
UNIT-III
Unix Process and Signal: What is process, process structure, starting new process, waiting for a
process, zombie process, process control, process identifiers, system call interface for process
management-fork, vfork, exit, wait, waitpid, exec, system, signals – Signal functions, unreliable
signals, interrupted system calls, kill and raise functions, alarm, pause functions, abort, sleep
functions.
UNIT-IV
Inter process Communication Overview: Introduction to IPC, IPC between processes on a
single computers system, IPC between processes on different systems, file and record locking,
other unix locking techniques, pipes, FEFOs, streams and messages, namespaces, introduction to
three types of IPC (system-V) message queues, semaphores and shared memory.
Message Queues – Unix system V message unix kernel support for messages, unix APIs for
messages, client/server example.
UNIT-V
Semaphores- Unix system-V semaphores, unix kernel support for semaphores, unix APIs for
semaphores, file locking with semaphores. Shared Memory-Unix system-V shared memory, unix
kernel support for shared memory unix APIs for shared memory, semaphore and shared memory
example.
Sockets: Berkeley sockets, socket system calls for connection oriented protocol and
connectionless protocol, example client/server program.
Text Books:
1. Unix Network Programming W.r. Stevens Pearson/PHI.
2. Unix Concepts and Applications, 3rd Edition, Sumitabha Das, TMH.
3. Advanced Unix Programming 2nd Edition, M.J.Rochkind, Pearson Education.
Reference Books:
1. Unix system programming using C++, T.Chan, PHI.
2. Unix for programmers and users, 3rd Edition Graham Glass, King Ables, Pearson Education.
3. Unix system V Network Programming, Stephen A. Rago, Pearson Education.
4. Unix programming environment, Kernighan and Pike, PHI. Pearson Education.
SPRCA311 FS LAB
L P C
0 3 2
1. File Operations:
Opening, reading, writing, closing and creating of files in C++
2.Study of secondary storage device:
Tracks, sectors, block capacity of disk, tape and CD ROMs
3.File Structures in C++
Reading a stream of fields, record structures and its length indicators, Mixing of numbers and
characters, Use of a hex dump, Retrieving records by keys using sequential search, direct
access
4. File performance
Data compression, storage compacting, reclaiming space dynamically
5. Indexing and indexed sequential files
Index file, inverted file operations, usage of B and B++ trees
6. Hashing files
Hashing functions, algorithms, record distribution and collision resolution by progressive

over flow, Extendable hashing and hashing performance.
Text Book:
File Structures – An Object Oriented Approach with C++, Michael J.Folk, Bill Zoe lilck and
Greg Riccardi, Pearson Education.
SPRCA312 UNIX PROGRAMMING LAB
L P C
0 3 2
1. Study of laboratory environment:
Hardware Specifications: System details, Network details
Software Specifications: O.S. details, Compilers
2. Write “Unix Programming Lab.” N times in a file: outfile.txt in current directory
using system calls and user-defined function ‘writefile(char * )’. N is an integer
given through a file infile.txt.
3. Checking error numbers with externally declared integer errno and using perror
library function
Shell Programs:
4. Average of marks in three Name of the Courses of a student
5. Sum of digits in a 5-digit number using while loop
6. All combinations of 1,2 and 3 using for loops
7. Finding Leap year program using if structure
8. Executing Unix commands using case (switch) structure
Programs on Processes:
9. Chain of processes
10. Fan of processes
Programs on Communication:
11. Primitive Communications: Lock Files, Signal and Signal management Calls
12. Pipes: Unnamed Pipes, Named Pipes
13. Message Queues: Creating a Message Queue, A Client-Server Message Queue
Programs on Process Scheduling:
14. FCFS scheduling algorithm

15. Round Robin scheduling algorithm
16. Priority scheduling algorithm (Preemptive)
17. Priority scheduling algorithm (Non-preemptive)
18. Shortest-Job-First scheduling algorithm (Preemptive)
19. Shortest-Job-First scheduling algorithm (Non-preemptive)
Programs using Semaphores:

20. Creating and Accessing Semaphore Sets, Semaphore Operations
Reference Books:
1. Unix concepts & Applications, 3rd edition, Sumitabha Das, TMH
2. Unix Network Programming W.R. Steverns Pearson/PHI
3. Advanced Unix Programming 2nd Edition H.J.Rochkind, Pearson Education
MASTER OF COMPUTER APPLICATIONS (M.C.A.) IV Semester
SPRCA401 COMPUTER GRAPHICS
L P C
4 0 4
Aim and Objective: The Objective of the courses to teach the students the fundamentals of Computer
Graphics which will help the student to learn out design and develop optimal graphics algorithms with the
optimal storage requirement.
UNIT-I
Introduction to computer graphics- Introduction, Non interactive/interactive Graphics, Uses of computer

graphics, Classification of Applications, Programming Language, Graphics and Operating software,
Graphic Systems Configuration.
Graphic Systems-Introduction, Cathode Ray Tube(CRT)basics, Refresh Display, Direct View Storage
Tube(DVST), Raster Display, Input devices, Output devices, Computer Graphic Software, Integration of
Graphics Standard, Interactive Graphic Techniques, Graphical User Interface.
UNIT-II
Output Primitives- Introduction, Representing Image, Straight Line, Line drawing algorithms, Differential
Digital Analyser(DDA)algorithm, Bresenham’s Line Algorithm, Circle generating Algorithm, Bresenham’s
circle Algorithm, Midpoint circle Algorithm, Ellipse Generating Algorithm, Midpoint Ellipse Algorithm,
Polygon filling Algorithms, Character or Text Generation, Aliasing and Anti alising
UNIT-III
Two Dimensional Transformations-Introduction, Representation of points, Matrix Algebra and
Transformation, Transformation of points, Transformation of straight line, Midpoint Transformation,
Transformation of Parallel Lines, Transformation of Intersecting Lines, Rotation, Reflection and Scaling of
Straight Line or Polygons, Combined Transformation, Translation and Homogeneous Coordinates,
Rotation about an Arbitrary point, Reflection about an Arbitrary Line.
Window Clipping- Introduction, Viewing Transformation, Clipping, Point Clipping, Line Clipping,
Cohen-Sutherland Line clipping, Parametric Liang-Barsky 2D Line Clipping Algorithm, Polygon Clipping,
Sutherland-Hodgman Algorithm, Curve Clipping, Text Clipping
UNIT-IV
3D Concepts and Techniques- Introduction, 3D Transformations, Rotation about an axis Parallel to a
Coordinate Axis, Rotation about an Arbitrary Axis in Space, Reflection through an Arbitrary Plane, 3D
Modelling Schemes, Projection, Orthographic Projection, Isometric Projection, Oblique Projection,
Perspective Projection, One Two and Three point Perspective, Viewing Parameters, Object Coordinate
Conversion to View Plane Coordinate, 3D Clipping, View Volume.
UNIT-V
Animation and Multimedia-Introduction to Animation, Devices for Producing Animation, Computer
Assisted Animation, Video Formats, Frame-by-Frame Animation Techniques, Real-Time Animation
Techniques , Animation Software. Introduction to Multimedia, visual Elements, Sound Elements,
Multimedia Storage.
Text Book:
Computer Graphics- Amarendra N Sinha, Arun D Udai, Tata McGraw Hill
Reference Book:
Computer Graphics 2nd Edition Donald Hearn, M. Pauline Baker Prentice Hall
MASTER OF COMPUTER APPLICATIONS (M.C.A.) IV semester
SPRCA402 DATABASE MANAGEMENT SYSTEMS L P C
4 0 4
Aim and Objective: The aim of this course is to introduce the students to basic concepts of
databases and database management systems with emphasize on relational databases. The entity
relationship diagram helps the students to design the database and the concept of normalization.
UNIT-I
Introduction And Conceptual Modeling:
Databases and Database Users: Introduction, Characteristics of Database Approach, Actors on the
Scene, Workers defining the Scene, Advantages of using DBMS Approach.
Database System-Concepts and Architecture : Data Models, Schemas and Instance; Three-Schema
Architecture and Data Independence; Database Language and Interface, The Database System
Environment; Centralized and Client/Server Architecture of Database Management Systems; Classification
of Database Management Systems.
UNIT-II
Data Modeling Using The E-R Model: High- Level Conceptual Data Models for Database Design; Entity
Types, Entity Sets, Attributes and Keys; Relationship Types, Relationship Sets, Roles and Structural
Constraint; Weak Entity Types, ER Diagrams, Naming Conventions and Design Issues. Enhanced ER and
UML Modeling, An Example of University EER Schema and Formal Definitions of EER Models, UML
Class Diagrams; Relationship Types of Degree Higher Than Two.
The Relational Data Model and Relational Database Constraints : Relational Model Concepts,
Relational Model Constraints and Relational Database Schemas; Updating Operations and Dealing with
Constraints Violations.
UNIT-III
The Relational Algebra : Unary Relational Operations: SELECT and PROJECT; Relational Algebra
Operations from Set Theory; Binary Relational Operations: JOIN and DIVISION; Additional Relational
Operations; Examples of Queries in Relational Algebra.
Relational Database Design By ER And EER-To-Relational Mapping: Relational Database Design
using ER-to-Relational Mapping; Mapping EER Model Constructs to Relations.
UNIT-IV
SQL-99: Schema Definition, Basic Constraints, and Queries: SQL Data Definition, Specifying Basic
Constraints in SQL, Schema Change Statements in SQL, Basic Queries in SQL, More Complex SQL
Queries, INSERT, DELETE, UPDATE Statements in SQL, Additional Features of SQL, Specifying
General Constraints As Assertions, Views, Database Programming Issues and Techniques.
Relational Database Design: Informal Design Guidelines for Relational Schemas, Functional
Dependencies, Normal Forms Based on Primary Keys, General Definitions of 2nd and 3rd Normal Forms,
Boyce- Codd Normal Form, Properties of Relational Decomposition, Algorithms for Relational Database
Schema Design, Multi valued Dependencies and Fourth Normal Form, Join Dependencies and Fifth
Normal Form.
UNIT-V
Transaction Processing Concepts :
Introduction to Transaction Processing Concepts and Theory: Introduction to Transaction Processing;
Transaction and System Concepts; Characteristics Schedule based on recoverability, Concurrency Control
Techniques, Data base Recovery Concepts, Recovery Techniques.
Text Book:
1. Fundamentals of Database Systems Ramez Elmasri and Shamkant B. Navathe, Durvasula
V.L.N. Somayajulu, Shyam K. Gupta 4th edition, Pearson education.
Reference Book:
1. Database Concepts, Abraham Silberschatz, Henry F Korth, S.Sudarshan, McGraw-Hill
SPRCA403 JAVA PROGRAMMING
L P C
4 0 4
Aim and Objective: The aim of the course is teach students the basic concepts of Java programming. This
course covers preliminaries, I/O streaming and file handling and teach students how to program applets in
Java & networking and allow the students to implement effectively.
UNIT - I
The Primaries and Control Statements - Introduction to Java – Features of Java – Object Oriented
Concepts – Lexical Issues – Data Types – Variables – Arrays Operators – Control Statements.
UNIT - II
Classes and Objects - Classes – Objects – Constructors – Overloading method as Control – Static and
fixed methods – Inner Classes – String Class – Inheritance – Overriding methods – Using super–Abstract
class.
UNIT - III
Packages and Threads - Packages – Access Protection – Importing Packages – Interfaces – Exception
Handling – Throw and Throws – Thread – Synchronization – Messaging – Runnable Interface – Inter
thread Communication – Deadlock – Suspending, Resuming and stopping threads – Multithreading.
UNIT - IV
Applets and Event Handling – Applet Basics , Applet Architecture , Applet Skeleton ,Simple Applet
display methods , Requesting Repainting – Simple Banner Applet , HTML Applet Tag – Event Handling –
Two Event Handling Mechanisms , Event Classes , Event Listener Interfaces , Adapter Classes
UNIT – V
Swings - JApplet , Icons and Labels, Text Fields , Buttons , Combo Boxes , Tabbed Panes , Scrolled Panes,
Trees, Tables.
Text Book:
The Complete Reference Java 2 – Fifth Edition by Herbert Schildt TATA Mc Graw Hill Edition
Reference Books:
1. K. Arnold and J. Gosling – The Java Programming Language – 3rd Edition., Pearson Edu, 2005
2. David Flanagan – Java in a Nutshell: A Desktop Quick Reference for Java Programmers –
3. O’Reilly & Associates, Inc. 1999
4. Bruce Eckel –Thinking in Java – Prentice Hall, 2nd Ed 2002.
SPRCA404 NETWORK SECURITY
L P C
4 0 4
Aim and Objective
To enable the student to understand the importance of physical security for a network center, describe the
encryption technique, various security protection methods, apply audit and trial to ensure transaction
security, have the knowledge to design a secure computer network and establish a good security policy in a
business environment.
UNIT - 1
Introduction : Security goals, Attacks, Services and Mechanism, Techniques,
Traditional Symmetric Key Ciphers Introduction, Substitution Ciphers,
Transposition Ciphers, Stream and Block Ciphers, Modern Symmetric-Key Ciphers,
Modern Block Ciphers, Modern Stream Ciphers.
UNIT – II
Data Encryption Standard (DES) : Introduction, DES Structure, DES Analysis, Multiple DES,
Security of DES , Advanced Encryption Standard (AES) : Introduction, Transformations, Key
Expansion, Ciphers, Analysis of AESEncipherment Using Modern Symmetric-Key Ciphers: Use of
Modern Block Ciphers, Use of Stream Ciphers, Other Issues.
UNIT – III
Asymmetric-Key Cryptography : Introduction, RSA Cryptosystem, Rabin Cryptosystem, Elgamal
Cryptosystem, Elliptic Curve Cryptosystems, Integrity, Authentication and Key Management, Message
Integrity and Message Authentication: Message Integrity, Random Oracle Model, Message
Authentication, Cryptographic Hash Functions : Introduction, SHA, WHIRLPOOL, Digital Signature :
Comparison, Process Services, Attack on Digital Signature, Digital Signature Schemes
UNIT- IV
Entity Authentication : Introduction, Passwords, Challenge-Response, Zero-Knowledge, Biometrics ,
Key Management : Symmetric-Key Distribution, KERBEROS, Symmetric Key Agreement, Public Key
Distribution. Network Security, Security at the Application Layer: E-MAIL, PGP and S/MIME
UNIT – V
Security at the Transport Layer : SSL and TLS, SSL Architecture, Protocols, SSL Message Formats,
Transport Layer Security, Security at the Network Layer : IP Sec, Two Modes, Two Security Protocols,
Security Association, Security policy, IKE.
Text Book:
Cryptography and Network Security, by Behrouz A. Forouzan, Tata McGraw-Hill, New Delhi.
Reference Books:
1) Network Security : Private Communication in a Public World, Kaufman, Pearson Education Asia,
New Delhi
2) Cryptography and Network Security, By William Stallings Pearson Education, Asia, New Delhi.
MASTER OF COMPUTER APPLICATIONS (M.C.A.) IV Semester L P C
SPRCA405 SOFTWARE ENGINEERING 4 0 4
Aim and Objective: The main objective of this course is to introduce various software engineering
concepts and principles and detailed study of various phases of software engineering.. it include study of
various process models ,requirement engineering, design engineering and various testing strategies
&techniques. All this concepts are to be studied with procedural oriented features only
UNIT - I
Software and Software Engineering - The Evolving Role of Software, Software, The Changing Nature
of Software, Legacy Software, Software Myths, How it all Starts.
Software Engineering-Layered Technology, The Process Frame Work, The Capability Maturity Model,
Integration Process Patterns, Process Assessment, Personal and Team Process Models, Process
Technology, Product and Process
UNIT – II
Prescriptive Process Methods - Prescriptive Models, The Waterfall Model, Incremental Process Model,
Evolutionary Process Models, Specialized Process Models - Requirement Engineering
A Bridge to Design and Construct Requirement Engineering Tasks, Initiating Requirement Engineering
Process, Eliciting Requirements, Analysis Modeling
Requirement Analysis, Data Modeling Approaches, Data Modeling Concepts, Flow -Oriented Modeling,
Software Requirements Document.
UNIT-III
Design Engineering - Design With in the Context of Software Engineer, Design Process and Design
Quality, Design Concepts, The Design Model, Architectural Design
Software Architecture, Data Design, Architectural Design, Assessing Alternative Architectural Design,
Mapping Data Flow into Software Architecture.
UNIT-IV
Component –level Design - What is Component, Conducting Component-level Design, Designing
Conventional Components.
User Interface Design
The Golden Rules, User Interface Analysis and Design, Interface Analysis, Interface Design Steps, Design
Evaluation. The design Document
UNIT-V
Software Testing Strategies - A Strategic Approach to Software Testing, Strategic Issues, Test Strategies
for Conventional Software, Validation Testing, System Testing, The Art of Debugging, Software Testing
Techniques, Software Testing Fundamentals, Black Box and White Box Testing, Basis Path Testing,
Control Structure Testing.
Prescribed Book:
Software Engineering
A practitioners Approach-Pressmen, Sixth Edition, McGraw Hill Edition.
eference Books:
1. Software Engineering- K.K. Agarwal & Yogesh Singh, New Age International Publishers
2. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz, John Wiely.
3. Systems Analysis and Design- Shely Cashman Rosenblatt,Thomson Publications.
4. Software Engineering principles and practice- Waman S Jawadekar, The McGraw-Hill Companies.
SPRCA411 DBMS LAB
L P C
1. Create a table EMP with the following fields. 0 3 2
a) EName , Eno ,Salary , DeptNo , Address , Dname
b) Insert 5 records into EMP
c) ALTER EMP table I) Varying size of Eno field II) Adding a new field job
d) Delete the table EMP
2. Create a table EMP with the above mentioned fields.
Insert 5 records into EMP
Update the salary of the Employees by 10% hike
Delete the employees whose name is ‘AAA’
3. Create a table ORDER with the following fields and constraints.
ORDER
Column Name Constraint Name Constraint Type
Order-no pk-order-no PRIMARY KEY
Item-name itn UNIQUE
Qty ck-aty CHECK (25<QTY<50)
Rate-unit Nn-rate NOT NULL
Using Ex 3.
A) Drop unique constraint for item-name
B) Disable the constraint Nn-rate
C) Insert a record with NULL values for rate unit
D) Enable the constraint with NULL value existing on rate-unit
E) Create a table EMP mentioned above and test all the arithmetic functions and
character functions.
F) Add a field date-of-birth to EMP table and test all the date functions.
G) i) Modify EMP table adding a new field BONUS, update it using NVL
ii) Retrieve the employees whose name starts with S.
iii) Select all the employees who are working in IT department.
H) i) Using EMP table find the employee getting maximum salary
ii) Find the employee whose salary is minimum
iii) Find the sum of salaries of all the employees working in ‘ACCOUNTS’ department.
4. Create a table DEPT with the following fields
DNo. Primary Key ; D Name
Modify EMP table adding a foreign key constraint on DeptNo.
i) Insert 6 records into Dept. ii ) Implement the following Join operations
a)Self Join b) Equi Join c) Non Equi Join d) Outer Join e) Natural Join
5. Using EMP and DEPT, implement all type of view techniques.
a) Row subset view b) Column subset view c) Row column subset view d) Grouped view
e) Joined view f) With check option
6. Using EMP and DEPT
a) Create a sequence to insert the empno in EMP table b) Create a synonym for the above two tables
PL/SQL PROGRAMMING
1. Create a cursor to update the salary of employees in EMP table

2. a) Write a PL/SQL program to raise an Exception
When the bonus exceeds salary
b) Write a PL/SQL program to test the built-in Exceptions
3. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also
check whether that item exists.
4. Write a function to find substring.
5. Create a trigger which checks whether employee with Emp_no is present in the Employee table
before inserting into EMP.
Reference: SQL, PL/SQL Programming Language for Oracle 3rd Edition LVan Bayross
SPRCA412 JAVA PROGRAMMING LAB
L P C
0 3 2
1. Program to demonstrate various data types

2. Program to demonstrate various variables
3. Program to demonstrate various arrays
5. Program to demonstrate various arithmetic operators
6. Program to demonstrate Bit wise operators
7. Program to demonstrate relational operators
8. Program to demonstrate various control structures or control statements.
9. Program to demonstrate classes and objects
10. Program to demonstrate constructors and different number of parameters passed
to constructors.
11. Program to demonstrate overloading methods.
12. Program to demonstrate overloading constructors
13. Program to demonstrate call by value and call by reference
14. Program to demonstrate static variable and static class
15. Program to demonstrate single inheritance
16. Program to demonstrate super
17. Program to demonstrate multilevel inheritance
18. Program to demonstrate method over riding
19. Program to demonstrate dynamic method dispatch
20. Program to demonstrate Abstract Classes
21. Program to demonstrate packages
22. Program to demonstrate Interfaces
23. Program to demonstrate exception handling
24. Program to demonstrate Multiple coach clauses
25. Program to demonstrate Throw, throws, finally
26. Program to demonstrate Creative multiple threads
27. Program to demonstrate different control on applets
Reference: Java Complete reference 5th Edition Herb Schildt, Mc Graw – Hill ISBN - 0072224207
SPRCA413 MINOR PROJECT
L P C
0 0 3
MASTER OF COMPUTER APPLICATIONS (M.C.A.) V Semester
L P C
SPRCA501 WEB TECHNOLOGIES
4 0 4
Aim and Objective : To enable the student to understand the importance of various advances java features
like jdbc, java servlets and jsp, enterprise java beans. The main emphasis of this course is to develop the
projects using the advanced java concepts .
UNIT-I
JDBC: What is jdbc, jdbc API, Understanding jdbc architecture,jdbc types, different operations using jdbc
connectivity, Prepared statement, Callable statement.
Java Servlet Technology: What is a Servlet?, The Example Servlets, Servlet Life Cycle, Sharing
Information, Initializing a Servlet, Writing Service Methods, Filtering Requests and Responses, Invoking
Other web Resources, Accessing the Web Context Maintaining Client State, Finalizing a Servlet, Further
Information.
UNIT-II
Java server Pages Technology: What is a JSP Page? The Example JSP Pages, The Life Cycle of a JSP
Page, Creating Static Content, Creating Dynamic Content, Expression Language, Java Beans Components,
Using Custom Tags, Reusing Content in JSP Pages, Transferring Control to Another Web Component,
Including an Applet, Setting Properties for Groups of JSP Pages, Further Information.
Javaserver Pages Documents: The Example JSP Document, Creating a JSP Document, Identify the JSP
Document to the Container
UNIT-III
Javasever pages standard Tag Library: Using JSTL, Core Tag Library, XML Tag Library,
Internationalization Tag Library, SQL Tag Library
Custom Tags in JSP Pages: What is a Custom Tag? Types of Tags, Encapsulating Reusable Content
Using Tag Files, Tag Library Descriptors, Programming Simple Tag Handlers
Scripting in JSP Pages: Using Scripting, Disabling Scripting, Declarations, Scriptlets, Expressions,
Programming Tags That Accept Scripting Elements
Enterprise Beans: What is an Enterprise Bean? What is a session Bean? What is an Entity Bean? What is
a Message – Driven Beans? Defining Client Access with Interfaces, The contents of an Enterprise Beans,
Naming Conventions for Enterprise Beans, The life Cycles of Enterprise Beans
UNIT-IV
Getting Started with Enterprise Beans: Getting the J2EE Application, Creating the Enterprise Bean,
Creating the Application Client, Creating the Web Client, Mapping the Enterprise Bean References,
Specifying the Web Client’s Context Root, Deploying the J2EE Application, Running the Application
Client, Modifying the J2EE Application
Session Bean Examples: The Cart Bean Example, A web Service Example: Hello Service Bean, Other
Enterprise Bean Features, Using the Timer Service, Handling Exceptions
Bean-Managed Persistence Examples: The Savings Account Bean Example, Mapping Table
Relationships for Bean-Managed Persistence, Primary Keys for Bean-Managed Persistence, Deploytool
Tips for Entity Beans with Bean-Managed Persistence
UNIT-V
Container-Managed Persistence Examples: Overview of the Roster App Application, The Player Bean
Code, Method Invocations in Roster APP, Building and Running the Roster App Example, A Guided Tour
of the Roster App Settings, Primary Keys for Container- Managed Persistence, Advanced CMP Topics:
The OrderApp Example, Deploytool Tips for Entity Beans with Container-Managed Persistence.
A Message – Driven Bean Example: Example Application Overview, The Application Client, The
Message-Driven Bean Class, Deploying and Running Simple Message App, Deploy tool Tips for Message-
Driven Beans, Deploy tool Tips for Components that Send Messages
Text Books: 1. Head First Servlet & JSP by Bryan Basham Bert Bates Kathy Sierra
2. The J2EE Tutorial,2nd Edition, Stephanie Bodoff, Eric Armstrong,Jennifer Ball Java Database connectivity
3. Head First EJB by Katy Sieria Bert Bates
Reference Book: J2EE complete Reference
SPRCA502 MULTI MEDIA SYSTEMS L P C
4 0 4
Aim and Objective: The aim of the course is to give students a basic understanding of the technologies
underlying multimedia systems and to keep abreast of the latest trends in the booming game and
multimedia software industry. To make students familiar with various tools used in Multimedia and to
develop skills in working on Multimedia software like flash, dreamweaver and to understand the various
stages in a Multimedia project.
UNIT-I
Fundamental concepts in Text and Image: Multimedia and hypermedia, world wide web, overview of
multimedia software tools. Graphics and image data representation graphics/image data types, file formats,
color in image and video: color science, color models in images, color models in video.
Fundamental concepts in video and digital audio: Types of video signals, analog video, digital video,
digitization of sound, MIDI, quantization and transmission of audio.
UNIT-II
Action Script I: Action Script Features, Object-Oriented Action Scripts, Datatypes and Type Checking,
Classes, Authoring an ActionScript Class.
Action Script II: Inheritance, Authoring an ActionScript 2.0 Subclass, Interfaces, Packages, Exceptions
.
UNIT-III
Application Development: An OOP Application Frame work, Using Components with ActionScript,
Movie, Clip Subclasses.
Multimedia data compression: Lossless compression algorithm: Run-Length Coding, Variable Length
Coding, Dictionary Based Coding, Arithmetic Coding, Lossless Image Compression, Lossy compression
algorithm: Quantization, Transform Coding, Wavelet-Based Coding, Embedded Zerotree of Wavelet
Coefficients Set Partitioning in Hierarchical Trees (SPIHT)
UNIIT-IV
Basic Video Compression Techniques: Introduction to video compression, video compression based on
motion compensation, search for motion vectors, MPEG Basic Audio Compression Techniques.
UNIT-V
Multimedia Networks: Basics of Multimedia Networks, Multimedia Network Communications and
Application: Quality of Multimedia Data Transmission, Multimedia over IP, Multimedia over ATM
Networks, Transport of MPEG-4, Media-on-Demand (MOD).
Text Books:
1. Fundamentals of Multimedia by Ze-Nian Li and Mark S. Drew PHI/Pearson Education
2. Essentials ActionScript 2.0, Colin Moock, SPD O, Reilly
Reference Books :
1. Digital Multimedia, Nigel chapman and jenny chapman, Wiley-Dreamtech
2. Macromedia Flash MX Professional 2004 Unleashed, Pearson.
3. Multimedia and communications Technology, Steve Heath, Elsevier((Focal Press)
4. Multimedia Applications, Steinmetz, Nahrstedt, Springer.
5. Multimedia Basics by Weixel Thomson
6. Multimedia Technology and Applications, David Hilman, Galgotia
SPRCA503 OBJECT ORIENTED SOFTWARE ENGINEERING
L P C
4 0 4
Aim and Objective: The aim of this course is to provide the students for Object Oriented Software
Engineering features. It deals with project development using Object Oriented Analysis and Object
Oriented Design and Object Oriented Coding and Object Oriented Testing Techniques.
UNIT-I
Software Engineering: Software related problems, software engineering, concepts, development activities.
Modeling: Concepts, Modeling with UML
UNIT-II
Project Organization & Communication: Project Organization & communication concepts and their
activities
.
Requirements: Requirements elicitation & its activities and managing requirements elicitation ,,
Analysis: Analysis overview, concepts, activities and managing analysis
UNIT-III
System Design: Decomposing the system : System Design overview, System design concepts, and
System design Activities , and managing System Design
System design: addressing design goals : An overview of system design activities and concepts UML
Development diagram, System design goals, Managing system design
UNIT-IV
Object Design: Reusing Pattern Solutions : An overview of object design Reuse Concepts, Solution
objects, inheritance and design patterns.
An Object Design :Specifying Interfaces: An overview of interface specification, interface specifications

concepts & its activities and Managing object design
UNIT-V
Testing: Testing concepts, activities and managing testing
Project Management - Introduction, An overview of project management, Project Management Concepts, Project
Management Activities.
Text Book:
Object-Oriented Software Engineering: Using UML, Patterns and Java, Bernd Bruegge and Allen H. Dutoit, 2nd Edition,
Pearson Education Asia
Reference Books:
1. Object-Oriented Software Engineering: Practical software development using UML and Java
Timothy C. Lethbridge and Robert Laganiere , McGraw-Hill Higher education
2. An Introduction to Object Oriented Systems Analysis and Design with UML and the Unified
Process, Stephen R Schach, Tata McGraw-Hill
SPRCA521 ELECTIVE I – DISTRIBUTED SYSTEMS
L P C
4 0 4
Aim and Objective : The aim of this course is to enable the students to understand various
distributed systems concepts. It includes interprocess communication and distributed deadlocks and
distributed shared memory.
UNIT -I
Characterization of Distributed Systems and System Models:- Introduction, Examples of distributed
systems, Resource sharing and the Web, Challenges of Distributed system. Architectural models,
Fundamental models.
UNIT-II
Interprocess communication and Distributed objects and RMI:- Introduction, The API for the
Internetprotocols, External data representation and marshalling, Client-server communication, Group
communication, Case study: Interprocess communication in UNIX. Communication between distributed
objects, Java RMI case study.
UNIT -III
Distributed File Systems Name Services:- Introduction, File service architecture, SunNetwork file
system, The Andrew File System. Name services and the Domain Name System, Directory and discovery
services, Case study of the Global Name Service, Case study of the X.500 Directory Service
UNIT -IV
Time and Global States, Coordination and Agreement::- Introduction, Clocks, events and process states,
Synchronizing physical clocks, Logical time and logical clocks, Global states, Distributed mutual
exclusion, Elections, Multicast communication
UNIT -V
Distributed Deadlocks and Distributed Shared Memory: Distributed dead lock, Introduction, What is
Shared memory?, Consistency models, Page based Distributed Shared memory, Shared – variable
Distributed Shared memory, Object based Distributed Shared Me mory
Text Book:
1. Distributed Systems – Concepts and Design, George Coulouris, Jean Dollimore, Tim Kindberg,
Pearson Education.
Reference Books:
1. Distributed Systems – Principles & Paradigms, Andrew S. TenenBaum, Marten Van Steen, Pearson
Education.
2. Advanced Concepts in Operating Systems- Mukesh Singhal , Niranjan Shivaratri
SPRCA523 ELECTIVE I – ADVANCED DATABASE MANAGEMENT SYSTEMS
L P C
4 0 4
Aim and Objective: The objective of this course is to have overall view on various advanced databases
concepts like query processing, advanced data types and new applications.
UNIT I
Object-Based Databases: Overview, Complex data types, Structured types and inheritance in SQL, Table
inheritance, Array and multi set types in SQL, Object identity and reference types in SQL, Implementing
O-R features, Persistent programming languages, Object oriented verses object relations
XML: Motivation, Structure of XML data, XML document schema, Querying and transformation,
Application programming interface to XML, storage of XML data, XML applications
UNIT II
Query Processing: Overview, Measures of query cost, Selection operation, Sorting, Join operation,
Evaluation of expression
QUERY OPTIMIZATION: Overview, Transformation of relational expression, Estimating of statistics of
expression results, Choice of evaluation plans, Materialized views
UNIT III
Database System Architectures: Centralized and Client-Server Architectures, Server System

Architectures, Parallel Systems, Distributed Systems Network types
PARALLEL DATABASES: Introduction, I/O parallelism, Inter Query Parallelism, Intra Query
Parallelism, Intra Operation Parallelism, Inter Operation Parallelism, Design of Parallel Systems
UNIT IV
Distributed Databases: Homogeneous and heterogeneous databases, Distributed data storage, Distributed
transaction, Commit protocol, Concurrency control in Distributed databases, Availability, Distributed
Query Processing, Heterogeneous distributed data bases, Directory Systems
Advanced Application Development: Performance tuning, Performance Bench mark, Standardization,
Application migration
UNIT V
Advanced Data Types And New Applications: motivation, Time in databases, Spatial and Geographic
data, Multimedia Databases, Mobility and Personal Databases
Advanced Transaction Processing: Transaction-processing monitors, Transactional work flows, E-
commerce, Main memory databases, Real time transaction systems, Long duration transaction, Transaction
management in multi databases
Text Book:
1. DATABASE SYSTEM CONCEPTS (Fifth Edition), Abraham silberschatz, Henry F.Korth,
S. Sudarshan
Reference Book:
Fundamentals of Data base Systems , ramez Elmasri and Sharnkanth B.Navathe,
4th Edition , Perarson Education
MASTER OF COMPUTER APPLICATIONS (M.C.A.) V Semester L P C
SPRCA531 ELECTIVE II – DATA MINING 4 0 4
Aim and Objective: The Name of the Course is designed to meet the challenges of developing large data
warehouses, as the industrial market is moving towards customers satisfaction and relationship intelligence
will have to be embedded in business. The focus is mainly on the concepts of very large databases and their
applications. The objective is to introduce the basic concepts of data warehouses, the design and tuning its
performance. Concepts of knowledge discovery in databases is also given importance
UNIT – I
Introduction: Motivation and importance, What is Data Mining?, Relational Databases,

DataWarehouses, Transactional Databases, Advanced Database Systems and Advanced Database
Applications, Data Mining Functionalities, Interestingness of a pattern Classification of Data Mining
Systems, Major issues in Data Mining.
Data Warehouse and OLAP Technology for Data Mining : What is a Data Warehouse? Multi-
dimensional Data Model, Data Warehouse Architecture, Data Warehouse Implementation, Development of
Data Cube Technology, Data Warehousing to Data Mining.
UNIT – II
Data Preprocessing: Why Pre-process the Data? Data Cleaning, Data Integration and Transformation,Data
Reduction, Discretization and Concept Hierarchy Generation.
UNIT - III
Data Mining Primitives, Languages and System Architectures : Data Mining Primitives: What defines
a Data Mining Task? A Data Mining Query Language, Designing Graphical User Interfaces based on a
Data Mining Query Language, Architectures of Data Mining Systems.
Concept Description: Characterization and Comparison : What is Concept Description? Data
Generalization and Summarization-based Characterization,
Analytical Characterization: Analysis of Attribute Relevance, Mining Class Comparisons: Discriminating
between different classes, Mining Descriptive Statistical Measures in large Databases.
UNIT – IV
Mining Association Rules in large Databases : Association Rule Mining, Mining
Single-Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel
Association Rules from Transactional Databases, Mining Multidimensional Association Rules from
Relational Databases and Data Warehouses, From Association Mining to Correlation Analysis, Constraint-
based Association Mining.
Classification and Prediction : Concepts and Issues regarding Classification and Prediction, Classification
by Decision Tree Induction, Bayesian Classification, Classification by Backpropagation, classification
based on Concepts from Association Rule Mining, Other Classification Methods like k-Nearest Neighbour
Classifiers, Case-based Reasoning, Generic Algorithms, Rough Set Approach, Fuzzy Set Approaches,
Prediction, Classifier Accuracy.
UNIT – V
Cluster Analysis : What is Cluster Analysis? Types of Data in Cluster Analysis, A Categorization of
Major Clustering Methods, Partitioning Methods, Hierarchical Methods, Density-based Methods, Grid-
based Methods, Model-based Clustering Methods, Outlier Analysis, Summary.
Text Book:
Data Mining Concepts and Techniques, Jiawei Han and Micheline Kamber, Morgan Kaufman
Publications.
Reference Books:
1. Introduction to Data Mining, Adriaan, Addison Wesley Publication
2. Data Mining Techniques, A.K.Pujari, University Press
SPRCA532 ELECTIVE II – E-COMMERCE
L P C
4 0 4
Aim and Objective :. The objective of the course is to make students familiar with fundamentals on
electronic commerce technologies and to provide a sound knowledge of business models, information
systems and technologies in relation to electronic commerce. It also covers appraise tools like e-commerce
platforms, HTTP servers, secure transaction software and firewalls, database systems, heterogeneous
networks and intelligent agent.
UNIT -I
Introduction
Infrastructure of Electronic Commerce – Networks – Packet Switched Networks – TCP/IP – Internet
Protocol – Domain Name Services – Web Service Protocols – Internet Applications – Utility Programs –
Markup Languages – Web Clients and Servers – Internets and Extranets – Virtual Private Network.
UNIT-II
Core Technology
Electronic Commerce Models – Shopping Cart Technology – Data Mining – Intelligent Agents – Internet
Marketing – XML and E-Commerce.
UNIT- III
Electronic Payment System
Real World Payment Systems – Electronic Fund Transfer – Digital Payment – Internet Payment Systems –
Micro Payments – Credit Card Transactions – Case Studies.
UNIT- IV
Security and Threats
Threats to Network Security – Public Key Cryptography – Secure Socket Layer – Secure Electronic
Transaction – Network Security Solutions – Firewalls.
UNIT- V
Inter/Intra Organizational Electronic Commerce

EDI – EDI Application in Business – Legal, Security and Privacy Issues – EDI and Electronic Commerce –
Standards – Internal Information Systems – Macro Forces – Internal Commerce – Workflow Automation
and Coordination – Customization and Internal Commerce – Supply Chain Management.
Text Book:
Ravi Kalakota and Andrew B Whinston, Frontiers of Electronic Commerce, Addison Wesley, 2004.
Reference Books:
Pete Loshin, Paul H Murphy, Electronic Commerce, II Edition, Jaico Publishers, 1996.
David Whiteley, E-Commerce: Strategy, Technologies and Applications, McGraw Hill, 2000.
Daniel Minoli & Emma Minoli – Web Commerce Technology – Tata McGraw Hill, 2002.
SPRCA511 OOSE LAB
L P C
0 3 2
Aim and Objective : The purpose of the Software Engineering Lab course is to familiarize the students
with modern software engineering methods and tools, Rational Products. The course is realized as a
project-like assignment that can, in principle, by a team of three/four students working full time. Typically
the assignments have been completed during the semester requiring approximately 80-120 hours from each
project team.
The goal of the Software Engineering Project is to have a walk through from the requirements, design to
implementing and testing. An emphasis is put on proper documentation. Extensive hardware expertise is
not necessary, so proportionate attention can be given to the design methodology.
Despite its apparent simplicity, the problem allows plenty of alternative solutions and should be a
motivating and educating exercise. Demonstration of a properly functioning system and sufficient
documentation is proof of a completed assignment
Projects
• Term projects are projects that a group student or might take through from initial specification to
implementation.
The project deliverables include:
• Documentation including
A problem statement
A requirements document
A software/Hardware Requirements
A Requirements Analysis Document. RAD
• A design document
A Software Design Description and a System Design Document.
An Object design
A object design document(ODD)
• A sample Screen.
• A sample test specification.
Reference Books:
1. Project-based software engineering: An Object-oriented approach, Evelyn Stiller, Cathie
LeBlanc, Pearson Education
2. Visual Modelling with Rational Rose 2002 and UML, Terry Quatrini, Pearson Edusction
3. UML2 Toolkit, Hans-Erik Eriksson, etc; Wiley
SPRCA512 WEB PROGRAMMING LAB
L P C
0 3 2
1. Write an HTML document to display the word “WEBDESIGNING” in horizontal Scrolling

format.
2. HTML document to demonstrate Ordered lists,unordered Lists,Nested Lists.
3. Write an HTML document to divide the window into two halves using frames.
4. Write an HTML document to demonstrate tables.
5.. Write a JavaScript program to read the customer name and perform manipulations, addition of 2
numbers, display a greeting message
6. Program on JDBC for insertion, deletion, updation of data in the database.
7. Program for Multiple Insertions, Multiple Deletions, Multiple Updations of data in the database.
8. Program on Prepared Statement and Callable Statements.
9. Program on Transition Processing.
10. Web Page Creation using JSP
11 Program for using custom Tags
12.Programs for using Standard Library Tags(SLT).
13.JSP Pages involves JDBC Connectivity.
14.Program on Enterprise Java Bean
15.Program on Bean Managed Persistancy, container Managed Persistancy
16.Program on Session Bean
Text Book:
1. HTML Black Book, Steven Holzner, Dreamtech Press.

MASTER OF COMPUTER APPLICATIONS (M.C.A.) VI Semester
SPRCA641 Elective III – MOBILE & WIRELESS NETWORKS
L P C
4 0 4
Aim and Objective: To introduce students to the concept of wireless communications. Emphasize is on
working of various layers in a wireless medium, insight into WAP, WML, wireless telephony application.
UNIT – I
Basics of Wireless Communication : Introduction – Wireless transmission – Frequencies for radio
transmission – Signals – Antennas – Signal propagation – Multiplexing modulation – Spread spectrum –
Cellular systems.
Wireless MAC Layer, Medium access control – Motivation for a specialized MAC – SDMA – FDMA –
TDMA – CDMA – comparison of S/T/F/CDMA. Telecommunication systems – GSM – DECT – TETRA –
UMTS and IMT – 2000. Satellite systems – GEO 139, LEO 139, MEO 140 – Routing – Localization –
Handover – Broadcast systems – Overview – Cyclic repetition of data – Digital audio broadcasting –
Digital video broadcasting.
UNIT – II
Wireless LAN & Wireless ATM : Wireless LAN – Infrared vs. radio transmission – Infrastructure and ad
hoc networks – IEEE 802.11 – HIPERLAN – Bluetooth. Wireless ATM – Motivation for WATM –
Wireless ATM working group – WATM services – Reference model – Functions – Radio access layer –
Handover – Location management – Addressing – Mobile quality of service – Access point control
protocol.
UNIT – III
TCP/IP Protocol Suite : TCP/IP and Networking - Integrating TCP / IP and OSI Network Layers -
Exploring IP Addresses - Controlling Network Traffic - Configuring Client Workstations.
Protocols : TCP / IP Protocols – Understanding TCP / IP Protocols – Using Mail Protocols – Using
Document Delivery Protocols.
TCP/IP Services - TCP/IP Services – Creating a TCP / IP Intranet – Exploring Client OS File Server
Capabilities - Adding Email and Web Server Capabilities to Your OS – Establishing Dedicated Servers –
Windows NT and Linix.
UNIT – IV
Mobile Network Layer : Mobile network layer – Mobile IP – Dynamic host configuration protocol – Ad
hoc networks. Mobile transport layer – Traditional TCP 292 – Indirect TCP – Snooping TCP – Mobile
TCP – Fast retransmit/fast recovery – Transmission/timeout freezing – Selective retransmission –
Transaction oriented TCP.
UNIT – V
Wireless Applications : Support for mobility – File systems – Consistency – Worldwide web – Hypertext
transfer protocol – Hypertext markup language – Approaches that might help wireless access – System
architecture – Wireless application protocol.
Text Books:
1. Jochen Schiller – Mobile Communications, Addison Wesley , 2nd Ed – 2004.
2. John Ray - Using TCP / IP – Special Edition – Prentice hall India – 1999.
Reference Books:
1. William Stallings – Wireless Communications and Networks, Pearson Edu, 2nd Ed, 2005.
2. Douglas Comer, Principles of TCP / IP, Prentice Hall, 2nd Ed, 2002
SPRCA642 Elective III – EMBEDDED SYSTEMS
L P C
4 0 4
Aim and Objectives: The Name of the Course aims to cover the concepts of embedded systems, their
design and applications, programming models and Interprocess communication.. The student would be able
to understand and use in embedded systems, device drivers, software engineering practices in embedded
systems development and Inter process communication.
UNIT - I
A First Look at Embedded Systems: Examples of Embedded Systems, Typical Hardware.
Hardware Fundamentals for Software Engineer : Terminology, Gates,
A few other basic considerations, Timing diagram, Memory.
Advanced Hardware Fundamentals: Microprocessors, Buses, Direct Memory
Access, Interrupts, Other common Parts, Built-ins on the microprocessor,
Conventions used on Schematics, A sample Schematic, A last word about Hardware.
UNIT – II
Interrupts : Microprocessor Architecture, Interrupt Basics, The Shared-data problem, Interrupt Latency.
Survey of Software Architectures : Round-Robin, Round-Robin with Interrupts,
Function-Queue-Scheduling Architecture, Real-Time Operating System
Architecture, Selecting an Architecture.
UNIT – III
Introduction to Real-Time Operating Systems : Tasks and Task States,
Tasks and Data, Semaphores and Shared Data.
More Operating System Services : Message Queues, Mail Boxes, and Pipes,
Timer Functions, Events, Memory Management, Interrupt Routines in an RTOS Environment.
UNIT – IV
Basic Design using RTOS: Overview, Principles, An Example, Encapsulating Semaphores and Queues,
Hard Real-Time Scheduling Considerations, Saving Memory Space, Saving Power.
UNIT – V
Embedded Software Development Tools : Host and Target Machines, Linker/Locators for Embedded
Software, Getting Embedded Software into the Target system.
Debugging Techniques : Testing on your Host Machine, Instruction Set Simulators, The assert Macro,
Using Laboratory Tools.
Text Books:
1. An Embedded Software Primer, David E. Simon, Pearson Education.

2. Embedded Real time Systems Programming, Sriram V. Iyer and Pankaj Gupta, TMH, 2004.
Reference books:
1. Embedded Systems Design – A unified hardware/software introduction, Frank Vahid/Tony Givargis,
John Wiley & Sons Inc., 2002.
2. Embedded Systems, Architecture, Programming and Design,, Raj Kamal, TMH, 2003.
SPRCA643 Elective III – BIO-INFORMATICS
L P C
4 0 4
Aim and Objective: The Name of the Course aims to cover the basics of Bio informatics, Dynamic
programming, Evolutionary trees & DNA sequencing. The students would be able to understand and
explain the fundamentals of Bio-informatics, Dynamic programming, searching algorithms, Evolutionary
trees, DNA mapping, DNA sequencing and Gene predictions
UNIT-I
Introduction: Definitions, Sequencing, Biological sequence/structure, Genome Projects, Pattern
recognition an prediction, Folding problem, Sequence Analysis, Homology and Analogy.
Protein Information Resources: Biological databases, Primary sequence databases, Protein Sequence
databases ,Secondary databases, Protein pattern databases, and structure classification databases
UNIT -II
Genome Information Resources: DNA Sequence databases, specialized genomic resources
DNA Sequence Analysis : Importance of DNA analysis, Gene structure and DNA sequences, Features of
DNA sequence, sub-sequences, Identity and similarity, The Dot plot, Local and global similarity different
alignment techniques, Dynamic Programming, Pair wise database searching
UNIT -III
Pair wise alignment techniques: Database searching, Alphabets and complexity, Algorithm and programs,
Comparing two sequences, sub-sequences, Identity and similarity, the Dot plot, Local and global
similarity, different alignment techniques, Dynamic Programming, Pair wise database searching
Multiple sequence alignment: Definition and Goal, The consensus, computational complexity, Manual
methods, simultaneous methods, Progressive methods, Databases of Multiple alignments and searching
UNIT-IV
Secondary database searching: Importance and need of secondary database searches, secondary database
structure and building a sequence search protocol
UNIT-V
Analysis packages Analysis package structure, commercial databases, commercial software,
comprehensive packages, packages specializing in DNA analysis, Intranet Packages, Internet Packages.
Text Book:
1. Introduction to Bioinformatics, T K Attwood & D J Parry-Smith, Addison Wesley Longman
Reference Books:
1. Bioinformatics – A Beginner’s Guide, Jean – Michel Clavier. Cerdric Notre dame. WILEY
Dream Tech India Pvt. Ltd.
2. Sequence Analysis in a Nutshell, Scott Marcel & Darryl Leon, O’REILLY
SPRCA651 Elective IV – FUZZY LOGIC & NEURAL NETWORKS
L P C
4 0 4
Aims and Objective: Emphasis is given to the fundamental concepts of fuzzy sets, fuzzy classification,
adaptive fuzzy control systems and fuzzy expert systems. Fundamentals of genetic algorithms and their
need in optimization problems is given an insight and Basic models of artificial neural networks such as
perception, backpropagation, hopfield networks are given emphasis. Self organizing maps, counter
propagation networks are dealt along with their applications
UNIT-I
Fuzzy set Theory and Fuzzy Logic Control: Basic concepts of fuzzy sets – Operations of fuzzy sets –
Fuzzy relation equations Fuzzy logic control – Fuzzification – Defuzzification – Knowledge base –
Decision making logic – Membership functions – Rule base.
UNIT-II
Adaptive Fuzzy Systems: Performance index modification of rule base – Modification of membership
functions – Simultaneous modifications of rule base and membership functions – Genetic algorithms – for
adaptive fuzzy system – Neuro fuzzy systems.
UNIT-III
Artificial Neural Networks: Introduction – History of neural networks – Multilayer, Perceptrons – Back
propagation algorithm and its variants – Different types of learning, examples.
UNIT-IV
Mapping and Recurrent Networks: Counter propagation – Self-organization Map – Cognitron and
Neocognitron – Hopfield Net-Kohonnen Nets – Grossberg Nets – Art-I, Art-II reinforcement learning.
UNIT-V
Case Study:Application of Fuzzy logic and Neural Networks in DBMS, Data Mining and Image
processing.
Text Book:
Timothy J. Ross, Fuzzy Logic with Engineering Applications – TMH.
Reference Books:
1. James A. Freeman, David M. Skapura, Neural Networks – Algorithms Applications and
Programming Techniques – Pearson Education.
2. Zurada J.M., Introduction to Artificial Neural Systems – Jaico Publishing House.
3. Simon Haykin, Neural Networks.
4. Yegnanarayana, Artificial Neural Networks.
5. Kosko, Neural Networks and Fuzzy Systems, PHI.
SPRCA652 Elective IV – IMAGE PROCESSING
L P C
4 0 4
UNIT I:
Fundamentals of Image Processing: Image Acquisition, Image Model, Sampling, Quantization,
Relationship between pixels, distance measures, connectivity, Image Geometry, Photographic film
Histogram: Definition, decision of contract basing on histogram, operations basing on histograms like
image stretching, image sliding, Image classification. Definition and Algorithm of Histogram equalization.
UNIT II
Image Transforms: Discrete Fourier Transform, Some properties of the two-dimensional fourier
Transform last fourier transform, Inverse FFT.
Image Enhancement , Spatial domain methods, Frequency domain methods, Enhancement by point
processing, Spatial filtering, Lowpass filtering, Highpass filtering, Homomorphic filtering, Colour Image
Processing.
UNIT III
Image Restoration : Degradation model, Diagnolization of Circulant and Block-Circulant Matrices,
Algebraic Approach to Restoration, Inverse filtering, Wiener filter, Constrained Least Square Restoration,
Interactive Restoration, Restoration in Spatial Domain., Image Compression: Coding, Interpixel and
Psychovisual Redundancy, Image Compression models, Error free comparison, Lossy compression, Image
compression standards.
UNIT IV
Image Segmentation : Detection of Discontinuities, Edge linking and boundary detection, Thresholding,
Region Oriented Segmentation, Motion based segmentation.
UNIT V
Morphology: Dilation, Erosion, Opening, Closing, Hit-and Miss transform, Boundary extraction, Region
filling, Connected Components, Thinning, Thickening, Skeletons, Pruning Extensions to Gray-Scale
Images. Application of Morphology in I.P. Recognition and Interpretation : Elements of Image Analysis,
Pattern and Pattern Classes, Decision-Theoretic Methods, Structural Methods, Interpretatiion.
Text Books:
1. Rafael C. Gonzalez & Richard E. Woods, “Digital Image Processing”, AWL.
2. A.K. Jain, “Fundamental of Digital Image Processing”, PHI.
Reference Books:
1. Rosefield Kak, “Digital Picture Processing”
2. W.K. Pratt, “Digital Image Processing”,
3. Digital Image Processing and Analysis , B. Chanda & D. Dutta Majumber , PHI
4. Image Processing in C , Dwayne Phillips , BPB Publications
SPRCA653 Elective IV – ADVANCED NETWORK SECURITY L P C
4 0 4
UNIT – I
System Security : Intruders, Intrusion Detection, Password Detection, Password Management,
Malicious Software, Viruses and Related Threats, Virus Countermeasures.
UNIT – II
Firewalls: Firewall Design Principles, Trusted Systems
Network Management Security : Basic Concept of SNMP, SNMP v1 Community Facility, SNMPV3.
UNIT – III
XML Security : XML Primer, What is XML? Processing XML,
Introduction to XML Signatures Part 1 and Part 2.
UNIT – IV
Introduction to XML Encryption, XML Signature implementation using RSA.
UNIT – V
XML Key Management Specification and the Proliferation of Web Services.
Text Books:
0Network Security Essentials Applications and Standards, By William Stallings Pearson
Education Asia, New Delhi
XML Security, By Blake Dournace, Tata Mc-Graw-Hill, New Delhi
Reference Book:
1. Cryptography and Network Security, By William Stallings Pearson Education Asia, New Delhi
SPRCA611 PROJECT
L P C
0 0 12

SPRCA612 SEMINAR
L P C
0 0 3

SPRCA613 COMPREHENSIVE VIVA
L P C
0 0 4

MCAsyllbus (09-07-2009)

Caricato da

Informazioni sul documento

Descrizione originale:

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

MCAsyllbus (09-07-2009)

Caricato da

Copyright:

Formati disponibili

GITAM UNIVERSITY

(Declared as Deemed to be University U/S 3 of UGC Act, 1956)

REGULATIONS & SYLLABUS

Gandhi Nagar Campus, Rushikonda

1.1 Admissions into Master of Computer Applications (MCA) programme of GITAM

2.0 ELIGIBILTY CRITERIA

2.2 Admissions into M.C.A. will be based on the following:

(i) Score obtained in GAT (PG), if conducted.

3.0 STRUCTURE OF THE M.C.A. PROGRAMME

3.1 The Programme of instruction consists of:

(i) A core programme imparting to the student specialization of computer

3.3 Project Dissertation has to be submitted by each student individually.

4.0 CREDIT BASED SYSTEM

One credit for each Lecture hour.

5.0 MEDIUM OF INSTRUCTION

7.0 CONTINUOUS ASSESSMENT AND EXAMINATIONS

Table 1: Assessment Procedure

S.No. Component of Marks allotted Type of Scheme of Examination

(i) 50 marks are allotted for

9.0 SPECIAL EXAMINATION

10.0 ATTENDANCE REQUIREMENTS

11.0 GRADING SYSTEM

Table 2: Grades & Grade Points

12.0 GRADE POINT AVERAGE

Table 3: CGPA required for award of Degree

13.1 Duration of the programme:

a) Registered and successfully completed all the courses and projects.

9. The attendance marks ( maximum 5) shall be allotted as follows :

Percentage of Attendance Marks

SPRCA103 DIGITAL LOGIC DESIGN

SPRCA104 PROBABILITY AND STATISTICS

SPRCA111 PROGRAMMING WITH C LAB

SPRCA112 DIGITAL LOGIC DESIGN LAB

2. Implementation of AND , OR, NOT, Ex-OR gate functioning using NAND,

3.Design Adders, Subtractors Using Logic Gates.

4.Design of a Three Bit Comparator Circuit.

5.Design a 3 * 8 Decoder Using Two 2 * 4 Decoders.

6.Design a 4 * 1 Multiplexer Using Logic Gates.

7.Design RS, JK, D, T Flips Flops Using Logic Gates.

9.Design a three bit Binary Up Counter.

10. Design a Mod -9 counter.

12. Design a BCD Counter.

SPRCA201 DATA STRUCTURES

Aim and Objective

SPRCA202 COMPUTER ARCHITECTURE

SPRCA203 OBJECT ORIENTED PROGRAMMING WITH C++

Exception Handling: Basics of Exception handling, Exception handling Mechanism, Throwing

SPRCA204 OPTIMIZATION TECHNIQUES

1. Operations Research – An Introduction, Handy A Taha – Pearson Education .

Aim and Objective

SPRCA211 DATA STRUCTURES LAB USING C++

Aim and Objective:

Opening, reading, writing, closing and creating of files in C++

2.Study of secondary storage device:

Tracks, sectors, block capacity of disk, tape and CD ROMs

3.File Structures in C++

Data compression, storage compacting, reclaiming space dynamically

5. Indexing and indexed sequential files

Index file, inverted file operations, usage of B and B++ trees

Hashing functions, algorithms, record distribution and collision resolution by progressive

Programs on Process Scheduling:

14. FCFS scheduling algorithm