Mca 5 yr 2013

MASTER OF COMPUTER
APPLICATIONS-INTEGRATED
YEAR – 2013
DURATION – 5 YEARS (10 SEMESTERS)
JAYOTI VIDYAPEETH WOMEN’S UNIVERSITY,
JAIPUR
[ TOTAL PAGES : ]
SYLLABUS
OUTLINES FOR:
1 - 10 SEMESTERS
FACULTY OF ENGINEERING & TECHNOLOGY
www.jvwomensuniv.com

JAYOTI VIDYAPEETH WOMEN’S UNIVERSITY, JAIPUR
Programme Objectives
The main motive of – MCA-Integrated programme is to aim at imparting comprehensive
knowledge with equal emphasis on theory and practice of Computer Science Applications.
It is designed to meet the needs of the market for expertise in Computer applications.
After completion of Master of Computer Application (MCA-Integrated) degree, the
students are prepared to take up positions as system analysts, systems designers,
Programmers and managers in any field related to information technology.
S.
No.
Particulars Corporate Portfolio Government Portfolio Entrepreneur
Portfolio
1. Job
Opportunity
 Database Administrator
 Data Analyst
 Database Manager
 Game Developer
 Hardware Designer
 IT Manager
 IT Recruiter Software
 Network Administrator
 Program Manager
 Project Manager
 Software Developer
 Software Engineer
 Software programmer
 Software Trainer
• Database Administrator
• Data Analyst
• Network Administrator
• Project Manager
• Software Developer
• Probationary Officer
• Software Engineer
• Software programmer
• Software Trainer
• Section Engineer
• Scientist
• System Analyst
• Training &
Placement
Consultant
2.
Recommendati
on
As
Tailored
Program (A)
Android Application
Programming
Oracle(OCA) Certification
Advanced Java
Redhat(RHCE) Certification
Coaching for
Civil Services
GATE
CDS
Case Studies

I- SEMESTER
Nature of Course Course Name C T P1 P2
Core Computer
Science
Fundamental of Computer I : Basics of
Computer System and Number System
3 2 1 0
Core Computer
Science
Fundamental of Computer II : Boolean
Algebra
2 2 0 0
Core Computer
Science
Fundamental of Computer III: Concepts of
Software and MS office
4 2 2 0
Core Computer
Science
Programming in C I: Basics of C 5 3 2 0
Core Computer
Science
Programming in C II:Functions and Arrays 5 3 2 0
Core Computer
Science
Programming in C III: Search and sort
Algorithms
4 2 2 0
Electronics and
Communication
Electrical & Electronics Engineering I : DC
Networks
4 2 1 1
Electronics and
Communication
Electrical & Electronics Engineering II : Single
Phase Ac Circuits, Transformer
4 2 2 0
Electronics and
Communication
Electrical & Electronics Engineering III:
Transistors, Communication System
4 2 2 0
Mathematics Basics of Mathematics I: Matrices, Algebra 4 3.7
0.3
0
Mathematics
Basics of Mathematics II: Differential
Calculus, Integral Calculus
2.7 2.7 0 0
Mathematics
Basics of Mathematics III: Linear
programming
3.3 3 0.3 0
University
Compulsory
Course
Extra-Curricular Activities 1 0 1 0
University
Compulsory
Course
Women Rights and Law 2 2 0 0
University
Compulsory
Course
Community Development Activities 1 0 1 0
University
Compulsory
Course
English communication
Total Credits 45+4+2=51

Note:
 C represents number of Credit per course.
 T represents number of Theory Credit per course.
 P1 represents number of Practical and Practice credits respectively per course.
 P2 represents number of Seminars, group discussion, workshop.
Programme Summary
NATURE OF COURSE ( I-SEMESTER) NO. OF CREDITS
Core Computer Science 23
Electronics and Communication 12
Mathematics 10
University Compulsory Course 6
Total 51

II- SEMESTER
Core Computer
Science
E- Commerce I:
Introduction, E-Commerce, Traditional
Commerce & Electronic Commerce
4 4 0 0
Core Computer
Science
E- Commerce II: System architecture, web
presence strategy, Brick to click approach 3 3 0 0
Core Computer
Science
E- Commerce III: Understanding E- payment,
establish a payment system
3 3 0 0
Core Computer
Science
Digital Computer Organization I : Boolean
Algebra
3.6 3.3 0 0.3
Core Computer
Science
Digital Computer Organization II : Binary
arithmetic
2.3 2.3 0 0

Core Computer
Science
Digital Computer Organization III: Memory
Organization
3.1 3.1 0 0
Core Computer
Science
System Analysis and Design I : Decision
Making Process
3 3 0 0
Core Computer
Science
System Analysis and Design II: Preliminary
Investigation
2 2 0 0
Core Computer
Science
System Analysis and Design III: Software
Design
3 3 0 0
Mathematics
Statistical Methods I: Frequency
distributions, Relative frequency
distributions
4 4 0 0
Mathematics
Statistical Methods II: The Binomial, Normal
and Poissons distributions
3 3 0 0
Mathematics
Statistical Methods III : Statistical decisions
and hypothesis decision rules
3 3 0 0
Electronics and
Communication
Digital Electronics I: Number systems and
different types of number systems
4 3 1 0
Electronics and
Communication
Digital Electronics II : Combinational &
Sequential circuits, flip flops
5 3 2 0
Electronics and
Communication
Digital Electronics III : Counters,
Asynchronous (ripple), synchronous and
synchronous decade counter
3 3 0 0
University
Compulsory
Course
University
Compulsory
Course
Total Credits 49+2=51
Note:
Programme Summary
NATURE OF COURSE ( II SEMESTER) NO. OF CREDITS
Mathematics 10
Total 51

Programme Structure– II Year
2nd
Year consists of III, IV Semester
2nd Year Motive: The aim of second year is to provide knowledge in complete Internet programming, e-commerce, DSA
and DBMS. It also includes computer networking concepts and practical knowledge of Financial Accounting. The major
portion included a minor project for getting experience in real life software design and development.
III- SEMESTER
Nature of
Course
Course Name C T P1 P2
Core Computer
Science
Management Information System I :
Introduction, MIS concept, Basic of
Management Information System
4 4 0 0
Core Computer
Science
Management Information System II:
Development of Management Information
3 3 0 0

System
Core Computer
Science
Management Information System III:
Applications of MIS, Enterprise Resource
Planning(ERP)
3 3 0 0
Core Computer
Science
Programming with Visual Basic I: Introduction
to .NET
5 2.8 2 0.2
Core Computer
Science
Programming with Visual Basic II : Array,
Function
5 3 2 0
Core Computer
Science
Programming with Visual Basic III: Working
with Forms
4 2 2 0
Management
Fundamentals of Accounting
I : Introduction to Financial Accounting-
Meaning and Scope
3 3 0 0
Management
II: Recording of transactions
3 3 0 0
Management
III: Provision and Reserves
3 3 0 0
Core Computer
Science
Internet Programming I : Internet
Programming Technologies
4 3 1 0
Core Computer
Science
Internet Programming II: HTML:
Introduction of HTML, HTML Elements,
HTML Basic Tags
6 4 2 0
Core Computer
Science
Internet Programming III: Java Scripts 4 2 2 0
Professional
Development
Activity
Seminar 1 0 0 1
University
Compulsory
Course
Environmental Studies and Disaster
Management
2 2 0 0
University
Compulsory
Course
University
Compulsory
Course
Note:
Programme Summary
NATURE OF COURSE ( III SEMESTER) NO. OF CREDITS
Mathematics 9
Professional Development Activity 1
Total 52

IV- SEMESTER
Nature of
Course
Course Name C T P1 P2
Core Computer
Science Computer Network I: Network architecture 4 3 1 0
Core Computer
Science Computer Network II : Transmission Media 4 3 1 0
Core Computer
Science
Computer Network III : Introduction of
TCP/IP
3 2 1 0

Core Computer
Science
Database Management System I: Introduction:
Purpose of Data Base Systems, Data
Abstraction
4 3 1 0
Core Computer
Science
Database Management System II: Relational
Model
4 3 1 0
Core Computer
Science
Database Management System III: Security &
Integrity
4 4 0 0
Core Computer
Science
Data Structures using C I: Basics of Data
Structure
4 2 2 0
Core Computer
Science
Data Structures using C II: Linked List 4 2.9 1 0.1
Core Computer
Science
Data Structures using C III : Tree 4 3 1 0
University
Compulsory
Course
University
Compulsory
Course
Professional
Development
Activity
Minor Project 20 0.25 19.75 0
Note:
Programme Summary
NATURE OF COURSE ( IV SEMESTER) NO. OF CREDITS
Computer Science 35
Total 57

Programme Structure– III Year
3rd
Year consists of V, VI Semester
Third Year Motive: The aim of this year of MCA is to develop the strong base of advance subjects like Software
Engineering, JAVA, Operating Systems & practical knowledge of software development. The Project in the last semester
has been included for getting the experience of industrial project development.
V- SEMESTER
Core Computer
Science
Design and Analysis of Algorithms I: Introduction to data
structures and algorithms
4 2.5 1.5 0
Core Computer
Science
Design and Analysis of Algorithms II: Graph Algorithm,
Searching Algorithm and Greedy Method
4 2.5 1.5 0

Core Computer
Science
Design and Analysis of Algorithms III: Dynamic
Programming, Problem Analysis, NP Completeness
3 3 0 0
Core Computer
Science
Object Oriented Programming in “C++” I: Object
Orientation Concepts
4 3 1 0
Core Computer
Science
Object Oriented Programming in “C++” II: Classes and
Objects
4 2.5 1.5 0
Core Computer
Science
Object Oriented Programming in “C++” III : Inheritance
4 2.5 1.5 0
Core Computer
Science
Software Engineering I : Overview of Software
Development and methodology 3
3 0 0
Core Computer
Science
Software Engineering II : Function-oriented Methodology,
Software testing
2 2 0 0
Core Computer
Science
Software Engineering III : Object-oriented Methodology,
Software Project Management
3 3 0 0
Core Computer
Science
Operating System I : Introduction and CPU Scheduling 3.3 2 1.3 0
Core Computer
Science
Operating System II: Synchronization, Deadlock 3.2 2.5 0.7 0
Core Computer
Science
Operating System III: Logical versus physical address
space, Swapping
3.5 2.5 1 0
Mathematics
Discrete Mathematics I: Relations, Permutations,
Combinations
3 3 0 0
Mathematics Discrete Mathematics II: Boolean Algebra, Lattices 2.5 2 0.5 0
Mathematics Discrete Mathematics III: Graph Theory 2.5 2 0.5 0
University
Compulsory
Course
University
Compulsory
Course
University
Compulsory
Course
University
Compulsory
Course
English communication
Total Credits 49+6=55
Note :
Programme Summary

NATURE OF COURSE ( V SEMESTER)
NO. OF CREDITS
Computer Science 41
Mathematics 8
Total 55
VI- SEMESTER
Core Computer
Science
Core Java I: Introduction to Core Java 3.2 2 1.2 0
Core Computer
Science
Core Java II: Objects, Classes and Inheritance
4.6
3
1.6
0

