Page 1

UNIVERSITY OF CALICUT Curriculum for BCA Programme Syllabi for Core/Open/Complementary Courses

Se m est er

C o u rs e N o

Contact Hours Course Code Course Title T he or y 4 5 L T a ot b al 0 0 4 5

C r e d it s 3 3

1 CA1A01 2 CA1A02

Communication Skills in English Critical Reasoning, Writing and Presentation Communication Skills in Languages other than English Computer Fundamentals & Programming in C Mathematical Foundation For Computer Applications Discrete Mathematics Total ( 6 courses)

I Se m est er

3 CA1A07

5

0

5

4

4 CA1B01 5 CA1C01 6 CA1C02

3 4 4

0 0 0

3 4 4 25

4 3 3 22

Page 2

Se m est er

C o u rs e N o

Contact Hours Course Code Course Title T he or y 4 L T a ot b al 0 4

C r e d it s 4

7 CA2A03

Reading literature in English Reading on Indian constitution secularism and sustainable environment literature in languages other than English Programming in C++ & Data Structures Computer Oriented Statistical Methods Numerical Methods in C Total ( 6 courses)

8 CA2A04 II Se m est er 9 CA2A09 10 CA2B02 11 CA2C03 12 CA2C04

5 5 3 4 2

0 0 0 0 2

5 5 3 4 4 25

4 4 3 3 3 21

Page 3

Se m est er

C o u rs e N o

Contact Hours Course Code Course Title T he or y 5 5 3 4 3 L T a ot b al 0 0 1 0 0 5 5 4 4 3

C r e d it s 4 4 3 3 3

13 CA3A06 14 CA3A12 III Se m est er 15 CA3B03 16 CA3B04 17 CA3C05

History & Philosophy of Science General Informatics Database Design & RDBMS Operating Systems Financial & Management Accounting Operations Research Total ( 6 courses)

18 CA3C06

4

0

4 25

3 20

Page 4

Se m est er

C o u rs e N o

Contact Hours Course Code Course Title T he or y 4 4 3 4 4 4 L T a ot b al 0 0 2 0 0 0 4 4 5 4 4 4 25

C r e d it s 4 4 4 3 3 3 21

19 CA4A13 20 CA4A14 IV Se m est er 21 CA4B05 22 CA4B06 23 CA4C07 24 CA4C08

Basic Numerical Skills Entrepreneurship Development Programming in Java Programming Laboratory I (C++ & Data Structures using C++) E-Commerce Management Information Systems Total ( 6 courses)

Page 5

Net Choose one course from open course I (Other Streams) Mini Project Total ( 7 courses) Page 6 .Se m est er C o u rs e N o Contact Hours Course Code Course Title T he or y 4 3 4 3 3 4 0 L T a ot b al 0 0 0 0 2 0 2 4 3 4 3 5 4 2 25 C r e d it s 3 3 3 3 3 3 1 19 25 CA5B07 26 CA5B08 27 CA5B09 V Se m est er 28 CA5B10 29 CA5B11 30 CA5D01 31 CA5B12 Data Communication & Mobile Computing Microprocessor Computer Networks Software Engineering Visual Programming using C#.

II (RDBMS & VB.Se m est er C o u rs e N o Contact Hours Course Code Course Title T he or y 4 4 5 5 4 L T a ot b al 0 0 0 0 0 3 4 4 5 5 4 3 25 C r e d it s 3 3 3 3 3 2 17 32 CA6B13 33 CA6B14 VI Se m est er 34 CA6B15 35 CA6B16 36 CA6B17E1 37 CA6B17 Web Programming using PHP Computer Graphics & Multimedia Programming Laboratory.II (Programming in Java. PHP) Programming Laboratory.Net) Choose one course from open course II Project Total ( 6 courses) Total Courses : 37 Total Credit : 120 CA1B01 – Computer Fundamentals & Programming in C Page 7 .

UNIT II : Memory.Course Number: 4 Contact Hours: 3 T Number of Credits: 2 Number of Contact Hours: 50 Hrs Aim of the Course To equip the students with fundamental principles of operations of various units of computer and to impart them with the basic principles and concepts of computer programming. Instruction Codes.Binary. Applications. Peripheral Devices and CPU (10 Hrs) Memory: Characteristics of memory systems. puts(). Assembly language. Assembler.Magnetic tape.System Software. Operators. addressing modes. Utility Software.Addition. Hardware. Number System:. To study C language Prerequisites Background of the basic science at +2 level Course Outline UNIT I : Introduction (10Hrs) Evolution of Computers. Computer Languages:. CD ROM. RAM:. Application Software. ROM. Binary Arithmetic:. Control Statements:. System Buses. Introduction to C. Organization. Generations. High Level Language. Complement Addition. Multiplication & Division. Data Input functions: getchar(). Magnetic disk. Flowchart. Software Classification:. UNIT III : C Fundamentals (10 Hrs) Introduction to tools for Program Design: Algorithm. Structure of C Programs. Formatted scanf() and printf().if. Types. Objectives of the Course To learn the basics of computer hardware components To learn the basics of computer hardware units and how they work together To learn the concepts of programming. Cache Memory. Derived.Branching:. Conversion from one number system to another. Asynchronous data transfer.Machine Language. Looping: Entry controlled Page 8 . Components. Instruction formats. Functional Components & their Interconnections. DVD. Constants. CPU: Functions. Data Output functions: putchar(). I/O Organization: Peripheral Devices. Strings. Characteristics. Interpreters. Compilers. Input/Output Interface. gets(). Subtraction. Secondary Memory:.Static & Dynamic memory types. Empty. scanf(). printf(). Keywords. Precedence and Associativity. Common Registers. switch. Identifiers. Hexadecimal. Specified symbols. Primary Memory. C Tokens. Data type Qualifiers. Modes of transfer. Decimal. Direct Memory Access. Octal. Various types of ROM. Floppy disk. Memory hierarchy. Data types: Primary. User-defined. Hard disk.

Passing structures to functions. Automatic. PHI. Exit controlled – do while. Two dimensional and Multidimensional. fopen. Jumping:. file inclusion. Yashvant Kanetkar.goto label. fclose functions. 6. fscanf. “ Computer Organization & Architecture”. 3. Prototype declaration. Storage class. Main References :1. 4. fprintf. M Morris Mano( Third Edition onwards) “ Computer Organization & Architecture”. Character arrays. Static & Register variables. 5.declaration. Calling by value. Arguments. UNIT IV : Structured Data Types and Functions (10 Hrs) Arrays:. 2. 2. scope of variables. Hayes J P. Local & Global variables. Rajaraman “ Programming in C”. Command line arguments. for . break and continue. conditional compilation. Dynamic memory allocation. Byran Gotfried “ Fundamentals of Computer”. Macro expansion. User defined functions. Forward jump & Backward jump. 4. Second Edition. operations.System defined or Library functions. “ Computer System Architecture”. Passing arrays (1 dimensional. fgets. return statement. Calling by Reference.One dimensional . 3.– while. C pre-processor & other features. McGraw Hill : Let us C”.formal & actual. Pointers:. Mullish Cooper. fputs. recursion function. Fourth Edition “ Programming in Ansi C” . Miscellaneous directives. Herbert Schildt. E Balagurusamy. BPB publications “ The spirit of C”. Jasco books “The Complete reference C”. Tata McGraw Hill “ Programming with C”. file types. Tata Mc Graw Hill Course Number: 4 Page 9 . Functions:. Structure and Union. opening & closing a file. V. Definition. Kezningham & Ritchie Additional References :1. William Stallings. external. 2 dimensional & character arrays) to functions. UNIT V : Data Files (10 Hrs) Introduction to data files. initialization.

