2 CA-1205 Design and Analysis of Algorithms 3-1-0 4
3 CA-1207 Linux and Shell Programming 3-0-0 3
4 CA-1208 Applied Numerical Techniques 3-0-0 3
5 CA-1209 IT Management 3-0-0 3
6 CA-1211 Rapid Application Development 3-1-0 4
PRACTICAL / DRAWING / DESIGN
SI. No.
Course No.
Course Name Periods
Cr L-T-P
CA-1253 Internet and Web Development Lab 0-0-2 1
1 CA-1257 Linux and Shell Programming Lab 0-0-2 1
2 CA-1261 Rapid Application Development Lab 0-0-2 1
4 PD-293 Intra and Inter Personal Skills 0-0-2 1
5 PD-291 Co-Curricular Activities 1*
TOTAL CONTACT HOURS TOTAL CREDITS
18-4-8(30) 25+1*
5
SCHEME OF STUDIES BCA, Degree Programme
3rd
Year
Semester-V
THEORY
SI. No.
Course No
Course Name Periods
Cr L-T-P
1 CA-1302 Software Engineering Principles 3-1-0 4
2 Elective – I 3-0-0 3
3 CA-1303 Programming Using C# 3-1-0 4
4 CA-1304 Artificial Intelligence 3-1-0 4
5 CA-1305 Introduction to E-commerce 3-0-0 3
PRACTICAL / DRAWING / DESIGN
SI. No.
Course No.
Course Name Periods
Cr L-T-P
2 CA-1353 Programming Using C# Lab 0-0-2 1
CA-1354 Artificial Intelligence Lab 0-0-2 1
3 CA-1381 Minor project -1 0-0-08 4
3 PD-392 Problem Solving Skills 0-0-2 1
4 PD-391 Co-Curricular Activities 1*
TOTAL CONTACT HOURS TOTAL CREDITS
15-3-14(32) 25+1*
6
SCHEME OF STUDIES BCA Degree Programme
3rd
Year ( who opt to leave with BCA degree)
Semester-VI ( for BCA degree)
THEORY
SI. No.
Course No
Course Name Periods
Cr L-T-P
1 Elective – 2 3-0-0 3
2 CA-1306 Software Project Management 3-1-0 4
3 CA-1382
Project Training (Major Project)** 0-0-30 15
4 PD-391 Co-Curricular Activities 1*
TOTAL CONTACT HOURS TOTAL CREDITS
6-1-30(37) 22+1*
7
BCA SYLLABUS-1ST YEAR
CA-1101 Computer programming using C L T P Cr
3 1 0 4
OBJECTIVE
To introduce the students the basic of C and Logic behind the implementation of different features of C like different data types , function, array, control statements, pointers, structures, file processing and recursion
1. BASICS OF PROGRAMMING & OVERVIEW OF C PROGRAMMING:
programming fundamentals – problem definition, algorithms, flow charts and their symbols, Type of programming languages, Translators, Introduction to C, Structure of C program, C character Set, Identifiers and keywords, data types, constants, variables and arrays, Declarations, expressions, statements, Symbolic constants, type conversion, Types of operators, Arithmetic, relational, logical, bitwise, unary, assignment and conditional operators and their hierarchy & associativity, Input and output functions in C, some simple C programs, header files, common programming errors.
2. CONTROL STATEMENTS: Sequencing, Selection: conditions; the if
statement; if statements with compound statements; nested if statements and
multiple-alternative decisions; the switch statement. Loop Control Statements – For loop, while loop, Do-while loop and nested loops, break statement, The continue statement, The goto statement, The comma operator
3. TOP-DOWN DESIGN WITH FUNCTION: Building programs from existing
information; library functions; top-down design and structure charts; Defining a
function, accessing a function, function prototypes, passing arguments to a
function, Call by value and reference, Types of Storage Classes: Scope of variables – Global ,auto and Static Variables , Recursion,
8
4. ARRAYS & STRING HANDLING: declaring, referencing and initializing
arrays; array subscripts; using for loops for sequential access; using array elements as function arguments; array arguments; searching and sorting an array; multidimensional arrays; string basics; string library functions; assignment and substrings; longer strings; concatenation and whole line input; string comparison;; character operations; string to number and number to string conversions.
5. Pointers Basics- Fundamentals, Pointer declarations, Passing pointers to
the functions, pointers and one dimensional array, dynamic
memory allocation, Operations on pointers, arrays of pointers. Function
returning a Pointer, A pointer to a Function, , pointers to pointers, pointers and strings, Void pointers. arguments to function main
6. STRUCTURE ,UNION AND PREPROCESSING: – Declaration and
Initialization of structure, structure within structure, Array of structure, Passing to a function, Pointer to structure, Union ,Union of structure, Enumerated Data Type , typedef, Bitwise operators, Bit‐ fields in Structures , Pre-processor
directives, conditional compilation;; defining macros with parameters
7. FILE PROCESSING: Introduction, Streams and File types, Opening and
closing a data file, Input / Output operation on files, Text mode Versus Binary Mode, Formatted Input and output operation with files, Structures read and write in files, Random access to Files, Error detection during File operations, other useful file handling operations.
TEXT BOOK
1. Yashwant P. Kanetkar “Let Us C” 5th edition BPB Publication
REFERENCE BOOKS
1. Dennis, M. Ritchie and Brian, W. Kernigham, “The C Programming Language,
Prentice Hall of India, 2nd Edition, 1988 2. Schildt, Herbert “The Complete Reference C”, 4th Edition, Tata McGraw Hill,
2004 3. Hanly Jeri R, & E. B. Koffman , “Problem Solving and Program Design in C”,
Pearson Publication, 5th Edition, 2008.
9
4. Byron, C. Gottfried, “Theory and Problem of Programming with C”, Tata McGraw Hill
5. E.Balagurusamy “C – programming” Tata McGray Hill
CA-1103 DATABASE MANAGEMENT SYSTEM L-T-P Cr
3-0-0 3
OBJECTIVE
To provide knowledge about various organizations and management information systems, keeping in view the aspects of shareability, availability, evolvability and integrity. 1. INTRODUCTION: Purpose of database system; characteristics of database
approach; advantages of using DBMS; database concept and architecture; data abstraction, data models; instances and schema; data independence; schema architecture; database languages; database manager; database administrator; database users.
2. DATA MODELING: Entity sets attributes and keys; relationships (ER);
database modelling using entity; type role and structural constraints; weak and strong entity types; entity-relationship diagram; design of an E-R database schema;
3. DATA MODELS AND RELATIONAL ALGEBRA: Introduction to Hierarchical model and Network model. Relational model -basic concepts; Enforcing Data Integrity Constraints; Relational-Algebra Operations; Introduction on views; Codd's Rules.
relational database design; relation schema; anomalies in a database; functional dependencies; 1NF, 2NF, 3NF and BCNF. ; Reduction of an E-R schema to Tables
5. QUERY LANGUAGES: Introduction to SQL; basic queries in SQL; advanced
queries in SQL; functions in SQL; basic data retrieval; updates in SQLs, views in SQL.
6. FILE ORGANIZATION: indexing and hashing; overview of file organization
techniques; secondary storage devices; operations in files; heap files and sorted files; ; Indexing and Hashing- Basic concepts; Static Hashing; Dynamic
Hashing; ordered indices; single level ordered index; multi-level index.
of transactions; implementation of atomicity and durability; schedules and recoverability; serializability of schedules; concurrency control. Deadlock handling - detection and resolution.
10
8.
TEXT BOOK
1. Silberschatz A., Korth H. F. and Sudarshan S., “Database System Concepts”, 3rd edition, McGraw-Hill, International Edition, 1997
REFERENCE BOOKS
1. Date C. J., “An Introduction to Database Systems”, 7th edition, Addison-Wesley, Low Priced Edition, 2000
3. Elmasri R. and Navathe S. B., “Fundamentals of Database Systems”, 3rd edition, Addison-Wesley, Low Priced Edition, 2000
11
MA-1104 MATHEMATICS- I L-T-P Cr
3-1-0 4
OBJECTIVE To lay mathematical foundation for the fundamentals of various computational structures such as algebra and Calculus. 1. DETERMINANTS: Definition; Minors; Cofactors; Properties of Determinants. 2. MATRICES: Definition; Types of Matrices; Addition; Subtraction; Scalar
Multiplication and Multiplication of Matrices; Adjoint; Inverse; Cramers Rule; Rank of Matrix Dependence of Vectors; Eigen Vectors of a Matrix; Caley-Hamilton Theorem (without proof).
3. LIMITS & CONTINUITY: Limit at a Point; Properties of Limit; Computation of Limits of Various Types of Functions; Continuity at a Point; Continuity Over an Interval; Intermediate Value Theorem; Type of Discontinuities.
4. DIFFERENTIATION: Derivative; Derivatives of Sum; Differences; Product & Quotients; Chain Rule; Derivatives of Composite Functions; Logarithmic Differentiation; Rolle’s Theorem; Mean Value Theorem.
5. EXPANSION OF FUNCTIONS: Maclaurin’s & Taylor’s; Indeterminate Forms; L’ Hospitals Rule; Maxima & Minima; Asymptote; Singular Points; Curve Tracing; Successive Differentiation.
6. INTEGRATION: Integral as Limit of Sum; Fundamental Theorem of Calculus; Indefinite Integrals; Methods of Integration Substitution; By Parts; Partial Fractions; Integration of Algebraic and Transcedental Functions.
7. VECTOR ALGEBRA: Definition of a vector in 2 and 3 Dimensions; Double and Triple Scalar and Vector Product and their Applications.
TEXT BOOK Kresyig E, “Advanced Engineering Mathematics”, 5th Edition, John Wiley & Sons, 1999. REFERENCE BOOKS 1. B.S. Grewal, “Elementary Engineering Mathematics”, 34th Ed., 1998. 2. H.K. Dass, “Advanced Engineering Mathematics”, S. Chand & Company, 9th
OBJECTIVE To make students understand the concepts related to language development communication skills. 1. FEATURES OF INDIAN ENGLISH: Correction of sentences- structures-
Tenses- ambiguity- idiomatic distortions. 2. INFORMAL CONVERSATION Vs FORMAL EXPRESSION: Verbal and non-
verbal communication; barriers to effective communication- kinesics. 3. TYPES OF COMMUNICATION: Oral, Writing and Reading- Word- Power-
Vocabulary- Jargon- rate of speech; pitch; tone- Clarity of voice. 4. TECHNICAL PRESENTATION: Types of presentation- video conferencing-
participation in meetings- chairing sessions. 5. FORMAL AND INFORMAL INTERVIEWS: Ambiance and polemics-
interviewing in different settings and for different purposes e.g. eliciting and giving information; recruiting; performance appraisal.
6. WRITTEN COMMUNICATION: Differences between spoken and written communication- features of effective writing such “as clarity; brevity; appropriate tone clarity; balance etc.
7. LETTER-WRITING: Business forma culture-style-effectiveness; promptness- Analysis of sample letters collected from industry- email; fax.
TEXT BOOK Pal Rajendra, Korlaha, Hi, J,S., “Essentials of Business Communication”, Sultan Chand & Sons REFERENCE BOOKS 1. Rutherford, Andrea, J., “Basic Communication Skills for Technology”, Pearson
New Delhi. 3. Madhukar, R., K, “Business Communication”, Vikas Publishing House Pvt.
Ltd.
13
PH-1104 BASICS OF PHYSICS L-T-P Cr
3-0-0 3
OBJECTIVE Providing a sound conceptual understanding of the fundamental concepts of physics like work, energy & power. 1. LAW OF MOTION: Force and Inertia; The law of inertia or Newton’s first law of
motion; Newton’s Second law of Motion; Newton’s third law of Motion Equilibrium of concurrent forces.
2. WORK, ENERGY & POWER: Work; Kinetic Energy; Potential Energy; Power; Collisions; Different Forms of Energy; conservation of Energy .
3. ELECTRICITY: Electric Forces; charges & Fields: Frictional electricity; properties of electric charge; conductors and insulators; coulomb’s law; electric field; lines of force.
4. ELECTROSTATICS: Gauss’s theorem; applications ; electrostatic potential; potential energy; electrostatics of conductors; capacitors and capacitance; effect of dielectrics in capacitors.
5. CURRENT ELECTRICITY: Current; voltage; resistance; ohm’s law and resistivity of materials; electrical circuits & Kirchhoff’s rule; measurement of voltages; currents and resistance.
6. THERMAL AND CHEMICAL EFFECTS OF CURRENT: Heating effects; Thermo Electricity; Chemical effects; Magnetic effects of currents; Oersted’s discovery; Magnetic field due to current forces on current and the lorentz force. Ampere’s circulate law; Solenoid.
7. ELECTROMAGNETIC INDUCTION: Faraday’s experiments; Faradays Law; Lenz’s Law and conservation of energy; discussion of Faraday’s Law; Electromagnetic induction and Lorentz force; Semiconductors and their property.
TEXT BOOK Gupta, S., K., “Modern ABC of Physics”, Vol. I & II, Modern Publishers, 2002. REFERENCE BOOKS
1. Pradeep, “Fundamental Physics”, Class XI, XII, 2000. 2. Kumar Mittal, “Physics, Part – I”, Published by Nageen Publications, Meerut. 3. Kumar Mittal, “Physics, Part - II”, Published, By Nageen Publications, Meerut.
14
BA-247 ACCOUNTING AND FINANCIAL
MANAGEMENT
L-T-P Cr
3-1-0 4
OBJECTIVE
To equip students with computer based accounting and other financial skills. 1. ACCOUNTING: Principles; concepts; conventions; double entry system of
accounting; introduction of basic books of accounts ledgers. 2. PREPARATION OF TRIAL BALANCE: Final accounts- company final
accounts. 3. FINANCIAL MANAGEMENT: Meaning and scope; role; objectives of time
value of money- over vitalization- under capitalization- profit maximization- EPS maximization.
4. RATIO ANALYSIS: Advantages; limitations; fund flow analysis- meaning;
importance; preparation and interpretation of funds flow and cash flow statements- statement of changes in working capital.
5. COSTING: Nature and importance and basic principles; absorption costing vs.
marginal costing- financial accounting vs. cost accounting vs. management accounting.
6. MARGINAL COSTING AND BREAK- EVEN ANALYSIS: Nature; scope and
importance- practical applications of marginal costing; limitations and importance of cost- volume; profit analysis.
7. STANDARD COSTING AND BUDGETING: Nature; scope; computation and
Maheshwari S. N., “Financial Accounting”, Sultan Chand & Company. REFERENCE BOOK
Van Horne, James, “Financial Management and Policy”, 12th Ed, Pearson Education
15
CA-1102 DATA STRUCTURES USING C L-T-P Cr
3-0-0 3
OBJECTIVE To relay the theoretical and practical fundamental knowledge of most commonly used Data Structures. PRE-REQUISITES Knowledge of basic computer programming 1. INTRODUCTION TO DATA STRUCTURES: Definition of data
structures and abstract data types; linear vs. non-linear data types; primitive vs. non-primitive data types; Static and Dynamic implementations; Arrays; 2; 3 and multi-dimensional arrays.
2. RUNNING TIME: Time Complexity; Big – Oh - notation; Running
Times; Best Case; Worst Case; Average Case; Introduction to Recursion; Divide and Conquer Algorithm; Evaluating time Complexity.
3. STACKS AND QUEUES: The Stacks: Definition; Array based
implementation of stacks; Examples: Infix; postfix; prefix representation; Conversions; definition of Queues; Array based implementation of Queues. Circular queue, De-queue, Priority Queues
4. LINKED LISTS: Lists; Definition of Linked List, Types of Linked list,
Operations on Linked list, Garbage collection; Circular Linked list; Two Way Linked list; circular Two Way Linked list. Linked List based implementation of stacks; Linked List implementation of Queues.
5. TREES: Definition of trees and Binary trees; Properties of Binary trees
and Implementation; Binary Traversal pre-order; post order; In- order traversal; Binary Search Trees.
16
6. GRAPHS: Definition of Undirected and Directed Graphs and Networks; The Array based implementation of graphs; Adjacency matrix; path matrix implementation; The Linked List representation of graphs; Graph Traversal – Breadth first Traversal; Depth first Traversal.
7. SORTING AND SEARCHING ALGORITHMS: Introduction; Sorting by
Aho, A.V, Hopcroft, J. E., Ullman, T. D., “Data Structures and Algorithms”, Original Edition, Addison-Wesley, Low Priced Edition, 1999 REFERENCE BOOKS
1. A. M. Tenenbaum, Langsam, Moshe J. Augentem, “Data Structures using C”, Prentice Hall of India
2. Ellis, Horowitz, Sartaj Sahni, “Fundamentals of Data Structures”, Addison-Wesley Pub, 1983
3. Mark Allen Weiss, “Data Structures and Algorithms Analysis in C”, Pearson Education, 2000
17
CA-1104 OBJECT ORIENTED PROGRAMMING
USING C++
L-T-P Cr
3-1-0 4
OBJECTIVE
Providing a sound conceptual understanding of the fundamental concepts of computing hardware, software, networking and services; build programming logic and thereby developing skills in problem solving using C++ programming language; Introduce the concept of object orientation and on how to handle data in different forms; Emphasize the concepts and constructs rather than on language features. 1. INTRODUCTION TO C++: C++ standard library; basics of a typical C++
environment; pre-processors directives; illustrative simple C++ programs; header files and namespaces; library files.
2. OBJECT ORIENTED CONCEPTS: Introduction to objects and object oriented
programming; encapsulation (information hiding); access modifiers: controlling access to a class; method; or variable (public; protected; private; package); other modifiers; Polymorphism: overloading; inheritance; overriding methods; abstract classes; reusability; class behaviors.
3. CLASSES AND DATA ABSTRACTION: Introduction; structure definitions;
accessing members of structures; class scope and accessing class members; separating interface from implementation; controlling access function and utility functions; initializing class objects: constructors; using default arguments with constructors; using destructors; classes : const(constant) object and const member functions; object as member of classes; friend function and friend classes; using this pointer; dynamic memory allocation with new and delete; static class members; container classes and integrators; function overloading.
4. OPERATOR OVERLOADING: Introduction; fundamentals of operator
overloading; restrictions on operators overloading; operator functions as class members vs. as friend functions; overloading; <<; >> overloading unary operators; overloading binary operators.
5. INHERITANCE; VIRTUAL FUNCTIONS AND POLYMORPHISM: Introduction;
inheritance: base classes and derived classes; protected members; casting base-class pointers to derived-class pointers; using member functions; overriding base–class members in a derived class; public; protected and private inheritance; using constructors and destructors in derived classes.
18
6. FILES AND I/O STREAMS: Files and streams; creating a sequential access
file; reading data from a sequential access file; updating sequential access files; random access files; creating a random access file; writing data randomly to a random access file; reading data sequentially from a random access file;.
7. TEMPLATES & EXCEPTION HANDLING: Function templates; overloading
template functions; class template; templates and inheritance; templates and friends; templates and static members; basics of C++ exception handling: try; throw; catch; throwing an exception; catching an exception.
TEXT BOOK
Balagurusamy, E., “Object Oriented Programming with C++”, Prentice Hall of India, 2008. REFERENCE BOOKS
1. Kamthane, “Object Oriented Programming with ANSI and Turbo C++”, Pearson Education
2. Lafore, Robert, “Object Oriented Programming in Turbo C++”, The WAITE Group Press, 1994
3. Schildt, Herbert “C++: The Complete Reference”, Tata McGraw Hill, 3rd Ed, 2008
4. Bhave, “Object Oriented Programming with C++”, Pearson Education.
19
CA-1106 DISCRETE STRUCTURES L T P Cr 3 0 0 3
OBJECTIVE To lay mathematical foundation for the fundamentals of various computational structures such as Boolean algebra, propositional logic, graph and trees. PRE-REQUISITES Knowledge of Data Structure 1. SET THEORY: Introduction to set theory; set operations; algebra of sets: duality,
finite and infinite sets, classes of sets, power sets, multi sets, Cartesian product, representation of relations, types of relation, equivalence relations and partitions, partial ordering relations and lattices; function and its types, composition of function and relations; cardinality and inverse relations
2. PROPOSITIONAL CALCULUS: Basic operations: AND (Λ), OR (V), NOT (~), truth value of a compound statement, propositions, tautologies, contradictions.
3. TECHNIQUES OF COUNTING: Permutations with and without repetition, combination.
4. RECURSION AND RECURRENCE RELATION: Polynomials and their evaluation; sequences, introduction to AP, GP and AG series, partial fractions; linear recurrence relation with constant coefficients; homogeneous solutions, particular solutions, total solution of a recurrence relation using generating functions.
5. ALGEBRIC STRUCTURES: Definition and examples of a monoid, semigroup, groups and rings; homomorphism, isomorphism and automorphism; subgroups and normal subgroups; cyclic groups, integral domain and fields; co-sets; Lagrange’s theorem
6. GRAPHS: Introduction to graphs, directed and undirected graphs; homomorphic and isomorphic graphs; subgraphs; cut points and bridges; multigraph and weighted graph; paths and circuits, shortest path in weighted graphs; Eulerian path and circuits, Hamilton paths and circuits; planar graphs; Euler’s formula.
7. TREES: Trees, spanning trees, binary trees and its traversals
TEXT BOOK 1. Liu C. L., “Elements of Discrete Mathematics”, McGraw Hill, 1989 REFERENCE BOOKS 2. Johnson Bough R., “Discrete Mathematics”, 5th Edition, Pearson Education, 2001
20
3. Graham Ronald, Knuth Donald E. and Patashik Oren, “Concrete Mathematics: A Foundation for Computer Science”, Addison-Wesley, 1989
6. COUNTERS: Ripple counter; Synchronous Counter; Modulo Counters; Ring Counter; Twisted Ring Counter.
7. MEMORY DEVICES: RAM; ROM; PAL & PLA. TEXT BOOK Mano, Moris, “Digital Logic and Computer Design”, Prentice Hall of India Publications, 2002 REFERENCE BOOKS 1. Jain, R. P., “Modern Digital Electronics”, Tata McGraw Hill, 3rd Edition, 2003. 2. Salivahanan, S., & Arivyhgan, S., “Digital circuits and design”, Vikas
Publication, 2001. 3. Malvino, Leach, "Digital Principles and Application", Tata McGraw Hill, 1999.
21
MA-1105 MATHEMATICS- II L-T-P Cr
3-1-0 4
OBJECTIVE To make students understand the concepts related to Set theory, relations, functions & 2D, 3D Coordinate Geometry. 1. SETS: Sets; Subsets; Equal Sets Universal Sets; Finite and Infinite Sets;
Operation on Sets; Union; Intersection and Complements of Sets; Cartesian product; Cardinality of Set; Simple Applications.
2. RELATIONS AND FUNCTIONS: Properties of Relations; Equivalence Relation; Partial Order Relation Function: Domain and Range; Onto; Into and One to One Functions; Composite and Inverse Functions; Introduction of Trigonometric; Logarithmic and Exponential Functions.
3. PARTIAL ORDER RELATIONS AND LATTICES: Partial Order Sets; Representation of POSETS using Hasse diagram; Chains; Maximal and Minimal Point; Glb; Lub.
4. FUNCTIONS OF SEVERAL VARIABLES: Partial Differentiation; Change of Variables; Chain Rule; Extrema of Functions of 2 Variables; Euler’s Theorem.
5. REVIEW OF 2D COORDINATE GEOMETRY: Equations of Straight Lines; Circle; Ellipse; Parabola; Hyperbola.
6. 3D COORDINATE GEOMETRY: Coordinates in Space; Direction Cosines; Angle Between Two Lines; Projection of Join of Two Points on a Plane; Equations of Plane; Straight Lines; Conditions for a line to lie on a plane; Conditions for Two Lines to be Coplanar; Shortest Distance Between Two Lines; Equations of Sphere; Tangent plane at a point on the sphere.
7. MULTIPLE INTEGRATION: Double Integral in Cartesian and Polar Coordinates to find Area; Change of Order of Integration; Triple Integral to Find Volume of Simple Shapes in Cartesian Coordinates.
TEXT BOOK
Kolman, Busby and Ross, “Discrete Mathematical Structure”, Prentice Hall of India, 1996. REFERENCE BOOKS
2. Sarkar, S.K., “Discrete Maths”, S. Chand & Co., 2000
CE-101 ENVIRONMENTAL SCIENCE AND ECOLOGY L T P Cr
2 0 0 2
OBJECTIVE
Environmental Studies is a multidisciplinary area, the issues of which every one should know. The aim of the course is to make everyone aware of environmental issues like continuing problems of pollution, loss of forest, solid waste disposal, and degradation of environment. Issues like economic productivity and national security, global warming, the depletion of ozone layer and loss of biodiversity are other serious concerns before the mankind. 1. THE MULTIDISCIPLINARY NATURE OF ENVIRONMENTAL STUDIES: Basic
definitions related to environment; Scope, vis-à-vis environmental science and environmental engineering; Causes of environmental degradation, atmospheric composition and associated spheres, habitat and climate; objective, goals and principles involved in environmental education, environmental awareness, environmental ethics, environmental organization and their involvement.
2. NATURAL RESOURCES: Renewable and non-renewable resources; forest resources, over-exploitation, and deforestation / afforestation; water resources,
impact of over-utilization of surface and ground water, floods, drought, conflicts over water, dams; mineral resources: dereliction of mines, environmental effects of extracting and using mineral resources; Food resources, modern agriculture and its impact, problem associated with fertilizer and pesticide, water logging, salinity ; energy resources, renewable, non-renewable energy sources, solar energy, wind energy, hydro energy, biomass energy, geothermal energy, nuclear energy and its associated hazards; land as a resource, land degradation, man induced landslides, soil erosion and desertification.
3. ECOSYSTEMS: Concept of an ecosystem, structure and function of an ecosystem, producers, consumers and decomposers, energy flow in the ecosystem, ecological succession, food chains, food webs and ecological
pyramids; characteristic features, structure and function of the following ecosystem -forest ecosystem, grassland ecosystem desert ecosystem and aquatic ecosystems.
4. BIODIVERSITY AND ITS CONSERVATION: Bio-geographical classification of
India; biodiversity at global, national and local levels, India as a mega-diversity nation, hot-spots of biodiversity; value of biodiversity-consumptive use,
23
productive use, social, ethical aesthetic and option values; threats to biodiversity; conservation of biodiversity: in-situ and ex-situ conservation of biodiversity.
5. ENVIRONMENTAL POLLUTION: Causes, effects and control measures of air pollution, water pollution, soil pollution, marine pollution, noise pollution, thermal pollution, solid waste management, e-waste management; disaster management – floods, earthquake, cyclone and landslides.
6. SOCIAL ISSUES AND THE ENVIRONMENT: Water conservation, rain water harvesting, watershed management; climate change, global warming, acid rain, ozone layer depletion; Environmental Protection Act, Air (Prevention and Control of Pollution) Act, Water (Prevention and Control of Pollution) Act, Wildlife Protection Act, Forest Conservation Act.
7. HUMAN POPULATION AND THE ENVIRONMENT: Population growth, population explosion – family welfare programmes; role of information technology in environment and human health; case studies, Chipko movement, Saradar Sarovar dam, mining and quarrying in Udaipur, salinity and water logging in Punjab, Haryana and Rajasthan, Bhopal gas tragedy, Chernobyl nuclear disaster, arsenic pollution in ground water.
TEXT BOOK Kaushik, Anubha, and Kaushik, C.P., “Perspectives in Environmental Studies”, New Age International Publishers, 2004 REFERENCE BOOKS 1. Agarwal, K. C., “Environmental Biology”, Nidhi Publ. Ltd., Bikaner, 2001 2. Bharucha Erach, “The Biodiversity of India”, Mapin Publishing Pvt. Ltd., 2006 3. Brunner R. C., “Hazardous Waste Incineration”, McGraw Hill Inc., 1989. 4. Clark R.S., “Marine Pollution”, Clanderson Press Oxford,1989 5. Cunningham, W.P., Cooper, T.H. Gorhani, E. & Hepworth, M.T., Environmental
Encyclopedia”, Jaico Publ. House, 2001. 6. De A. K., “Environmental Chemistry”, 2nd Edition, Wiley Eastern, 1989 7. Jadhav, H. and Bhosale, V.M., “Environmental Protection and Laws”, Himalaya
Pub. House, Delhi, 1995. 8. Mckinney, M.L. and Schocl. R.M., “Environmental Science Systems &
Solutions”, Web enhanced edition, 1996. 9. Rao M.N. and Datta, A.K., “Waste Water Treatment”, Oxford & IBH Publ. Co.,
1987. 10. Sharma B.K., “Environmental Chemistry”, Goel Publ. House, Meerut, 2001 11. Trivedi R.K. and Goel, P.K., “Introduction to Air Pollution”, Techno-Science
Publications, 1996
24
CA-1151 COMPUTER PROGRAMMING LAB L T P Cr
0 0 3 1
LIST OF EXPERIMENTS/EXERCISES
1. Basic/Simple logic building 2. Handling mathematical data 3. Use of selection control structures 4. Use of loop control structure 5. Use of function 6. Use of Array 7. Use of pointers 8. String Manipulation 9. Implementing Searching 10. Implementing simple Sorting 11. Use of Structure and Union 12. File handling
REFERENCE BOOKS 1. Dennis, M. Ritchie and Brian, W. Kernigham, “The C Programming Language”,
Prentice Hall of India, 1988. 2. Byron, C. Gottfried, “Theory and Problem of Programming with C”, Tata
McGraw Hill
25
CA-1155 PC SOFTWARE LAB L-T-P Cr
0-0-2 1
LIST OF EXPERIMENTS/EXERCISES
1. All commands specified using windows
2. Introduction to MS-Word: introduction to word processing, its
features.
3. MS Word: formatting documents, paragraph formatting, indents.
4. Page formatting, header and footer, bullets and numbering.
5. Ms-Word: tabs, tables, formatting the tables, finding and replacing
text, mail merging etc.
6. Introduction to MS-Excel, introduction to electronic spreadsheets,
ranges, formulae, functions, auto sum, copying formula
8. MS Excel: formatting data, creating charts, creating database,
sorting data, filtering etc.
9. Introduction to MS PowerPoint, PowerPoint, features of MS-
PowerPoint clipping, slide animation, slide shows, formatting etc.
10. Ms-PowerPoint presentation (10-15 slides) on (i) evolution of
computers (ii) search engines
26
CA-1152 DATA STRUCTURES USING C LAB L-T-P Cr
0-0-2 1
LIST OF EXPERIMENTS/EXERCISES
1. Write a program to search an element in an array using linear search. 2. Using iteration & recursion concepts write programs for finding the element in
the array using Binary Search Method 3. Write a program to perform following operations on matrices using functions
only a) Addition b) Subtraction c) Multiplication d) Transpose
4. Write a program for static implementation of Stack 5. Write a program for static implementation of Queue 6. Write a program to create a linked list & perform operations such as insert,
delete, update, reverse in the link list 7. Write a program to create a linked list & perform operations such as insert,
delete in the Circular link list 8. Write a program to implement binary search tree. (Insertion and Deletion in
Binary Search Tree) 9. Write a program which simulates the various tree traversal algorithms. 10. Write a program to implement bubble sort 11. Write a program to implement selection sort 12. Write a program to implement insertion sort 13. Write a program to implement quick sort 14. Write program to implement merge sort
27
CA-1153 DATABASE MANAGEMENT SYSTEM LAB L-T-P Cr
0-0-2 1
LIST OF EXPERIMENTS/EXERCISES
1. Creation of a database and carrying out record addition, deletion, modification,
generate queries and reports, and listing records in ascending order
2. Deletion of complete data from the given table, deletion based on a given condition,
updating contents of a table, modifying structure, deletion of complete table.
3. Creation of primary key, foreign key, non null and unique constraints; use of
check and default constraints; insertion of data in tables created with
constraints
4. Creating views from single and multiple tables, drop views and creating index
on the table and drop them.
5. Finding unique names of all salesmen, deletion of the structure of a table, use
of delete command with conditions, updating records of a table with conditions,
altering structure of a table and changing size of existing column in the table
6. Retrieval of data using sub-queries
7. Create the view from the table by combining relation on the basis of various types
of joins like equi-join, and retrieval of data with left outer join, right outer join.
8. Create a view from the table, from more than one table and carryout other
operations like dropping the view, inserting date into the view and creating
index on the table and drop them.
9. Transaction processing and query processing.
10. Deadlock handling
28
CA-1154 OBJECT ORIENTED PROGRAMMING
using C++ LAB
L-T-P Cr
0-0-2 1
LIST OF EXPERIMENTS/EXERCISES
1. Write a program for Basic/Simple logic building in C++
2. Write a program to implement function overloading
3. Write a program to implement the concept of class and object
4. Write a program to implement the concept of friend function
5. Write a program to implement the concept of static data member
6. Write a program using the concept of constructor & destructor
7. Write a program to Implement operator overloading
8. Write a program to Implement single inheritance
9. Write a program to Implement Multiple inheritance
10. Write a program to Implement Virtual function
11. Write a program to create, read & write sequential file
12. Write a program to create, read & write random access file
13. Write a program to implement function template
14. Write a program to implement class template
15. Write a program for exception handling
Reference book
1. Barkakati, Nabajyoti, “Object Oriented Programming in C++”, Prentice Hall of
India, 2001. 2. Schildt, Herbert, “C++: The Complete Reference”, Tata McGraw Hill, 4
th
Edition, 2003
29
PD-192 PERSONALITY DEVELOPMENT SKILLS L T P Cr
0 0 3 1
OBJECTIVE To equip the students with the understanding of human behavior, develop time management skills, and enhance personality. 1. TRANSACTIONAL ANALYSIS: Winners and losers; ego states; OK states;
positive and negative strokes; life scripts; exercises. 2. CREATIVE THINKING: What is creativity; 6 thinking hats; mental blocks;
strengths and weaknesses; exercises. 4. DEVELOPING POSITIVE ATTITUDE: Meaning; changing attitudes; power of
positive thinking; overcoming negative attitude; exercises. 5. TIME MANAGEMENT: Features, time management matrix; tips for time
management; effective scheduling; time wasters; time savers; exercises and time bound tasks.
6. STRESS MANAGEMENT: What is stress; causes; positive and negative stress; effects; signs; tips to overcome stress; stress busters; exercises
7. DECISION MAKING: Definition; models and types; skills and techniques; courses of action; steps involved in decision making; individual decision making and group decision making; exercises
REFERENCE BOOKS 1. Muriel, James and Jongeward, Dorothy, “Born to Win”, Signet Publishers, 1978 2. Harris, Thomas Anthony, “I’m OK, You’re OK”, Galahad Books, 2004 3. Dr. Alex, K., “Soft Skills”, 2009, S. Chand, 2009 4. Adams Scott , “Positive Attitude”, Andrews Mcbeel Publishing, 2004 5. Newton Tim, “Managing Stress – Emotion and Power at Work”, Sage
Publications Ltd., 1995 6. Koch Richard, “The 80/20 Principle :The Secret to Success by Achieving with
Less”, Broadway Business, 1999 7. Covey Stephen R., “The 7 Habits of Highly Effective People”, Simon &
Schuster UK, 2004 NOTE: One trainer per lecture and two trainers per practical session. Classroom with board/projector for PPT and video clips will be required.
30
PD-251 MATLAB L T P Cr
0-0-2 1
OBJECTIVE
MATLAB is a powerful language for technical computing. It is widely used in universities and colleges for courses in mathematics, science and especially in engineering. In industry the software is used in research, development and design. This course is intended for students who are using MATLAB for the first time and have little or no experience in computer programming. 1. BASIC STRUCTURE and FEATURES OF MATLAB: Command window; figure
window; editor window and help window; arithmetic operations with scalars, order of precedence; using MATLAB as a calculator; display formats; elementary math built-in functions; scalar variables, assignment operator; predefined variables; useful commands for managing variables; applications in problem solving. 2. CREATING ARRAYS – one dimensional, two dimensional; array addressing;
built-in functions for handling arrays; mathematical operations with matrices; strings and strings as variables; generation of random numbers; examples of MATLAB applications. 3. SCRIPT FILES: Creating and saving a script file, current directory; output
commands 4. TWO – DIMENSIONAL PLOTS: Plot command; line specifiers plot of a given
data; plot of a function; plotting multiple graphs in the same plot. 5. FUNCTIONS AND FUNCTION FILES: Creating a function file; input and output
arguments; function body; comment lines; saving a function files; using a function file; programming in MATLAB. TEXT BOOK
Gilat Amos, “MATLAB: An Introduction with Applications”, John Wiley & Sons, Inc (Wiley Student Edition), 2008 REFERENCE BOOK
Herniter, E. Marc, “Programming in MATLAB”, Brooks/Cole, Thomson Learning
31
PD-191 CO-CURRICULAR ACTIVITIES L T P Cr
- - - 1
OBJECTIVE To help the students in their all round growth and acquire attributes like team spirit, organizational ability, leadership qualities, etc. OPERATION The students are to take part in Co-curricular activities outside contact hours through clubs/ societies spread over all the three terms of the year. They are required to register for this course in each term and their performance will be evaluated in last term of the year.
32
BCA-MCA INTEGRATED SYLLABUS (2nd Year)
CA-1201 OPERATING SYSTEMS L T P Cr
3 1 0 4
OBJECTIVE
To provide the knowledge of internals, different types and purpose of operating systems PRE-REQUISITES
Knowledge of computer organization and architecture, programming skills 1. INTRODUCTION: functionalities and Objectives of OS, historical evolution of
operating systems, batch processing, multitasking, timesharing, Real time systems, Distributed systems, O/S service system calls, system programs.
2. PROCESS MANAGEMENT: Process States, Process Control Block,
Processor Scheduling, CPU scheduling, scheduling criteria, scheduling algorithms -First Come First Serve (FCFS), Shortest-Job-First(SJF), Priority Scheduling, Round Robin(RR), Multilevel Queue Scheduling.
To provide basic knowledge of internals of microprocessor, its architecture, components, terminologies, etc. at minute level and ultimately about the working of a digital computer hardware as a whole PRE-REQUISITES
Knowledge of data structures, microprocessors and interfacing
34
1. INTRODUCTION TO DIGITAL COMPUTER: Introduction of computer
architecture and organization, functions and block diagram of computer, store program control concept, Flynn’s classification of computers (SISD, SIMD, MISD, MIMD).
2. DATA REPRESENTATION AND BOOLEAN ALGEBRA: Binary; Octal; HEX
and their inter-conversion; 1’s and 2’s complement. Binary Arithmetic; Number Systems – BCD; EBCDIC; ASCII; De-Morgan’s Theorem; Duality Theorem; Boolean Algebra Rules; Postulates/Laws; Logic Circuits; NOT; AND; OR; NAND; NOR; XOR; XNOR.
3. SEQUENTIAL LOGIC & CIRCUITS: Flip-Flops, Clocked RS, D type, JK, T
type . Flip-flop excitation tables Designing registers – Serial Input Serial Output (SISO), Serial Input Parallel Output (SIPO), Parallel Input Serial Output (PISO), Parallel Input Parallel Output (PIPO) and shift registers. Designing counters – Asynchronous and Synchronous Binary Counters
4. INSTRUCTION SET ARCHITECTURE: Instruction codes, instruction set
formats (fixed, variable, hybrid); types of instructions, memory reference, register reference, I/O reference; addressing modes: register, immediate, direct, indirect, Indexed, RISC, CISC, and their comparison .
DDR; RDRAM. ROM; PROM; EPROM; EEPROM; Concepts of Auxiliary; Associative; Cache and Virtual Memory; DMA; DMA Transfer modes should be covered.
6. BASIC NON PIPELINED CPU ARCHITECTURE: CPU Architecture types
(accumulator, register, stack, memory/ register) detailed data path of a typical register based CPU, fetch-decode-execute cycle (typically 3 to 5 stage); micro-instruction formats, implementation of control unit: hardwired and micro-programmed, control memory, microinstruction sequencing.
7. PROCESSOR ARCHITECTURE: Clock Speed; Processing Power and Buses
of a Microprocessor; Components of Microprocessor; I/O Ports; 16-Bit (80286) Architecture; 32-Bit (80486) Architecture.
TEXT BOOKS
Carpinelli, John D, ”Computer Systems Organization & Architecture”, Addison Wesley, 2001 REFERENCE BOOKS
1. Morris, Mano, “Computer System Architecture”, Prentice Hall of India, 1999. 2. Malvino,”Digital Computer Electronics”. 4. Jotwani, “Computer system Organisation”, Tata McGraw Hill
35
5. V. Rajaraman and Radhakrishnan, “Introduction to Digital Computer Design”. 6. W. Stalling, “Computer Organization and Architecture”.
CA-1204 COMPUTER GRAPHICS L T P Cr
3 1 0 4
OBJECTIVE
Students completing this course are expected to be able to:
Write programs that utilize the OpenGL graphics environment.
Use polygonal and other modeling methods to describe scenes.
Understand and be able to apply geometric transformations.
Create basic animations.
Understand scan-line, ray-tracing, and radiosity rendering methods PRE-REQUISITES
Knowledge of computer programming 1. INTRODUCTION: What is Computer Graphics; Computer Graphics
Applications; Computer Graphics Hardware and software; Two dimensional Graphics Primitives: Points and Lines; Line drawing algorithms: DDA; Bresenham’s; Circle drawing algorithms: Bresenham’s circle drawing; mid point circle drawing algorithm; Polygon filling algorithm; boundary filled algorithm; scan-line algorithm; flood fill algorithm.
2. TWO DIMENSIONAL VIEWING: The 2-D viewing pipeline; windows;
viewports; window to view port mapping; Clipping: point; clipping line (algorithms); Sutherland-Cohen algorithm.
36
3. TWO DIMENSIONAL TRANSFORMATION: Homogeneous coordinates
4. THREE DIMENSIONAL GRAPHICS: Three dimensional graphics concept;
Matrix representation of 3-D Transformations; Composition of 3-D transformation; Viewing in 3D: Projections; types of projections.
5. HIDDEN SURFACE REMOVAL: Introduction to hidden surface removal. The
Z- buffer algorithm; scanline algorithm; area sub-division algorithm. 6. REPRESENTING CURVES AND SURFACES: Parametric representation of
curves: Bezier curves; B-Spline curves. Feature of Bezier and B-spline Curve 7. ILLUMINATION, SHADING, IMAGE MANIPULATION: Illumination models;
shading models for polygons; shadows; transparency.
TEXT BOOK
Pradeep Bhatia, “Computer Graphics”, 2nd
Edition, I K Publishers, 2009. REFERENCE BOOKS
1. James D. Foley, Andeies van Dam, Stevan K. Feiner and Johb F. Hughes, “Computer Graphics Principles and Practices”, 2nd Edition, Addision Wesley, 2000.
2. Donald Hearn and M. Pauline Baker, “Computer Graphics” , 2nd Edition, Prentice Hall of India, 1999.
3. David F. Rogers,“Procedural Elements for Computer Graphics”, Tata McGraw Hill, Second Edition, 2001.
4. N. Krishanmurthy, “Introduction to Computer Graphics”, Tata McGraw Hill, 2002.
37
CA-1206 MULTIMEDIA TECHNOLOGIES L T P Cr
3 1 0 4
OBJECTIVE
To provide basic knowledge of image compression, audio, video, sound, virtual reality, intelligent multimedia systems etc PRE-REQUISITES
Knowledge of computer graphics, programming, 3D geometry 1. BASICS OF MULTIMEDIA TECHNOLOGY: Computers; communication and
entertainment; multimedia an introduction; framework for multimedia systems; multimedia devices; CD- Audio; CD-ROM; CD-I; presentation devices and the user interface; multimedia presentation and authoring; professional development tools;
2. LAN AND MULTIMEDIA: internet; World Wide Web & multimedia distribution
network: ATM & ADSL; multimedia servers & databases; vector graphics; 3D graphics programs; animation techniques; shading; anti aliasing; morphing; video on demand.
3. IMAGE COMPRESSION & STANDARDS: Making still images; editing and
capturing images; scanning images; computer color models; color palettes; vector drawing; 3D drawing and rendering; JPEG: objectives and architecture; DCT encoding and quantization; statistical coding; predictive lossless coding; performance; overview of other image file formats as GIF; TIFF; BMP; PNG; etc.
4. AUDIO: Digital representation of sound; time domain sampled representation;
method of encoding the analog signals; sub-band coding; Fourier method; transmission of digital sound; digital audio signal processing; stereophonic and quadraphonic signal processing; editing sampled sound; MPEG Audio; audio compression and decompression; brief survey of speech recognition and generation; audio synthesis; musical instrument digital interface
5. VIDEO: digital video and image compression; MPEG motion video
compression standard; DVI technology; time base media representation and delivery.
6. VIRTUAL REALITY: Applications of multimedia; intelligent multimedia system;
desktop virtual reality; VR operating system; virtual environment displays and orientation making; visually coupled system requirements; intelligent VR software systems.
38
7. APPLICATIONS OF ENVIRONMENT IN VARIOUS FIELDS. TEXT BOOK
Villamil and Molina, “An Introduction to Multimedia”, MacMillan, 1997 REFERENCE BOOKS
1. Lozano, “Multimedia: Sound & Video”, Prentice Hall of India (Que), 1997 3. Ranjan Parekh, “Principle of Multimedia”, Tata McGraw Hill 4. Villamil and Molina, “Multimedia: Production, Planning and Delivery”, Que,
1997 5. Sinclair, “Multimedia on the PC”, BPB Publications 6. Tay Vaughan, “Multimedia: Making It Work”, Fifth edition, Tata McGraw Hill,
1994 7. James E Shuman, “Multimedia in Action”, Wadsworth Publications, 1997 8. Jeff Coate Judith, “Multimedia in Practice”, Prentice Hall of India, 1995 9. John F. Koegel, “Multimedia Systems”, Addison Wesley Ltd. 10. Halsall and Fred, “Multimedia Communications”, Addison Wesley, 2001
CA-1210 COMPUTER NETWORKS L T P Cr
3 0 0 3
OBJECTIVE
To have a fundamental understanding of the design, performance and state of the art of wireless communication systems, Topics covered include state of the art wireless standards and research and thus changes substantially form one offering of this course to the next
39
1. OSI REFERENCE MODEL AND NETWORK ARCHITECTURE: Introduction to
Computer Networks; Example networks ARPANET; Internet; Private Networks; Network Topologies: Bus-; Star-; Ring-; Hybrid-; Tree -; Complete -; Irregular –Topology.
2. TYPES OF NETWORKS: Local Area Networks; Metropolitan Area Networks;
Wide Area Networks; Layering architecture of networks; OSI model; Functions of each layer; Services and Protocols of each layer
3. TCP/IP: Introduction; History of TCP/IP; Layers of TCP/IP; Protocols; Internet
Protocol; Transmission Control Protocol; User Datagram Protocol; IP Addressing; IP address classes; Subnet Addressing; Internet Control Protocols; ARP; RARP; ICMP; Application Layer; Domain Name System; Email – SMTP; POP; IMAP; FTP; NNTP; HTTP; Overview of IP version 6.
4. LOCAL AREA NETWORKS: Introduction to LANs; Features of LANs;
Components of LANs; Usage of LANs; LAN Standards; IEEE 802 standards; Channel Access Methods; Aloha; CSMA; CSMA/CD; Token Passing; Ethernet; Layer 2 & 3 switching; Fast Ethernet and Gigabit Ethernet; Token Ring; LAN interconnecting devices: Hubs; Switches; Bridges; Routers; Gateways.
5. WIDE AREA NETWORKS: Introduction of WANs; Routing; Congestion
Control; WAN Technologies; Distributed Queue Dual Bus (DQDB); Synchronous Digital Hierarchy (SDH)/ Synchronous Optical Network (SONET); Asynchronous Transfer Mode (ATM); Frame Relay; Wireless Links.
6. INTRODUCTION TO NETWORK MANAGEMENT: Remote Monitoring
Techniques: Polling; Traps; Performance Management; Class of Service; Quality of Service; Security management; Introduction to Network Operating Systems: Client-Server infrastructure; Windows NT/2000.
7. INTRODUCTION TO SOCKET PROGRAMMING: Introduction to Socket, Socket
structure, TCP/IP Socket, Client side and Server Side Programming. TEXT BOOK
Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw Hill. REFERENCE BOOKS
1. Andrew S. Tanenbaum, “Computer Networks”, 4th Edition, Pearson Education/Prentice Hall of India, 2003.
2. William Stallings, “Data and Computer Communication”, 5th Edition, Prentice Hall of India, 1997.
3. James F. Kurose, Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, 2nd Edition, Pearson Education, 2003.
4. D. E. Comer, “Internetworking with TCP/IP”, Volume 1, 3rd Edition, Prentice Hall of India, 1995.
40
CA-1212 CORE JAVA L T P Cr
3 1 0 4
OBJECTIVE
To relay the theoretical and practical knowledge of Java programming language PRE-REQUISITES
Basic Knowledge of programming language and object oriented programming 1. INTRODUCTION TO JAVA & PRINCIPLES OF OBJECT ORIENTED
PROGRAMMING: Basic Concepts of OOP and it’s Benefits; Application of
OOP; The Creation of Java; Importance of Java for the Internet; Java’s Magic: The Byte-code; Features of Java.
2. DATA TYPE, ARRAY & STRINGS: Data types & Operators available in java;
Control Structures: if, while, do while, for, switch; Break & Continue Statement; Arrays and Strings: Arrays, Arrays of Characters; String handling Using String Class; Operations on String Handling Using; String Buffer Class.
3. OBJECT-ORIENTATION: Object-Oriented Programming in Java, Java
Program Structure. Defining of a Class, Definition of Methods, Constructors, Creating Objects of a Class, Assigning Object Reference Variables, The keyword “this”, Defining and Using a Class, Automatic Garbage Collection.
41
Extending Class and Inheritance: Using Existing Classes, Class Inheritance, Choosing Base Class, Access Attributes, Polymorphism, Multiple Levels of Inheritance, Abstraction through Abstract Classes, Using Final Modifier, the Universal Super class-Object Class.
4. PACKAGE & INTERFACES: Understanding Packages, Defining a Package,
Packaging up your Classes, Adding Classes from a Package to your Program, Understanding CLASSPATH, Standard Packages, Access Protection in Packages, Concept of Interface. Exception Handling: The Idea behind Exceptions, Types of Exceptions, Dealing with Exceptions, Exception Objects, Defining Your Own Exceptions, Checked and Unchecked Exceptions.
5. MULTITHREADING PROGRAMMING: The Java Thread Model,
Understanding Threads, The Main Thread, Creating a Thread: extending Thread and implementing Runnable, Creating Multiple Threads, Thread Priorities, Synchronization, Deadlocks inter-thread communication, Deadlocks. Input/Output in Java: I/O Basic, Byte and Character Structure, I/O Classes, Reading Console Input, Writing to Console Output, Reading and Writing on Files, Random Access Files, Storing and Retrieving Objects from File. Stream Benefits.
6. CREATING APPLETS IN JAVA: Applet basics; applets architecture; applet life
cycle; simple applet display methods; requesting repainting; using the status window; the html applet tag; passing parameters to applets.
7. JAVA DATA BASE CONNECTIVITY (JDBC): Database Connectivity- Relation
Databases; JDBC API; Reusing Database Objects; Transactions; Advance Techniques. Java Utilities (java.util Package) The Collection Framework : Collections of Objects; Collection Types; Sets Sequence Map; Understanding Hashing; Use of Array List & Vector.
TEXT BOOK
Balaguruswamy , E., ““Programming with Java”, Tata Mcgraw Hill. REFERENCE BOOKS
1. Horetmann Cay and Cornell Gary, “Core JavaTM 2, Volume II – Advanced Features”, 7th Edition, Pearson Publisher, 2004.
2. Horetmann Cay and Cornell Gary, “Core Java Volume – I”, Pearson Education. 3. Callway Dustin R., “Inside Servlets”, Pearson Education. 4. Goodwill James and Bryan Morgan, “Developing Java Servlets”, Techmedia. 5. “Java Server Programming, Volume I and II”, Wrox Press
42
CA-1203 INTERNET AND WEB DEVELOPMENT L T P Cr
3 1 0 4
OBJECTIVE
To impart knowledge about handling the latest web development tools and techniques 1. INTRODUCTION TO THE INTERNET, THE WORLD WIDE WEB: the idea of
hypertext and hyper media; how the web works: HTTP; HTML and URLs; how the browser works: MIME types; plug-ins and helper applications; the standards: HTML; XML; XHTML and the W3C; functionality of MacroMedia DreamWeaver.
2. HYPERTEXT MARKUP LANGUAGE: the anatomy of an HTML document;
marking up for structure and style: basic page markup; absolute and relative links; ordered and unordered lists; embedding images and controlling appearance; table creation and use; frames; nesting and targeting; descriptive markup.
3. SEPARATING STYLE FROM STRUCTURE WITH STYLE SHEETS: internal
style specifications within HTML; External linked style specification using CSS; page and site design considerations.
4. CLIENT SIDE PROGRAMMING: introduction to the JavaScript syntax; the
JavaScript object model; event handling; output in JavaScript; forms handling; miscellaneous topics such as cookies; hidden fields; and images; applications.
5. SERVER SIDE PROGRAMMING: introduction to server side technologies
ASP/JSP; programming languages for server side scripting; configuring the server to support ASP/JSP; applications;
6. OTHER DYNAMIC CONTENT TECHNOLOGIES: Delivering multimedia over
web pages; the VRML idea; the Java phenomenon-applets and servelets; issues and web development.
7. INTRODUCTION TO MICROSOFT .NET TECHNOLOGY AND ITS
COMPARISON WITH THE COMPETING TECHNOLOGIES.
43
TEXT BOOK
Frank Boumpery, Cassandra Greer, Dave Raggett, Jenny Raggett, Sebastian Schnitzenbaumer & Ted Wugofski, “Beginning XHTML”, WROX press (Indian Shroff Publ. SPD) 1
st edition, 2000
REFERENCE BOOKS
1. Chuck Musciano, Bill Kennedy, “HTML & XHTML: The Definitive Guide”, 4th
Edition, 2000 2. Web Technologies, Achyut S Godbole , Atul Kahate, Tata McGraw Hill, 2003 3. Scott Guelich, Shishir Gundararam, Gunther Birzniek, “CGI Programing with
Perl 2/e”, O’Reilly 4. Doug Tidwell, James Snell, Pavel Kulchenko, “Programming Web services”,
O’Reilly 5. Raj Kamal, “Internet and Web Technologies”, Tata McGraw Hill, 2002
CA-1205 DESIGN & ANALYSIS OF ALGORITHMS L T P Cr
44
3 1 0 4
OBJECTIVE
To relay the theoretical and practical aspects of design of algorithms
PRE-REQUISITES
Knowledge of fundamentals of basic computer programming for implementing algorithms. 1. MATHEMATICAL PRELIMINARIES: Role of algorithm in computing;
mathematical preliminaries; review of growth functions; solution of difference equations; analysis in terms of space and time complexity.
3. D. E. Knuth, “The Art of Computer Programming”, 2nd
Ed., Addison Wesley, 1998
45
CA-1207 UNIX & SHELL PROGRAMMING L T P Cr
3 0 0 3
OBJECTIVE
To introduce to the students the in-depths of Unix operating system structure and function, as well as to acquaint them with programming using Shell commands, and handling advanced concepts like semaphores. 1. UNIX UTILITIES: introduction to UNIX file system; vi editor; file handling utilities;
security by file permissions; process utilities; disk utilities; networking commands; cp; mv; In; rm; unlink; mkdir; rmdir; du; df; mount; umount; find; 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; gerep; egrep; fgrep; cut; paste; join; tee; pg; comm.; cmp; diff; tr; awk; tar; cpio.
2. 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
46
responsibilities; pipes and input redirection; output redirection; shell script examples.
3. UNIX FILES: UNIX file structure; directories; files and devices; system calls;
4. UNIX PROCESS AND SIGNALS: 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.
5. INTERPROCESS COMMUNICATION OVERVIEW: introduction to IPC; IPC
between processes on a single computer system; IPC between process on different systems; file and record locking; other UNIX locking techniques; pipes; FIFO; streams and messages.
6. MESSAGE QUEUES: UNIX system-V messages; UNIX kernel support for
message; UNIX APls for messages client/server example. 7. SEMAPHORES: UNIX system-V semaphores; UNIX kernel support for
semaphores; Unix APls for semaphores; Shared Memory- UNIX system-V shared
memory. TEXT BOOK
W. R. Stevens, “Unix Network Programming”, Pearson/PHI. REFERENCE BOOKS
To provide a foundation for numerical computing for scientific and engineering applications PRE-REQUISITES
Knowledge of Basic Mathematics involving differentiation, integration, differential equations, linear equations, etc. 1. ERRORS IN NUMERICAL CALCULATIONS: Introduction; Numbers and their
accuracy; Absolute; Relative and percentage errors and their analysis; Truncation errors; General formula; Error calculation for inverse problem.
2. SOLUTION OF NON-LINEAR EQUATIONS: Bisection method; Regula-Falsi
method; Secant method; Newton-Raphson method; Fixed point method; Initial approximation and convergence criteria.
3. SOLUTION OF LINEAR SYSTEMS: Gauss elimination method; Gauss-Jorden
6. SOLUTION OF DIFFERENTIAL EQUATIONS: Taylor’s series method; Euler
and modified Euler’s method; Runge-Kutta method; Milne’s prediction corrector method.
7. SOLUTION OF PARTIAL DIFFERENTIAL EQUATIONS: Finite difference
approximation; Solution of Laplace equation (standard 5 point formula) one-dimensional heat equation (Schmidt method, Cranck-Nicolson method; Dufort & Frankel method and wave equation.
48
TEXT BOOK
S S Shastry, “Introductory Methods of Numerical Analysis”, PHI, 2007 REFERENCE BOOKS
1. M K Jain, S R K Iyengar, R K Jain, “Numerical Methods for Scientific and Engineering Computation”, New Age International Publishers, 3
rd Edition, 1996
2. B S Grewal , “Numerical Methods in Engineering and Science”, Khanna Publishers, 2005
3. V. Rajaraman, “Computer Oriented Numerical Methods”
CA-1209 INFORMATION TECHNOLOGY
MANAGEMENT
L T P Cr
3 0 0 3
49
OBJECTIVE
To equip students with knowledge about handling various IT related activities such as taking decisions under varied situations, handling of resources, etc. 1. NATURE AND FUNCTIONS OF MANAGEMENT: importance of management;
definition of management; management process; roles of manager; management - a science or art; management - a profession.
2. PLANNING: nature of planning; importance of planning; types of planning –
steps on planning, meaning of decision, types of decisions 3. DECISION MAKING: meaning of decision; types of decisions; Organization:
span of management; principles of organizing; departmentalization. 4. DIRECTION: requirements of effective direction; motivation; importance of
communication; purposes of communication; formal communication; informal communication; barriers to communication; principles of effective communication.
5. LEADERSHIP: difference between a leader and a manager; characteristics of
leadership; functions of a leader; approaches to leadership; effective leadership; leadership style in Indian organizations.
6. MANAGERIAL CONTROL: steps in a control process; need for control; types
of control methods; essentials of effective control systems. 7. SOCIAL RESPONSIBILITIES OF BUSINESS: meaning of social responsibility;
social responsibilities of business towards different groups. TEXT BOOK
PC Tripathi, PN Reddy,”Principles of Management”, 2nd
Edition, Tata McGraw-Hill.
50
CA-1211 RAPID APPLICATION DEVELOPMENT L T P Cr
3 1 0 4
The course on RAD focuses on building applications within a very short time period. After successful completion of this course the students will be able to obtain a firm foundation on RAD concepts and methodologies and acquire sufficient working knowledge in RAD tools. PRE-REQUISITES
Knowledge of programming in C, C++, JAVA
1. Rapid Application Development: Introduction to RAD Definition, history; importance strategy; constraints; advantages and disadvantages; customer oriented development;
2. Different RAD tools: Introduction of different RAD tools; open source versus licensed software builder; Easy Eclipse, Visual studio .net and its. Major components: Various applications build using visual studio; familiarity with IDE visual studio.
51
3. .NET Overview: Building blocks of .NET framework, Architecture; .NET programming languages; MSIL, Metadata, Common Language Runtime, CTS,CLS, Managed code;
4. Getting Started with Visual Basic.Net: what’s new in VB.Net, building VB.Net Application, Operators, Methods, Properties, Conditionals and Loops.
5. Implementing OOP using Visual Basic.Net: Structures, Object-Oriented features, Procedures, function & Collection, Exception Handling, SDI and MDI Application.
ADO.NET; components of ADO.NET. Two Applications in VB.NET
TEXT BOOK
1. The Complete Reference Visual Basic .NET, Tata McGRAW- Hill Edition, Jeffrey R. Shapiro
REFERENCE BOOKS:
2. Visual Basic.Net Programming, Black Book, Dreamtech Press.
52
CA-1254 COMPUTER GRAPHICS LAB L T P Cr
0 0 2 1
LIST OF EXPERIMENTS
1. Write a program for 2D line as raster graphics display using Bresenhem line drawing algorithm
2. Write a program for 2D line drawing as raster graphics display using DDA line drawing algorithm
3. Write a program for circle drawing as raster graphics display using mid point circle drawing algorithm
4. Write a program for polygon filling as raster graphics display using a) Boundary fill algorithm b) Flood fill algorithm
5. Write a program for line clipping 6. Write a program for polygon clipping 7. Write a program for display 3D object as 2D raster graphics display using
perspective transformation 8. Write a program for rotation for 3D object about arbitrary axis 9. Write a program for creating a Bezier Curve REFERENCE BOOKS
1. Pradeep Bhatia, “Computer Graphics”, 2nd
Edition, I K Publishers, 2009. 2. Computer Graphics by Donald Hearn and M. Pauline Baker, 2nd Edition,
Prentice Hall of India, 1999 3. Procedural Elements for Computer Graphics, David F. Rogers, Tata McGraw
Hill, Second Edition, 2001
53
CA-1256 MULTIMEDIA TECHNOLOGIES LAB L T P Cr
0 0 2 1
LIST OF EXPERIMENTS
1. Write a program to justify a text entered by the user on both the left and right hand side. For example, the test “An architect may have a graphics program to draw an entire building but be interested in only ground floor”, can be justified in 30 columns as shown below. An architect may have a Graphics programs draw an entire building but be interested in only ground floor.
2. Study the notes of a piano and stimulate them using the key board and store them in a file.
3. Write a program to read a paragraph and store it to a file name suggested by the author.
4. Devise a routine to produce the animation effect of a square transforming to a triangle and then to a circle.
5. Write a program to show a bitmap image on your computer screen. 6. Write a program to play “wave” or “midi” format sound files. REFERENCE BOOKS
1. Adobe: Creative Team, “Adobe Flash CS4 Professional Classroom in a Book”, Adobe Press, 2008. 2. Jennifer Smith and Aquent Creative Team, “Photoshop CS4 Digital Classroom”, Wiley, 2008
54
CA-1262 CORE JAVA LAB L T P Cr
0 0 2 1
LIST OF EXPERIMENTS
1. To find the sum of odd integers between 1 and 99 2. Program for printing Hello World as output 3. Program from getting input from Keyboard. 4. Program for calling A method using Class Instance 5. Program for catching exception in the program 6. Program for getting address and name of the computer 7. Program for deleting a text file 8. Program for making connection between client and server. 9. Write a Java program that calculates and prints the simple interest using
the formula: simple interest=PNR/100 Input values P, N, R should be accepted as command line input as below, e.g. java Simple interest 5 10 15
10. Write a program that print prime numbers between 1 to n. Number n should be accepted as command line input.
11. Create an User-defined exception class using the extends keyword. Write a constructor for this class that takes a string argument and stores it inside the object with a string handle. Write a method that prints out the stored string. Create a try-catch clause to exercise the created exception.
12. Create a Java program using thread 13. Create an Applet to display a string “I am in the centre” in Courier font, with
size 30 and style and italic. This text should be centered both horizontally and vertically.
14. Create an applet to obtain the list of fonts available with the current Java working environment.
15. Write an animation applet that makes an image appear from left to right, in stages.
16. Create a simple, non-editable combo box with a list of items, when selected one of the items, will display the string to the console and also printing the string which is being deselected, i.e., the string which already been selected.
17. Use socket programming to design a client/server application that takes the password as input and checks whether it is correct. The program should print the appropriate message.
18. Develop a java program for Database connectivity. 19. Using RMI develop a client ,server frame
55
REFERENCE BOOKS
1. “Java Server Programming, Volume I and II”, Wrox Press. 2. Herbert Schildt, “The Complete Reference”, Java Seventh Edition.
CA-1253 INTERNET AND WEB DEVELOPMENT LAB L T P Cr
0 0 2 1
LIST OF EXPERIMENTS
1. Sending and receiving mails. 2. Chatting on the net. Using FTP and Tel net server. 3. Using HTML Tags (table, form, image, anchor etc.). Making a Web page of your college using HTML tags. 4. Create a web page using frames. 5. Create a web page which contain all lists. 6. Create a web page which contain all physical level tags. 7. Create a web page which contain all Logical level tags. 8. Create a web page which contain all text controls tags of html. 9. Create a web page which contain an image, border that image and use that
image as hyperlink. 10. Write a java script program for addition, multiplication, displaying a message
using Function. 11. Write a java script program for event handling (onclick). 12. Write a java script program for window event handling. 13. Write a java script program for image event handling. 14. Write a java script program for creating an object date and time. REFERENCE BOOKS
1. Holzner Steven, “XHTML Black Book”, 2000. 2. Godbole Achyut S. and Kahate Atul, “Web Technologies”, Tata McGraw Hill,
2003.
CA-1257 UNIX & SHELL PROGRAMMING LAB L T P Cr
0 0 2 1
LIST OF EXPERIMENTS
1. Write a shell script to generate a multiplication table. 2. Write a shell script that copies multiple files to a directory. 3. Write a shell script that counts that number of lines and words present in a
given file.
56
4. Write a shell script that displays the list of all files in the given directory. 5. Write a shell script (small calculator) that adds, subtracts, multiplies and divides
the given two integers. There are two division options: one returns the quotient and the other returns reminder. The script requires 3 arguments: The operation to be used and two integer numbers. The options are add (-a), subtract (-s), multiply (-m), quotient (-c) and reminder (-r).
6. Write a shell script to reverse the rows and columns of a matrix. REFERENCE BOOK
Rochkind, M.J., “Advanced Unix Programming”, 2nd
Edition, Pearson Education. 2.
CA-1261 RAPID APPLICATION DEVELOPMENT LAB L T P Cr
0 0 2 1
LIST OF EXPERIMENTS/EXERCISES
1. Program to create 3 forms and perform the following tasks:
a. Calculate addition of 5 numbers
b. Calculate factorial of a number
c. Find whether a given number is even or odd
2. Program to create an employee registration form. 3. Program to create a form and perform the following array operations:
a. Sorting of elements of array
b. Searching a number in an array
c. Merging of 2 given arrays
4. Program to show error handling mechanism in vb. 5. Program to show common dialog control and menu based operations. 6. Program to show functioning of a calculator. 7. Program to create an employee registration form and save the employee
records in random files. 8. Program to show employee record and department records using ado control. 9. Program to create data reports in VB
a. Data report showing employee records stored in database.
b. Data report showing employee list according to their respective departments.
10. Program to create a data report in VB to show the salary details of the employee whose id is entered.
57
PD-292 EFFECTIVE COMMUNICATION L T P Cr
0 0 2 1
OBJECTIVE
To acquaint the students with the basics of effective spoken and written English and
enhance their reading, listening, and communication skills.
1. COMMUNICATION: Importance; barriers and types of communication;
methods to develop effective communication skills. 2. GRAMMAR: Parts of speech; subject/verb agreement; tenses; error correction;
business idioms; Indianism in English; frequently mispronounced words;
exercises. 3. SPOKEN ENGLISH: Vowel and consonant sounds; syllables and syllabic
stress; conversational skills; extempore; JAM. 4. READING & LISTENING SKILLS: Reading with comprehension; story
reading; passage reading; newspaper reading; listening and active
listening; barriers to listening; effective listening and types of listening;
exercises. 5. WRITING SKILLS: Importance of writing skills; how to develop writing skills;
writing exercises i.e., essay writing, reviews, reports, etc. 6. NON VERBAL COMMUNICATION: History; kinesics; postures; gestures;
functions; importance and challenges of non verbal communication. 7. BUSINESS COMMUNICATION: Business letters and messages; business
reports; presentation skills; do’s & don’ts; personal journal.
TEXT BOOK
Wren and Martin, “High School Grammar”, Paperback, 2000
58
REFERENCE BOOKS
1. Condrill Jo, & Bough, Bennie, “101 Ways to Improve Your Communication
Skills Instantly”, 4th Edition, Paperback, 2005
2. Rai S. M., Rai Urmila, “Communication Skills”, Students Edition, Himalaya,
2007.
3. Connor J. D. O, “Better English Pronunciation” Cambridge. 2nd Edition,
Paperback, Cambridge University Press, 2008
4. Raina Arjun, ”Speak Easy Voice And Accent Training Manual”, Paperback
(Special India Edition, Full Circle
5. Guffey Mary Ellen, “Business Communication” 3rd Edition, South – Western
College Publishing, 2000
NOTE:
One trainer per lecture and two trainers per practical session. Classroom with
board/projector for PPT and video clips will be required.
59
PD-293 INTRA & INTER-PERSONAL SKILLS L T P Cr
0 0 2 1
OBJECTIVE To acquaint the students with the understanding of self development through good inter-personal skills for effective social communication in order to succeed in maintaining relationships in professional and social environments. This module will also help at learning group discussions and interview skills to enable employability and professional fit.
1. SELF AWARNESS: Development of our self image; social comparison; significant others; self esteem; self confidence.
2. ASSERTIVENESS & CONFIDENCE: Assertiveness; being confident; strategies to make assertive NO easier; dealing with emotions; difference between being aggressive and being assertive.
3. TEAM BUILDING & TEAM WORK: The team concept; elements of team work; stages of team formation; effective team; essential building blocks of effective teams; team player’s style; team tasks; exercises.
5. INTERVIEW SKILLS: Why an interview; the first step to a successful interview; resumes that make an impact; the interview process; the interview preparation checklist; interviewing skills; putting your best foot forward; common interview mistakes; one on one HR interviews (two for each student).
6. GROUP DISCUSSION SKILLS: Meaning of a GD; types; role of a moderator; do’s and don’ts; mock GDs on general, knowledge based and abstract topics.
7. THE ART OF CONVERSATION: Skills to strike a conversation; sustaining conversation; communicating across cultures; conflict management.
TEXT BOOK Haddon, F. Peter, ”Mastering Personal and Interpersonal Skills”, Viva Books Pvt. Ltd., 2003 REFERENCE BOOKS 1. Schuller, Robert H., “Tough Times Never Last But Tough People Do”, Orient
Paperbooks, 1988 2. Bolton, Robert, “People Skills”, Touchstone Books, 1986 3. Jansaz, De Suzanne, ” Interpersonal Skills in Organizations”, 3
rd Edition,
McGraw Hill Education (Asia), 2009 4. Fontana, David, “Social Skills at Work”, Universities Press, 2000
60
5. Burns, James Mac Gregor, “Leadership”, Harper Perennial, 1982 6. Harris, Godfrey, ”Art of Conversation”, Jaico Publishing House, 2002
CA-1302 SOFTWARE ENGINEERING PRINCIPLES L T P Cr 3 1 0 4
OBJECTIVE To provide basic knowledge of properties of software and its development processes, software quality, CASE tools, etc. PRE-REQUISITES Knowledge of computer programming, principles of management
1- Introduction: Introduction to Software Engineering, Definition of Software
Wesley, 1999. 4. Mall Rajib, “Fundamentals of Software Engineering”, Prentice Hall of India
5. Gustafson David, “Software Engineering”, Tata McGraw Hill, 2002.
CA-1303 PROGRAMMING USING C# L-T-P Cr 3-1-0 4
OBJECTIVE To equip students with C# programming Concepts
62
1. PHILOSOPHY OF .NET: overview of distributed computing; origin of .NET
technology; understanding; .NET platform; do’s and don’ts of .NET; benefits and limitations of .NET; building blocks of .NET framework; .NET programming languages; role of MSIL and Metadata; .NET types and .NET namespaces.
2. VISUAL STUDIO .NET AND ITS. MAJOR COMPONENTS: understanding CLR; CTS and CLS; developing C# Applications using Visual Studio .Net
3. EVOLUTION OF C#: comparison among C++; Java and C#; benefits of C#; object-oriented programming using C#
4. C# PROGRAMMING: introduction to C#; creating a C# program; types in C#; classes; inheritance and polymorphism; methods; statements and control; arrays and strings; interfaces; abstract and base classes.
5. STATEMENTS AND CONTROL: properties and indexers; delegates and their usefulness; attributes; I/O in C#; exception and error handling in C#; C# and windows application.
6. ADO .NET: comparison of ADO and ADO. NET; introduction to data access with ADO.NET components of ADO.NET; overview of XML; XML and ADO.NET.
7. WEB DEVELOPMENT AND ASP .NET: comparison of ASP and ASP .NET; features of ASP .NET; benefits of ASP .NET; features provided by ASP .NET; web forma and their components; overview of web services.
TEXT BOOK 3. Balaguruswammy, E, “Programming in C#”, Tata McGraw Hill REFERENCE BOOKS 4. Jain, V K, “The Complete Guide to C# Programming”, IDG Books India. 5. Pappas & Murray, “C# Essentials”, Prentice Hall of India 6. Gunnerson Eric, “A programmer’s Introduction to C#”, IDG Books 7. Wakefield, “C# and .NET Web Developers Guide”, IDG Books India.
63
CA-1304 ARTIFICIAL INTELLIGENCE L T P Cr 3-1 0 4
OBJECTIVE To introduce about artificial intelligence approaches to problem solving, various issues involved and application areas PRE-REQUISITES Knowledge of neural networks, data structures
1. Introduction: Definition of Artificial Intelligence (AI), Evolution of Computing
History of AI, data, information and knowledge; AI problems and techniques – AI programming languages; problem space representation with examples, Applications of Artificial Intelligence.
2. Search strategies: Breadth first search; Depth first search; heuristic search
techniques: Hill climbing: Best first search; A* algorithm; AO* algorithm; Means-ends analysis 3. Production System & knowledge based representation: Production rules, the
working memory, Recognize-act cycle, conflict resolution by Meta rules, Architecture of production system. Semantic net, Frames.
method of theorem proving, forward chaining, backward chaining standard theorems, method of substitution, Theorem proving using Wang’s algorithm. 5. Predicate Logic: Alphabet of first order logic(FOL), predicate, well formed
formula, clause form, algorithm for writing sentence into clause form, Unification of predicates, unification algorithm, resolution Robinson’s interface rule, Scene interpretation using predicate logic 6. Reasoning Under Uncertainty: reasoning under uncertainty; non monotonic
reasoning; review of probability; Baye’s probabilistic interferences and Dempster Shafer theory; Heuristic methods; Fuzzy reasoning. 7. Planning & Game Playing: Minimax search procedure; Goal stack planning;
non linear planning; hierarchical planning; representation for planning. TEXT BOOK
Elaine Rich and Kevin Knight, “Artificial Intelligence”, 3rd Edition, Tata McGraw Hill, 1991 REFERENCE BOOKS
1. Nils J Nilson, “Artificial Intelligence”, Harcourt Asia Pvt. Ltd. 2. Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach”, Prentice Hall of India, 1998 3. O. W. Patterson, “Introduction to Artificial Intelligence & Expert Systems”, Prentice Hall of India 4. Patrick Henry Winston, “Artificial Intelligence”, 3rd Edition, Addition Wesley, 1992 5. Programming PROLOG, Clockson & Mellish, Narosa Publications
65
CA-1305 INTRODUCTION TO E-COMMERCE L T P Cr 3 0 0 3
Pre-requites
Knowledge of internet and web development, data mining, computer
networks, software engineering.
1. INTRODUCTION TO E-COMMERCE: Benefits; impact of e-
commerce; classification of e-commerce; application of e-commerce
technology; business models; framework of e-commerce.; business
to business; business to customer; customer to customer; advantages
and disadvantages of e-commerce; electronic commerce environment
and opportunities: back ground – the electronic commerce
environment – electronic market place technologies.
2. NETWORK INFRASTRUCTURE OF E-COMMERCE: Network
infrastructure to e-commerce & internet; lan; ethernet ( ieee 802.3);
wan; internet; tcp/ip reference model; domain names; internet
industry structure; ftp applications; protocols required for
ecommerce; HTTP; CGI 3; firewalls; securing web service; secure
payment system transaction security (SET); cryptology; digital
signatures
3. ELECTRONIC PAYMENT SYSTEM: Introduction to electronic
cash and electronic payment schemes – internet monitory payment;
different models; framework; prepaid and post-paid payment model
and security requirements – payment and purchase order process –
online electronic cash. search tools: directories; search engines; meta
search engines.
4. EDI & E-content : Business Trade Cycle; EDI; EDI Fact,
Electronic content.
66
5. E-BUSSINESS: Business requirements – concepts; payment
processing. launching your e business- marketing an e-business;
public relations; consumer communication; news groups & forums;
exchanging links; web rings; e-business back end systems; business
record maintenance; back up procedures and disaster recovery plans.
6. M-COMMERCE: Introduction to mobile commerce; framework;
applications; design methodology and advantages; future trends in
m-commerce. Supply chain management in e-commerce.
7. ADVERTISING & CRM: Internet Advertising; Models of
Internet advertising; sponsoring content; Corporate Website;
Weaknesses in Internet advertising; web auctions. E-retailing; Role
of retailing in E-commerce; E-marketing and advertising. CRM in e-
commerce. Case Study: discussion on a corporate web site. e-
commerce legal issues and cyber laws.
TEXT BOOK
1- Chaffey, Dave, “E-business and E-commerce Management”,
Pearson Education
REFERENCE BOOKS
1. Kalakota, Ravi, Whinston Andrew B . , “E-Commerce-A
Manager’s guide”, Addison Wesley.
2. David Whetley; E-commerce concepts.
3. M- commerce; Norman Sadeh; Wiley
CA-1353 PROGRAMMING USING C# LAB L-T-P Cr 0-1-2 2
LIST OF EXPERIMENTS
67
1. Write a program in C# illustrating the use of sequence, conditional and iteration construct.
2. Write a program in C# illustrating various operators like logical, arithmetical, relational, etc.
3. Write a program in C# illustrating overloading of various operators. 4. Write a program in C# illustrating use of friend, inline and Static Member functions,
default arguments. 5. Write a program in C# illustrating use of destructor and various types of constructor. 6. Write a program in C# illustrating various forms of inheritance. 7. Write a program in C# illustrating use of virtual functions, Virtual base class,
delegates. 8. Write a program in C# illustrating file operations. 9. Write a program in C# illustrating simple web applications using ASP.net 10. Write a program in C# illustrating use of Active X Controls.
CA-1354 ARTIFICIAL INTELLIGENCE LAB L T P Cr
0-0-2 1
LIST OF EXPERIMENTS 1. Study of Prolog programming language 2. Write programs to use iterative structures using Prolog (at least 3 programs) 3. Write programs to demonstrate inferencing/ deductive logic using Prolog (at least 3
programs) 4. Write a program to solve 8 queens problem using Prolog. 5. Solve any problem using depth first search using Prolog. 6. Solve any problem using best first search using Prolog. 7. Solve 8-puzzle problem using best first search using Prolog 8. Solve Robot (traversal) problem using means End Analysis using Prolog. 9. Solve traveling salesman problem using Prolog. 10. Write program to exhibit the ability of building an Expert System using Prolog 11. Study the properties and issues of Natural Language Processing 12. Study the grammar mapping issues in language translation from English to Hindi
The project involves in-depth study on the topic, design, development, analysis fabrication and/or experimental work – Hardware and/or Software. It is intended to give an opportunity to a student to apply his knowledge to solve real-life problem. The student has to select a project work based on a topic of interest.
PD-391 CO-CURRICULAR ACTIVITIES L T P Cr
0 0 2 1 OBJECTIVE To help the students in their all round growth and acquire attributes like team spirit, organizational ability, leadership qualities, etc. OPERATION
The students are to take part in Co-curricular activities outside contact hours through clubs/ societies spread over all the three terms of the year. They are required to register for this course in each term and their performance will be evaluated in last term of the year.
PD-392 PROBLEM SOLVING SKILLS L T P Cr
0 0 2 1
OBJECTIVE
69
To train and enhance the students’ problem solving skills, reasoning ability, quantitative ability, and reading comprehension skills. 1. LOGICAL REASONING: Logical deductions (Syllogism & Venn Diagrams);
4. Devi Shakuntla, “Book of Numbers”, 1984 5. Summers George J., “The Great Book of Puzzles & Teasers”, Jaico Publishing
House, 1989
70
CA-1391 INTERNSHIP-1 L T P Cr
0 0-30 1
0BJECTIVE
The Internship course is a formal method of linking university with the world of work and essentially takes the class room for 20-22 weeks to a professional location where the student and faculty solve real-life problems, of course, with the help of professional experts. Resident University faculty will supervise the education of the students. Internship is conducted at various production and manufacturing units, Design, Development and Consulting Agencies, National Laboratories, R&D Centres, etc. The students solve real-life problems of interest to the host organizations. The professional expert acts as a consultant while resident University faculty supervises the work.
CA-1371 SEMINAR-1 L T P Cr
0 0-2 1
The seminar-1 is to cover the details regarding Internship-I viz. problem definition, literature survey, concepts and methodology employed, analysis, design and development, conclusions and future work
71
CA-1323 ADVANCED COMPUTER ARCHITECTURE L T P Cr 3 0 0 3
OBJECTIVE To introduce various technological aspects about parallelism in super computing, microprocessors supporting such high scale computing, other hardware architectures, ultimately leading to high performance computing through grid computing. 1. PARALLEL COMPUTER MODELS: The state of computing; multiprocessors and
multicomputers; multivector and SIMD computers; architectural development tracks. 2. PROGRAM AND NETWORK PROPERTIES: Conditions of parallelism; data and
resource dependences; hardware and software parallelism; program partitioning and scheduling; grain size and latency; program flow mechanisms; control flow
72
versus data flow; data flow architecture; demand driven mechanisms; comparisons of flow mechanisms
3. SYSTEM INTERCONNECT ARCHITECTURES: Network properties and routing; static interconnection networks; dynamic interconnection networks; multiprocessor system interconnects; hierarchical bus systems; crossbar switch and multiport memory; multistage and combining network.
5. BACKPLANE BUS SYSTEM: Backplane bus specification; addressing and timing protocols; arbitration transaction and interrupt; cache addressing models; direct mapping and associative caches.
OBJECTIVE To bring out various issues related to advanced computing with respect to database management systems such as parallelism in implementation, data backup and recovery management, intelligent data mining techniques, standards, etc. PRE-REQUISITES: Knowledge of database management systems 1. DATA MODELS: EER model and relationship to the OO model; object oriented
data model and ODMG standard; other data models - NIAM, GOOD, ORM 2. QUERY OPTIMISATION: Query execution algorithms; heuristics in query execution;
cost estimation in query execution; semantic query optimisation; database transactions and recovery procedures: transaction processing concepts, transaction and system concepts, desirable properties of a transaction, schedules and recoverability, serializability of schedules; transaction support in SQL; recovery techniques; database backup; concurrency control, locking techniques for concurrency control, concurrency control techniques; granularity of data items
3. CLIENT/SERVER COMPUTING: Client/Server concepts; 2-tier and 3-tier client/server systems; client/server architecture and the internet; client /database server models; technology components of client/server systems; application development in client/server systems
4. DISTRIBUTED DATABASES: Reliability and commit protocols; fragmentation and distribution; view integration; distributed database design; distributed algorithms for data management; heterogeneous and federated database systems
6. DATA WAREHOUSING: Basic concepts; data warehouse architecture; data characteristics; reconciled data layer data transformations; derived data layer user interface.
7. COMMERCIAL AND RESEARCH PROTOTYPES: Parallel database; multimedia database, mobile database; digital libraries; temporal database
REFERENCE BOOKS 1. Ramakrishnan Raghu, “Database Management System”, McGraw Hill, 3rd Ed., 2003 2. Elmasri R. and Navathe S. B., “Fundamentals of Database Systems”, 3rd Edition,
Addison Wesley, Low Priced Edition, 2000. 3. Tamer M. and Valduricz, “Principles of Distributed Database Systems”, 2nd Edition,
LPE Pearson Edition. 4. Silbershatz A., Korth H. F. and Sudarshan S., “Database System Concepts”, 3rd
Edition, McGraw-Hill, International Edition, 1997. 5. Desai Bipin C., “An Introduction to Database Systems”, Galgotia Pub. 6. lioffer Feffray A., Prescotl Mary B.and McFadden Fred R., “Modern Database
Management”, 6th Edition, Pearson Education.
75
CA-1325 CRYPTOGRAPHY AND DATA
COMPRESSION
L T P Cr
3 0 0 3
OBJECTIVE The course will provide a down-to-earth overview of cryptographic techniques applicable in an IT environment, and outline the constraints and limitations of realistic secure systems. A running theme is the tradeoff between usability and security of a system. Also covered are a number of compression techniques - data compression and data encryption are, in some respects, closely related. A working knowledge of C is assumed and essential. 1. COMPRESSION: Packing; Huffman coding; run length encoding; Lempel-Ziv-
Welch; Phil Katz’s PKZIP; Delta modulation; JPEG. 2. ERROR DETECTION AND CORRECTION: Parity; 1, 2, n-dimensions, Hamming
7. ENCRYPTION: Advanced Encryption Standard; Evaluation Criteria for Advanced Encryption Standard; The Advanced Encryption Standard Cipher; Substitute Byte Transformation; Contemporary Symmetric Ciphers; Triple Data Encryption Standard; Blowfish; RC5; Characteristics of Advanced Symmetric Block Ciphers; Confidentiality using Symmetric Encryption; Key Distribution.
REFERENCE BOOKS 1. IEEE, “Integration of Data Compression and Cryptography: Another Way to
Increase the Information Security”, IEEE Computer Society 2. Schneier B., “Applied Cryptography: Protocols, Algorithms and Source Code in C”,
2nd edition, Wiley, 1996. 3. Desai Suhag, “Security in Computing”, Pearson Education 4. Trappe W. and Washington L., “Introduction to Cryptography”, 2nd edition, Pearson
Education, 2006
7. House, 2008 Notes: One trainer per lecture and two trainers per practical session. Classroom
with board/projector for PPT and video clips will be required.
76
PD-291 CO-CURRICULAR ACTIVITIES L T P Cr
- - - 1
OBJECTIVE To help the students in their all round growth and acquire attributes like team spirit, organizational ability, leadership qualities, etc. OPERATION The students are to take part in Co-curricular activities outside contact hours through clubs/ societies spread over all the three terms of the year. They are required to register for this course in each term and their performance will be evaluated in last term of the year.