Core Computer
Science
Core Java III: Packages and Exception Handling 4.2 3 1.2 0
Core Computer
Science
Web Development Techniques I: Introduction,
Web Applications
3.6 3 0.6 0
Core Computer
Science Web Development Techniques II: Java Scripts
3.4 2.2 1.2 0
Core Computer
Science
Web Development Techniques III: Introduction of
PHP
4 3 1 0
Mathematics Numerical Computation I: Statistical Methods 3 2.5 0.5 0
Mathematics
Numerical Computation II: Interpolation and
Integration
4 3.5 0.5 0
Mathematics
Numerical Computation III: Errors and
Approximations in Digital Computers
4 3.5 0.5 0
Core Computer
Science
Software Project Management I : Project
Management
3 3 0 0
Core Computer
Science
Software Project Management II : Estimation and
Project Scheduling
4 4 0 0
Core Computer
Science
Software Project Management III : Quality
Management
3 3 0 0
Core Computer
Science
Open Source Technology I: Introduction of Open Source 3 2.8 0 0.2
Core Computer
Science
Open Source Technology II: Administration 2 2 0 0
Core Computer
Science
Open Source Technology III: Applications 2 2 0 0
University
Compulsory
Course
University
Compulsory
Course
English Language Lab 2 0 2 0
English Communication Skills 2 2 0 0
Professional
Development
Activity
Seminar 1 0 0 1
Total Credits 54+2+1 = 57
Note:
Programme Summary

NATURE OF COURSE ( VI SEMESTER) NO. OF CREDITS
Mathematics 10
English 4
Total 57
Programme Structure– II Year
4th Year consists of III, IV Semester
4th Year Motive: The aim of four year is to provide knowledge in complete Advanced Java programming, DWDM, and
cognitive psycology. It also includes network progamming concepts artificial intelligence and microprocessor and
assembly language.
VII- SEMESTER
Objective: This semester is based on real application development. Data mining techniques.
Nature of Course Name C T P1 P

Course 2
Core Computer
Science
Advanced Java Programming I: Introduction the Abstract
Window Toolkit (AWT) and Java Swing
4 2.5 1.5 0
Core Computer
Science
Advanced Java Programming II: Networking through Java
Programming, Java Database Front End
4 3 1 0
Core Computer
Science
Advanced Java Programming III: Servlets and JSP 4 3
1
0
Core Computer
Science
Data Ware Housing and Data Mining I: Basics of Data
Warehouse
2.5 2.5 0 0
Core Computer
Science
Data Ware Housing and Data Mining II : Data Preprocessing,
Language, Architectures
3 3 0 0
Core Computer
Science
Data Ware Housing and Data Mining III: Classification &
Clustering
2.5 2.5 0 0
Core Computer
Science
Cognitive psychology I: history of the cognitive approach 4 4 0 0
Core Computer
Science
Cognitive psychology II: Communication and Language
Processing
4 4 0 0
Core Computer
Science
Cognitive psychology III: Contribution of cognitive psychology 2 2 0 0
Electronics and
Communication
Digital Electronics I: Number systems and different types of
number systems
4 4 0 0
Electronics and
Communication
Digital Electronics II : Combinational & Sequential circuits, flip
flops
4 4 0 0
Electronics and
Communication
Digital Electronics III : Counters, Asynchronous (ripple),
synchronous and synchronous decade counter
4 4 0 0
University
Compulsory
Course
University
Compulsory
Course
University
Compulsory
Course
Professional
Development
Activity
Industry Visit 1 Visit
Note:
Program Summary

NATURE OF COURSE (VII- SEMESTER) NO. OF CREDITS
Total 51

VIII - SEMESTER
Objective: This semester contains applications of Artificial Intelligence and Operation Research with the practical
knowledge of Network programming.
Core Computer
Science
Artificial Intelligence & Applications I: Introduction to Artificial
Intelligence
3 3 0 0
Core Computer
Science
Artificial Intelligence & Applications II: Knowledge Representation 3 3 0 0
Core Computer
Science
Artificial Intelligence & Applications III: Game Playing 4 4 0 0
Core Computer
Science
Database Management System I: Introduction to Data Base Systems 4 3 1 0
Core Computer
Science
Database Management System II: Relational Model and
Normalization
4 3 1 0
Core Computer
Science
Database Management System III: Concurrency Control,
Transaction and Security
4 3 1 0
Core Computer
Science
Networking Programming I : Basics of TCP Sockets 4 3 1 0
Core Computer
Science
Networking Programming II: TCP Echo Server-Client 4 3 1 0
Core Computer
Science
Networking Programming III: Udp Sockets 4 3 1 0
Electronics and
Communication
Microprocessor and Assembly Language Programming I:
Introduction to Micro Computer Systems 4 2 2 0
Electronics and
Communication
Microprocessor and Assembly Language Programming II:
Assembly Language and Programming in 8085
4 2 2 0
Electronics and
Communication
Microprocessor and Assembly Language Programming III:
Interfacing
4 2 2 0
University
Compulsory
Course
University
Compulsory
Course
Professional
Development
Activity
Certified Training/Project 6 0.25 5.75 0
Total Credit 42+10+2=54
Note:

Program Summary
NATURE OF COURSE ( VIII- SEMESTER ) NO. OF CREDITS
Total 58

Programme Structure– V Year
IX - SEMESTER
Objective: The aim of this semester is to provide the knowledge of Information security, Computer graphics and cloud
computing.
Nature of Course Course Name C T P1
P2
Core Computer
Science
Cryptography & Network Security I: Conventional And
Modern Encryption
3 3 0 0
Core Computer
Science
Cryptography & Network Security II: Public Key Encryption
& Authentication
3.5 3.5 0 0
Core Computer
Science
Cryptography & Network Security III: System Security 2.5 2.5 0 0
Core Computer
Science
Computer Graphics I: Application areas of Computer
Graphics
3.7 2.7 1 0
Core Computer
Science
Computer Graphics II: 2-D geometrical transforms 4.5 3 1.5 0
Core Computer
Science
Computer Graphics III: 3-D object representation 3.8 3 0.8 0
Management
Organizational Behavior: Organizational Behavior I -
Definition - Importance - Historical Background
4 4 0 0
Management
Organizational Behavior: Personality & Attitudes II- Meaning
of personality
3 3 0 0
Management
Organizational Behavior: Motivation III - Motives -
Characteristics - Classification of motives
3 3 0 0
Core Computer
Science
Advanced Web Technologies I: The Basics of PHP scripts.
The Building blocks of PHP
4.5 3 1.5 0
Core Computer
Science
Advanced Web Technologies II: Working with Objects 4.8 3 1.8 0
Core Computer
Science
Advanced Web Technologies III: Learning the MySQL Data
types
3.7 3 0.7 0
Core Computer
Science
Cloud Computing I : Understanding Cloud Computing 3 3 0 0
Core Computer
Science
Cloud Computing II : Developing Cloud Services 3 3 0 0
Core Computer
Science
Cloud Computing III : Cloud Computing For Everyone 3 3 0 0
University
Compulsory
Course
University
Compulsory
Course
University
Compulsory
Course
Women Rights & Empowerment 2 2 0 0
Total Credit 53+2+2=57
Note:

Program Summary
NATURE OF COURSE ( IX - SEMESTER ) NO. OF CREDITS
Computer Science 43
Management 10
Total 57

X- SEMESTER
Objective: This semester is purely based on Industrial Training of the whole semester. The students will join an
industry and undergo for training under the guidance of expert professionals.
Professional
Development
Activity
Major Project 56 0.25 55.75
Total Credit 56(180 days)
Note:
Program Summary
NATURE OF COURSE ( X - SEMESTER ) NO. OF CREDITS
Total 56

Semester -I
Sub: Fundamentals of Computers
UNIT – I (Basics of Computer System and Number System) (2-1-0)
Theory (2 Credits) (20 Hours)
Introduction to Computer System and functions of its components, evaluation of Computers and their
classification, hardware and software. Number System: Decimal, Binary, Octal and Hexadecimal and their
inter conversions. Representation of integer and real numbers, characters and codes (BCD, ASCII and
EBCDIC), error detecting and correcting codes (Parity, Gray and Hamming codes), binary and floating point
arithmetic (addition and subtraction).
Practical (0.5 Credit) (5 Hours)
Practice (0.5 Credit) (5 Hours)
Demonstration of different Hardware and software components of computers.
Description of the functionalities of different types of software’s.
Practice of number system.
UNIT – II (Boolean Algebra) (2-0-0)
Basic concepts of Boolean algebra and their electronic implementation through various logic gates,
simplification of Boolean expressions (Boolean algebra and Karnaugh map method). Hard Devices and
software device, CPU, Memory disks and its types.
UNIT – III (Concepts of Software and MS office) (2-2-0)
Concept of System software and application software, Office Automation (MS-Word, Excel and Power Point).
Introduction to Data Bases, concept and architecture, Tables, Query and Report generation (MS- Access).
Practical (2 Credit) (20 Hours)
Word Processing: Document creation & formatting, grammar & spelling checking, Table handling, Find &
Replace, Mail Merge, Macro, Document with multiple columns, Templates
Spreadsheet: Creation of Workbook, entering data in multiple sheets, Cell referencing, charts, Functions-
Date & Time, Mathematical, Statistical, Look up and text
Presentation: Creation of Presentation and formatting, different views of presentation, layouts and
templates, Master slides, Animation, Transition
Recommended Books