command line arguments Page 10 . Programs involving structures. arrays of structures. pointers and structures 8. Programs involving pointers. Programs involving while. Programs involving one and two dimensional arrays 5. Programs involving no transfer of control 2. ?: and goto statement 3. switch. arguments as arrays. Programs involving if. pointers and strings. for. Programs involving files. do…while. pointers and arrays.Contact Hours: 2L Number of Credits: 2 Number of Contact Hours: 30 Hrs Aim of the Course To equip the students with fundamental programming principles Objectives of the Course To learn the concept of programming To study C language Prerequisites Basic programming concepts Course Outline Module I – 30 Hrs Programming in C 1. Programs involving functions. return value as pointer. strings 6. structure within structure 7. else if ladder. pointer arguments to functions. recursions. if…else. break and continue statements 4.

Unit III (12 Hrs) Differentiation: Derivative at a point Derivative of a Function. Reflexive. null set. equal sets. Quotient rule. Composition. Differentiation from first principle. Higher order derivatives (Definition only) Unit IV (12 Hrs) Page 11 . equivalent sets. disjoint sets Relations: Inverse. Transitive. Product rule. Course Outline Unit I (12 Hrs) Sets & Binary Operations: Definition of set. Inverse. Real functions: Types. difference. Objectives of the Course To learn the set operations. infinite set. Differentiation of a function of a function (problem based). Even & Odd functions. To learn the basics of limits To learn the basics of Differentiation & Integration To study the matrix operations. range. Product. Limits &Continuity: . Differentiation of important functions.Mathematical Foundation for Computer Applications Course Number: 5 Contact Hours: 4 T Number of Credits: 3 Number of Contact Hours: 60 Hrs Aim of the Course To equip the students with basic principles of integration and differentiation and matrix operations. finite set. one-one and onto functions. Symmetric. Limits: Definition (basic properties only). Universal set Operations on a set: Union. Quotient. domain.CA1C01 . Equivalence (No Proof Required) Unit II (12 Hrs) Functions. Value of a function. Operations: Sum. Difference. Scalar multiple.Function: Definition. Intersection. singleton set.

Addition of Matrices . Types of Matrices.Integration: Integral as Anti derivative. Properties of definite integrals (Problem Based) Unit V (12 Hrs) Matrices : Matrix Definition.K.Goyal Page 12 . Multiplication of Matrices . Fundamental theorems. Various Kinds of Matrices . Transpose of a Matrix . Integration through Partial Functions. Inverse of a Matrix. Indefinite integral & constant of integration. Integration by parts. Definite Integral: Evaluation by Substitution. Reference : “Skills in Mathematics :Algebra”. Elementary Standard results.S. Order of a Matrix. Methods of Integration.

Discrete Mathematical Structures with applications to Computer Science.Rings. Ross – Pearson Education Page 13 . Busby.CA1C02 – Discrete Mathematics Course Number: 6 Contact Hours: 4 T Number of Credits: 3 Number of Contact Hours: 60 Hrs Aim of the Course To equip the students with basic principles of Discrete Mathematics Objectives of the Course To learn the mathematical logic & Boolean Algebra To learn the basics of Groups & Rings Course Outline Unit 1: (12 Hrs) Mathematical Logic – Proportions-Predicates and quantifiers.Generating functions. Unit IV: (12 Hrs) Recurrence relations: Linear recurrence relations with constants coefficients – solution by the method of generating functions. Discrete mathematical Structures – Kolman.Logical inference. Integral domains and fields (definitions and simple properties only) Main References 1. J. Unit V: (12 Hrs) Groups and Rings – Groups.K.Subgroups – Generation and evaluation of process. Logical operators.Methods of proof.Asymptotic behavior of numeric functions.Manipulation of Numeric functions. asymptotic behaviour of functions. Tremblay and R Manohar. Unit III: (12 Hrs) Discrete Numeric functions and generating functions.Introduction. Elements of Discrete Mathematics TATA MCGRAW – HILL Edition 2. Unit II: (12 Hrs) Counting Techniques: Basic counting techniques-permutations and combinations.MCGRAW HILL INTERNATIONAL Edition 3.

TMH Pub.C++ data types.1999 3.CA2B02 – Programming in C++ & Data Structures Course Number: 10 Contact Hours: 3 T Number of Credits: 2 Number of Contact Hours: 50 Hrs Aim of the Course To equip the students with principles and concepts of object oriented design Objectives of the Course To learn the basic concepts and principles of object oriented design To study C++ language Prerequisites Basic background skills Course Outline Unit I: (10 Hrs) Oop concepts: Introduction-Difference between procedure oriented and object oriented programming-Characteristics of Oop . default argument Unit II: (10 Hrs) Classes: Member and member function. virtual base classes-Nesting of classes and containership-Exception handling-Templates and template functions Unit IV: (10 Hrs) Arrays. prototype. polymorphism. Sartaj Shani “Data structures. operators-insertion. extraction operators-pointers-referencesenumeration-functions in c++. Robert Lafore “Object oriented programming in c++” Galgotia 4. inheritance.abstraction. Algorithms and applications in C++ 2. return type. Balagurusamy: Object Oriented Programming with C++. Dinesh Mehta “Fundamentals of Data Structures in C++” Course Number:10 Contact Hours: 3 L Page 14 . argument passing. 5. bubble and quick sort methods and comparisons. insertions. insertion and deletion operation. hybrid inheritance-virtual functions. 1998. hierarchical inheritance. multilevel inheritance. multiple inheritance. multidimensional arrays-Search Linear and binary search methods.. and encapsulation Class and Object . Unit V: (10 Hrs) Linked list. Main References 1.inline function-constructor and destructor-new and delete operators-friend function –function overloading with example-operator overloading Unit III: (10 Hrs) Inheritance: derived classes-single inheritance. E. and doubly linked list with header nodes.Representation. Bjarne Stroustrup “the C++ programming language” Addison Wesley. representation of arrays. deletion-stack using linked list-queue using linked list.Sorting-insertion.

Rank correlation and Regression analysis Unit II Probability theory :Random experiment . Mean deviation and standard deviation.Number of Credits: 2 Number of Contact Hours: 30 Hrs Aim of the Course To develop the basic programming skills Objectives of the Course To learn the basic programming skill in OOPS To learn the implementation of various data structures Prerequisites Basic programming skills in C & knowledge in OOPS Course Outline Programs involving OOP features Programs involving data structures using c++ CA2C03 – Computer Oriented Statistical Methods Course Number: 11 Contact Hours: 2 4 Number of Credits: 2 Number of Contact Hours: 60 Hrs Aim of the Course To train the students with basic statistical methods. Curve fitting. Geometric mean and Harmonic mean.Principles of least squares. Lorenz curve. Mode. Correlation (Bivariate case only) Pearson’s coefficient of correlation. fitting of straight lines. frequency approach to probability. statistical regularity. sample space. quartile deviation. Objectives of the Course To learn the basics of statistics To learn probability theory To learn the sampling distributions Course Outline Unit I Basics statistics: Measures of central tendencies – Mean. union. Measures of dispersion – Range. events. Different approaches of probability. Classical definition. Median. Sample point. numerical examples Page 15 . intersection and compliment of events.