1. Computer Fundamentals, Architecture & Organization, B.RAM, New Age International, New
Delhi, 2000
2. Microsoft Office 2000 for Windows, S. Sagman, Berkeley Peachpit Press, 1999
Reference Books:
1. Fundamentals of Computer, V Rajaraman, Prentice Hall of India Pvt. Ltd.
Sub: Programming in C
UNIT- I (Basics of C) (3-2-0)
Theory (3 Credits)
C basics: C character set, Structure of program, Data Types, Constants, Identifiers, Keywords, Declarations,
Symbolic, Constants, Operators, and Expressions. Control Structures: If-Else, Switch, Go To, Do- While, For
Statements, Nested Loops, and Break and Continue Statements.
Practical (1.8 Credit) Practice( 0.2 Credits)
S no Name of Program Practical Practice
1 Programs based on arithmetic expression –addition.
2 Programs based on arithmetic expression –subtraction
3 Programs based on arithmetic expression –
multiplication
0.2
4 Programs for swapping 0.1
5 Program to calculate area of circle 0.1
6 Program to calculate area of square 0.1
7 Program to calculate area of rectangle 0.1
8 Program to calculate area of triangle 0.1
9 Program to calculate area of cube 0.1
10 Program to calculate of volume cylinder 0.1
11 Programs based conditional operators 0.1 0.1
12 Programs based on relational operators 0.1 0.1
13 Programs based on conditional statement if, if…..else.
nested if…..else
0.2
14 Programs based on conditional statement nested
if…..else
0.1
15 Programs based on looping statement (for loop, while
loop, do…..while loop
0.1
UNIT II (Functions and Arrays) (3-2-0)
Theory (3 Credits)
Functions and Arrays: Defining and accessing functions, Passing arguments, Function Prototypes, Recursion,
Library Functions, Storage classes: automatic, external (global), static & registers. Preprocessor directives:
#include, #define.

Arrays: Defining and Processing, Passing to a function, Multi dimensional arrays.
Practical (2 Credits)
1 Program for Arithmetic operations using Function 0.2
2 Program for matrix multiplication using Array 0.2
3 Calculate factorial of any number using fact() function 0.2
4 Program to print Fibbonacci series using function 0.2
5 Program to demonstrate call by value function call 0.2
6 Program to demonstrate call by reference function call 0.2
7 Program for Recursion Function 0.2
8 Programs based on array 1-D Array 0.2
9 Programs based on array 2-D Array 0.2
10 Programs based on array operations 0.2
UNIT III (Search and sort Algorithms) (2-2-0)
Theory (2 Credits)
Strings and its various operations, Pointers: Declarations, Operations on Pointers, Pointers and Functions,
Pointers and Arrays, Pointers and Structures, File Handling: Open, Close, Create, File Operations, and
Command Line Arguments.
1 Program for String comparison 0.2
2 Program for String concatenation 0.2
3 Program for String copying 0.2
4 Program for String reverse 0.1
5 Program for String replacement 0.1
6 Program for file opening using fopen(),fclose() 0.1
7 Program for file reading and writing 0.1
8 Program for command –line arguments 0.2
9 Program to demonstrate use of Structure 0.2
10 Program to demonstrate use of Union 0.2
11 Program to demonstrate use of Pointers 0.2
12 Program to demonstrate use of Pointers using Array 0.2
Recommended Text Books:
1. The C Programming Language (Ansi C Version), Brian W. Kernighan, PHI
2. Let Us C, Yashwant Kanetkar, BPB Publications.
Reference Books:
1. Kumar R. et.al., “Programming in ANSI C”, Tata McGraw Hill Publ.,
2. Johnsonbaugh, R and Jakin. M., “Application Programming in C”, Prentice Hall of India.
3. Balagurusamy, E., “Programming in ANSI C”, Tata McGraw Hill Pub.
4. Gottfried. S. Byron., “Theory and Problems of Programming with C,” Tata McGraw Hill.
5. Kernighan et. al., “The C Programming Language”, Prentice Hall of India Ltd.

Sub: Electrical & Electronics Engineering
UNIT I (DC NETWORKS)(2-1-1)
Theory (2 Credits)
DC NETWORKS: Kirchhof’s Laws, Node Voltage and Mesh Current Analysis, Delta-Star and Star-Delta
Transformation, Source Conversion, Classification of Networks Elements, Super position theorem,
Theremin’s Theorem.
Practical (1 Credit)
UNIT II (Single Phase AC Circuits)(2-2-0)
Theory(2 Credits)
Generation of Single Phase AC Voltage, EMI Equation, Average, RMS and Effective Values, RLC Series,
Parallel and Series- Parallel Circuits, Complex, Representation of Impedance, Phasor Diagram, Power &
Power Factor.
TRANSFORMER: Transformer: EMF equation, Faradays Laws of Electromagnetic Induction, Construction and
Operation of Single Phase Voltage and Current Relationship and Pharos Diagram of Ideal Transformer.
UNIT III (Transistors & Communication System)(2-2-0)
Theory (2 Credits)
Bipolar Junction Transistor, Transistor Current Components, Characteristics of CE, CB and CC
Transistors Amplifiers.
Introduction to modulation (AM, FM and PM), Demodulation, De-multiplexing, Super heterodyne Radio
Receiver, Television, Elementary Concept of Optical, Satellite and Mobile Communication.
Reference Books:
1. B.Subramanyam,” Electric Circuit Analysis”, I.K. International Publishing House Pvt. Ltd.,
2. Basic Electrical Engineering by K.N.Srinivas
3. Semiconductor Devices by Yaduvir Singh & Swarajya Agnihotri

Sub: Basics of Mathematics
UNIT- I (Matrices)(3.7-0.3-0)
Theory (3.7 Credits)
Algebra of matrices, definition of various types of matrices, symmetric and skew symmetric matrices,
determinant of a matrix, elementary properties of determinants, inverse of a matrix, rank of
a matrix, solution of Linear equations using Cramer’s rule, matrix method and elementary
row transformation.
Algebra: Indices, logarithms, partial fractions, quadratic expression, quadratic equation, elementary
permutations and combinations, method of mathematical induction.
Practice (0.3 Credits)
Practice based on matrices, logarithms and mathematical induction.
UNIT- II (Differential & Integral Calculus )(2.7-0-0)
Definition of function, limit of a function at a point, evaluation of standard limits, differentiation of algebraic,
exponential and logarithmic functions, differentiation of a sum, difference, product and
quotient of two functions, chain rule of differentiation, derivatives of second order.
Integration as inverse operation of differentiation, indefinite integrals, Integration of simple functions,
Integration by substitution, Integration by parts, definite integral.
UNIT- III (Linear Programming)(3-0.3-0)
Theory (3 Credits)
Introduction to linear programming problems and their mathematical formulation, graphical method for the
solution of a linear programming problem of two variables, convex sets and their elementary properties,
Simplex method and its application to simple problems.
Practice (0.3 Credit)
Practice based on linear Programming problems.
Recommended Text Books

1. A text book of Algebra; Bhargava, Saini and Agrawal, Jaipur Publishing House, Jaipur.
2. A text book of Differential Calculus; Bansal, Bhargava and Agrawal, Jaipur Publishing House, Jaipur.
Reference Books:
1. Differential Calculus; M.C. Gupta and Others.
2. Integral Calculus; K.C. Sharma and Others; Ramesh Book Depot, Jaipur.
3. Elementary Mathematics; M.C. Gupta; Ramesh Book Depot, Jaipur.
4. Basic Mathematics; Agarwal D.C., Mittal S.K.
5. Differential Equations; Bansal, J.L. and Dhami, H.S.; Jaipur Publishign House, Jaipur.

Women Rights and Law
(2-0-0)
Credits-2
Objective: The paper aims at creating awareness as to importance and role of women in society through the
medium of law. It also focuses on women welfare laws.
Unit – I: Meaning of law ,Constitutional Safeguards for Women, Right to Equality (Art-14),Life & Personal
Liberty, Right to Education (Art-21,21-A), Right against Sexual Exploitation (Art-23,24), Constitutional Remedies
(Writs- Art-32-35), Participation in Panchayat and Municipalities, Marriage : Conditions,Ceremonies,Registration,
Restitution of Conjugal Rights, Judicial Separation, Void & Voidable Marriages, Legitimacy of Children of Void &
Voidable Marriages, Punishment of Bigamy, Divorce Common Grounds for Divorce, No Petition for divorce within
1year of marriage, Divorced Person when may marry again,Maintenance: Wife, widowed daughter-in-law, Children,
Amount of Maintenance , Interim Maintenance, Maintenance Provisions under Cr.PC, Adoption: Requisites of a
valid adoption,Capacity of a male Hindu to take in adoption, Capacity of a female Hindu to take in adoption, Persons
capable of giving in adoption, Persons who may be adopted, Effects of Adoption,.
(1 Credit)
Unit – II: Indian Penal Code, 1860 Right of Private Defence, Dowry Death, Abetment of Suicide, Cruelty by
Husband or Relatives of Husband, Sex Selection & Causing Miscarriage, Hurt & Grievous Hurt, Wrongful Restraint
& Confinement, Outraging the modesty of a woman, Kidnapping and Abduction, Offences regarding Prostitution,
Rape, Bigamy, Adultery, Domestic Violence, Sex Determination Test -The Medical Termination of Pregnancy Act,
1971, The Pre-Conception and Pre-Natal Diagnostic Techniques Act, 1994, Reproductive Technologies: Meaning,
Concept & Challenges of A.I, IVF & Surrogacy, Right of HIV/ AIDS Victims, Introduction to Consumer Protection
Act , Tenancy Act, Right to Information Act, Motor Vehicles Act, Intellectual Property Rights, Act & Rules
Maternity Benefits Act 1961.
(1 Credit)
Recommended Books:
1. Law relating to Women – S.R.Myneni
2. Law relating to Women – Dr. S.C. Tripathi
Reference Books:
1. Women and Law – Prof. Nomita Aggarwal
2. Women and Law – Dr. Manjula Batra
3. Women and Law – G.P. Reddy

Semester -II
Sub: E-Commerce
UNIT- I (Introduction of E-Commerce) (4-0-0)
Theory (4 Credits)
Introduction, E-Commerce, Traditional Commerce & Electronic Commerce, understanding portals,
understanding E- Business, Type of E-Business Websites & classification, Summary, self assessment question.
Technologies for E-commerce, Web server hardware. Web server software & operating system, static &
dynamic content management, client side & server side programming, web server performance &
evaluation, load balancing & redundancy.
UNIT - II (System architecture, web presence strategy, Brick to click approach) (3-0-0)
Theory (3 Credits)
System architecture, web presence strategy, Brick to click approach, offline presence & online presence,
content & information, the revenue model, understanding consumer behavior online. Understanding E-
Services, electronic commerce & banking, e-commerce & retailing, e- commerce & publishing, e-commerce &
supply chain management, specialized services.
UNIT - III (Understanding E- payment, establish a payment system)(3-0-0)
Theory (3 Credits)
Understanding E- payment, establish a payment system, credit card transaction, digital certified & certificate
authority, secure electronic transaction (SET) M- Commerce needs, application, wireless marketing, mobile
customer relationship (CRM), M- payment.
1. Ravi Kalakota and Andrew B Whinston, “ Frontiers of Electronic Commerce “,Pearson Education Asia,
1999.( Chapters 1,2,3,6-10,16)
2. Marilyn Greenstein and Todd M Feinman , ” Electronic commerce: Security, Risk Management and
Control “ Tata McGraw-Hill , 2000.(Chapters 7,8,10-12)
Reference Book:
1.E-Commerce book by P.T.Joseph
2.Bajaj and Nag, “ECommerce the cutting edge of Business”, TMH
3.P. Loshin, John Vacca, “Electronic commerce”, Firewall Media, New Delhi.

Sub: Digital Computer Organization
UNIT- I (Boolean Algebra) (3.3-0-0.3)
Theory (3.3 Credit)
Logic Gates (AND, OR, NOT, Universal Gates) and their operations, Number Systems- Decimal and Binary
Number System, Code Conversion (Binary, Octal Hexadecimal), Computer BCD, Boolean Functions,
Simplification of Boolean equations using K-maps, Logic Gates(AND, OR, NOT, NAND, NOR) and Logic Circuits
with Truth Table.
Group Discussion (0.3 Credit)
UNIT- II (Binary arithmetic) (2.3-0-0)
Theory (2.3 Credit)
Binary Arithmetic (Addition, Subtraction, Multiplication and Division), 1’s and 2’s complement arithmetic,
Fixed-point and Floating Point Representation, Arithmetic Circuits- Adder, Subtractor, Flip-Flops
Combinational circuits- Multiplexers, De-Multiplexers
UNIT- III (Memory Organization) (3.1-0-0)
Theory (3.1 Credit)
Peripheral Devices and Memory Organization Peripheral Devices: Peripheral Devices, Input-Output devices,
Asynchronous Data Transfer, Modes of Transfer. Memory Organization: Memory Hierarchy, Main Memory,
Auxiliary Memory, Associative Memory, Cache Memory, Virtual Memory. CPU Organization: General Register
Organization, Bus and Memory Transfer (Data Bus, Register bus, Control Bus), Register Transfer Languages.
Recommended text Books:
1. Computer System Architecture, M. Morris Mano, PHI, New Delhi.
2. Digital Logic and Computer Organization, V. Rajaraman, T. Radhakrishnan, Phi Learning Pvt. Ltd.
Reference Books:
1. J.P. Hayes – “Computer Architecture and Organization”, McGraw Hill, New York.

Sub: System Analysis and Design
UNIT- I (System definition and Concept, Decision Making Process) (3-0-0)
Theory (3 Credits)
System : definition and concept; Real time and distributed systems; Data information and related
attributes; System analysis and analyst Decision Making Process, Role of Information, Overview of Systems
Analysis and Design, System Development Life Cycle (SDLC).
UNIT- II (Preliminary Investigation) (2-0-0)
Theory (2 Credits)
Fact-Finding, Tools, Review of literature, procedures, forms, files, on-site observation, Research and site
visits, Interviews and questionnaires, Type of interviews and questionnaires, joint application development
(JAD), JAD participants, How to plan and conduct AD sessions ,Benefits.
Preliminary Investigation, Feasibility Study-Technical. Economic and Operation. Cost/Benefit Analysis,
Requirement Capturing and Specification Using DF Diagram, System Flow Diagrams.
UNIT - III (Software Design) (3-0-0)
Theory (3 Credits)
Software Design: Strategies for good system design, Designing fundamentals, Effective modular design: Data,
architectural and procedural design, design documentation, ERD, Object Oriented Design: OOD concepts and
methods, class and object definitions, refining operations, class and object relationships,logical and physical
design, Form – driven methodology, major development activities, personnel allocation and audit
1. System Analysis & Design – Elias M. Awad, Galgotia Publication
2. System Analysis and Design, Capron, Tom, Addison Wesley.

Sub: Statistical Methods
UNIT I (4-0-0)
Theory (4 Credits)
Frequency distributions, Relative frequency distributions, cumulative frequency distributions and Ogives,
Frequency curves, mean, median, mode and other measures of central tendency, Dispersion, standard
deviation variance. Skewness and Kurtosis.
Combinations and permutations, concepts and axioms of probability, Addition and multiplication theorems
of probability, theorem on conditional probability, Bayer's Theorem, Random variables, discrete, probability
distribution & probability distribution of functions of random variables, Mathematical expectation.
Moments, Movement generating functions.
UNIT II (3-0-0)
Theory (3 Credits)
The Binomial, Normal and Poissons distributions, relationship between Binomial and Normal distributions
relationship between Binomial and Poisson distributions, relationship between Binomial and Normal
distributors, relationship between Binomial and Poisson distributions. Sampling theory, random samples and
random numbers, Computations of mean, variance and moments of grouped data. Estimation theory,
unbiased, efficient point and interval estimates, reliability, maximum likehood estimates.
UNIT III (3-0-0)
Theory (3 Credits)
statistical Decision theory, Statistical decisions and hypothesis decision rules. type I & II errors, Two tailed
and one tailed of freedom the F distribution the chi square test, curve fitting and method of least squares,
regressions. Correlation theory, correlation and regression, measures of correlation coefficients of
correlation, correlation of time series and attributes, multiple and partial correlation, relationship between
multiple and partial correlation coefficients. Time series and forecasting, moving averages, smoothing of
curves, forecasting models and methods. Analysis of variance, t-test the F-test and the Z-test
Text / Reference book
1.Elements of Mathematical statistics, S. Prasad; Rastogi Publications , Meerut
2. Basic Statistics: B.L. Agrawal
Recommended text books:
1. M.R. Spiegel and Larry J. Stephens : Statistics, Tata Mc. Graw Hill Edition.
2. M.R. Spiegel and Larry J. Schiller and R.Alu Srinivasan : Probability and Statistics, Tata Mc. Graw Hill
Edition.

Sub: Digital Electronics
UNIT I (Number systems and different types of number systems) (3-1-0)
Theory (3 Credits)
Number systems and different types of number systems,1’s & 2’s complement, Binary Fixed- Point
Representation, Arithmetic operation on Binary numbers, Overflow & underflow, Floating Point
Representation, ASCII, EBCDIC codes, Gray code, Excess-3 & BCD
Logic Gates, AND, OR, NOT GATES and their Truth tables, NOR, NAND & XOR gates, Boolean Algebra, Basic
Boolean Law's, Demurrage’s theorem, MAP Simplification, Minimization techniques, K -Map, Sum of Product
& Product of Sum.
UNIT II (Combinational & Sequential circuits, flip flops)(3-2-0)
Theory (3 Credits)
Combinational & Sequential circuits, Half Adder & Full Adder, Full subtract or Binary serial and
parallel adders. BCD adder. Binary multiplier. Decoder: Binary to Gray decoder, BCD to decimal, BCD to 7-
segment decoder. Flip-flops - RS, D, JK & T Flip-flops, RAM and ROM, Multiplexer, Demultiplexer,
Encoder, Octal to binary, BCD to excess-3 encoder. Decoder, Idea about Arithmetic Circuits, Program
Control, Instruction Sequencing.
UNIT III (Counters, Asynchronous , synchronous and synchronous decade counter)(3-0-0)
Theory (3 Credits)
Counters, Asynchronous (ripple), synchronous and synchronous decade counter, Modulus counter,
skipping state counter, counter design. Ring counter. Counter applications. Registers: buffer register, shift
register
1. M. MORRIS MANO, “Computer System Architecture ” PHI Publication ISBN 81-203-0417-9
Reference Book
1. BARTEE, “Digital Computer Fundamentals ” TMH Publication ISBN 0-07-003899-6
2. MALVINO, “ Digital Computer Electronics ” TMH Publication ISBN 0-07-462235-8

Semester –III
Sub: Management Information System
UNIT I (Introduction, MIS concept, Basic of Management Information System) (4-0-0)
Theory (4 Credits)
Introduction, MIS concept, Definition, role & Impact of MIS, Process of management, organization structure &
behavior. Basic of Management Information System Decision Making.
UNIT II (Development of Management Information System)(3-0-0)
Theory (3 Credits)
Information concepts, System concepts & control Types of system handling system complexity System
development model Development of Management Information System Requirement and implementation of
MIS, Choice of information Technology for Management Information System.
UNIT III (Application of MIS, Enterprise Resource Planning) (3-0-0)
Theory (3 Credits)
Application of Management Information system Application in manufacturing sector using for personal
management, financial management, Production Management, Material Management, Marketing
Management Application in Service Sector. Enterprise Resource Planning (ERP), EMS, ERP, Benefits
implementation, EMS & MIS. Case Studies- Application of SAP TM technologies in manufacturing sector.
Reference Books :
1. W.S. Jawadekar-Management Information System, Tata McGraw Hill.
2. Loudon & Loudon-Management Information, Pearson Education Asia

Sub: Programming with Visual Basic
UNIT- I (Introduction to .Net) (2.8-2-0.2)
Theory (2 Credits)
Introduction to .NET, .NET Framework features & architecture, CLR, Common Type System, MSIL, Assemblies
and class libraries. Introduction to visual studio, Project basics, types of project in .Net, IDE of VB.NET- Menu
bar, Toolbar, Solution Explorer, Toolbox, Properties Window, Form Designer, Output Window, Object
Browser.
The environment: Editor tab, format tab, general tab, docking tab. visual development & event drive
Programming -Methods and events.
Practical (1.4 Credits) Practice (0.6 Credit)
S no Name Of Program Practical Practice
1 Introduction of .net and features 0.2 0.1
2 Exercise based on console programming in .net 0.2 0.1
3 Exercise based on datatype 0.2 0.1
4 Exercise based on variable 0.2 0.1
5 Exercise based on control structure 0.2 0.1
6 Exercise based on .net properties 0.2 0.1
7 Exercise based on Form designing 0.2
Group Discussion/Seminar (0.2 Credit)
UNIT - II (Array, Function) (3-2-0)
Theory (3 Credits)
The VB.NET Language- Variables -Declaring variables, Data Type of variables, Forcing variables declarations,
Scope & lifetime of a variable, Constants, Arrays, types of array, control array, Collections, Subroutines,
Functions, Passing variable Number of Argument Optional Argument, Returning value from function.
Control flow statements: conditional statement, loop statement. Msgbox & Inputbox.
1 Introduction of .net and features 0.2 0.1
2 Creating windows form 0.2 0.1
3 Program based on Arrays. 0.2 0.1
4 Program based on Subroutine. 0.2 0.1
5 Program based on Functions. 0.2 0.1
6 Program based on Filtering and sorting data. 0.2
7 Program based on Msgbox & Inputbox. 0.2 0.1
UNIT - III (Working with Forms)(2-2-0)
Theory (2 Credits)
Working with Forms : Loading, showing and hiding forms, controlling One form within another.
GUI Programming with Windows Form: Textbox, Label, Button, Listbox, Combobox, Checkbox, PictureBox,
RadioButton, Panel, scroll bar, Timer, ListView, TreeView, toolbar, StatusBar.There Properties, Methods and
events. OpenFileDilog, SaveFileDialog, FontDialog, ColorDialog, PrintDialog. Link Label. Designing menues :
ContextMenu, access & shorcut keys.

1 Implementing simple data binding 0.3 0.1
2 Implementing complex data binding. 0.2 0.1
3 Displaying data from multiple tables. 0.3 0.1
4 Exercise based on OpenFileDilog and SaveFileDialog. 0.2 0.1
5 Exercise based on ContextMenu. 0.2 0.1
6 Exercise based on access & shorcut keys 0.2 0.1
1. VB.NET Programming Black Book by steven holzner –dreamtech publications
2. Mastering VB.NET by Evangelos petroutsos- BPB publications
3. Introduction to .NET framework-Worx publication
Reference Books:
1.Applied Microsoft.NETframework programming, Jeffrey Richter, MS Press.
2.NET framework essentials Thuan L. Thai, Hoang Q. Lam, O’Reilly.
3.Programming .NET components, By Juval Löwy, O’Reilly

Sub: Fundamentals of Accounting
UNIT I (Introduction of Financial) (3-0-0)
Theory (3 Credits)
Introduction to Financial Accounting-Meaning and Scope, Accounting v/s Book Keeping Terms used in
accounting, users of accounting information and limitations of Financial Accounting. Conceptual Frame
work: Accounting Concepts, Principles and Conventions. Accounting Standards, Accounting Policies.
Unit II (Recording of transactions) (3-0-0)
Theory (3 Credits)
Recording of transactions: Accounting Equation, Journal, Ledger, Trial Balance Cash Book, Bank
Reconciliation Statement, Depreciation: Meaning, need & importance of depreciation, methods of
charging depreciation (WDV & SLM).
Unit III (Provision and Reserves) (3-0-0)
Theory (3 Credits)
Provision and Reserves, Preparation of final accounts: Preparation of Trading and Profit & Loss Account
and Balance Sheet (with and without adjustments).
1 Fundamentals of Accounting & Financial Analysis: Anil Chowdhry, Pearson Education
Reference Books:-
1. Fundamentals of Accounting & Financial Analysis: By Anil Chowdhry (Pearson Education)
2. Financial accounting: By Jane Reimers (Pearson Education)
3. Accounting Made Easy: By Rajesh Agarwal& R Srinivasan (Tata McGraw –Hill)
4. Financial Accounting for Management; By Amrish Gupta (Pearson Education)
5. Financial Accounting for Management: By Dr. S. N. Maheshwari (Vikas Publishing House)
6. Fundamentals of Accounting & Financial Analysis

Sub: Internet Programming
UNIT - I (Internet Programming Technologies) (3-1-0)
Theory (3 Credits)
Internet and various protocols, World Wide Web, Web Protocol, Transferring Data on the Web, URL, Internet
Programming Tools, Introduction to Internet Programming ,Server Computing, Concept of front end and
back end design.
1 Creating a web page and transferring different data on it 0.2
2 Exercise with different fundamental tags 0.2
3 Exercise on Protocol assessment 0.2
4 Exercise on Designing concept 0.2
5 Exercise on Front end Design 0.1
6 Exercise on back end Design 0.1
UNIT- II (Introduction of HTML)(4-2-0)
Theory (4 Credits)
Introduction of HTML, HTML Elements, HTML Basic Tags, HTML Formatting, HTML Entities, HTML Links,
HTML Frames, HTML Tables, HTML Lists, HTML Forms, HTML Images, HTML Background, HTML Colors,
HTML Color-values, HTML Color-names, search engine, HTML url-encode, Publishing HTML on web.
Cascaded Style Sheet: CSS Introduction, Syntax, Setting Background, Text, Font, Border, Margin, Padding,
List, Dimension, Classification, Positioning, Pseudo-class, Pseudo-element, CSS Media Types, External,
Internal and Inline style sheet.
1 Develop an HTML document for a web page of your favorite teacher 0.2 0.1
2 Design the page with an attractive background color, text color and
background image
0.2 0.1
3 Develop an HTML document for a web page of your favorite National Leader 0.2 0.1
4 Design the page with an attractive color combination, with suitable headings
and horizontal rules
0.2 0.1
5 Write an HTML document with an example of Ordered List and Unordered
List
0.2 0.1
6 Write an HTML document with an example of Table format to print your Bio-
Data
0.2 0.1
7 Write an HTML document with an example of Table format to print your
Telephone Bill
0.2
UNIT- III (Java Scripts) (2-2-0)
Theory (2 Credits)
Introduction of Java Scripts :Variables declaration, If...Else statement, Switch statement, Break statement,
Operators statement, CSS ,Popup Boxes, Functions, For Loop, While Loop,, For...In, Events, Try...Catch, Throw,
on-error.
1 Program for Control Statements 0.2 0.1
2 Program for Operators 0.2 0.2
3 Program for Functions 0.2 0.1
4 Exercise based on different looping 0.2 0.1

5 Program for Exception Handling 0.2 0.1
6 Exercise based on popup boxes 0.2 0.2
1. Head First HTML with CSS & XHTML By Elisabeth Freeman, Eric Freeman December 2005
Reference Book
1. HTML & Web Design Tips and Techniques - Kriss Jamsa, McGraw-Hill
2. JavaScript: The Complete Reference, 2nd edition, Tata McGraw Hill.
HTML & XHTML: The Complete Reference, Powell, Thomas, Tata McGraw Hill.

Semester IV
Sub: Data Structure and Algorithm
UNIT I (Introduction of data structure and data types) (2-2-0)
Theory (2 Credits)
Development of Algorithms : Notations and analysis - Storage structures for arrays – Sparse matrices
Linear Data Structures: Introduction to data structures, Creation and manipulation of data structures: arrays,
lists, stacks, queue-Representation using arrays.
Linked Lists: Single linked list, linked stacks and queues, Circular linked list, Doubly linked list and
Generalised list, Polynomial addition, multiplication. Two-way link lists programs. Infix to postfix/prefix
conversion.
Practical (1.4 Credits) Practice(0.6)
S.No Name Of Program Practical Practice
1 Program based on Arrays(1-D.2-D) 0.2 0.1
2 Program based on several matrices operations 0.2 0.1
3 Program based on Stacks 0.2 0.1
4 Program based on Queue 0.2 0.1
5 Program based on Linked list 0.2 0.1
6 Program based on Conversion of infix expressions to postfix expressions 0.2 0.1
7 Program based on Conversion of postfix expressions to infix expressions 0.2
UNIT II (Non-linear Structures)(2.9-1-0.1)
Non Linear Data Structures:
Trees: Definition and terminology, Representation. Tree traversal, Examples on trees. Threaded trees
Binary Trees: Binary search tree, Operation on multi-way trees. height balanced trees. B trees and B+ trees.
Graphs: Representation of graphs - BFS, DFS - Topological sort - Shortest path problems. String
representation and manipulations - Pattern matching.
Practical (0.8 Credits) Practice(0.2 Credits)
1 Program based on B tree 0.2
2 Program for Tree Traversal 0.2
3 Program based on Binary search tree 0.2
4 Program based on BFS 0.1 0.1
5 Program based on DFS 0.1 0.1
Group Discussion /Seminar (0.1 Credits)
UNIT III (Sorting)(3-1-0)
Theory (3 Credits)
Sorting Techniques : Searching, Sorting and Hashing: Linear search-Binary search-Sorting techniques-
Bubble sort ,Insertion Sort, Selection Sort, Merge and quick sort, Comparision with respect to their efficiency.
Hash Tables, Hashing techniques and collision handling mechanism.

1 Program for Linear Searching 0.1
2 Program for Binary Searching 0.1
3 Program for Bubble sorting 0.2
4 Program for Selection Sorting 0.2
5 Program for Merge Sorting 0.2
6 Program for Insertion Sorting 0.2
1. Schaum's Outline of Data Structures with C by JOHN R. HUBBARD, Publisher: McGRAW-HILL
2. Schaum's Outline of Data Structures with C by Lipschutz and Seymour, Publisher: McGRAW-HILL
Reference Books:
1. Data Structures Using C by Aaron M. Tenenbaum, Publisher: Prentice Hall
2. Data Structure through C, R. S. Salaria, Khanna Publication

Sub: Computer Network
UNIT I (Network architecture ) (3-1-0)
Theory (3 Credits)
Introduction to Network, Network architecture, Line Configuration, Network Topology, Transmission Mode,
Category of Networks, Analog and Digital Signal, Periodic and aperiodic Signal, Transmission of digital data
interface and modem, Layer Architecture Model, OSI Reference Model.
1 Study of network IP:Classification of IP address 0.2 0.1
2 Study of network IP: Sub netting 0.2
3 Study of existing topology of a network. 0.2 0.1
4 Execution of different network commands. 0.2
UNIT II (Transmission Media) (3-1-0)
Theory (3 credits)
Transmission Media: guides and unguided media, Transmission Impairments, performance, Shannon
capacity, Error Detection & Correction, Data link layer protocols, multiple access protocol, IEEE standards for
LAN, high speed LANs, Network Devices-repeaters, hubs, switches, bridges, Ethernet and Wireless LAN,
Multiplexing and Switching, .
Practical (0.8 Credits) Practice (0.2 Credits)
1 Exercise on IEEE Standards 0.2 0.1
2 Exercise on High speed LAN 0.1
3 Study of Network devices 0.2 0.1
4 Exercise on Ethernet and Wireless LAN 0.1
5 Study of TCP and UDP performance 0.2
UNIT III ( Introduction of TCP/IP) (2-1-0)
Theory (2 Credits)
TCP/IP Protocol Suite, Layers of TCP/IP, IP addressing, Classes of IP addresses, Network Layer and Routing,
Internetworking, Routing principles. Transport and application layer Protocols in brief, TCP and UDP, SMTP,
FTP, HTTP, DNS and DHCP.
1 Study of basic Network configuration commands 0.2 0.1
2 Connect the computers in Local Area Network 0.2 0.1
3 To get the Physical address of the system using Address Resolution
Protocol
0.2 0.2
1. B.A. Forouzan-Data Communications and Networking, Tata McGraw Hil
Reference Book
1. Kurose and K.W. Ross-Computer Networking Pearson Education Asia.
2. William stallings - Data and Computer communication - (PHI)

3. S. Tanenbaum- Computer Networks - (PHI)
Sub: Database Management System
UNIT I (Introduction of database) (3-1-0)
Theory (3 Credits)
Purpose of Data Base Systems, Data Abstraction, Data Models, Instances and Schema, Data Independence,
Data Definition Language, Database Manger, Database Administrator, Database users, Overall System
Structure. Entity-Relationship Model: Entities and Entity Sets, relationship and relationship sets, Mapping
constructions, primary keys. Entity-Relationship diagram, Reducing E-R diagrams to tables, Generalization
and specialization.
Practical (0.6 Credit)
1 Program based on Database creation & related queries, on Keys 0.2 0.1
2 Alteration of an existing database 0.2 0.1
3 Program based on Tables 0.2 0.1
UNIT II (Relational Model)(3-1-0)
Theory (3 Credits)
Relational Model: Structure of relational database, Format, Query Language, modifying database, views,
Pitfalls in Relational Database Design, Normalization using Functional, Multi-valued and Join dependencies,
Domain Key, Normal forms.
1 Deletion of existing tables from a particular database 0.1
2 Implementation of query language with insertion, Selection & Updating of
database tables
0.1
3 Execution of several query statements that includes following operations
a)Deletion of a record
b)Basic data retrieval
0.1
4 Execution of several query statements that includes Condition specification 0.1
5 Execution of several query statements that includes following operation
a)Arithmetic Operators
b) Aggregate Operators
0.2
6 Retrieval of records through multiple tables 0.1
7 Join operation on multiple tables 0.1
8 Set manipulation on records through various operations 0.2
UNIT III (Security & Integrity)(4-0-0)
Theory (4 Credits)
Security & Integrity: Security and Integrity violations, Authorization and Views, Integrity constraints,
Encryption. Transaction Processing & Concurrency Control: Transaction Processing, Schedules & Recovery,
Concurrency Control Techniques, Locking, Time Stamp ordering.
1. Silverschatz Korth and Sudarshan-Database System Concepts, 4th
ed. Tata Mc-Graw Hill.
2. Raghu Rama Krishnan-Database Management Systems, 2nd
ed. Tata Mc-Graw Hill
Reference Books:
1. R. Elmasri et. Al “Fundamentals of Database Systems”. 3rd
Edition – Addison Wesley, (Indian
Reprint), New Delhi.

2. C.J.Date, Data Base Systems, Vol I & II
Semester V
Sub: Design and Analysis of Algorithms
UNIT – I (Introduction to data structures and algorithms) (2.5-1.5-0)
Introduction of Linear Data Structures, arrays, lists, stacks, queue. Linked Lists: Single linked list, linked
stacks and queues, Circular linked list, Doubly linked list and Generalized list, Introduction of Non Linear
Data Structures: Trees and Graphs. Introduction, Basics of Algorithms, Models of Computation: space and
time complexity measures, lower and upper bounds, Abstract Data Type, Complexity analysis and measures,
The Running Time of a Program, Use of the Big-Oh, small o, Big-omega and small omega notation,
Practical (1 Credit) Practice(0.5 Credit)
S.No. Name of Practical Practical Practice
1
1
Perform recursive binary and linear search. 0.2 0.1
2
2
Sort a given set of elements using Heap sort technique. 0.2 0.1
3
3
Sort a given set of elements using Merge sort technique. 0.2 0.1
4
4
Sort a given set of elements using Insertion sort technique. 0.2 0.1
5
5
Sort a given set of elements using Quick sort technique. 0.2 0.1
UNIT-II(Graph Algorithm, Searching Algorithm and Greedy Method) (2.5-1.5-0)
Study and analysis of basic sorting algorithms like Heap Sort, Radix Sort, Bucket Sort and Merge sort.Graph
Algorithms: connectivity, strong connectivity, biconnectivity, Graph traversals, topological sort, shortest paths,
minimum spanning trees, network flow; The disjoint set union problem; String matching; order statistics.
Searching algorithm (Depth and Breadth first search in graphs), divide-and-conquer, Backtracking Algorithm.
Greedy Method: Knapsack Problem.
Practical (1 Credit) Practice(0.5 Credit)
S. No. Name of Practical Practical Practice
1
1
Check whether a graph is connected using Depth first
technique.
0.2 0.1
2
2
Sort a given set of elements using Selection sort technique. 0.2 0.1
3
3
From a given vertex in a weighted connected graph, find
shortest paths to other vertices using Dijkstra’s algorithm.
0.2 0.1
4
4
Find minimum cost spanning tree of a given undirected graph
using Kruskal’s algorithm.
0.2 0.1
5
5
Print all the nodes reachable from a given starting node in a
digraph using Breadth first search technique.
0.2 0.1
UNIT-III (Dynamic Programming, Problem Analysis, NP Completeness) (3-0-0)
Theory (3 Credits)
Dynamic Programming: Matrix Chain Multiplication, Longest Common Subsequence and 0/1 Knapsack
Problem. Branch and Bound: Travelling Salesman Problem and Lower Bound Theory. Pattern Matching
Algorithms: KMP Matcher and Boyer Moors Algorithms.