Maximum likelihood estimator.distribution. Bivariate distributionsdefinition of bivariate distribution. Macmillan Publishiong Co. Two types of errors.elementary properties. Waple R E – “ Mathematical Statistics”. Poisson. standard distributions. Miller I Freund J E – “ Probability and Statistics for Engineers”. Normal Unit IV Sampling distributions. Ltd. the distribution of mean samples from a Normal population. raw and central moments. Desirable properties of point estimates.Int 2.Ltd. Interval estimation. 4. Ltd Page 16 .Binomial.Unit III Random variables and probability distribution. Discrete and continuous random variables. Neyman. Prentice Hall of India Pvt.density function. Hogg R V Craig A T – “ Introduction to Mathematical Statistics”. Testing of hypothesis.Chisquare and F and use of their tables Unit V Estimation of parameters.change of variable in unvariate case. independence of two variables. Mathematical expectation. General principles of testing. 3. Definition and statement of the form of the distributions. Interval estimates of mean and variance of Normal population and proportion of Binomial population. Prentice Hall of India Pvt. Prentice Hall of India Pvt.Pearson approach Main References 1. Freund J E. marginal and conditional distributions. moment generating functions. “ Statistics for Management”. Levin R I.density function.

CA2C04 – Numerical Methods in C Course Number: 12 Contact Hours: 2 T Number of Credits: 2 Number of Contact Hours: 50 Hrs Aim of the Course To train the students with basic Numerical Methods Objectives of the Course To learn the floating point arithmetic To learn how to solve linear equations To learn the numerical differentiation and integration Prerequisites Background of the basic Mathematics at +2 level Course Outline Unit 1 (10 hrs) Floating Point Arithmetic. Significant digits and Numerical Instability Unit 2 (10 hrs) Roots of Algebraic and Transcendental Equations – The Increment Search Method – Bisection Method – Method of False Position – Newton Raphson Method Page 17 .Errors.