Recommended Text Book:
1. Rivest and Cormen, Introduction to Algorithms, Prentice Hall of India.
Reference Books:
1. Aho A.V., J.E. Hopcroft, J.D. Ullman; Design and Analysis of Algorithms, Pearson Education.
2. Baase, Computer Algorithms Pearson Education.
3. Brassard, Algorithms Prentice Hall.
4. Bazaraa, Linear Programme & Network Flows, John Wiley & Sons.

Sub: Object Oriented Programming in “C++”
UNIT I (Object Oriented Concepts) (3-1-0)
Theory (3 Credits)
Object Orientation Concepts, Object Oriented Methodology, Features, Application and Advantages of OOP’s,
What is C++, Programming Paradigms, Procedural Programming, Modular Programming, Data Abstraction,
Data Types, new operators and keywords, Type conversions in C++, reference variables, arrays etc.
1. Programs based on variables and assignment. (0.2 Practical) (0.1 Practice)
2. Programs based on arithmetic operators (0.2 Practical) (0.1 Practice)
3. Programs based on logical operators. (0.2 Practical)
4. Programs based on conditional & looping statements (0.2 Practical)
UNIT II (Classes and Objects) (2.5-1.5-0)
Classes and Objects, Classes and Access Specifiers, Defining data members and member functions, Array of
objects, Usage of namespace, Managing Console I/O, Usage of Manipulators, Usage of Constructors and
Destructors, Functions in C++ , Call by reference, return by reference, Function overloading, Inline Functions,
Friend Functions, Static class members, Operator Overloading , Overloading unary and binary operators,
Usage of this pointer, Overloading using friend functions, Overloading “<<” and “>>” operator.
1. Programs related to essentials of object oriented programming:
i. Classes & Objects (0.2 Practical)
ii. Constructor & Destructor (0.2 Practical)
iii. Access Specifiers, abstract data types (0.2 Practical)
iv. Returning and passing objects as parameter (0.2 Practical)
v. Nested and inner classes (0.2 Practical)
2. Programs based on the Polymorphism concept: function overloading. (0.2 Practical)
3. Programs based on the Polymorphism concept: operator overloading.(0.2 Practical) (0.1 Practice)
UNIT III (Inheritance ) (2.5-1.5-0)
Inheritance, Introduction, Types of Inheritance, Base class and derived class examples, Virtual base class,
Abstract class, Virtual functions and pure virtual functions, Exception handling, Error Handling , Error
Handling Alternatives, Exception Specification, Exception in Constructors & Destructors, Uncaught
Exceptions, Standard Exceptions.
1. Programs based on the Inheritance (super class - sub class) concept.(0.2 Practical) (0.1 Practice)
2. Programs based on Pointers to Objects. (0.2 Practical) (0.1 Practice)
3. Programs based on friend function. (0.2 Practical) (0.1 Practice)
4. Exercise based on static functions. (0.2 Practical) (0.1 Practice)
5. Designing of Object & Class diagram: links and associations. (0.2 Practical) (0.1 Practice)
1. Object Oriented Programming (C++) – Balaguruswamy
Reference Books:
1. The C++ Programming Language - Bjarne Stroustrup
2. Thinking in C++ - Bruce Eckel
3. C++ Programming Today – Barbara Johnstron

4. Problem Solving with C++ - Walter Savitch
Sub: Software Engineering
UNIT- I (Software evolution)(3-0-0)
Theory (3 Credits )
Issues in Software Engineering, Software evolution: Concepts of product life cycle, Development life cycle
models: Waterfall, Spiral, Iterative enhancement and phased development, Computer system engineering:
Overview, various phases, analysis, design, development and implementation. Cost Estimation Techniques,
Metrics for software productivity and quality, Effort Estimation: Overview, COCOMO, Putnam, Sterling
models, automated estimation tools.
UNIT- II (Software Project Scheduling) (2-0-0)
Theory (2 Credits)
Software Project Scheduling: Task definition and parallelism, effort distribution, scheduling Methods: PERT
and CPM, Software project plan outline Software prototyping: Overview, steps, methods, tools, specification,
guidelines Requirement analysis methods: introduction, methods Software implementation: Issues, concept
of programming support environment Software Testing overview: various tests and methods: top-down,
bottom-up, mixed Debugging: definition, techniques and strategies, exhaustive testing, classification.
UNIT - III (System integration)(3-0-0)
Theory (3 Credits)
System integration: Overview, integration of hardware and software component Strategies software
configuration management activity, planning, monitoring Controlling, Resource management, Product
assurance: overview, quality assurance Software quality assurance: Definitions, various types, trade-offs,
verification and validation Configuration management: identification, control, auditing, status accounting, ,
overview, definition, V and V life cycle.
1. Pressman “Software Engineering A Practitioner’s Approach” McGraw-Hill, 5th edition,
Reference Books:
1. Shooman “Software Engineering Design, Reliability and Management” ,McGraw Hill 1983
2. Fairley “Software Engineering Concepts”, McGraw--Hill Series, New York, 1985

Sub: Operating System
UNIT – I (Introduction and CPU Scheduling) (2-1.3-0)
Theory (2 Credits)
Introduction: Types of OS - multiprogramming, time sharing, real time systems, multiprocessor system.
Concepts of process, Process and Threads: Life cycle and implementations of process. CPU Scheduling :
Review of multiprogramming, concept, scheduling concept, scheduling algorithms, algorithm evaluation,
multiple processor scheduling, disk and drum scheduling: Physical characteristics, first come first serve
scheduling, shortest seek time first scheduling, SCAN
Practical (0.8 Credit) Practice (0.4 Credit)
1 Program based on FCFS Scheduling. 0.2 0.1
2 Program based on Round robin Scheduling. 0.2 0.1
3 Program based on shortest job first scheduling. 0.2 0.1
4 Program based on shortest seek time first scheduling 0.2 0.1
Practice (.1 Credit)
Practice of numericals of scheduling algorithms like FCFS, Round robin and shortest job first.
UNIT – II (Synchronization and Deadlock) (2.5-0.7-0)
Synchronization: - Peterson's solution - Bakery algorithm - Hardware-based solutions – Semaphores
Deadlocks: The deadlock problem, deadlock characterization, deadlock presentation, deadlock avoidance and
Banker's algorithms. Concurrent Process: Precedence graph, specification, review of process concept,
hierarchy of process, the critical section problem, semaphores, classical process coordination problem, inter
process communication -Race conditions, Critical regions, Mutual exclusion with busy waiting, sleep and
wakeup.
Practical (0.4 Credit) Practice (0.3 Credit)
1 Program for Banker’s Algorithm. 0.2 0.2
2 Program for Deadlock detection and Prevention. 0.2 0.1
UNIT – III (Memory management and Unix File System) (2.5-1-0)
Memory management: Bare machine, resident monitor, swapping, multiple partition, paging, segmentations,
Paging and Virtual memory, FCFS, FRU - Belady's anomaly, Thrashing - Working set. Virtual memory:
overlays, demand paging, page replacement, virtual memory concepts, page replacement algorithms,
belody's anomaly, allocation algorithm, thrashing, I/O devices and device controllers; Interrupt handlers,
disk arm scheduling algorithm. Design of the Unix File System - Buffer caches - File system organization – I-
nodes File tables - Inode tables - Network file systems.
1 Essential Linux commands Understanding shells, 0.1
2 Commands for files and directories cd, ls, cp, mv, 0.2
3 Commands for files and directories rm, mkdir, rmdir, pwd, 0.1
4 file, more, less, creating and viewing files using cat, 0.1
5 file comparisons – cmp & comm, View files, 0.2
6 disk related commands, checking disk free spaces 0.1
7 Creating and editing files with vi editor 0.2
1. Operating System Concepts, Seventh Edition, Avi Silberschatz, Peter Baer Galvin, Greg
Gagne, Publisher: Wiley
2. W.STALLINGS, "Operating Systems", Prentice Hall, V Edition, 2005
Reference Books:
1. A.S. Tanenbaum Modern Operating Systems, Pearson Education Asia.

Sub: Open Source Technology
UNIT- I (Introduction of Open Source) (2.8-0-0.2)
Theory (3 Credits)
Open Source and Linux Open Source Definition, The distribution terms of open source software, open source
technology importance, Free and Open Source ( FOSS ), LAMP ( Linux, Apache, MySQL, PHP, Python, and
Perl.). Benefits, Perspectives of Open Source software Linux and Open Source, Linux Usage Basics: Logging
into the system, changing users and editing text files. Running Commands and Getting Help, Browsing the
File system, Users, Groups and Permissions. Introduction to Web server. Installing Apache on Linux: httpd
service.
UNIT- II (Administration) (2-0-0)
Theory (2 Credits)
Linux Administration: Installation of Linux interactively, Perform user and group administration, Administer
the Linux printing subsystem, Automate tasks with at, cron ,Install, update, query and remove software
packages with RPM.
UNIT- II (Application) (2-0-0)
Theory (2 Credits)
Linux Application: Accessing and Running Applications: cc compiler, gcc Compiler, Mozilla Firefox.
Multimedia in Linux : Listening to Audio, Playing video, Using Digital Camera, Recording music / video CDs.
12 Publishing: Open office, Working with Graphics, Printing Documents, Displaying documents with
Ghostscript and Acrobat, Using Scanners driven by SANE.