Prentice Hall of India 2. M. Iyengar . Salvadori & Baron . Wley Eastern Course Number: 12 Contact Hours: 2 P Number of Credits: 1 Number of Contact Hours: 30 Hrs Aim of the Course To train the students in programming Numerical Methods Objectives of the Course To learn the floating point arithmetic To learn how to solve linear equations To learn the numerical differentiation and integration Prerequisites Background of the basic Mathematics at +2 level & knowledge in C programming Page 18 . Numerical Solution of Ordinary differential equations – Single Step Method – Taylor’s Series Method – Euler’s Method – Modified Euler’s Method – Runge Kutta Methods Main References 1. R.K. “Numerical Methods for Scientific and Engineering Computation”.Numerical Differentiation – Methods based on finite differences – Extrapolation Methods – Numerical Integration – Methods based on Interpolation – Composite Rule – Trapezoidal and Simpson’s Rule – Romberg Integration – Gauss Quadrature Formulas . SRK.Jain .Jain .Unit 3 ((10 hrs) Solution to Simultaneous Linear Equations – Direct Method – Crammer’s Rule – Gauss Elimination Method – Gauss Jordan Elimination Method – Triangularization Method Unit 4 ((10 hrs) Interpolation and Approximation – Lagrange & Newton Interpolations – Finite Difference Operators – Interpolating Polynomials using finite differences – Hermite Interpolation – Least Square Polynomial Approximation of a data Unit 5 ((10 hrs) Numerical Differentiation and Integration . “Numerical Methods in Engineering “ .K.

Strong entity sets. ER diagrams . Database administrator . Module II (12 Hours) Relational Database Design : First . Module III (12 Hours) Page 19 . Relationship sets . View of data – Data abstraction . Database architecture . Constraints . Data models . Database users . BCNF . Keys .Course Outline C Programs to solve numerical method problems CA3B03 – Database Design & RDBMS Course Number: 15 Contact Hours: 3 T Number of Credits: 2 Number of Contact Hours: 50 Hrs Aim of the Course : To equip the students with principles and concepts of relational database design Objectives of the Course • To learn the basic principles of database and database design • To learn the basics of RDBMS • To learn the concepts of database manipulation SQL • To study PL/SQL language Prerequisites Basic knowledge of the computer functional units and their functioning and basic programming knowledge Course Outline Module I (12 Hours) Introduction : Purpose of database systems . The Entity –Relationship model: Entity sets . Weak entity sets . Fourth and Fifth Normal forms . Attributes . Database languages . Mapping Cardinalities . Transactions : ACID properties . Concurrent executions . Third . Second. Instances and Schemas . States .

passing and returning data to stored procedures . global variables . Cursors : Working with cursors . Grouping data from tables in SQL . if /else . Joining a table to itself . Object privileges . “SQL Bible”. creating and calling a scalar function . multiple trigger interaction. Primary key . Ivan Bayross. types of locks .Data Definition in SQL : Data types .Trukhnov. Logical operators . Course Number: 15 Contact Hours: 2L Number of Credits: 1 Number of Contact Hours: 30 Hrs Aim of the Course : To equip the students with fundamental programming principles Objectives of the Course • • To study PL/SQL language To study SQL commands and procedures Prerequisites Basic knowledge of the computer functional units and their functioning and basic programming knowledge Course Outline Page 20 . Data Constraints – I/O constraints . Security : Locks . “SQL. Main References : 1. Granting and revoking permissions : Granting privileges . procedural flow . Alex Krigel and Boris M. Creation . levels of locks . Dropping of tables . Henry F Korth . Renaming the column of a view . Revoking privileges . creating triggers . 5th Edition 2. Error Handling . Abraham Silberschatz . implementing triggers . goto .PL/SQL: The Programming Language of Oracle” 3. Unique key constraints . Deletion of tables . Module IV (12 Hours) Database Manipulation in SQL : Computations done on table data : Select command . Joins – Joining multiple tables .Wiley pubs 4.create. Insertion . “Microsoft SQL Server 2000 Bible” . while.alter and drop .Views : Creation. Developing stored procedures . S. if. Foreign key . Wiley Dreamtech India Pubs. Renaming . Module V (12 Hours) Program with SQL : Data types : Using set and select commands . Updation .Sudharshan “ Datebase System Concepts” . Paul Nielsen . Range searching . building user defined functions . GROUP BY . destroys view . Modifying the structure of the tables . HAVING clauses . Pattern matching . ALTER TABLE command. Viewing . using stored procedures within queries .

Deadlock :Handling deadlock . Types : Batch . Unit III (12 hrs) Memory Management : Functions . Concurrent processes . Process synchronization . Booting process. Preemptive and nonpreemptive scheduling algorithms . Non-contiguous: Segmentation and Paging . Contiguous : set principle . Prevention . Process states. Solution to mutual exclusion problem : Software . Scheduling objectives . Scheduling levels . Avoidance . Process scheduling. Events related to process. Demand paging . Hardware & Semaphore Solutions . Structure. Unit II (12 hrs) Processor Management: Functions. Real time . Timesharing . Mutual exclusion and critical section . OS as Resource manager .SQL Commands and Procedures CA3B04 – Operating Systems Course Number: 16 Contact Hours: 4 T Number of Credits:3 Number of Contact Hours: 60 Hrs Aim of the Course To equip the students with basic concepts of Operating Systems Objectives of the Course To learn the basic concepts and functions of operating system Prerequisites Basic knowledge of computer functional units Course Outline Unit I (12 hrs) What is an OS . PCB. Process. Virtual memory . Unit IV (12 hrs) State and Dynamic . POST. State transition. Classical problems of mutual exclusion . Multiprocessor system . Multiprogramming . Working Page 21 . Functions. Distributed system . Detection and Recovery. Page replacement policies .

“System Programming and Operating Systems” .J. Virtual . File allocation . Functions .File Management : Information management : File system . File system design : Symbolic . File organization . Free space management . Spooling . Tata McGraw Hill .A design Oriented Approach” .M. John Wiley & Sons 2. William Stallings . “Modern Operating Systems” . “An Introduction to Operating System “ . Main References: 1. Device management : Functions . Galvin & Gagne .Dhamdhare . 1996 5. “Operating System” . PHI 4. “Operating System Concepts” . Prentice Hall Additional References : 1. Logical and Physical file system layers . Techniques for device management : Dedicated . Donovan J. Unit V (12 hrs) Device Management : Disk scheduling . Basic .Charles Crowley . Disk scheduling policies . File system structure . Dietel . “Operating System” . Tanenbaum A. D. 1997 Page 22 . . Shared . File directory .Silberschatz .S. Tata McGraw Hill . McGraw Hill 3. “Operating Systems. Madnick S. Addison Wesly 2. .E. . Channels and Control unit. File protection and security.

Balance sheet UNIT-II (12 hrs) Invitation to management accounting: Analysis and interpretation of trading accounts and financial statements – Horizontal Vertical analysis – Common size Balance sheet –common size income statement – comparative income and balance sheet –trend analysis. Cash book-forms of cash books.Trading P/L A/c. To get a general understanding and important tools for managerial decision making. Prerequisites Basic Accounting knowledge Course Outline UNIT-I (12 hrs) Principles of accounting – Some fundamentals concepts and conventions – Systems of accounting double entry principles – Advantages of Double entry system – personal. nominal accounts. To get a general understanding on various tools for financial statement analysis. To get a general understanding on accounting procedures up to the preparation of various financial statements. UNIT-III (12 hrs) Ratio analysis: uses of ratios in interpreting trading accounts and financial statements –different types of ratios – Liquidity ratios –turnover ratios-activity ratios –solvency ratios UNIT-IV (12 hrs) Page 23 .CA3C05.Ledgers –limitations of financial accounting-Trial balance – Final accounts . real.Financial & Management Accounting Course Number: 17 Contact Hours: 4 T Number of Credits:3 Number of Contact Hours: 60 Hrs Aim of the Course To equip the students with fundamental principles of financial & management accounting Objectives of the Course To get a general introduction on accounting and its general application.subdivisions of Journal.

sales budget-production budget-flexible budget-cash budgetadvantages-preparation Main References 1. Least cost method.R. A.M “Financial Management” Vikas publishing house 2.master budget.margin of safety –standard costinganalysis of variance-material-labour-O/H-sales variables-Budget and Budgetary control.Transhipment problem.R approach in decision making. Simplex method.different types of budgets. Kellock. Course Outline Unit 1: (12 hrs) Operation research and LPP:Operation Research and Decision making.N Maheshwari “advanced Accountancy” Vikas publishing house 4. LPP: Introduction. Prerequisites Basic Mathematical knowledge. maximal flow problem. To get a general understanding of different mathematical models. Pandey I. Objectives of the Course To get a general introduction in solving linear programming problems. Assignment model: Mathematical formulation of the problem-assignment algorithm. basic components. PERT and CPM. artificial variable technique-Big M and two phase method-problem of degeneracy-concept of dualitydual simplex method. Unit II: (12 hrs) Transportation model-North west corner rule. Application of O. uses and limitation of O. To get a general understanding of network analysis technique. Advantages of O.Break even point – cost volume profit analysis.Vinod “cost and Management accounting”-Calicut University central co-operative stores CA3C06 – Operations Research Course Number: 18 Contact Hours: 4 T Number of Credits:3 Number of Contact Hours: 60 Hrs Aim of the Course To impart an interdisciplinary approach in mathematical formulation of different models.loops in transportation table.cash flow statement. project scheduling critical path calculations.impossible algorithms-travelling salesman problem Unit III: (12 hrs) Network scheduling: concept of network. mathematical formulation the problem.R. Rules of network construction. advantages Page 24 . Vogel’s approximation method.J “elements of Accounting” Heinmann 3. canonical and standard forms of LPP.Fund flow statement –schedule of changes in working capital –fund from operation.Degeneracy in transportation table. S.cash from operating activities –cash from financing activities –cash from investing activities UNIT-V (12 hrs) Marginal costing.

staff replacement problem.J Karlin.EOQ problem with no shortages. 2.of network (PERT/CPM). items that fail completely and suddenly.A “operation Research : an Introduction”.Sequencing models: processing n jobs trough two machines.ABC analysis. Arrow K. EOQ problem with shortages. Gupta P. EOQ production problem with no shortages. Unit V: (12 hrs) Inventory model: Deterministic inventory problem. McMillan 1982 Additional References 1. two jobs through m machines Unit IV: (12 hrs) Replacement model: Replacement of items with gradual deteriorates-items deteriorates with value of money.sultan chand&sons . E)Q problem with one and two price break. New York Page 25 . n jobs through three machines . Macrile Sasiani. Arthur Yospon and Lawrance Friedmon-“operation Research methods and problems” John wiley&Sans. S and Scarf “Studies in the mathematical theory of inventory and production” Stanford University Press 2. Kanti Swarup. Main References 1. Taha h. EOQ problem with no shortage and several production runs of unequal length.K Man Mohan “Operation Research”. Inc.

Multithreaded programming . Arrays. JFC. Unit II : (12 Hours) Operators and Expressions. Exceptions. Evolution. Strings and Vectors. Constants. Branching and Looping Unit III : (12 Hours) Classes. Environment.CA4B05 – Programming in Java Course Number: 21 Contact Hours: 3 T Number of Credits:2 Number of Contact Hours: 55 Hrs Aim of the Course To equip the students with basic programming skill in Java Objectives of the Course To learn the core Java language Prerequisites Basic Knowledge of OOPS concepts Course Outline Unit 1 : (11 Hours) Fundamentals of Object Oriented programming. Graphic Programming Unit V : (10 Hours) Page 26 . Unit IV : (10 Hours) Applet Programming. Decision making. Variables & Data Types. Packages. Objects and Methods. Features. Interfaces.

JDBC. Person education Course Number: 21 Contact Hours: 2L Number of Credits: 1 Number of Contact Hours: 30 Hrs Aim of the Course: To equip the students with programming principles of core Java Objectives of the Course • • • To study the features of Java To study two tier architecture To study the event driven programming Prerequisites Basic knowledge of Object Oriented Concepts Course Outline Programs involving arrays. exception handling. Page 27 . strings. “ Developing E Commerce Sites”. “ Web Programming with ASP”. packages..Fast and easy Web development”. Concepts of J2EE References • • • • • E Balagruswami. frames.a Primer”. Tata Mc Graw Hill. Peter Rossbach & Hendrisk Schereliber. “ Java 2. “ Java – Server and Servlets”. Java Collection. interfaces. Third Edition. Person Education Vivek Sharma & Rajiv Sharma.Managing Input/Output files. Prentice Ha.2008 Andy Harris. Person Education Matt J Crouch. applets. “ Programming With Java .

CA4B06 – Programming Laboratory I (C++ & Data Structures) Course Number:22 Contact Hours: 4 L Number of Credits: 3 Number of Contact Hours: 50 Hrs Aim of the Course To develop the programming skills in C++ Objectives of the Course To learn the basic programming in OOPS To learn the implementation of various data structures Prerequisites Basic programming skills in C & knowledge in OOPS Course Outline Programs involving OOPS features Programs involving Data Structures Page 28 .

Prerequisites Basic knowledge in Commerce Course Outline UNIT I: (12 hrs) Electronic Commerce framework – Electronic Commerce of Media convergence.Commerce Course Number: 23 Contact Hours: 4 T Number of Credits:3 Number of Contact Hours: 60 Hrs Aim of the Course To provide the students with the basic knowledge in E-Commerce Objectives of the Course To get a general introduction Electronic Commerce framework To get a general understanding on various electronic payment system To get a general understanding on Internal information systems To get a general understanding on the new age of Information.CA4C07 – E .The Anatomy of E-commerce applications – Electronic Commerce Applications – Electronic Commerce Organization Applications – Market Forces Influencing the I-way – Components of the I-way UNIT II: (12 hrs) Architectural framework for electronic commerce – World Wide web (WWW) – Web background: Hypertext publishing – Technology behind the web – security and the web – Consumeroriented applications – Mercantile models from the consumer’s perspective – Mercantile models from the Merchant’s Perspective UNIT III : (12 hrs) Page 29 .

PHI. 2003 2. “E. Jaworski. Pearson Education Asia.charting the Online Marketing process –Information search and Retrieval – Electronic commerce Catalogs or Directories – Information Filtering Main References 1. Security. “ FRONTIERS OF ELECTRONIC COMMERCE”. Bernard J. UNIT V: (12 hrs) The New Age of Information-Based Marketing – Advertising on the Internet. Jeffery F. P.Types of Electronic payment systems – Digital Token-Based Electronic Payment Systems – Smart cards and Electronic Payment Systems – Credit Card based Electronic Payment systems – Risk and Electronic Payment Systems – Designing electronic payment systems -Electronic data interchange – EOI Applications in Business – EDI: Legal. Joseph. 2002 3. Andrew B. Rayport. Whinston.T. and Privacy issues – EDI and Electronic Commerce.COMMERCE – A MANAGERIAL PERSPECTIVE”. UNIT IV: (12 hrs) Internal Information systems – Macro forces and Internal Commerce – Work Flow Automation and Coordination Customization and Internal commerce – Supply chain commerce systems – making a business case for a document Library – Types of digital documents – Issues behind Document Infrastructure. TMCH. “E. 2003 Page 30 . Ravi Kalakota.COMMERCE”.

Page 31 . relevance of decision making concepts for information system design. decision making under psychological stress. Definition of information. MIS structure based on organizational function. some issues of MIS. Management information system support for decision making.CA4C08 – Management Information Systems Course Number: 24 Contact Hours: 4 T Number of Credits:3 Number of Contact Hours: 60 Hrs Aim of the Course To provide the students with the basic knowledge in Management Information Systems Objectives of the Course To get a general introduction to Information Systems To get a general understanding on the conceptual foundations To get a general understanding on organizational & management concepts To get a general understanding on developing & implementing application systems. Behavioral Model of organizational decision making. Methods for decision among alternatives. MIS & other academic disciplines. Unit II (12 hrs)Conceptual Foundations: Phases in decision Making Process. MIS as an evolving concept. Behavioral models of the decision Maker. synthesis of MIS system structure. Prerequisites Basic knowledge in Information Systems Course Outline Unit I (12 hrs) Introduction to information Systems: Definition of a management information system. Concepts of decision Making. MIS structure based on management activity. Subsystems of an MIS. Operating elements of an information system.

System concepts applied to MIS. Life cycle approach to application system development. Structure and development. Auditing of IS. Unit V (12 hrs)Developing & implementing application systems: A Contingency approach to choosing an application development strategy. Information processing model of organization structure. Quality assurance with user developed systems.quality of information in decision making. Organizational functions for control & quality assurance. Organizational change. tentative limits on human information processing. Characteristics of human information processing performance. implications of organizational structure & management theory of MIS. organizations as sociotechnical systems. Concepts of organizational Planning. Modifications of basic organizational structure. Concepts of human cognition & learning. System concepts & Organizations. Margrethe H Olson. Evaluation of Proposed Hardware & Software. Main Reference: Gordon B Davis. value of information other than in decision. Unit IV (12 hrs) Organizational structure & management concepts: The basic model of Organizational Structure. Prototyping approach to application system development. Evaluation of existing Hardware & Software. Planning Process and Characterstics of control process. General model of the human as an information processor. General model of a system. Post audit evaluation of Is Applications. Life cycle installation & operation stage. Life cycle definition stage. Unit III (12 hrs)System Concepts: Definition of a System. Organizational culture & Power. Management information systems conceptual foundations. The Newwell-Simon model. Implementation of IS as an organizational change process. Quality in IS. TATA McGraw Hill Page 32 . Types of systems. Subsystems. Quality assurance for applications. Management theories.

PPM –Digital Pulse modulation (PCM).Analog pulse modulation – PAM. Half -Duplex and Full. UNIT II (12 hrs) Communication concepts :Analog modulation – Various schemes – AM. checksum.Simplex. FSK.Duplex modes of transmissions.Shannon’s Theorem.ASK. Channel capacity . Key Techniques . Hamming code. PWM. Noisedifferent types of noise. PSK. CRC. QPSK UNIT III (12 hrs) Page 33 .Serial and Parallel Transmissions-Synchronous and Asynchronous Transmissions. FM –Sampling theorem .CA5B07 – Data Communication & Mobile Computing Course Number: 25 Contact Hours: 4 T Number of Credits:3 Number of Contact Hours: 60 Hrs Aim of the Course To provide the students with the basic knowledge in Data Communication & Mobile Computing Objectives of the Course To get a general introduction to data & mobile communication concepts To get a general understanding on wireless networking Prerequisites Basic knowledge in Communication Systems Course Outline UNIT I (12 hrs) Introduction: Communication model – Data communication and networking – Digital vs Analog Communications. Error Detection and Correction: parity. PM.

Pearson Education 2. 2. Reference Books: 1.Mobile computing through internet. GSM: GSM history-GSM architecture-GSM Entities. WAP: The Mobile Internet Standard: Overview of WAP Text Books: 1.IS-95-CDMA versus GSM-Wireless Data.Transmission Media: Guided Media: Twisted Pair Cable.GSM Channel typesGSM addresses and identifiers-Network aspects in GSM-Authentication and security in GSM. Synchronous Time Division Multiplexing –Statistical time Division multiplexing – UNIT IV (12 hrs) Introduction to wireless networking-Mobile and Wireless Devices –Need for Mobile Computing –3 tier Architecture. optical fiber Cable Unguided (wireless): Terrestrial microwave – satellite microwave –wireless propagation. Multiplexing . UNIT V (12 hrs) GPRS: Introduction-GPRS and Packet data Network-GPRS Network architecture-GPRS Network operation-Data service in GPRS-Application for GPRS-limitation of GPRS. Data and Computer Communications-William Stallings.Tanenbaum & Schilling Mc Graw Hill. Coaxial Cable.Mobile computing through telephone: IVRVoice XML-TAPI. Mc Graw Hill.Behurouz & Forozan Mc Graw Hill. CDMA: Introduction-Spread-spectrum technology.Kennedy.Frequency Division Multiplexing (FDM) – Time Division Multiplexing (TDM). Electronic communication system . Page 34 . Introduction to Data Communications & Networking . VIIth Edition. Principles of Communication System .

Alignment.To learn the basic concepts and functions of operating system Prerequisites Basic knowledge in computer hardware Course Outline Unit I (10 hrs) Introduction to the microprocessor and computer: Internal processor architecture. To know the methods of connecting them to the peripheral devices. Procedure Definition. Value Returning Attribute. Data Control. 8086 and higher versions To understand the instruction set of the above. subroutines. programming techniques. Clock signals. Header File. Macro Definition. examples. Modular programming: stacks. Unit III (10 hrs) Assembler Directives: Data Definition and Storage Allocation. Target Machine Code Generation Control Directives Page 35 . Program End. program control instructions. addressing modes Unit II (10 hrs) Programming 8086: Data movement instructions. Arithmetic and logic instructions. string instructions. Macros.CA5B08 – Microprocessor Course Number: 26 Contact Hours: 3 T Number of Credits:3 Number of Contact Hours: 50 Hrs Aim of the Course To equip the students with the architecture and instruction sets of different microprocessors and to design systems using microprocessors Objectives of the Course • • • To study the architecture of microprocessors like 8085. Branch Displacement. Inclusion. Bus. Functional block diagram. Program Organization.

486.Max Modes. Prentice Hall 3. Peter Abel. K. ”Microcomputer systems: the 8086\8088 Family: Architecture.8253 Unit V (10 hrs) Introduction to other 16 bit 32 bit processors: 80286. Mohammed Rafiqussaman. Interfacing. Microprocessor and microcomputer based system design 5. Prentice Hall 4. Badri Ram. Interrupt I\O.8257. Application of 8259. 8255. S\W application. BPB 2. Min. Pentium and Pentium ProProcessor References: 1.R Venugopal.Unit IV (10 hrs) Interrupts and interrupt routines. Yu-Chang Liu & Glenn A Gibson. Microprocessor X6 Programming.8251. PHI 6. System bus structure. IBM PC Assembly Language and programming. Programming and design”. TMH Page 36 . DMA.”Advanced Microprocessors and interfacing”. 386. I\O interface and programming: Fundamental I\O considerations. Data transfer schemes-Programmed I\O.

IEEE 802.SONET – Bridges-Sliding window protocol-ALOHA-CSMA/CD UNIT III (12 Hrs) Network layer: Repeaters-Bridges-Gateways. Switching-The Physical Layer: Modem-RS232 Interface UNIT II ((12 Hrs) Data Link Layer: LAN .IEEE 802.CA5B09 – Computer Networks Course Number: 27 Contact Hours: 4 T Number of Credits:3 Number of Contact Hours: 60 Hrs Aim of the Course To provide the students with the basic knowledge in Networking Objectives of the Course To get a general introduction to Computer Networks To get a general understanding on different OSI layers Prerequisites Basic knowledge in Communication Systems Course Outline UNIT I (12 Hrs) Introduction to Computer Networks: Network Topologies-Types of Network-OSI Model.Routing algorithms .11 – FDDI .Congestion Control algorithms – Internetworking . Transport Layer: Elements of Transport protocol – A simple transport protocol – The Internet transport Protocols : TCP-UDP -Performance issues UNIT IV (12 Hrs) Session layer: Synchronization – Presentation layer: Encryption-Decryption-Application layer : HTTP-FTP-SMTP-DNS UNIT V (12 Hrs) Network Security: Common threats-Firewalls.Routers .IEEE 802.Ciphers-Public/Private key encryption-DES-RSA-MD5-Kerberos-PGPMIME Page 37 .Advantages and Disadvantages of firewallsCryptography.Ethernet IEEE 802.5 .4 .3 .

IVth Edition. Prentice Hall of India.Behurouz & Forozan. 2003. IIIrd Edition. Cryptography And Network Security – Principles and Practices. Pearson Education 4. Computer Networks -Andrew S. Introduction to Data Communications & Networking . PHI 3. Tanenbaum . VIIth Edition. Data and Computer Communications-William Stallings.TMH 2.References: 1.William Stallings. Page 38 .

Data Design. Documentation. Object oriented Design. Data flow Diagrams. Information Modeling. Pseudo Codes. Design Structure. Entity Relationship Diagrams. Spiral Model. Feasibility Study. Architectural Styles. cost of maintenance. flow Charts. Mapping Requirements into Software Architecture Low Level Design: Modularization. Software Characterstics. Top –Down and Bottom-UP design UNIT IV: Software Testing and Maintenance (12 hrs) Top-Down and Bottom-Up Testing Strategies: Test Drivers and Test Stubs. Component based Development Model. Decision Tables. Prototype Model. Test Data Preparation Software as an entity. Page 39 . Software Applications. Reverse Engineering. IEEE Standards for SRS.CA5B10 – Software Engineering Course Number: 28 Contact Hours: 3 T Number of Credits:3 Number of Contact Hours: 60 Hrs Aim of the Course To provide the students with the basic knowledge in Software Engineering Objectives of the Course To equip the students with basic system development skills To get a general understanding on Software Life Cycles Prerequisites Basic knowledge in Programming Course Outline Unit I: Introduction (12 hrs) Introduction to software Engineering. Review and Management of User Needs. Corrective and perfective maintenance. SRS Document. Categories of maintenance: Preventive. Software Re-Engineering. software quality frameworks. Software Quality Assurance (SQA): Verification and Validation. Iterative Enhancement Models. ISO 9000 models UNIT III: Software Design (12 hrs) Basic Concept of Software Design. Analysis. Coupling and Cohesion Measures Design strategies: Function Oriented Design. Charts. Black Box Testing. Unit II: Software Requirement Specification (SRS) (12 hrs) Requirement Engineering Process: Elicitation. SQA Plans. White Box Testing. Similarity and differences from conventional engineering processes Software Development Life Cycle (SDLC) Models: Water Fall Model. Software Components. Architectural Design: Software Architecture. Software engineering processes. Need for Maintenance. Evolutionary development models.

Fundamentals of Software Engineering. Software Engineering. an Engineering Approach” John Wiley. Pankaj Jalote.PHI Publication. Efforts. Software Engineering. Narosa Publication. 3. Fundamentals of Software Engineering. R. 6. 2. Schedule/Duration. “Software Engineering. Rajib Mall. Carlo Ghezzi. Software Version Control. K. Page 40 . Constructive cost Models. An Overview of CASE Tools Estimation: Cost. D Manodrioli. 4. Software Risk Analysis and Management Reference Books: 1.S Pressman “Software Engineering: A Practitioners Approach”.K Agarwal and Yogesh Singh.UNIT V: Software Project Management (12 hrs) Software configuration management Activities: Change control Process. 5. McGraw Hill. Resource Allocation Models. M Jarayeri. New Age International Publishers. James Peter. PHI Publication.

declarations. Data grid UNIT –V (10 hrs) Exception. and Radio Buttons. UNIT – II (12 hrs) Basic classes.net framework. UNIT –III (14 hrs) Object Oriented Programming in c# .net.Net Prerequisites Basic knowledge in OOPS Course Outline UNIT – I (10 hrs) the origins of the . methods and events.Net Course Number: 29 Contact Hours: 3 T Number of Credits: 2 Number of Contact Hours: 60 Hrs Aim of the Course To provide the students with the basic knowledge in Visual programming Objectives of the Course To get a general understanding on .NET approach. Text Boxes. Properties. Dataset Class. Introduction to visual studio. Data binding with controls like Text Boxes. benefits of the . The Just-In-Time Compiler visual studio. Connection Objects. Check Boxes. conditionals. arrays. catch and final statements. strings. Data Adapters. architectures of C#. the common language runtime. Page 41 .NET.NET languages. List Boxes. Tree Views. Status Bar and Progress bars. Labels. . enumerations. List Boxes.ADO . List Views. Command Objects.net IDE interface and event driven programming. and user defined exception.. Combo Boxes . C# and . Menus . features of .Image List. Windows Forms.net.Net Frame Work To get a general understanding on .CA5B11 – Visual programming Using C#. Buttons. NET Framework class library introduction. Constructors and Destructors Method overloading Inheritance UNIT IV (14 hrs) Database :Connected and disconnected mechanism. structured exception handling using try. loops.NET technology . Class and Object. Toolbars.NET .

References 1 . 6. Create and use user controls in a Windows Forms application Create menus in a Windows Forms application Add code to form and control event procedures in a Windows Forms application Validate user input in a Windows Forms application Bind Windows Forms applications to various data sources by using Microsoft ADO. Page 42 .Net . 3. 4. 2.Net Prerequisites Basic programming skills in C++ & knowledge in OOPS Course Outline Create and populate Windows Forms. Wroax publications Course Number:29 Contact Hours: 2 L Number of Credits: 1 Number of Contact Hours: 30 Hrs Aim of the Course To develop the programming skills in C#. 5. Debug a Windows Form Application (try/catch) 1.Net Framework Essentials .NET 7.3rd Edition (O’Reilly) 2. Beginning with C#.Net Objectives of the Course To learn the basic programming skills in .

client –side scripting versus – server side scripting –using personnel web page server or internet information server.WWW. UNIT II (10 hrs) HTML: Introduction to HTML-Essential Tags-Adding Images-Color and Background of Web Pages-Lists and their Types.HTML .URLDomain Names. HTTP-FTPEmail(POP.IMAP.Creating Table-FramesForms-Introduction to DHTML: CSS UNIT III (10 hrs) JavaScript: Introduction to JavaScript –Basics-Writing JavaScript – Running JavaScriptAlert boxes-Accepting input from user-Creating Dynamic webpages using JavaScriptRelating JavaScript to DHTML UNIT IV (10 hrs) Active Server Pages (ASP): Introduction –How ASP work.SMTP)-TELNET-USENET-GOPHER-Search Engine.Open course Offered to other Programmes CA5D01 – Internet Programming Course Number: 30 Contact Hours: 2 T + 2 P Number of Credits: 2 Number of Contact Hours: 50 Hrs (T) +30 Hrs (P) Aim of the Course To provide the students with the basic knowledge in Internet Programming Objectives of the Course To get a general understanding on HTML To get a general understanding on ASP Prerequisites Basic knowledge of Internet Course Outline UNIT I (10 hrs) Introduction to Internet: What is Internet –Services provided by internet.file system objects Page 43 .Linking to External Documents.Browsers.

HTML.Achyut s.UNIT V (10 hrs) Front Page: Front Page Basics.2003. Godbole & Atul Kahate.Pearson Education Asia . Internet and Word wide Web How to Program. Java Script.Deitel &Nieto. Page 44 . Tata McGraw Hill. DHTML. CGI – Evan Bayross – BPB 3. PERL. Web Technologies – TCP/IP to internet application architectures. HTML Black Book – Steven Holzner – Dreamtech Press 2.Phases of Planning and Building Web Sites. 2003 4.Front Page Views-Adding Pictures-Backgrounds-Links References 1.

CA5B12 – Mini Project Course Number: 31 Contact Hours: 2 P Number of Credits: 1 Number of Contact Hours: 30 Hrs Aim of the Course To equip the students with Computer Application Objectives of the Course To develop the software development skill Prerequisites Basic programming knowledge Course Outline Mini Project in any platform using any language of student’s choice Page 45 .

PHP functions for MySQL operations: mysql_connect. variables and scope. Displaying data from MYSQL in webpage Page 46 . Logical. select box.CA6B13 – Web Programming Using PHP Course Number: 32 Contact Hours: 4 T Number of Credits: 3 Number of Contact Hours: 60 Hrs Aim of the Course To equip the students with basic programming skill in Web Designing Objectives of the Course To learn the Web Designing Prerequisites Basic knowledge in HTML Course Outline Unit I (10 Hrs) HTML: Introduction to HTML. PHP functions. button. font and image. underline break. Basic formatting tags: heading. substr. Insertion and Deletion of data using PHP. Loops. Unit IV (10 Hrs) Working with PHP: Passing information between pages. String functions: strlen. font face. PHP advanced functions: Header . Role of Web Server software. Branching statements. Document Methods: write and writeln methods. echo and print. mysql_result. Cookie Object Oriented Programming using PHP: class. size. bgcolor. border. strcmp. Events Familiarization: onLoad. Comparison and Conditional operators. Frameset and frames Unit II (10 Hrs) Javascript: Introduction. Operators: Logical. Conditional Statements. string case. radio button. HTTP GET and POST method. Different attributes like align.password. Operators: Arithmetic. checkbox. object. break and continue. comments. unordered and definition. mysql_select_db. alert. strstr. constructor.superecript. DELETE. destructor and inheritance Unit V (10 Hrs) PHP & MySQL: Features of MySQL.Navigation Links using anchor tag: internal. paragraph. italic.Table tag. underline.onChange Unit III (10 Hrs) PHP: Introduction to PHP. Client side programming.mysql_fetch_object. hidden controls. onClick. Assignment. INSERT. bold.mail and image links. Javascript Functions.strops. data types. including files. Relational. text . HTML Form controls: form. external . mysql_fetch_array. variables. Array constructs: array(). Loops. color.Lists: ordered. subscript. Session. str_replace. Introduction to SQL commands-SELECT.list() and foreach(). mysql_query. mysql_fetch_row. comments. Server side scripting. textarea. script tag. onBlur. break and continue.onSubmit. UPDATE.

CSS. HTML 4.XHTML. Wrox Beginning 2.0 IN SIMPLE STEPS Author : Kogent Solutions Publishers : Wiley 2. Beginning PHP D W Mercer. HTML 4 FOR DUMMIES Author : ED TITTEL & MARY BURMEISTER Publishers: Wiley 3. Jon Duckett. 3RD ED Author : JANET VALADE Publishers: Wiley Page 47 . PHP & MySQL Bible. Wiley Reference Books 1.A Kent.S D Nowicki Publisher:Wrox 4. Web Programming with HTML. Jim Converse & Joyce Park.Reference: 1. PHP & MYSQL FOR DUMMIES.

Properties of multimedia systems.Media and Data streams.Bresenham’s line& circle drawing algorithms UNIT II (12 Hrs) Geometrical transformations.Data stream characteristics. Optical Storage Media Page 48 .Display devices.Speech UNIT IV (12 Hrs) Images. Raster scan algorithms – DDA .CA6B14 – Computer Graphics & Multimedia Course Number: 33 Contact Hours: 4 T Number of Credits: 3 Number of Contact Hours: 60 Hrs Aim of the Course To impart knowledge in computer graphics and multimedia Objectives of the Course To Learn the basics & applications of computer graphics To learn multimedia applications Prerequisites Basic knowledge in graphics and multimedia Course Outline UNIT I (12 Hrs) Origin of computer graphics-Application of computer graphics – Random scan &Raster scan systems.clipping-line&polygon clipping-Basic interaction tasks & interaction hardware-user interaction software UNIT III (12 Hrs) Multimedia_applications.computer image processing-Video –video file formats-video and animation – animation techniques-multimedia software tools-multimedia authoring tools UNIT V (12 Hrs) Data Compression : Storage Space – Coding Requirements –souce.Basic 2D transformations-2D composite transformations Homogeneous coordinate systems and matrix representation of transformations-window to viewport transformation.CRT.Audio:Music –MIDI-audio file formats.entropy and hybrid compressing techniques JPEG –MPEG – DVI .LCD. LED devices-input&output devices .plasma panel.

Ralf Steinmetz & Klara Nahrstedt – “ Multimedia Computing . Judith Jeffcoate “Multimedia in Practice”Prntice Hall India 3.Main References 1. Communication & Applications “ Pearson Education Page 49 . Hern D and Maker “Computer Graphics” Prentice Hall India 2.

CA6B15 – Programming Laboratory II (Programming in Java. PHP) Course Number: 34 Contact Hours: 5 L Number of Credits: 3 Number of Contact Hours: 80 Hrs Aim of the Course To equip the students with basic programming skill in Web Designing Objectives of the Course To learn the Web Designing Prerequisites Basic knowledge in HTML Course Outline Programs implementing features of java Programs implementing features of PHP Page 50 .

Net) Course Number: 35 Contact Hours: 5 L Number of Credits: 3 Number of Contact Hours: 80 Hrs Aim of the Course To equip the students with basic programming skill in Database designing and manipulations Objectives of the Course To learn the database manipulations and .Net applications Prerequisites Knowledge in SQL and VB.CA6B16 – Programming Laboratory III (Programming in RDBMS.Net Course Outline Programs involving SQL manipulations Programs involving VB. VB.Net applications Page 51 .

Life Cycle models. 2006. Srinivasan Desikan & Gopalswamy. UNIT-V Test Planning.”SoftwareTesting” 2007. UNIT II Black-Box Testing: What is Black-Box Testing? . UNIT III System and Acceptance Testing: system Testing Overview – Why System testing is done?– Functional versus Non-functional Testing . Regression Testing: What is Regression Testing? – Types of Regression Testing – When to do Regression Testing – How to do Regression Testing – Best Practices in Regression Testing.Non-functional Testing – Acceptance Testing – Summary of Testing Phases.William E. Execution and Reporting: Test Planning – Test Management– Test Process – Test Reporting –Best Practices. “Effective methods of software testing” Wiley India. Pradeep Oak.Perry. Additional References 1. “Software Testing Principles and Practices” Ramesh. Main References 1. 2 Renu Rajani. Quality control – Testing. Verification and Validation – Process Model to represent Different Phases . Pearson Education. White-Box Testing: Static Testing – Structural Testing Challenges in White-Box Testing. Test Metrics and Measurements: Project Metrics –Progress Metrics – Productivity Metrics – Release Metrics. UNIT-IV Performance Testing: Factors governing Performance Testing – Methodology of Performance Testing – tools for Performance Testing – Process for Performance Testing – Challenges. TMH Page 52 . Management.Functional testing .Open course 2 CA6D02 – Software Testing Course Number: 36 Contact Hours: 4 T Number of Credits: 3 Number of Contact Hours: 60 Hrs UNIT I Phases of Software project – Quality Assurance.Why Black-Box Testing? – When to do Black-Box Testing? – How to do Black-Box Testing? – Challenges in White Box Testing – Integration Testing: Integration Testing as Type of Testing – Integration Testing as a Phase f Testing – Scenario Testing – Defect Bash.

Samba: ftp. Manage an IIS server in a Remote Location. User Profiles Unit III: Managing Windows 2000 or Windows 2003 Part II Managing Printing Services: Adding A Printer. Protocols & Topologies. Monitor and Optimize IIS. Admin Roles & Responsibilities DNS Operation. DHCP Operation Unit II: Managing Windows 2000 or Windows 2003 Part I Installation of Windows OS. Managing Servers. Listing with ps. Managing Terminal Services Managing IIS: Install IIS. System Administration tools. Linux file systems. df. Adding and Managing Printers. The Passed Command Processes: Overview. mounting. Connecting to Shared Printer. Installing and configuring Linux NFS. quot. Apache. Server Hardware. Implement Web Applications. Run Levels. The Super user account. Multi Level DNS. How they work. Manage the IIS metabase. how they differ from other operating systems. Active Directory Concepts. Managing Groups. Unit IV: Managing Linux Part I Overview. Network Components. Package movement Network Services. Controlling and monitoring access to the printer Manage resources and security by using windows Explorer. Responsibilities. Managing and creating User Accounts. Security Page 53 . DHCP. structure. Access Control Lists. Configure authentication. File and Directory Permissions. sftp. The System Policy Editors. Managing Disaster Recovery: use Automatic System Recovery (ASR) to back up and restore server. The inittab and rc files. File Systems & Disk Storage.CA6D02 – Introduction to System Administration Unit I: Introduction to NOS and Administration Overview of Network Operating System: What they are. checking tools. System Start-up. Managing Security Policies. backing up. killing with kill. DNS. Group Policy Management tools and the security configuration and analysis tool Managing DNS. System Logs Managing Users: The Password and group Files. System Shut down Unit V: Managing Linux Part II Managing Printing Services: Overview. Checking with fsck. Local and Remote Printers Disks and File Systems: Partitioning. Creating and Managing Directories: Creating Shared Directory.

CA6B17 –Project Course Number: 37 Contact Hours: 3 P Number of Credits: 2 Number of Contact Hours: 50 Hrs Aim of the Course To equip the students with Computer Applications Objectives of the Course To develop the software development skill Prerequisites Advanced programming knowledge Course Outline Software Projects in any platform using any language of student’s choice Page 54 .