Semester VI
Sub: Core Java
UNIT – I (Introduction to Core Java) (3-1-0)
Theory (3 Credits)
Structured V/s object oriented approaches, Data abstraction information hiding and encapsulation, Objects
and classes Introduction to programming in Java: Byte code and virtual machine. Program Elements:
Primitive data types, variables, assignment, arithmetic, short circuit logical operators, arrays. Decision and
control statements.
2. Programs based on variables, assignment, arithmetic & logical operators. (0.2 Practical)
3. Programs based on conditional Statements. (0.2 Practical)
4. Programs based on looping statements. (0.2 Practical) (0.1 Practice)
5. Implementation of the methods using java programs. (0.2 Practical) (0.1 Practice)
UNIT – II (Objects, Classes and Inheritance) (3-1-0)
Theory (3 Credits)
Objects and classes: Objects, constructors, returning and passing objects as parameter. Nested and inner
classes. Single and Multilevel Inheritance, Extended classes, Access Control, usage of super. Overloading and
overriding methods. Abstract classes. Using final with inheritance. Polymorphism, single and multilevel
inheritances. Package and Interfaces: Defining package, concept of CLASSPATH, access protection, importing
package. Defining and implementing interfaces.
1. Programs related to essentials of object oriented programming:
a. Classes & Objects (0.1 Practical)
b. Access Specifiers (0.1 Practical)
c. Constructor (0.1 Practical)
d. Returning and passing objects as parameter (0.1 Practical)
e. Nested and inner classes (0.2 Practical)
2. Programs based on the Polymorphism concept. (0.2 Practical)
3. Programs based on the Inheritance (super class - sub class) concept. (0.2 Practical)
UNIT – III (Packages and Exception Handling) (3-1-0)
Theory (3 Credits)
Exception Handling: Exception handling fundamentals, Exception types, uncaught exceptions, try, catch and
multiple catch statements. Usage of throw, throws and finally. String Handling: String constructors, special
string operations, character extraction, searching and comparing strings, string Buffer class. Applet: Applet
Fundamentals, using paint method and drawing polygons.
1. Programs based on Packages and Interfaces. (0.2 Practical) (0.1 Practice)
2. Programs based on Exception Handling (try & catch statements, throws and finally statements).
(0.2 Practical)
3. Programs based on string operations. (0.2 Practical)
4. Programs related to web browser using Java Applet. (0.2 Practical) (0.1 Practice)
1. Java 2: The Complete Reference, Herbert Scliildt, Tata Mc Graw Hill.
Reference Books:
1. Deitel and Deitel, Java, How to Program, Pearson Education Asia.
2. E. Balaguruswmy, Programming with Java, Tata McGraw Hill.
3. C. Thomas Wu, An Introduction to OOP with Java, Mc Graw Hill.
4. Cay S. Horstmann and Gary Comell, Core Java, Pearson Education Asia.

5. Zukowski: Mastering Java 2, BPB Publications.
Sub: Discrete Mathematics
UNIT – I (Relations,Permutations and Combinations)(3-0-0)
Theory (3 Credits)
Fundamentals: Sets and Relations- Sets, Multi Sets, Operations on Sets, Relations and Properties of
Relations, Representation of Relations, Equivalence Relation, Closures of Relations, Method of Contradiction.
Permutations and Combinations, Pigeon Hole Principle, Principle of Inclusion and Exclusion.
UNIT – II (Boolean Algebra,Lattices) (2-0.5-0)
Theory ( 2 Credits)
Boolean Algebra, Posets and Lattices: Partial Order Set, Poset, Bounding Elements, Well Ordered Set,
Lattices, Principle of Duality, Bounded, Distributed, and Complemented Lattices, Finite Boolean Algebra,
Boolean Functions and Expressions, Proposition and Propositional Calculus.
Practice on Lattices, finite Boolean algebra, Boolean functions and duality.
UNIT – III (Graph Theory)(2-0.5-0)
Theory (2 Credits)
Graphs and Group Theory: Basic Introduction of Graphs- Types of Graphs, Path and Circuits, Eulerian Path
and Circuits, Hamiltonian Path and Circuits, Trees, tree traversal, Spanning Trees, Dijkstra, Prim’s and
Kruscal’s Algorithms. Finite state machine, Non Deterministic Finite Automata, Deterministic Finite
Automata.
Practice on Graphs, dijkstras algorithm, prims algorithm and Finite state automata.
Recommended Books:
1. C.L.Liu, “Elements of Discrete Mathematics”, TMH, 2000.
Reference Books:
1. Keneth H.Rosen, “Discrete Mathematics and Its Applications”, TMH, 1999.
2. Trembly J.P. & Manohar P., “Discrete Mathematical Structure with Applications to Computer
Science”, McGraw Hill, 1997.
3. Narsingh Deo, “Graph Theory with Application to Engineering and Computer Science”, PHI, 2004.

Sub: Web Development Techniques
UNIT-I (Internet Principles, Web Applications)(3-0.6-0)
Theory (3 Credits)
Internet Principles-Basic web concepts - client/server model Internet protocols and applications.
Introduction about WWW, Web Applications, Web Browsers, HTML: Introduction of HTML, HTML Elements,
HTML Basic Tags, HTML Formatting, HTML Entities, HTML Links, HTML Frames, HTML Tables, HTML Lists,
HTML Forms, HTML Images. Cascaded Style Sheet: CSS Introduction, Syntax, Setting Background, Text, Font,
Border, Margin, Padding, List, Dimension, Classification, Positioning, Pseudo-class, Pseudo-element, CSS
Media Types, External, Internal and Inline style sheet.
Practical (0.4 Credits)
1 Designing a static web page using HTML. 0.2 0.1
2 Designing a dynamic webpage using DHTML using different style
sheets.
0.2 0.1
UNIT-II (Java Scripts) (2.2-1.2-0)
Java Scripts: Variables declaration, If...Else statement, Switch statement, Operators statement, Popup Boxes,
Functions, For Loop, While Loop, Break Loops, For...In, Events, Try...Catch, Throw on error. Java Script
Objects: Introduction, String, Date, Array, Boolean, Math, JS Browser, JS Cookies, Validation, Animation, Image
Maps, Timing, Create Object.
1 Programs on Working with AWT 0.2 0.1
2 Programs on different layouts in Java 0.2 0.1
3 Programs using Java Applets 0.2 0.1
4 Program in Java Script. 0.2 0.1
UNIT-III (PHP) (3-1-0)
Theory (3 Credits)
Introduction of PHP, Installation, Syntax, Variables, strings, operators, control structures, arrays, functions,
forms, GET & POST methods. Advance Operations: Date, Inculde, File & File Upload, Cookies & Session
Handling, Error & Exception Handling, Filtering, Database Connectivity.
1 Basic Implementation in PHP and exception Handling. 0.1
2 Program of Database connectivity in PHP. 0.2 0.1

3 Program for GET method. 0.2 0.1
4 Program for POST method. 0.2 0.1
1. Core PHP Programming By Atkinson, Leon (Author), Suraski, Zeev (Author) Third Edition, Prentice
Hall
2. Head First HTML with CSS & XHTML By Elisabeth Freeman, Eric Freeman December 2005
3. JavaScript: The Complete Reference, 2nd edition, Tata McGraw Hill.
4. Harvey M. Deital and Paul.J.Deitel, "Internet & World Wide Web How to Program", 4th Edition, 2008
Reference Books:
1. PHP 5 For Dummies, by Janet Valade, Wiley Publishing, Inc.
2. Programming PHP, By Rasmus Lerdorf, Kevin Tatroe, O'Reilly

Sub: Numerical Computations
UNIT-I Statical Methods (2.5-0.5-0)
Theory (2 Credits)
Statistical Methods : Treatment of data, Frequency Distribution, measures of central tendency, dispersion &
partition values. Probability Probability distribution – Binomial, Poisson & Normal. Method of least square,
correlation and regression.
Practice Based on Probability distribution, correlation and regression.
UNIT-II (Interpolation and Integration) (2.5-0.5-0)
Interpolation: Newton’s forward and backward difference formulae, Lagrange’s Interpolation formula,
inverse interpolation. Numerical Differentiation, derivatives from Newton-Goegory Forward Polynomial.
Numerical Integration: Newton-Cotes formulae, Weddle’s, Trapezoidal & Simpson’s rule, Numerical solution
of ordinary differential equations: ODE’s as a system of first order ODE’s, Euler’s, and Picard’s.
Practice Based on Numerical differentiation, numerical integration and ODE.
UNIT-III (Errors and Approximations in Digital Computers) (2.5-0.5-0)
Errors and Approximations in Digital Computers, Number representation, Floating point Arithmetic.
Solution of system of linear equations – direct method, Gauss Jordan & Gauss Elimination methods, Pivoting,
Iterative methods – Jacobi & Gauss Seidel methods. Solution of Nonlinear equations in n variable:
Localization of the roots, Bisection and Regula- Falsi methods, Newton-Raphson method, successive
Approximation method.
Practice Based on Linear equations, guass jordan gauss elimination and newton raphson method.
1) Computer Oriented Numerical Methods: Raja Raman, V., Prentice Hall.
Reference Books:
1) Introductory Methods of Numerical Analysis, S.S. Sastry, Prentice Hall, India
2) Computer Based Numerical Algorithms: Krishnamurthy E.V.;East West Press
3) Elementary Numerical Analysis : Conte de Boor.
4) Mathematical Statistics with Applications, John E. Freund’s, Pearson publications, New Delhi.

Sub: Software Project Management
Unit-I (Project Management) (3-0-0)
Theory (3 Credits)
Project Management: The management spectrum, the people, the product, the process, the project W5
HH
principle, critical practices. Metrics for Process and Project: Metrics in the process and project Domains,
software measurements, metrics for software quality, integrating metrics within software Process metrics
for small organizations, establishing a software metrics program.
Unit-II (Estimation and Project Scheduling) (4-0-0)
Theory (4 Credits)
Estimation: Observations, Project planning Process, software project estimation, decomposition techniques,
empirical estimation models, estimation for object oriented projects, estimation for Agile development and
web engineering projects, Project Scheduling: Basic concepts, project scheduling, defining a task set and task
network, scheduling, earned value analysis. Risk Management: Reactive V/S proactive Risk Strategies,
software risks, Risk identification, Risk projection, risk refinement, risk mitigation, monitoring and
management, the RMMM plan. Quality Planning: Quality Concepts, Procedural Approach to Quality
Management, Quantitative Approaches to Quality Management.
Unit-III (Quality Management) (3-0-0)
Theory (3 Credits)
Quality Management: Quality Concepts, Software Quality assurances, software reviews formal technical
reviews, Formal approaches to SQA, Project Execution And Closure, The Review Process, Planning, Overview
and Preparation, Group Review Meeting, Rework and Follow-up, One-Person Review Guidelines for Reviews
in Projects, Data Collection, Project Monitoring and Control.
1. Bob Hughes, Mikecotterell, “Software Project Management”, Third Edition, Tata McGraw Hill, 2004.
Reference Books:
1. Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill, 2001.
2. Royce, “Software Project Management”, Pearson Education, 1999.
3. Jalote, “Software Project Manangement in Practive”, Pearson Education, 2002

VII- SEMESTER
Sub: Advance Java Programming
UNIT-I (Introduction the Abstract Window Toolkit (AWT) , Java Swing)(2.5-1.5-0)
Introduction the Abstract Window Toolkit (AWT): Working with Windows and AWT, AWT classes, Windows
Fundamentals, Working with frame windows, creating a frame window in applet. Layout Managers and
Menus. Java Swing: Japplet, Icons and Labels, Text Fields, Buttons, Combo Boxes, Tabbed Panes, Scroll-Panes,
Trees, Tables, Exploring the Swings
1. Write a program to design a form using components textbox, text field, checkbox, buttons, list and
handle various events related to each component. (0.2 Practical) (0.1 Practice)
2. Write programs to demonstrate use of Grid Layout. (0.2 Practical)
3. Write programs to demonstrate use of flow and Layout. (0.2 Practical) (0.1 Practice)
4. Write programs to demonstrate use of Border Layout. (0.2 Practical)
5. Write a program to display any string using available Font and with every mouse click change the
size and / style of the string. Make use of Font and Font metrics class and their methods.
(0.2 Practical)
6. Write a program to create a menu bar with various menu items and sub menu items. Also create a
checkable menu item. On clicking a menu Item display a suitable Dialog box.
(0.2 Practical) (0.1
Practice)
UNIT-II (Networking through Java Programming, Java Database Front End)(3-1-0)
Theory (3 Credits)
Networking through Java Programming: Basics Socket overview, client/server, reserved sockets, proxy
servers, internet addressing. The networking classes & interfaces, Inet address, Factory methods, instance
method, TCP/IP Client Sockets, TCI/IP Server Sockets, Datagram’s, Datagram packets, Datagram server &
client. Java Database Front End: Database client/server methodology, Two-Tier Database Design, Three-Tier
Database Design, A JDBC Database Example JDBC Drivers, JDBC-ODBC Bridge, Current JDBC Drivers
1. Write a program to retrieve hostname using methods in Inet Address class. (0.2 Practical)
2. Write programs that demonstrates TCP/IP based communication between client and server.
(0.2
Practical)
3. Write an Application program /Applet to make connectivity with database using JDBC API
(0.2
Practical)
4. Write a program to design a form using basic swing components. (0.2 Practical)
5. Write a program to demonstrate the use of scroll panes in Swing. (0.1 Practical)
6. Write Java Program to map Directory tree. (0.1 Practical)
UNIT-III (Servlets, jsp) (3-1-0)
Theory (3 Credits)
Servlets: The Life Cycle of a Servlet, The Java Servlet Development Kit, The Simple Servlet, The Servlet API,
The javax.servlet Package, Reading Servlet Parameters, Reading Initialization Parameters, The
javax.servlet.http package, Handling HTTP Requests and responses.

1. Write a Java program to demonstrate the use of Tables. (0.2 Practical)
2. Write a servlet for demonstrating the generic servlet class. (0.2 Practical)
3. Write a servlet to demonstrate the Http Servlet class using do Get ().(0.2 Practical) (0.1 Practice)
4. Write a servlet to demonstrate the Http Servlet class using do Post ().(0.2 Practical) (0.1 Practice)
1. Deitel and Deitel, Java, How to Program, Pearson Education Asia.
2. C. Thomas Wu, An Introduction to OOP with Java, Mc Graw Hill.
Reference Books:
1. Cay S. Horstmann and Gary Comell, Core Java, Pearson Education Asia.
Sub: Data Ware Housing and Data Mining
UNIT I (Basics of Data Warehouse) (4-0-0)
Theory (4 Credits)
Fundamentals of data mining, Data Mining Functionalities, Classification of Data Mining systems, Major
issues in Data Mining, Data Warehouse and OLAP Technology for Data Mining, Data Warehouse,
Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse Implementation, Further
Development of Data Cube Technology From Data Warehousing to Data Mining.
UNIT II (DATA PREPROCESSING, LANGUAGE,ARCHITECTURES,KDD) (4-0-0)
Theory (4 Credits)
Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation, Data Reduction,
Discretization and Concept Hierarchy Generation, Online Data Storage. Data Mining Primitives, Data Mining
Query Languages, Designing Graphical User Interfaces Based on a Data Mining Query Language Architectures
of Data Mining Systems. Concepts Description: Characterization and Comparison: 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 III (CLASSIFICATION & CLUSTERING) (4-0-0)
Theory (4 Credits)
Mining Association Rules in Large Databases: Association Rule Mining, Mining Single-Dimensional Boolean
Association Rules from Transactional Databases, Mining Multilevel Association Rules from Transaction
Databases, Mining Multidimensional Association Rules from Relational Databases and Data Warehouses,
From Association Mining to Correlation Analysis. Classification and Prediction: Issues Regarding
Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification, Classification
by Back propagation, Classification Based on Concepts from Association Rule Mining. Cluster Analysis
Introduction: Types of Data in Cluster Analysis, Partitioning Methods, Density-Based Methods, Grid-Based
Methods,
1. Jiawei Han and Micheline Kamber, "Data Mining : Concepts and Techniques", Harcourt India Private
Limited, First Indian Reprint,2001
2. Margaret H. Dunham, "Data Mining : Introductory and Advanced Topics", Pearson Education, First
Indian Reprint,2003
Reference Books:
1. Data Mining – Concepts and Techniques - JIAWEI HAN & MICHELINE KAMBER Harcourt India.
2. Data Mining: Introductory and Advanced Topics- Margaret H.Dunham, S.Sridhar
3. Data Warehousing in the Real World,- Sam Anahory, Dennis Murry, Pearson Education.
4. The Data Ware House Toolkit – Ralph Kimball

Sub: Cognitive Psychology
UNIT I (history of the cognitive approach) (4-0-0)
Theory (4 Credits)
A Brief history of the cognitive approach, cognitive science, Neuro science, Artificial intelligence, The Parallel
processing approach. Perceptual Process: Perception, pattern recognition, theories of pattern recognition,
Bottom-up vs Top-down Processing, Template matching, feature analysis, prototype matching, pattern
recognition: The role of the perceives.
UNIT II (Communication and Language Processing) (4-0-0)
Theory (4 Credits)
Communication and Language Processing: Linguistic Hierarchy, Chomsky’s theory of grammer, Psycho-
linguistic aspects, Abstraction of linguistic ideas, knowledge and comprehension, non-verbal abstraction –
musical syntax, The language of motion. Memory Modules: Memory, process, storage, Short term memory,
long term memory, organization in memory, simulation modules of learning and memory, mnemonics,
syntactic and semantic issues, Concept formation, problem solving.
UNIT III (Contribution of cognitive psychology) (2-0-0)
Theory (4 Credits)
Contribution of cognitive psychology to advances in Artificial Intelligence, computer based learning/teaching
systems, knowledge acquisition and knowledge based systems, expert systems.
1. Marc de May, “The cognitive Paradigm”, Reidel, 1982
Reference Books:
1. R. C. Shank, P. Childers, “Cognitive computer on language, Learning and AI”, 1984
2. P.C. Kendall, “Advances in Cognition behavioural research and therapy”, Academic Press, 1984.
3. Solso, R.L. “Cognitive Psychology (3rd
Edition), 1991, Allyn & Balon.
4. Matlin M.W., “Cognition (3rd
Edition), 1995, Harcourt Brace (Prism Indian Edition).
5. Leahey T.H. & Harris R.J., “Learning and Cognition (4th
Edition), 1997, PHI.

Sub:Women Rights and Law
Credits-2
Objective: The paper aims at creating awareness as to importance and role of women in society through the
medium of law. It also focuses on women welfare laws.
Unit – I: Meaning of law ,Constitutional Safeguards for Women, Right to Equality (Art-14),Life & Personal
Liberty, Right to Education (Art-21,21-A), Right against Sexual Exploitation (Art-23,24), Constitutional Remedies
(Writs- Art-32-35), Participation in Panchayat and Municipalities, Marriage : Conditions,Ceremonies,Registration,
Restitution of Conjugal Rights, Judicial Separation, Void & Voidable Marriages, Legitimacy of Children of Void &
Voidable Marriages, Punishment of Bigamy, Divorce Common Grounds for Divorce, No Petition for divorce within
1year of marriage, Divorced Person when may marry again,Maintenance: Wife, widowed daughter-in-law, Children,
Amount of Maintenance , Interim Maintenance, Maintenance Provisions under Cr.PC, Adoption: Requisites of a
valid adoption,Capacity of a male Hindu to take in adoption, Capacity of a female Hindu to take in adoption, Persons
capable of giving in adoption, Persons who may be adopted, Effects of Adoption,.
(1 Credit)
Unit – II: Indian Penal Code, 1860 Right of Private Defence, Dowry Death, Abetment of Suicide, Cruelty by
Husband or Relatives of Husband, Sex Selection & Causing Miscarriage, Hurt & Grievous Hurt, Wrongful Restraint
& Confinement, Outraging the modesty of a woman, Kidnapping and Abduction, Offences regarding Prostitution,
Rape, Bigamy, Adultery, Domestic Violence, Sex Determination Test -The Medical Termination of Pregnancy Act,
1971, The Pre-Conception and Pre-Natal Diagnostic Techniques Act, 1994, Reproductive Technologies: Meaning,
Concept & Challenges of A.I, IVF & Surrogacy, Right of HIV/ AIDS Victims, Introduction to Consumer Protection
Act , Tenancy Act, Right to Information Act, Motor Vehicles Act, Intellectual Property Rights, Act & Rules
Maternity Benefits Act 1961.
(1 Credit)
Recommended Books:
3. Law relating to Women – S.R.Myneni
4. Law relating to Women – Dr. S.C. Tripathi
Suggested Readings:
4. Women and Law – Prof. Nomita Aggarwal
5. Women and Law – Dr. Manjula Batra
6. Women and Law – G.P. Reddy

VIII- SEMESTER
Sub : Database Management System
UNIT I (Introduction to Data Base Systems) (3-1-0)
Theory (3 Credits)
Introduction: Database & Database Users. Characteristics of the Database, Approach advantages of using
DBMS. Data Models, Schemas & Instances. DBMS Architecture & Data Independence. System Architecture for
DBMS and Data Dictionary, Database Users Data Base languages & Interfaces. Data Modeling using the Entity-
Relationship Model -Entity types, Entity Sets, Attributes and Keys, Relationship, Relationship Types, Week
Entity Types, Structural Constraints, Enhanced ER Model- Specialization Generalization.
1. Exercise based on Database creation & related queries. (0.2 Practical)
2. Alteration of an existing database (0.2 Practical)
3. Deletion of existing tables from a particular database. (0.1 Practical)
4. Implementation of query language with insertion, Selection & Updating of database tables
(0.2 Practical) (0.1 Practice)
UNIT II (Relational Model and Normalization) (3-1-0)
Theory (3 Credits)
Relational Data Model Concepts and Constraints. Relational Algebra - select, project, set theoretic, join
operations. Overview of Relational Calculas. SQL – A Relational Database Language. Data Definition
commands, View and Queries, transaction commands, Specifying Constraints & Indexes in SQL. Relational
Data Base Design: Function Dependencies & Normalization for Relational Databases. Informal design
guidelines for relation schemas, Functional Dependencies. Normal forms based on primary keys (INF, 2NF,
3NF& BCNF). Lossless join & Dependency preserving decomposition. Multi-valued dependencies, join
dependencies (4NF & 5NF), Denormalization.
1. Execution of several query statements that includes following operations:
a) Deletion of a record Basic data retrieval (0.2 Practical) (0.1 Practice)
2. Execution of several query statements that includes Condition specification
(0.2 Practical) (0.1
Practice)
3. Execution of several query statements that includes following operations: (0.2Practical)
Arithmetic Operators
Aggregate Operators
4. Retrieval of records through multiple tables (0.2 Practical)
UNIT III (Concurrency Control, Transaction and Security) (3-1-0)
Theory (3 Credits)

Mca 5 yr 2013

Recomendados

Mais conteúdo relacionado

Mais procurados

Mais procurados (18)

Destaque

Destaque (6)

Semelhante a Mca 5 yr 2013

Semelhante a Mca 5 yr 2013 (20)

Mais de Namrata Mehta

Mais de Namrata Mehta (7)

Último

Último (20)

Mca 5 yr 2013