BCA Slybus Purbanchal

Purbanchal University
Bachelor of Computer Application (BCA)
Year: I Semester: I
S.N. Course Code Course Description Credits Lecture Tutorial Practical Total
(Hrs) (Hrs) (Hrs) (Hrs)
1 BCA101SH Mathematics-I 3 3 2 - 5
2 BCA105SH Technical English 3 3 1 - 4
3 BCA170CO Computer System Concepts 3 3 1 2 6
4 BCA175CO Computer Programming in C 3 3 1 2 6
5 BCA178CO Computer Project-I 2 - - 3 3
6 BCA190MS Modern Business Practices 3 3 1 - 4
Total 17 15 6 7 28
Technical English
BCA105SH
Year: I Semester: I
Teaching Schedule
Examination Scheme
Hours/Week
Theory Tutorial Practical Internal Assessment Final Total
Theory Practical Theory Practical
3 1 - 100
20 20 60 -
Course Objectives: The main objective of this course is to develop:

- Skills needed for group discussion, meeting conduction and technical talk.
- Intensive and extensive reading skills in technical and non-technical reading
materials.
- Skills in writing description, official letters and letters of application, proposals
and formal technical reports.
Course Contents:
Unit 1: Oral Communication (12 Hrs)
A. Fundamentals of effective speaking:
Posture, gesture, facial expression, voice, eye contact and space distancing.
B. Group discussion on subjects of general and technical interest
C. Meetings:
a. Notice preparation
b. Agenda preparation
c. Minutes preparation
d. Meeting conduction
D. Technical talk:
a. Writing complete manuscript for technical talk
b. Presenting technical talk based on manuscript
c. Preparing note for technical talk
d. Presenting talks based on notes
Unit 2: Reading: Intensive and Extensive (16 Hrs)
A. Intensive reading:
a. How to tackle intensive reading materials
b. Practicing comprehension on prescribed texts
c. Note making and summary writing
d. Practice on contextual grammar
B. Extensive reading:
a. How to tackle extensive materials
b. Practicing extensive reading
Unit 3: Writing (17 Hrs)
A. Fundamentals of effective writing:
Unity, coherence, conciseness, clarity
B. Description writing:
Mechanical, electrical or electronic objects, tables, graphs, charts, landscape,
technical process
C. Letters:
a. Official letters
i. Standard letter formats
ii. Writing letters for asking and giving information, giving instruction,
letters of request, apology and explanation, complaint and order
b. Letters of application
i. Standard format
ii. Preparing Resume
iii. Writing letters of application
D. Proposal writing:
a. Format for technical proposals
b. Writing technical proposals
E. Technical report writing:
a. Format for technical reports
b. Writing technical reports
F. Presentation techniques
G. Activity
Report writing and presentation on any of the IT related topics
Reference Books:
1. English for Engineers & Technologist, Orient Longman, Anna University, Chennai 1990
2. Adhikari Usha, et al., Communicative Skills in English, Research Training Unit,
Department of Science & Humanities, Institute of Engineering, Pulchowk Campus, 2002
3. Anne Eisenberg, Effective Technical Communication, Mc-Graw Hill, 1982
4. K. W Houp & T. E Pearsall, Reporting Technical Information, 5th Edition, Macmillan
Publishing Company, New York, 1984
5. Leech G. & Savartivk J., A Communicative Grammar of English, ELBS, 1975
6. Collins Cobuild English Dictionary, New Edition, Harper Collins Publishers, 1995
Mathematics - I
BCA101SH
Year: I Semester: I
Teaching Schedule Hours/Week Examination Scheme
3 2 - 100
20 - 80
Objective : Objective of this course is to provide a sound knowledge of calculus and

other related topics.
Contents:
Unit - 1: Sets and Functions : Sets and Algebra of sets, Union, Intersection, Difference,
Complement, Properties and Exercise, Venn Diagram, Real Number System, Intervals,
Absolute Value of Real Number line Relations and functions Graphs of simple
algebraic function. (8 hrs)
Unit - 2: limit And Continuity: Concept of Limit, Left and right hand Limit. Existence
of limits, Indeterminate forms, Infinity as Limit, Idea of x'- . Continuity, definitions,
properties. Exercises on evaluation of limits and test of continuity.
(3 hrs)
Unit - 3: Derivatives:
1. Definitions of Derivatives
(a) Mathematical, (b) Slope of a curve,
(c) Rate of change (relative)
2. Derivative Rules Power, Sum, Product, Quotient, Implicit, Chain,
Parametric(Mainly algebraic)
3. Trigonometric, Exponential, Logarithmic, Inverse trigonometric. (7 hrs)
Unit - 4: Application of Derivatives:
1. Sign of f"(x)-Increasing, Decreasing functions.
2. The Sign Of(x), Concavity, Points Of Inflexion.
3. More about graphs, Simple curve tracing.
4. Local & Absolute extrema.
5. Indeterminate Forms, Exercises, Use of L Hospital's Rule, Taylor's and
Maclaurin’s Series (Without Proofs).
6. Expansions using the above. (7 hrs)
Unit - 5: Integral Calculus:
1. Indefinite integrals as reverse of differentiation.
2. Integration rules- Integration Formulas, Substitutions, Trigonometric
Substitutions, and Integration by parts.
3. Standard Integrals ( ),
),
√(a2-x2) etc.
4. Use of Partial Fractions. (8 hrs)
Unit - 6: Define Integrals:

1. Limit of a sum, with exercises.
2. Fundamental theorem of Integral Calculus.
3. Evaluation of Integrals using Standard Integrals.
Applications in Calculating Area, Length, Volume and Average Value.
(Common Curves Only) (11 hrs)
Unit - 7: Series:
1. Sequence and series, Notations, General terms.
2. Limit of Sequence.
3. Partial Sum of series.
4. Convergent Sequences.
5. Convergence of series.
6. Important Series, Financial Series including their Validities.
7. Tests of Convergences applications only Comparison, Ratio, Logarithmic, etc
including Integral test.
8. Series with non-negative terms, Alternating Series, Absolute Convergence,
Conditional Convergence. (11 hrs)
Unit - 8: Function of two and three variables, Extension of ideas of limits and
continuity, Partial derivatives, Theorem Exercises. Higher order derivatives, Leibnitz
theorem. (8 hrs)
Unit 1. Basic Mathematics Vol. 1.

Unit 2. Basic Mathematics & Calculus with analytic geometry.
Unit 5. Basic Mathematics, Calculus with analytic geometry & Integral
Calculus.
Unit 6. Basic Mathematics, Calculus with analytic geometry & Integral
Calculus.
Unit 7. Algebra, Calculus with analytic geometry & Integral Calculus.
Unit 8. Differentials Calculus & Calculus with analytic geometry.
Recommended Text - Book :

1. Calculus and Analytic Geometry - Thomas and Finney, Narosa Publishing House
(India)
References :
1. Basic Mathematics (Vol. I & II) - D R. Bajracharya et.al
2. Calculus: Different & Integral - R. K. Patnaik.
3. Calculus with Analytic Geometry - Leigthold, Harper & Row
4. Calculus - Larson Hostetler, Health.
5. Integral Calculus - G.D. Pant and G.S. Shrestha.
6. Algebra - G. D. Pant.
7. Differentials Calculus - M.B. Singh and B.C.B.
Computer Programming in C
BCA175CO
Year: I Semester: I
3 1 2 100
20 20 60 -
Objective: The idea of the course is to give the fundamentals of the programming to the
students using "C”.
Contents:
1. Introduction to C: History, Importance of C, Basic Structure of C programs,
Programming Style. Executing a C program. (2hrs)
2. C fundamentals: Character Set, C tokens, keywords and identifiers, Constants,
Variables, Data types, escape sequences, preprocessor directives. (2 hrs)
3. Operators and expression : Arithmetic of Operators, Assignment operators, Increment
and Decrement operators, Logic operators, Assignment operators, Conditional
operators, Bit- wise operators. Arithmetic expressions, Evaluation of expressions.
(5 hrs)
4. Data input and output: Reading a character, writing a character, formatted input,
formatted output. (2 hrs)
5. Decision Making and Branching: IF Statement, The IF-ELSE Statement, The Switch
Statement, the GOTO Statement. (4 hrs)
6. Loops: The WHILE Statement, the DO WHILE Statement, the FOR Statement.
(3 hrs)
7. Arrays: Introduction, One Dimensional arrays, Two Dimensional arrays, Multi-
Dimensional arrays. (5 hrs)
8. Functions: Introduction, The form of C function, Return values and their types, calling
a function. Categories of functions, Recursion, Function and Arrays, 'C' built in
functions. (5 hrs)
9. Structures and Unions: Introduction, Structure definition, Arrays of structures, Array
within structure, Nesting structure, Union and its importance, structures and
functions. (4 hrs)
10. Pointers: Introduction, Accessing the address of a variable, Declaring and initializing
pointers, Accessing a variable through its pointer, Pointers and arrays, Pointers and
functions, Pointers and structures. (8 hrs)
11. File Management in C: Introduction, Defining and opening a file, Closing a file,
Input/output operations on files. (3 hrs)
12. Introduction to graphics: Initialization, graphical mode, simple program using built-
in graphical functions. (2 hrs)
References :
1. Schaum's Outline Series, Theory & Problems, Programming with C.
2. Yashvant Kanetkar, Let us C, BPB Publications.
3. Balguruswamy, Programming in "C", Tata McGraw-Hill Publishing.
LABORATORY EXERCISE FOR BCA 105 CS
Ex. No. Exercise Topic
1. Display messages as output

2. Simple interest calculation
3. Area of circle
4. Character conversion from lower case
5. Character conversion from upper case to lower case
6. Reading and writing a line of text
7. Averaging student exam scores
8. Compound interest calculation
9. Syntactic errors
10. Execution errors (Real root of a quadratic equation)
11. Debugging a program
12. Debugging with an interactive Debugger
13. Calculating total expenses
14. Calculating bonus
15. Calculating division of students
16. Generating consecutive integer quantities
17. Averaging a list of numbers
18. Converting Several lines of character to uppercase
19. Encoding a string of characters
20. Repeated compound interest calculations with error trapping
21. Solution of an algebraic equation
22. Calculating depreciation
23. Searching for palindromes
24. Largest of three integers quantities
25. Calculating factorials
26. Simulation of a game of chance
27. Printing backwards
28. The tower of Hanoi
29. Average length of several lines of text
30. Search for a maximum
31. Generating Fibonacci numbers
32. Deviation about an average
33. Reordering a list of numbers
34. A piglatin generator
35. Adding two tables of numbers
36. Recording a list of strings
37. Analyzing a line of text
38. Displaying the day of the year
39. Future value of monthly deposit (compound interest calculations)
40. Updating customer records
41. Locating customer records
42. Processing a linked list
43. Raising a number to a power
44. Creating a data file (lower case to upper case text conversion)
45. Reading a data file
46. Creating a file containing customer records
47. Updating a file containing customer records
48. Creating an unformatted data file containing customer records
49. Graphic programming- Writing video-game program in ‘C’
Computer System Concepts
BCA170CO
Year: I Semester: I
Teaching Schedule
Examination Scheme
Hours/Week
3 1 2 100
20 20 60 -
Course Objective: The main objective of this course is to provide a foundation of

computer systems and their applications in various fields. The course also provides
the basic concepts of different types of hardware and software components and other
related topics.
Course Contents:
Unit 1: Introduction to Computer: (6 Hrs)
 Characteristics, applications, and components of computer
 History and generation of computers
 Classification of computer based on purpose, size and technology
Unit 2: Basic Computer Organization and Computer Peripherals: (6 Hrs)
 Block diagram of computer system
 Input devices: Keyboard, mouse, and other types of input devices
 Output devices: Monitor, printer, and other types of output devices
Unit 3: Computer Storage: (6 Hrs)
 Concepts of memory and requirements of storage devices
 Classification and types of storage devices
 ROM and RAM with their types
 Magnetic devices and Optical devices
Unit 4: Computer Software: (4 Hrs)
 Introduction and types of software
 Definition and functions of operating system
 Programming languages and their types
Unit 5: Introduction to Database: (2 Hrs)
 Meaning of data and information
 Concepts and characteristics of database and DBMS
Unit 6: Networks and Internet: (6 Hrs)
 Introduction and uses of network
 Types and topologies of network
 Introduction, features and applications of Internet
 Concepts of intranet and extranet
 Network media and network software
 WWW, E-mail, E-commerce
Unit 7: Information Security: (2 Hrs)
 Computer crime, viruses and threats
 Cyber law and ethical issues
Unit 8: Computer Hardware: (12 Hrs)
 Motherboard and its parts, slots, daughterboard, and expansion slots
 BIOS, SMPS, CMOS, and Microprocessor
 Assembling and disassembling of computer system
 Installation of operating system, utilities and application software
 Customizing software
 Installation of printer, and drivers
 Routine checks and troubleshooting, virus protection
 Network cabling and Internet connectivity
Laboratory Works:
1. Basics of Windows and User Interface:
— Using mouse and moving icons on the screen
— The My Computer icon, the Recycle Bin icon, Status Bar, Start button, Menu Bar
— Opening, closing and running an application
— Using Windows Explorer to view files, folders and directories
— Creating and renaming files and folders
— Windows settings: control panel, wallpapers, screensavers, date and time, sound
— Advanced features: using right mouse button, shortcuts, notepad, accessories
2. Basic DOS Commands:
— Comparison of DOS and Windows, switching between DOS and Windows
— Creating, renaming, copying, moving, and deleting files and directories
3. Word Processing:
— Basics: opening and closing documents, saving documents, page setup, printing,
scrolling around a document
— Text manipulation and formatting: text selection, cut, copy and paste, font, Bold,
Italic and Underline, text alignment, line and paragraph setting, changing font,
size and color, bullets and numbering, changing case
— Table manipulation: drawing and inserting table, changing cell width and height,
alignment of text in cell, inserting and deleting rows and columns, table borders
4. Spreadsheets:
— Basics: opening and closing of spreadsheet, multiple sheets, Menu Bar, cell
inputting, cell addressing
— Manipulation of cells: entering texts, creating tables, setting cell width and
height, copying of cells
— Formulas: sum, average, percentage, and other basic functions
— Preparing invoices/budgets, totaling of transactions, maintaining daily and
monthly reports
5. Presentations:
— Basics: opening a PowerPoint presentation, using Wizard to create a presentation
— Slide presentation: title, text, picture, table, font color and font size, bullets and
indenting, slide design, background, slide numbering, slide show, slide
animation, slide sorting, printing slides
6. Computer Communication and Internet:
— Basics of computer network, WWW, and websites
— Web browsing, net surfing, chatting, using e-mails
7. Assembling, Disassembling, Installation, Troubleshooting, Cabling, and
Networking
Reference Books:
1. Peter Norton, "Peter Norton's Introduction to Computer", Tata McGraw-Hill
Publishing Company Limited
2. Robert Cowart, "Mastering Windows-Premium Edition", BPB Publication
3. Ron Mansfield, "Mastering Word", BPB Publication
4. Thomas Chester, "Richard A. Alden, Mastering Excel", BPB Publication
5. Katherine Murray, "Mastering Power Point", BPB Publication
6. Shankar N. Adhikary, Ajay K. Shah, "Business Application of Computers",
Buddha Publication
7. Winn L. Rosch, "The Hardware Bible", 3rd Edition, PHI
8. Mark Minasi, "The Complete PC Upgrade & Maintenance Guide"
9. Scott Mueller, "Upgrading & Repairing PCs"
10. Alexis Leon & Mathews Leon, "Fundamentals of Information Technology",
Leon Techworld
11. P. K. Sinha, "Computer Fundamentals", BPB Publication
12. V. Rajaraman, "Fundamentals of Computer"
Modern Business Practices
BCA 190 MS
Year : I Semester : I
Theory Practical * Theory ** Practical
3 1 - 100
20 - 80
* Continuous
** Duration: 3 hours
Objective: The basic objective of this course is to impart basic knowledge of
business organization and management
Contents:
A. Business Organization [5 hrs]
1. Nature of Business (Concept & feature)
2. Forms of Business organization
a) Sole Proprietorship (Definition, features, merit & demerits)
b) Partnership (Definition, features, merit & demerits)
c) Joint Stock Company (Definition, features, merit & demerits)
B. Management [5 hrs]
1. Concept and definition of Management.
2. Functions of management (overview) :
A. Planning [5 hrs]
a) Concept of planning
b) Types of plan
c) Steps in planning
d) Implementation of plans (Major factors effecting implementation of plan).
B. Organizing [5 hrs]
a) Concept of organizing
b) Structural concept of organizing
c) Process concept of organizing
d) Organization Structure (Bureaucratic, structures, matrix structure and
virtual organization structure)
C. Directing [2 hrs]
a) Concept and nature of directing (b) Principle of directing
(c) Human relations problems in directing
D. Controlling [2 hrs]
a) Concept and importance of controlling
b) Process of controlling
C. Human resource Management
1. Importance and significance of HRM [1 hr]
A. Procurement Function [5 hrs]
(a) Human resource planning (b) Job analysis
(c) Recruitment (d) Selection
(e) Socialization
B. Maintenance Function [3 hrs]
(a) Compensation &Incentive
(b) Discipline
(c) Grievance handling
C. development Function [5 hrs]
(a) Need assessment
(b) Training methods (on & off the job)
(c) Training evaluation
(d) Management development concept
D. Motivation Function [3 hrs]
(a) Concept motivation
(b) Theories of motivation (hierarchy of needs, motivation-hygiene theory,
theory x & theory Y)
D. Marketing
1. Meaning of marketing [5 hrs]
(a) Core concept of marketing
(b) Marketing Mix
(c) Concept of buyer behavior
(d) Need for understanding buying behavior
(e) Customer value & satisfaction
2. Implementation of Marketing Program [2 hrs]
(a) Product concept and types of product
3. Distribution [2 hrs]
(a) Meaning of distribution
(b) Importance of distribution
4. Promotion [3 hrs]
(a) Concept of promotion
(b) Promotion mix-
(i) Advertising, (ii) Publicity,
(iii) Sales Promotion
(c) Personal Selling
References
1. Ricky W. Griffin, Management, AITBS, Publisher & Distributors, Delhi.
2. Stephen P. Robbins & Mary Coulter, Management, Prentice Hall of India Ltd., India.
3. Dr. G. R. Agrawal, Organization and Management, M.K.Publisher.
4. David A. Decanzo A. & Stephen P. Robbins, Personal/ Human Resources
Management, Prentice Hall of India Ltd., India.
5. Dr. G.R. Agrawal, Marketing Management in Nepal, M.K. Publisher.
6. Dr. G.R. Agrawal, Human Resources Management in Nepal, M.k. Publisher.
7. Philip Kotler, Principle of Marketing, Prentice Hal of India Ltd., India.
Computer Project-I
BCA178CO
Year: I Semester: I
- - 3 100
- 40 - 60
Objective: To design and complete the software project by using high-level language
(C-Programming). On the completion of the project, student will be able to
develop small scale of software in C programming.
Course Contents:
A total 45 hours covering features of C programming techniques will be
assigned to the students. Topic must be identified and instructed to each
group, and at last students must prepare and submit written reports and
give the oral presentation.
General Procedure:
1. Information Gathering
2. System requirements specifications
3. Algorithms and Flowchart
4. Coding Techniques
5. Result
6. Documentation
The Project document shall include the following:
1. Technical description of Project
2. System aspect of the project
3. Implementation of project
4. Project tasks and time schedule
5. Project team members
6. Project Supervisor
Project Evaluation Criteria for Internal assessment:

The marks allocated for the project should be evaluated based on the following criteria:
 Title identification and Proposal Writing— 10 Marks
 Mid-term Presentation — 20 Marks
 Pre-final Submission and final Presentation — 30 Marks
Project Evaluation Criteria for External assessment:
 Project Documentation— 20 Marks
 Final Presentation — 10 Marks
 VIVA--- 10 Marks
Year: I Semester: II
S.N. Course Course Description Credits Lecture Tutorial Practica Total

Code (Hrs) (Hrs) l (Hrs) (Hrs)
1 BCA102SH Mathematics-II 3 3 2 - 5
2 BCA171CO Digital Logic 3 3 1 2 6
3 BCA172CO Microprocessor & Assembly 3 3 1 2 6

Language
4 BCA176CO Object-Oriented Programming 3 3 1 2 6

in C++
5 BCA179CO Computer Project-II 2 - - 3 3
6 BCA191MS Financial Accounting 3 3 1 1 5
Total 17 15 6 10 31
Mathematics-II
BCA102SH
3 2 - 100
20 - 80 -
Course Objective: To understand vectors in space, curves in space and their

applications, along with the matrix algebra and its uses in solutions of equations.
Course Details:
Unit - 1 Fundamental of Vectors: (10 hrs)
Vector, components, sum and difference of vectors, equal vectors, zero vector, unit
vector, vectors in a plane, vectors in space, use of i, j, k Direction cosines, Direction
ratios, relations among the direction cosines modulus of vectors, distance between two
points, the scalar product and vector product of two vectors and their properties, a.b. = 0
 a┴b, axb = 0  a ║b, and other relations, including physical applications. Product of
three and more vectors (definitions and simple examples only). Coordinates in space: (i)
Cartesian, (ii) Cylindrical, (iii) Spherical and transformations from one system to
another, with simple applications.
Unit-2 Differentiation of Vector function: (5 hrs)

Definition of derivatives of vectors functions, Exercise involving derivatives of vector
functions, d/dt(r,.r2), d/dt (r1 xr2),etc. Differentiation of Ф, .F, xF and simple
relations involving grad, div and curl. Definition of directional derivatives and their
evaluation.
Unit-3 Plane Analytic Geometry:

(a) Conic section as sections of a cone. Standard equation and general equation of a
circle. Condition for second degree equation to represent a circle. Determination of
centre and radius of a circle in the form (2 hrs)
(b) Definition of parabola as the locus of points equidistant from a point and a line.
Derivation of equation to a parabola in the form Determination of vertex,
focus, axis, directrix of a parabola in the general form. Condition for second degree
equation to represent a parabola. (2 hrs)
(c) Ellipse as the locus of points the sum of whose distances from two points is a constant.
Derivation of equation to a parabola in the standard form, Centre, foci, vertices, directrices,
eccentricity of (x – h)2/a2 +(y - k)2/b2=1by changing into with X x-h, Y=
y - k. Condition for second degree equation to represent an ellipse. (2 hrs)
(d) Hyperbola as the locus of points the difference of whose distances from two points is
a constant. Equation in the form
Centre, foci, vertices, directrices and
eccentricity determination. Condition for second degree equation to represent a
hyperbola. Asymptotes of a hyperbola in the standard form. (2 hrs)
(e) Quadratic curves, Conditions for the general equation of second degree to represent a
circle, a parabola, an ellipse and a hyperbola. Use of discriminant to identify the
curve. Reduction to the standard form and determination of centre, vertex, foci,
directrices and axes. (2 hrs)
Unit-4 Differential equations: (10 hrs)

Definition, order, degree, formation by elimination of constants, Solution of differential
equation of 1st order-1st degree, Variable separation, homogeneous, exact, linear,
reduction to Linear equations.
Second order linear equations with constant coefficients, Second order homogeneous
equation.
Unit-5 Matrix Algebra: (5 hrs)

Introduction to Matrices, sum and differences of Matrices, Scalar multiplication,
Multiplication using Matrices of third order,
Determinants, properties, Transpose, Adjoint and Inverse of Matrices.
Unit-6 Linear Equations: (5 hrs)

Consistent and Inconsistent equations (linear), Dependent and independent system,
Solution of systems of 2 and 3 linear equations by (i) Crammer's rule, (ii) Gaussian
Elimination and (iii) Inverse Matrix.
Reference Books:
1. Calculus with Analytical Geometry - Thomas & Fenny
2. A Text Book of Vector Calculus - M. B. Singh & B.C. Bajracharya
3. Basic Mathematices, Vol. I & II - D. R. Bajracharya et al
Digital Logic
BCA171CO
3 1 2 100
20 20 60
Objective : To provide a foundation in digital electronics applicable to computers science

students.
Contents :
1. Number system and their arithmetic : Decimal, Binary, Octal, Hexadecimal, Inter-
conversion among different number systems BCD, Gray code, ASCII code, Binary
addition, Subtraction using 1's & 2's complement, Multiplication, Division.
[5 hrs]
2. Logic functions and gates : AND, OR, NOT, NOR, NAND, XOR, XNOR, Gates symbols
and truth table, Tri-state logic. [3 hrs]
3. Boolean algebra: Boolean constant, variables, expressions, function, laws, Sum of
products and Product of sums equations, Simplification using Boolean algebra and
Karnaugh-maps, Don't care condition. [8 hrs]
4. Combinational logic circuits:Half and full adder, Subtractors, Combinational design
example, Mux, Demux, Encoder, Decoder, Seven segment decoder.
[10 hrs]
5. Flip-flops :RS flip-flop, Dflip-flop, JKflip-flop, Edge triggered flip-flop, Master-Slave
flip-flop. [6 hrs]
6. Sequential Circuits : State Diagram, Simple Sequential Circuits. [3 hrs]
7. Registers and Counters : Register, Left and right shift register, Ripple up and down
counter, Decade counter, Mode counter, Synchronous counter, Ring counter,
Application of the counter, Serial in serial out, Serial in parallel out, Parallel in serial out,
Parallel in parallel out. [8 hrs]
8. Memories : ROM, PROM, EPROM, static RAM, dynamic RAM. [2 hrs]
Digital Lab Contents:
Experiment 1 To determine the truth table of Two-Input OR Gate

Experiment 2 To determine the truth table of Two-Input NOT Gate
Experiment 3 To determine the truth table of Two-Input NAND Gate.
Experiment5 To determine the truth table of Two-Input NOR Gate.
Experiment 6 To determine the truth table of Two-Input EX-OR Gate.
Experiment 7 verification of Demerger's theorem experimentally AND using NAND
Experiment 8 verification of Demerger's theorem experimentally OR using NAND
Experiment 9 Verification of Demerger's theorem experimentally AND using NOR
Experiment 10 Verification bf Demerger's theorems experimentally multiple input
gates.
Experiment 11 Sum of product, product of sum.
Experiment 12 Encoder/Decoder.
Experiment 13 Multiplexer/ DeMultiplexer.
Experiment 14 7-segment decoder [Design exercise not implementation with logic
gates]
Experiment 15 Exercise Using BCD to 7-segment IC [7447].
Experiment 16 Half-Adder/ Full-Adder.
Experiment 17 Half-Su tractor/ Full-subtractor.
Experiment 18 RS-Flip Flop
Experiment 19 JK-Flip Flop
Experiment 20 DT- Flip Flop
Experiment 21 Shift Right/Shift Left Resister.
Experiment22 Ripple Counter
Experiment 23 Serial in Seria1 out.
Experiment 24 Parallel in serial out.
Experiment 25 Serial in Parallel out.
Experiment26 Up/down counter.
Experiment 27 Mode 10 counter.
Experiment 28 Synchronous ring counter
References :
1. Digital principles and applications, Albert Paul Malvino & Donald P. Leach, Tata
McGraw Hill, Fourth Edition
2. Digital logic and computer design, M. Morris Mano, PHI, 12 th Edition
3. Digital System, Ronald J. Tocci- PHI
4. Paul B Zbar, .Albert P Malvino, Michael A Miller: Basic Electronics- A Text Lab Manual,
Tata Megraw - Hitl psllishing Compnay Ltd., New Delhil.
Microprocessors and Assembly Language
BCA172CO
3 1 2 100
20 20 60 -
Course Objective: To become familiar with the operation, programming and application
of microprocessors.
Course Contents:
1. Introduction [3 hrs]
Microcomputer, Block diagram of Microcomputer, Microprocessor, Overview of
Microprocessor family.
2. Intel 8085 Microprocessor [14 hrs]
Pin Diagram and Pin Functions, Internal Architecture, Addressing Mode,
Instruction Set with classification, Instruction format and programming, Timing
Diagram.
3. I/O Interface [6 hrs]
Introduction, I/O port addressing, Decoding, Serial and Parallel communication.
The 8255 Programmable Peripheral Interface (Block diagram and Modes), The 8251
(Block diagram and Modes).
4. Interrupts [2 hrs]
Introduction, Types of Interrupts in 8085/8086, Basic Interrupt Processing.
5. Memory Interface [2 hrs]
Introduction, Address Decoding, 8088 Memory Interface.
6. DMA [1 hr]
Introduction, Basic DMA Operation.
7. 8086 Instruction Description and Assemble Directives [14 hrs]
Pin Diagram and Pin Functions, Internal Architecture, Addressing Mode, Instruction Set
with classification and Programming.
8. Introduction to Higher Series of Intel Processors - A Comparative Study.
[3 hrs]
Reference Books:
1. Barry B. Brey, The INTEL Microprocessors 8086/8088, 80186, 80286, 80386 and 80486
(Architecture, Programming and Interfacing), PHI
2. Yu Chung Liu & G. A. Gibson, Microcomputer Systems: The 8086/8088 Family
Architecture, Programming and Design, EE Edition
3. Adam Osborne & J. Kane, An Introduction to Microcomputer, Vol. II - Some Real
Microprocessors, Galgotia Book Source, New Delhi
4. Douglas V. Hall, Microprocessor & Interfacing, Programming and Hardware, Tata Mc-
Graw Hill
Lab - Experiments
All Laboratory work will be based on assembler (8086). Before starting lab
exercises, students should verify all the basic instructions.
Laboratory 1
To enter and to trace a simple assembly language program using DOS DEBUG
routine.
Laboratory 2
To write a simple assembly language program that will make logical decisions based
on program data, DOS DEBUG routine.
Laboratory 3
To enter and trace a program that contains a loop e.g. the loop instruction to use CX
register as a default index counter and decrement CX at the end of each pass,
compare CX to zero and if it is grater than zero, jump to the beginning of the loop.
Laboratory 4
To modify the program from laboratory 3, so that the looping is accomplished in a
different way. Modify the program so that it does not rely on the 'loop' instruction,
but rather, performs the loop operations separately. The output of laboratory 3 and
laboratory 4 should be same.
Laboratory 5
To complete an assembly language program to carry out given logical process and
then assemble, link and run. For example, to complete a given program so that it will
read a single character from the keyboard and test the character and based on the
range within which it falls, either print it, or change it to lower case and print it, or
print it unmodified.
Laboratory 6
To modify the program of laboratory 5, so that it will read a string of characters and
select them by the same as in laboratory 5.
Object-Oriented Programming in C++
BCA176CO
3 1 2 100
20 20 60 -
Course Objective: The objective of this course is to introduce students to the programming
methodology using the C++ language. This module should be associated with laboratory
experiments to augment the concepts taught in the class.
Course Contents:
1. Introduction to object-oriented language: Comparing procedural programming and
object oriented programming paradigm, Objects, Classes, Inheritance, Reusability,
Creating new data types, Polymorphism, Applications and benefits of using OOP.
[2 Hrs]
2. C Language Basic Syntax: Derived types, Standard conversion and promotions, new
++
and delete operators, constants, Enumeration, comments. [2 Hrs]

3. Function in C : Function overloading, default arguments, inline function.
++ [3 Hrs]
4. Classes & Objects: Introduction, class specification, data encapsulation, class objects,
accessing class members, defining member functions, this pointer, static function, pointers
within a class passing objects as argument, returning objects from functions, friend
function and friend classes. [6 Hrs]
5. Constructor and Destructor: Function of constructor & destructor, syntax of constructor
and destructor, types of constructors. [4 Hrs]
6. Operator overloading: Introduction, operator overloading restrictions, overloading unary
and Binary operators, Operator overloading using a friend function, Data conversion;
conversion between basic types, conversion between objects and basic types, conversion
between different classes. [6 Hrs]
7. Inheritance: Introduction, Types of Inheritance, Inheritance, Base class pointers to Derived
class pointers, constructors and destructors in Derived classes, Benefits and cost of
Inheritance. [6 Hrs]
8. Virtual functions and Polymorphism: Introduction, Virtual function, Pure Virtual
function and Abstract Classes, Early versus Late Binding. [5 Hrs]
9. Input/Output: Stream based input/output, input/output class hierarchy, File
input/output. [6 Hrs]
10. Advance C++ topics: Templates, Introduction to Templates, Function Templates, Class
Templates. [3 Hrs]
11. Exceptions: Introduction to Exceptions, Exception Handling Model, Exception Handling
Construct; try, throw, catch. [2 Hrs]
Laboratory: There shall be laboratory classes covering all the features of object-oriented language.
Reference Books:
1. Robert Lafore, Object-Oriented Programming in C++, Galgotia Publication, India
2. Deitel & Deitel, C++ How to Program, 3rd Edition, Prentice Hall
3. Navajyoti Barkakati, Object-Oriented Programming in C++, Prentice Hall of India
4. Venugopal, Rajkumar & Ravishankar, Mastering C++, Tata Mc-Graw Hill Publication,
India
Computer Project-II
BCA179CO
- - 3 100
- 60 - 40
Course Objective:
To design and complete the software project in an object-oriented language. On the
completion of the project, student will be able to develop small scale software in C++
programming language.
Course Contents:
There should be a total of 45 hours covering important features of object-oriented
programming. A software development project will be assigned to students in a group
(up to 3). A relevant topic shall be identified and instructed to each group. Students must
develop the assigned software, submit written report, and give oral presentation.
General Procedure:
1. Topic Selection
2. Information Gathering
3. System Requirements and Specifications
4. Algorithms and Flowcharts
5. Coding
6. Implementation
7. Documentation
The project document shall include the following:

1. Technical description of the project
2. System aspect of the project
3. Project tasks and time-schedule
4. Project team members
5. Project supervisor
6. Implementation of the project

 VIVA - 10 Marks
Financial Accounting
BCA 191 MS
4 1 1 100
20 20 60 -
Course Objective: The basic objective of this course is to impart the students with the
fundamental knowledge of financial and cost accounting, and the computerized accounting
system.
Course Contents:
1. Conceptual framework of accounting: Meaning, Nature & Scope of Accounting, Need of
accounting information, Accounting principles, standards & bases, Concepts of capital &
revenue, Rules for Debit and Credit. [4 Hrs]
2. Computerized accounting system: Concepts of grouping the accounting heads, schemes
of assisting the codes to accounting heads, accounting procedures used in practice for
recording cash, bank and journal transactions using appropriate vouchers.
[5 Hrs]
3. Preparation of ledgers, cash book and bank book. [3 Hrs]
4. Preparation of trial balance and final accounts of a company. [6 Hrs]
5. Inventory accounting and control: JIT inventory system, Economic order quantity (EOQ)
analysis, ABC analysis, VED analysis, inventory turn-over ratio, Cost price method: LIFO, FIFO,
HIFO and NIFO. Payroll procedure, accounting system for preparing and maintaining
payroll. [7 Hrs]
6. Standard costing: Standard cost, standard costing &budgetary control, standard cost card,
Material variance, Labor variance, Overhead variance. [5 Hrs]
7. Ratio analysis: Classification of ratio, Balance sheet ratio, Profit and Loss accounts ratio,
Composite or mixed ratio for management, Ratio for creditors, Ratio for shareholders.
[5 Hrs]
8. Cash Flow Statement (Direct Method) [5 Hrs]
9. Depreciation: Meaning, methods of depreciation, straight-line method and diminishing-
balance method. [5 Hrs]
Laboratory:
Emphasis should be on using accounting package (e.g. Tally, Facts, etc.) to prepare final accounts
of any organization.
Reference Books:
1. T. S. Gerewal, Introduction to Accounting
2. S. P. Jain & K. L. Narang, Cost Accounting Principles & Practices, 15th Rev. Ed. 1999
3. K. G. Gupta & D. C. Sharma, Management Accounting, S. J. Publication
4. S. P. Jain & K. L. Narang, Financial Accounting
5. Sukla & Gerewal, Advanced Accounts, S. Chand
6. Jawahar Lal, Cost Accounting, Tata Mc-Graw Hill Publishing
Year: II Semester: I
1 BCA207SH Sociology 2 2 1 - 3
2 BCA271CO Computer Architecture 3 3 1 - 4
3 BCA273CO Data Structure & Algorithm 3 3 1 2 6
4 BCA270CO System Analysis & Design 3 3 1 - 4
5 BCA275CO User Interface Design 3 3 1 2 6
6 BCA278CO Computer Project-III 3 - - 3 3
Total 17
Sociology
BCA207SH
Year: II Semester: III

Teaching Schedule
Hours/Week Examination Scheme
2 1 - 100
20 - 80 -
Course Objective: To provide fundamental knowledge on the concept of sociology and to

understand social, cultural, economic, political and technical aspects. The purpose is to enable them to
apply those basic concepts in addressing the significant issues inherent in Nepalese society and
culture.
Course Contents:
Unit 1: Introduction [3 Hrs]
a. Definition and evolution of sociology
b. Relationship of sociology with economic, political science and computer science
c. Applications of sociology in identification, implementation and evaluation of social and
technical issues.
Unit 2: Social and Cultural Change [7 Hrs]
a. Process
b. Theories of social change [evolutional, functional, conflict]
c. Factors of social change [economic, technology, education, demography]
d. Role of media and communication in social and cultural change
e. Innovation and diffusion
f. Resistance of social change
g. Technological changes and its consequences
Unit 3: Understanding Development [5 Hrs]
a. Definition and approaches of development
b. Indicators of development
c. Features of developing countries
d. Development planning
e. Role of national and international community and state
Unit 4: Process of Transformation [3 Hrs]
a. Modernization
b. Globalization
c. Migration
Unit 5: Characteristics of Nepali Society and Culture [7 Hrs]
a. Historical development of Nepal
b. Demographic composition
c. Issue of gender
d. Caste and ethnic group
e. National integration and differentiation
f. Social stratification
g. Social problems
h. Social control
Unit 6: Ethical Issues in IT [5 Hrs]
a. Definition of profession
b. Professional ethics
c. Code of conduct
d. Ethical dilemma and problems
e. Disciplinary action
f. Corporation social responsibility
Reference Books:
1. Alex Inkles, "What is Sociology? Introduction in the Discipline & Profession", Prentice Hall of
India
2. G. M. Foster, "Traditional Culture & Impact of Technological Change"
3. Rishikeshav Raj Regmi, "Dimension of Nepali Society & Culture"
4. C. N. S. Rao, "Principle of Sociology with an Introduction of Social Thought", S. Chand & Co.
Ltd.
5. Pratley Peter, "The Essence of Business Ethics", Prentice Hall of India, New Delhi
6. A. Giddens & D. Mitchell, "Introduction to Sociology", 3rd Ed., London, W. W. Norton &
Company
Computer Architecture
BCA271CO
Year: II Semester: III

Teaching Schedule
3 1 - 20 - 80 - 100
Course Objective: To provide the concepts of computer architecture as well as computer

organization and design.
Course Contents:
1. Introduction [3 Hrs]
Harvard architecture, Von-Neumann architecture, Instruction execution, Design principles for
modern computers, Instruction level parallelism
2. Computer Organization and Design [5 Hrs]

Instruction codes, Computer registers, Computer instructions, Timing and control, Instruction
cycle, Memory reference instruction, Input and output interrupt
3. Control Unit [5 Hrs]

Control memory, Address sequencing, Microprogram example, Design of control unit
4. Central Processing Unit [5 Hrs]

General register organization, Stack organization, Instruction format, Addressing modes, Data
transfer and manipulation, Program control, RISC, CISC
5. Computer Arithmetic [7 Hrs]

Addition, Subtraction, Multiplication, and Division algorithms, Booth algorithms, floating point
arithmetic (Addtion, Subtraction, Multiplication and Division).
6. Input Output Organizations [5 Hrs]

Peripheral devices, Input-output interface, Asynchronous data transfer, Modes of transfer,
Priority interrupt, DMA, Input-output processor, Serial communication
7. Memory Organization [5 Hrs]

Memory hierarchy, Auxiliary memory, Associative memory, Cache memory, Memory mapping,
Virtual memory, Memory management hardware
8. Pipeline and Vector Processing [5 Hrs]

Parallel processing, Pipelining, Arithmetic and instruction pipeline, RISC pipeline, Vector
processing, Array processing
9. Multiprocessor [5 Hrs]
Characteristics of multiprocessors, Interconnection structures, Inter processor arbitration, Inter
processor communication and synchronization, Cache coherence
Reference Books:
1. M. Morris Mano, Computer System Architecture, PHI
2. Andrew S. Tenenbuam, Structured Computer Organization, PHI
3. William Stalling, Computer Organization & Architecture
4. John P. Hayes, Computer Architecture & Organization
Data Structure & Algorithms
BCA273CO
Teaching Schedule
3 1 2 20 20 60 - 100
Course Objective: To provide fundamental knowledge of data structure, various algorithms used, and their
implementations.
Course Contents:
1.1 Data and Data types
1.2 Data structure and its operations and importance
1.3 ADT and its applications and importance
1.4 ADT vs DS
2. Algorithmic Efficiency and its Complexity [2 Hrs]

2.1 Time and space analysis
2.2 Asymptotic notations — Big O, Big Sigma, Theta, Omega
3. Stack [4 Hrs]
3.1 Definition
3.2 Primitive operations with examples representing stack in C
3.3 Stack implementation [PUSH/POP] operations,
3.4 Stack as an ADT
3.5 Prefix, infix and postfix expressions
3.5.1 Definitions
3.5.2 Algorithms for evaluation of infix and postfix expression
3.5.3 Converting an expression from infix to postfix and vice versa
4. Queue [3 Hrs]
4.1 Definition
4.2 Primitive operations with examples representing queue in C
4.3 Queue implementation [Enqueue/Dequeue] operations
4.4 Queue as an ADT
4.5 Types of queue [Linear, Circular, Priority queue and its types]
5. List and Linked List [6 Hrs]

5.1 Introduction to list and linked list
5.2 Advantages of list over stack and queue
5.3 Types of lists [static and dynamic]
5.4 List and list operations
5.5 Array implementation of list
5.6 Linked list as an ADT
5.7 Linked list and its types
5.7.1 Linear linked list — singly linear and doubly linear
5.7.2 Circular linked list — singly circular and doubly circular
5.8 Linked list operations [Insertion/deletion from the front node, from the last node, before a given
node, after a given node]
5.9 Linked stack and Linked queue
5.10 Doubly linked list and its advantages
6. Recursion [4 Hrs]
6.1 Definition and recursive functions
6.2 Recursion vs iteration with advantages and disadvantages
6.3 Application of recursion — Factorial calculation, Fibonacci series, TOH, Natural numbers
multiplication with algorithms and examples
6.4 Efficiency of recursion
7. Trees [6 Hrs]
7.1 Concepts and definitions
7.2 Binary tree and its applications
7.3 Basic operations in binary tree — insertion/deletion, traversing
7.4 Binary tree traversals — pre-order, post-order and in-order
7.5 Height, depth and level of binary tree
7.6 Balanced trees — AVL balanced tree and balancing algorithm, Huffman Coding algorithm
8. Sorting [5 Hrs]
8.1 Definition and types of sorting [Internal and external sort, Insertion and selection sort,
Exchange/bubble sort, Quick sort, Merge sort, Radix sort, Shell sort, Heap and heap sort
8.2 Efficiency of sorting
9. Searching and Hashing [6 hrs]

9.1 Definition of search and concepts of keys, Essentials of searching
9.2 Types of searching — Sequential search, Binary search, Binary tree search
9.3 General search tree
9.4 Definition of hashing
9.5 Hash function and hash table
9.6 Collision resolution technique
9.7 Efficiency comparisons of different search techniques
10. Graphs [7 hrs]

10.1 Definition and representation of graphs
10.2 Application of graphs
10.3 Graph as an ADT
10.4 Adjacency matrix implementation, Transitive closure, Warshall’s algorithm
10.5 Types of graphs
10.6 Graph traversal — depth first search [DFS], breadth first search [BFS]
10.7 Spanning tree and spanning forest
10.8 Kruskal’s algorithm, Round-robin algorithm, Greedy algorithm, Dijkstra’s algorithm
Laboratory: There shall be following lab exercises based on C or C++.

1. Implementation of Stack
2. Implementations of Linear and Circular queues
3. Solution of TOH and Fibonacci Recursion
4. Implementations of Linked list: singly and doubly linked
5. Implementations of Trees: AVL trees, balancing of AVL
6. Implementations of Merge sort
7. Implementations of Search: sequential, tree and binary
8. Implementations of Graphs: graph traversals
9. Implementations of Hashing
10. Implementations of Heap
Reference Books:
1. “Data Structure using C & C++”, Aarton M. Tenenbaum, Y. Langsam, M. J. Augenstein, PHI
2. “Fundamental of Computer Algorithms”, H. Sahani
3. “Data Structure of Program Design in C”, Robert L. Kruse, B. P. Leung, C. L. Tondo, PHI
4. “The Art of Programming, Sorting & Searching”, Donald E. Knuti-1
5. “Data Structure & Application”, Trebly & Sorenson
6. “Introduction to Data Structure & Algorithms with C & C++”, G. W. Rowe, PHI
7. “Fundamentals of Algorithms”, G. Brasssand & P. Bratley, PHI
System Analysis & Design
BCA270CO
Teaching Schedule
3 1 - 20 - 80 - 100
Course Objective: To launch the careers of successful systems analysts or of users assuming an active role in
building systems that satisfy their organization's information needs. The course also provides a solid foundation
of systems.
Course Contents:
1. Overview of Systems Analysis and Design [6 Hrs]
1.1. Introduction to system analysis and design
1.2. Information systems and its types
1.3. Stakeholders of Information systems
1.4. Systems Development Life Cycle and life cycle models (Waterfall, Spiral, Prototype)
1.5. Introduction to analysis and design tools
2. Process and Conceptual Modeling [6 Hrs]

2.1. Introduction to Data Flow Diagram (DFD)
2.2. Concepts used in drawing DFDs
2.3. DFD design (upto level 2)
2.4. Conceptual Modeling
2.5. Entity Relationship Diagrams
3. Logic Modeling [3 Hrs]

3.1. Decision Table
3.2. Decision Tree
3.3. Structured English
3.4. Data Dictionary
4. Systems Analysis [8 Hrs]

4.1. System planning and initial investigation
4.2. Project scheduling
4.3. Requirement analysis
4.4. Types of requirements
4.5. Requirement gathering methods
4.6. Feasibility study and its types
4.7. Steps of feasibility study
4.8. Cost/Benefit Analysis (Payback method, NPV method)
5. Systems Design [10 Hrs]

5.1. Introduction to systems design
5.2. The process and stages of systems design
5.3. Logical and physical design
5.4. Introduction to structured design (Modular system design, Functional strength, Structure chart,
Cohesion, Coupling)
5.5. Database design and overview of file organization
5.6. Normalization and its types (1NF, 2NF, 3NF)
5.7. Input/Output and Forms design
6. System Implementation [6 Hrs]

6.1. Introduction to system implementation
6.2. System installation and its types
6.3. System quality, Software quality assurance (Formal Technical Review, Walkthrough, Inspections)
6.4. System maintenance, types of maintenance, and process of system maintenance
6.5. System testing
7. Object-Oriented Analysis and Design [6 Hrs]
7.1. Object-Oriented Development Life Cycle
7.2. The Unified Modeling Language
7.3. Use-Case Modeling
7.4. Object Modeling: Class Diagrams
7.5. Dynamic Modeling: State Diagrams
7.6. Dynamic Modeling: Sequence Diagrams
Reference Books:
1. “Introduction to System Analysis & Design”, Igor Hawrysjkiewycz, PHI, 4th Edition
2. Jeffery A. Hoffer, Joey F. George, Joseph S. Valacich, "Modern System Analysis & Design", Pearson
Education, 2nd Edition
3. Englewood Cliffs, New Jersey, "System Analysis & Design"
4. Jeffrey L. Whitten, Loonnie D. Bentley, "System Analysis & Design Methods", 5th Edition
5. Grady Booch, "Object Oriented Analysis & Design with Applications", Pearson Education
User Interface Design
BCA275CO
Teaching Schedule
Examination Scheme
Hours/Week
Internal
Theory Tutorial Practical Final Total
Assessment
3 1 2 100
20 20 60 -
Course Objective: To provide the design knowledge of user interface and its environment.
Course Contents:
1. The Goal [8 Hrs]
1.1 Goal Directed Design
1.1.1 User's goals
1.1.2 Features of user interface design
1.2 Software Design
1.2.1 Introduction
1.2.2 Software design vs Interface design
1.3 Models of Interface Design
1.3.1 Conceptual model
1.3.2 Implementation model
1.3.3 Manifest model
1.3.4 Modeling from users’ point of view
1.4 Visual Interface Design
1.4.1 Visual patterns
1.4.2 The canonical vocabulary
2. The Form [8 Hrs]
2.1 Interface Paradigms
2.1.1 Metaphor
2.1.2 Idioms and branding
2.1.3 Affordances
2.2 Child Forms
2.2.1 Usage of window space
2.2.2 Windows pollution
2.3 File System
2.3.1 Introduction
2.3.2 Unified file model
2.3.3 Document management
2.3.4 Storage and retrieval
2.4 Platform Independence
2.4.1 Development platform
2.4.2 Multi-platform development
2.4.3 Inter-operability
3. Software Behavior [6 Hrs]
3.1 Flow
3.1.1 Sensible interaction
3.1.2 Flow of states
3.1.3 Notion of MDI states
3.2 Overhead
3.2.1 Revenue tasks and excise tasks
3.2.2 Eliminating excise tasks
3.3 Task Coherence
3.3.1 Decision-set streamline
3.3.2 Preference threshold
4. User-Computer Interaction [8 Hrs]
4.1 Mouse
4.1.1 Indirect manipulation
4.1.2 Mouse events
4.1.3 Focus and cursor hinting
4.2 Selection
4.2.1 Indicating selection
4.2.2 Insertion and replacement
4.2.3 Additive selection
4.2.4 Group selection
4.3 Gizmos Manipulation
4.3.1 Repositioning
4.3.2 Resizing and reshaping
4.3.3 Visual feedback of manipulation
4.4 Drag and Drop
4.4.1 Source and target
4.4.2 Problems and solutions
4.4.3 Drag and drop mechanisms
5. The Cast [8 Hrs]
5.1 Menu Design Issues
5.1.1 Hierarchy of menus
5.1.2 Drop down menus
5.1.3 Pop up menus
5.2 Menus and its Types
5.2.1 Standard menus
5.2.2 Optional menus
5.2.3 System menu
5.2.4 Menu item variation
5.3 Dialog Boxes
5.3.1 Dialog box basics
5.3.2 Suspension of interaction
5.3.3 Modal and modeless dialog boxes
5.3.4 Problems in modeless dialog boxes
5.3.5 Different types of dialog boxes
5.4 Dialog Box Conventions
5.4.1 Caption bar
5.4.2 Attributes
5.4.3 Terminating dialog box
5.4.4 Expanding dialog box
5.4.5 Cascading dialog box
5.5 Toolbars
5.5.1 Advantages over menus
5.5.2 Momentary button and latching button
5.5.3 Customizing toolbars
6. The Gizmos [7 Hrs]
6.1 Essential and Selection Gizmos
6.1.1 Essential gizmos
6.1.2 Selection gizmos
6.1.3 Combo box
6.1.4 Tree view gizmo
6.2 Entry and Display Gizmos
6.2.1 Entry gizmos
6.2.1 Bounded and unbounded fields
6.2.2 Validation
6.2.3 Edit fields
6.2.4 Display gizmos
6.2.5 Scroll bars
6.3 New Gizmos
6.3.1 Directly manageable gizmos
6.3.2 Visual gizmos
6.3.3 Adding visual richness to gizmos
Laboratory: There shall be lab exercises cover all the features of visual programming environment.
Reference Books:
1. Alan Cooper, “The Essential of User Interface Design”, Wiley DreamTech India P. Ltd.
2. Evangelos Petroutsos, “Mastering Visual Basic 6”, BPB Publication
Computer Project-III
BCA278CO
Teaching Schedule
- - 3 - 60 - 40 100
Course Objective:
After finishing this project, students will be able to develop application software
in Visual Programming Environment using RDBMS.
Course Contents:
A total of 60 lab hours covering all features of Visual Programming Environment
using RDBMS will be assigned to every student. Every group of students (upto 3)
will be assigned a project work related to developing Visual Programming using
any RDBMS tool. Students must develop the assigned software, submit written
report, and give oral presentation.

The practical marks allotted for the project should be evaluated based on the following criteria:

The marks allocated for the project should be evaluated based on the following
criteria:
 VIVA - 10 Marks
Year: II Semester: II
1 BCA293MS Technology & Operations 3 3 1 - 4

Management
2 BCA280CO Numerical Methods 3 3 1 2 6
3 BCA277CO Operating System 3 3 1 2 6
4 BCA272CO Computer Network 3 3 1 2 6
5 BCA276CO Database Management System 3 3 1 2 6
6 BCA279CO Computer Project-IV 3 - - 3 3
Total 18
Technology & Operations Management
BCA293MS
Teaching schedule
Examination Scheme
Hours/Week
3 1 - 100
20 - 80 -
Course Objective: The basic objective of this course is to provide students with the fundamental
knowledge of technology and operations function of an organization.
Course Contents:
1. Management of Technology: [2 Hrs]
1.1. Meaning and role of technology
1.2. Information technology
2. Operations Management: [4 Hrs]
2.1. Nature and concept of operations management
2.2. Differences and similarities between manufacturing and services
2.3. Role of operations management in an organization
3. Operations Strategy: [8 Hrs]
3.1. Strategies: corporate, functional, and unit
3.2. Developing operations strategy including market analysis, competitive priorities
3.3. Flow strategy
3.4. Break-even analysis
4. Process Management: [6 Hrs]
4.1. Introduction to process and process management
4.2. Major process decision: Process choice, Vertical integration, Resource flexibility, Capital intensity
5. Total Quality Management: [5 Hrs]
5.1. Introduction to total quality management [TQM]
5.2. Quality circle [QC]
5.3. TQM tools
5.4. The cost of poor quality
5.5. Continuous improvement
5.6. Employee involvement
5.7. Improving quality through TQM
6. Capacity, Location and Layout Design: [7 Hrs]
6.1. Meaning and measures of capacity planning
6.3. Meaning and factors affecting location decisions
6.4. Meaning, needs and types of layouts
7. Forecasting and Decision-making: [5 Hrs]
7.1. Concepts and judgment method of forecasting
7.2. Introduction to decision-making
7.3. Decision environment: certainty, risk, uncertainty
8. Material Requirement Planning: [4 Hrs]
8.1 Inputs to material requirement planning [MRP]
8.2. MRP factors
8.3. Outputs from MRP
9. Inventory Management: [4 Hrs]
9.1. Concept and importance of inventory management
9.2. Presentation of EOQ model
9.3. JIT system
Reference Books:
1. Lee Krajewski & Larry Ritzman, "Operations Management, Strategy & Analysis", Addison Wesley
Publishing Co.
2. Elwood S. Buffa & Rakesh Sarin, "Modern Production/ Operation Management", John Wiley & Sons
3. James B. Dilworth, "Production & Operations Management", McGraw Hill Publishing Co.
4. Everett E. Adam Jr. & Ronald J. Ebert, "Production & Operations Management", PHI Pvt. Ltd.
5. Suniti Shrestha, "Production & Operations Management"
Numerical Methods
BCA280CO
Teaching schedule
Examination Scheme
Hours/Week
3 1 2 100
20 20 60 -
Course Objective:
To enable students to [a] solve nonlinear equations, [b] use interpolation, [c] fit curves, [d] solve linear
equations, and [e] perform integration and differentiation, using numerical methods through computers.
Course Contents:
1. Errors in Numerical Computation [3 Hrs]
1.1 Introduction to numerical method
1.2 Introduction to error
1.3 Sources of error
1.4 General errors formula
2. Solution of Nonlinear Equations [6 Hrs]

2.1 Introduction
2.2 Bisection method
2.3 Newton Raphson method
2.4 Secant method
2.5 Horner’s rule
3. Interpolation [10 Hrs]

3.1 Introduction
3.2 Finite differences
3.2.1 Foreward differences
3.2.2 Backward differences
3.2.3 Central differences
3.2.4 Symbolic relations
3.3 Newton’s Forward and Backward formulae
3.4 Lagrange interpolation
3.5 Method of Least Square methods [LSM]
3.5.1 LSM for linear equation [y=a+bx]
3.5.2 LSM for quadratic equation [y=a+bx+cx2]
3.5.3 LSM for y=axb
3.5.4 LSM for y=aebx
4. System of Linear Equations [11 Hrs]

4.1 Contingency of a linear system of equations
4.2 Solution of linear system - Direct method
4.2.1 Gaussian Elimination method
4.2.2 Gauss Jordan method
4.2.3 Matrix inversion
4.3 Solution of linear system - Indirect method
4.3.1 Gauss Jacobi iteration method
4.3.2 Gauss Seidel iteration method
4.4 Method of Factorization, LU Decomposition method
4.5 Eigen vectors and Eigen values, Power method
5. Numerical Differentiation and Integration [8 Hrs]

5.1 Numerical Differentiation for 1st and 2nd order differentiation
5.1.1 Forward formula
5.1.2 Backward formula
5.2 Numerical Integration

5.2.1 Trapezoidal rule
5.2.2 Simpson’s 1/3 rule and 3/8 rule
5.2.3 Romberg integration
6. Numerical Solution of Ordinary Differential Equations [7 Hrs]

6.1 Introduction
6.2 Euler’s method and Modified Euler’s method
6.3 Rungekutta 2nd order and 4th order methods
6.4 Boundary value problem [Finite Difference method]
Laboratories: There shall be following lab exercises using any high-level Programming language.
1. Bisection method
2. Newton-Raphson method
3. Secant method
4. Horner’s rule
5. Langrange interpolation
6. Newton interpolation
7. Least Square method for linear equations
8. Gauss Elimination method
9. Gauss Seidel iteration method
10. Integration [Trapezoidal rule, Simpson’s 1/3 rule and 3/8 rule]
11. Euler’s method
12. Rungekutta 4th order methods
Reference Books:
1. S. S. Sastry, “Introductory Methods of Numerical Analysis”, PHI
2. S. Yakowitz & F. Szidarovszky, “An Introduction to Numerical Computations”
3. Dr. V. N. Vedamurthy, Dr. N. Ch. S. N. Iyengar, “Numerical Methods”
4. S. S. Sastry, “Engineering Mathematics Volume-II”, PHI
5. E. Balagurusamy, “Numerical Methods”
6. B.S. Grewal, “Numerical Method “
Operating System
BCA277CO
Teaching schedule
Examination Scheme
Hours/Week
3 1 2 100
20 20 60 -
Course Objective: The objectives of this course are to provide fundamental concepts of operating
systems, to provide sufficient understanding of operating system design and how it impacts application
system design and performance, and to provide understanding of implementation of system utilities for
inter-process communication in a multiprocessor environment.
Course Contents:
a. Operating system as an extended machine & resource manager
b. History and types of operating system
c. Operating system concepts, functions, structures
2. Processes and Threads [9 Hrs]
a. Introduction
b. Process model, process states, process control block
c. Introduction to threads, kernel and user implementation of threads
d. Inter- process communication (Multiprogrammning, parallel processing, critical sections, race
condition, mutual exclusion with busy waiting, semaphores, monitors)
e. Preemptive scheduling vs non-preemptive scheduling
f. Process scheduling (FCFS, SJF, RR, Priority, Real-time scheduling)
3. Memory Management [8 Hrs]
a. Memory management without swapping
b. Swapping
c. Virtual memory
d. Paging, Page replacement algorithms (FIFO, Optimal, LRU, LFU, NRU, Random, Clock, Second-
chance)
e. Predicting page faults
f. Segmentation with paging
4. File Systems [6 Hrs]
a. Files
b. Directories
c. File system implementation
d. Protection mechanism and operating system securities
5. Input/Output [7 Hrs]
a. Principles of input output hardware
b. Principles of input output software
c. Disks and disk scheduling algorithms (FSFS, SSTF, LOOK, SCAN, C-SCAN, C-LOOK)
d. Clocks
e. Terminals
6. Deadlocks [7 Hrs]
a. Introduction
b. Conditions of deadlock
c. Resources and deadlock modeling using resources
d. Deadlock detection and recovery
e. Deadlock avoidance & prevention
f. Banker's Algorithm (Single and multiple resources)
7. Real Time System [2 Hrs]
a. Introduction
b. Types of RTS (Soft real time, hard real time, firm real time)
8. Distributed System [3 Hrs]
a. Introduction and characteristics
b. Processes and processors in distributes system
9. Case Study
UNIX / LINUX / Windows / Android / iOS
(No classes are allotted to the case study; the students themselves referring various books should
study this unit.)
Laboratory: There shall be following lab exercises covering various features of different operating
systems.
1. General commands and programming in LINUX

2. Process scheduling
3. Page replacement algorithms
4. Deadlock modeling
5. Memory fitting algorithms
6. IPC (Inter Process communication)
7. Shell programming
Reference Books:
1. Andrew S. Tanenbaum, "Modern Operating System", PHI
2. Silberscatz and Galvin, “Operating System Concepts", Addison Wesley
3. Andrew S. Tanenbaum, "Operating System, Design & Implementation", PHI
Computer Network
BCA272CO
Teaching schedule
Examination Scheme
Hours/Week
3 1 2 100
20 20 60 -
Course Objective: The course aims at providing a sound conceptual foundation in the area of computer
networks with emphasis on the design aspects. The course attempts to provide a balanced treatment of the state-
of-the-art in the area and thus prepares the students for taking more rigorous and specialized courses in this and
related fields.
Course Contents:
1. Network Concepts, Classification and Components [6 Hrs]
a. Introduction, features and advantages of network
b. Types of network (LAN, MAN, WAN, P2P and client-Server)
c. Network topologies (Bus, Ring, Star, Hybrid, etc.)
d. Wireless networks (Bluetooth, WiFi, WiMax, etc.)
e. Switching (Packet switching and circuit switching networks)
f. Network components (NIC, Bridge, Repeater, Hub, Switch, Router, Gateway)
g. Transmission media (wired and wireless) and their types.
h. Ethernet cabling standards( Straight, Cross , Rollover Cabling)
2. Data Communication [8 Hrs]
a. Concepts of data, signal, channel and circuits, channel speed and bandwidth, bit rate and baud rate,
maximum data rate of a channel ,Signals, Analog and digital transmission, Asynchronous and
synchronous transmission, Data encoding techniques, Modulation and noise ,Multiplexing and de
multiplexing., Transmission errors, error detection types and Introduction to error correction codes.
b. X.25, Frame relay, SMDS, ISDN, ATM, xDSL, CDMA, VoIP.
3. Network Reference Models [5 Hrs]
a. Layered architecture, interfaces, services, and protocol hierarchies
b. ISO-OSI Reference model
c. TCP/IP Reference model
d. Novell networks
4. Data Link Layer [6 Hrs]
a. Data link layer design issues, MAC Address
b. Farming methods, flow control (Sliding window protocol)
c. Error control (Detection and correction)
d. Data link layer protocols: HDLC, SLIP, and PPP.
e. The Medium Access Sub-layer, The channel allocation problem, Multiple Access Protocols.
f. Ethernet, Token bus, Token Ring, FDDI, ALOHA, CSMA/CD, IEEE 802.3, 802.4, 802.5, and 802.11.
5. Network Layer [8 Hrs]

a. Network layer design issues, Unicast, Multicast, Anycast and Broadcast concept.
b. Details of IPV4 and IPV6.
c. Details of IP address (private, public and classes), Mobile-IP, Subnet mask, Subnetting, Super netting
CIDR, VLSM.
d. Concept of routing (Static and dynamic routing)
e. Routing algorithm types (Shortest-path, Flooding, Flow-based, Distance-vector, Link-state)
f. Congestion control and prevention policies, Leaky-bucket algorithm, Token-bucket algorithm
g. Internetworking, Tunneling and routing, ATM Internetworking, Mobile routing schemes
h. Network layer protocols: IP, NAT, ICMP, IGMP, ARP, RARP, RIP, OSPF, IGRP, EIGRP, BGP
6. Transport Layer [5 Hrs]
a. Transport layer design issues.
b. QoS, Elements of transport layer Protocols.
c. Connection-oriented and connectionless Service
d. Transport layer protocols: TCP, UDP, SCTP
e. Port Address and their types
7. Application Layer [7 Hrs]
a. Application layer and its function
b. Electronic mail: SMTP
c. File transfer: FTP, Telnet.
d. Dynamic host configuration protocol (DHCP)
e. DNS, HTTP, WWW, SNMP.
f. Cryptography, Symmetric Key and Public Key, Digital signature.
g. Firewalls and types.
h. Virtual private network.
i. Network Security and Information Security.
j. Securing TCP connections (SSL).
k. Network layer security (IPSec, VPN).
l. Securing wireless LANs (WEP).
Laboratory: There shall be following laboratory exercises that cover the various features and concepts of
computer networking. In practical, students should be able to set up small networks. Also, they should be able to
configure network hardware and network software in windows and Linux Environments. Following lab
exercises may be helpful.
1. Cabling (Straight and Cross-over cabling).
2. Installation of NIC and various Network devices like Hub, Switch, and Router.
3. Installation and configuration of Server and workstation in Windows/Linux.
4. File sharing and Printer sharing, Domain User, Z: drive, Security Policies.
5. Network Utilizes Commands (ipconfig, ping).
6. Setting IP address Subnet Mask and default gateway in PC.
6. Firewall configuration.
7. Configuration of Web Server (IIS, Apache), Mail Server, DNS, FTP, Telnet, SSH, rlogin.
8. Configuration of DHCP Server.
11. Basic network commands and network management and troubleshooting.
12. Static routing and dynamic routing (RIP and OSPF).
13. Implement the data link layer farming methods such as character, character stuffing and bit stuffing.
14. Implementation of CRC.
15. Installation of Linux and Windows Server in VMware.
17. Basic Network setup on Linux.
16. Case study: An existing network of your College.
Reference Books:
1. Andrew S. Tanenbaum, "Computer Networks", Prentice Hall East. Econ. Ed.
2. G. Keiser, "Local Area Networks", McGraw Hill International Ed.
3. F. Derfler, Jr., "Guide to Linking LANs"
4. S. Keshav, "An Engineering Approach to Computer Networking", Addison Wesley Longman
5. William Stallings, "Data & Computer Communications", Prentice Hall of India, New Delhi
6. D. E. Corner, "Internetworking with TCP/IP, Volume-I", Prentice Hall of India
7. Marshall T. Rose, "The Open Book: A Practical Perspective on OSI", Prentice Hall
8. Data Communications and Networking”, Behrouz A. Forouzan
9. Computer Networking James F. Kurose, Keith W. Ross.
Database Management System
BCA276CO
Teaching Schedule
3 1 2 20 20 60 - 100
Course Objective: After finishing this course, students will be able to design, implement and use
database systems. Students will also be good at using Structured Query Language.
Course Contents:
Definition of database, DBMS, RDBMS, ORDBMS, Definition of database system, Types and
Characteristics of database, Advantages and disadvantages of using DBMS
2. Database Systems Concepts and Architecture [8 Hrs]

Data models, Schemas and instances, DBMS architecture and data independence, Database
language and interfaces, Degree of relationship, Cardinality, Data dictionary, E-R model, Strong
and weak entity types, Attributes, Types of keys, Relationship types, E-R diagram
3. Relational Model [4 Hrs]

Introduction to relational databases, Relational algebra, Modification of database
4. SQL [7 Hrs]
Introduction, DDL, DML, Null values, String operations, Aggregate function, Joined relation,
Views, Set operations, Triggers, SQL Queries, Nested Queries, Introduction to PL/SQL
[Procedure, Function, Package]
5. Integrity Constraints [2 Hrs]

Entity constraints, Domain constraints, Referential integrity
6. Normalization [6 Hrs]
Pitfalls of relational model, Introduction to functional dependencies, Details of 1NF, 2NF and
3NF, Introduction to BCNF, 4NF and 5NF
7. Database Security [4 Hrs]

Different levels of database security, Access control, Authentication, Authorization, Non-
repudiation, Encryption and decryption.
8. Transaction and Query Processing [7 Hrs]

Introduction to transaction, State, ACID properties, Introduction to concurrency control [Lock,
Timestamp, Validation, Serializability, and Conflict serializability] Introduction to query
processing, Steps used in query processing. – Introduction to Lock Management – Lock
Conversions, Dealing with Dead Locks, Introduction to Crash recovery, the Write-Ahead Log
Protocol.
9. Backup and Recovery [3 Hrs]
Failure of database system, Backup devices, Backup of database and database system,
Techniques used in recovery of database system
Laboratory: There shall be lab exercises using SQL.
Reference Books:
1. “Database System Concept”, Silberschatz et. al., McGraw Hill, 3rd Edition
2. “An Introduction to Database System”, C. J. Date, Addison Wesley
3. “Fundamentals of Database Systems”, Ramez Elmasri, Shamkant B. Navathe
Computer Project-IV
BCA279CO
Teaching schedule
Examination Scheme
Hours/Week
- - 3 100
- 60 - 40
Course Objective:
After finishing this project, students will be able to develop application software
using Oracle as the back end tool and Developer as the front end tool.
Course Contents:
A total of 45 lab hours covering all features of Oracle and Developer will be assigned
to every student. Every group of students (upto 3) will be assigned a project work
related to application software development using Oracle as the backend tool and
developer as the front end tool. Students must develop the assigned software,
submit written report, and give oral presentation.


 Project Documentation— 20 Marks
 Final Presentation — 10 Marks
 VIVA — 10 Marks
Year: III Semester: I
S.N. Course Course Description Credit Lectur Tutorial Practic Total

Code s e (Hrs) (Hrs) al (Hrs) (Hrs)
1 BCA370CO Software Engineering 3 3 1 - 4
2 BCA371CO Object Oriented Analysis & 3 3 1 - 4

Design
3 BCA374CO Web Technology 3 3 1 2 6
4 BCA375CO Computer Graphics 3 3 1 2 6
5 BCA376SH Probability & Statistics 3 3 1 1 5
6 BCA378CO Computer Project-V 3 - - 3 3
Total 18 15 04 08 28
Software Engineering
Year III Semester: I
Teaching Schedule
Examination Scheme
Hours/Week
3 1 - 20 - 80 - 100
Course Objective: This course is intended to provide an introduction to SE concepts and practices
focusing on industrial software development characteristics and processes, development models, and
the software life cycle for mid-scale system.
 Provide students a comprehensive introduction to software engineering.

 provide the students the kinds of activities that are necessary for developing a software
system
 Study the important phases of software development
UNIT 1: Introduction to Software Engineering: [4 Hrs]

1.1 Definition of software engineering
1.2 The evolving role of software
1.3 Changing nature of software
1.4 Characteristics of software
1.5 A generic view of software engineering
1.6 Software engineering-layered technology
UNIT 2: Process Models [5 Hrs]

2.1 The Waterfall model
2.2 Prototyping model
2.3 RAD model
2.4 Spiral model
UNIT 3: Software Project Management [8 Hrs]

3.1 Meaning of 4Ps in software project management
3.2 Activities of project planning
3.3 Project estimation techniques
3.4 COCOMO model
3.5 Risk Management
3.6 Project Scheduling
3.7 Staffing
3.8 Software Configuration Management (SCM)
UNIT 4: Software Requirements and Specification [7 Hrs]

4.1 Functional and non-functional requirements, requirements engineering process (feasibility
studies, requirements elicitation and analysis, requirements validation, requirements
management)
4.2 Data Modeling and flow diagram
4.3 Software prototyping techniques
4.4 Requirement definition and specifications
UNIT 5: Software Design [7 Hrs]

5.1 Introduction to software design
5.2 Characteristics of a good software design
5.3 Design principle
5.4 Design concepts
5.5 Design strategy
5.6 Design process and design quality
5.7 Software architecture and its types
UNIT 6: Software Testing [7 Hrs]

6.1 Software testing process
6.2 Principal of testing
6.3 Test case design
6.4 Black-box testing (Boundary-value analysis, Equivalence class partitioning)
6.5 White-box testing (Statement coverage, Path coverage, Cyclomatic complexity)
6.6 Software verification and validation
UNIT 7: Metrics for Process and Products [4 Hrs]

7.1 Software measurement
7.2 Metrics for software quality
7.3 Software quality assurance
7.4 Software reliability
7.5 The ISO 9000 quality standards
UNIT 8: Introduction to Engineering Software Trends and Technology [3 Hrs]

8.1 Agile development
8.2 Extreme programming
8.3 Cloud computing and grid computing
8.4 Enterprise mobility
8.5 Business intelligent and approaches
8.5.1 ERP, Supply chain management, Service-oriented architecture and web services
8.5.2 Enterprise portals and Content management
8.6 Introduction to OOSE
Case Study: Students are encouraged to perform the case study to implement concepts of above-
mentioned topics.
Reference Books:
1. Roger S. Pressman, “Software Engineering - A Practitioner’s Approach”, 6th Ed., McGrawHill
International Edition
2. Sommerville, “Software Engineering”, Pearson Education
3. Udit Agrawal, “Software Engineering”
4. Rajib Malla, “Fundamentals of Software Engineering”
5. Pankaj Jalote, “Software Engineering – A Precise Approach”
Object Oriented Analysis and Design [OOAD]
BCA371CO
Year III Semester: I
Teaching Schedule
Examination Scheme
Hours/Week
3 1 - 20 - 80 - 100
Course Objectives: The main objectives of this course are:
1. To learn basic OO analysis and de sign skills through an elaborate case study
2. To use the UML design diagrams
3. To apply the appropriate design patterns
4. To apply the principles of object-oriented based implementation
UNIT 1: Introduction [4 Hrs]

1.1 Introduction to OOAD (OOA, OOD and OOP)
1.2 Basic concepts of OOAD (Object, Class, Abstraction, Encapsulation,
Polymorphism, Hierarchy, Modularity, Object Interaction, Interface,
Implementation)
UNIT 2: Unified Modeling Language (UML) [8 Hrs]

2.1 Introduction to UML and UML history.
2.2 Notation and basic building blocks of UML
2.3 UML diagrams
2.4 Extend, generalization, specialization
2.5 Object-oriented development life cycle (Iterative and incremental life cycle –
united process (UP) phases)
UNIT 3: Object Oriented Analysis [10 Hrs]

3.1 Introduction to model building
3.1.1 Defining model
3.1.2 Types of model
3.1.3 Importance of model building
3.2 Domain models
3.2.1 Finding conceptual classes and description of classes
3.2.2 Finding conceptual class
3.3 Domain model refinement -
3.3.1 Finding associations
3.3.2 Finding attributes
3.3.3 Finding class relationships
3.4 UML activity diagrams and modeling
3.5 System sequence diagrams
3.6 Realization of use case
3.6.1 Relationship between sequence diagrams and use cases
3.6.2 Relationship between class diagram and use cases
UNIT 4: Object Oriented Design [12 Hrs]

4.1 Introduction Object Oriented Design (OOD)
4.2 Designing Objects with Patterns
4.2.1 GRASP: Designing objects with responsibilities
4.2.1.1 Creator, information expert, low, coupling, controller,
high cohesion
4.2.2 Applying GoF design patterns: adapter, singleton, factory and
observer patterns
4.3 Designing for visibility
4.4 Class responsibilities and collaborator (CRC) design
4.5 UML state diagrams and modeling
4.6 UML interaction diagrams and modeling
4.7 UML deployment and component diagrams
5. Object Oriented Implementation [11 Hrs]

5.1 Introduction
5.1.1 Object Oriented Implementation
5.1.2 Structured Vs Object oriented based Implementation
5.2 Mapping design to code (Forward Engineering)
5.2.1 Class Diagram to Object Oriented Code,
5.2.2 Interaction Diagram to Object Oriented Code
5.3 Mapping Code to Design (Reverse Engineering)
5.4 Exception and Error handling in Object Oriented based software development
Reference Books:
1. Grady Booch, Robert A. Maksimchuk & Michael W. Engle, “Object Oriented Analysis &
Design with Application”, Third Edition, Pearson
2. Craig Larman, "Applying UML and Patterns: An Introduction to object-oriented
Analysis and Design and iterative development”, Third Edition, Pearson
3. Grady Booch, James Rumbaugh & Ivar Jacobson, "The Unified Modeling Language Use
Guide"
4. Perdita Stevens & Rob Pooley, "Using UML: Software Engineering with Objects &
Components", Second Edition, Pearson
Web Technology
Teaching Schedule

3 1 2 20 20 60 - 100
Course Objective: After finishing this subject, students will be able to develop web pages using
HTML, JavaScript, XML and advanced concepts of web applications and server-side
programming.
Course Contents:
1. Introduction to Web Technology [5 Hrs]
1.1 Web Basics: Web Browsers, Web Servers, Tier Technology and its types, Static and Dynamic
Web Page. Client side and Server side Scripting.
1.2 Web Protocols: details of HTTP, HTTPs, FTP
1.3 Introduction to Free and Open Source Software
1.3.1 Characteristics, Advantages and Disadvantages Free Software, Open Source Software
and Proprietary Software
1.3.2 Difference between Free Software, Open Source Software and Proprietary Software
1.3.3 Licensing and its types: Commercial License and Open Source License
2. HTML, XHTML & HTML5 [8 Hrs]

2.1 Introduction
2.2 Document metadata
2.3 Basic structure of HTML
2.4 Sections
2.5 Grouping content
2.6 Text-level semantics
2.7 Embedded content
2.8 Tabular data
2.9 Forms
2.10 Interactive elements
2.11 List
2.12 Links
2.13 Images
2.14 Frames
3. Page Designing with CSS [8 Hrs]
3.1 Introduction to designing approaches
3.1.1 Table-based designs
3.1.2 Table-less designs
3.2 Cascading Style Sheet and its properties
3.2.1 Introduction
3.2.2 CSS vs CSS3
3.2.3 CSS properties — Text and Fonts, Colors and Backgrounds, The Box Model
(dimensions, padding, margin and borders), Positioning and Display, Lists, Tables,
Media
3.2.4 Converting Image design to HTML (Slicing)
4. Client-side Scripting [6 Hrs]
4.1 Introduction
4.2 JavaScript
4.2.1 Lexical Structure
4.2.2 Variables, Identifiers, Data Types and Values, Scope, Literals, Reserved Words
4.2.3 Expression and operators, Statements
4.2.4 Arrays, Objects (Math, String, Date)
4.2.5 Functions
4.2.6 Regular Expressions
4.2.7 Garbage Collection
4.3 Objects
4.3.1 Objects and properties
4.3.2 Constructors
4.3.3 Prototype and Inheritance
4.3.4 Object as an associative array
4.4 DOM and Event Handling
4.5 Introduction to JSON, jQuery, jQuery Integration
4.6 Saving State with Cookies
5 XML, AJAX, and Web Services [5 Hrs]

2.1 Introduction to XML
2.2 XML validation with DTD & schema
2.3 XSL and XSLT
2.4 XML processing with PHP
2.5 Asynchronous JavaScript and XML (AJAX)
2.6 Web services
6. Server Side Programming with PHP [5 Hrs]
3.1 Introduction to server-side programming
3.2 PHP Basics, Object oriented Concept
3.3 Embedding PHP scripts
3.4 Basic syntax (Variables, operators, expressions, constants)
3.5 Control structures
3.6 PHP functions
3.7 Recursion
3.8 String manipulation
3.9 Using regular expression
3.10Exceptional handling with PHP
7. Database Connectivity in PHP [6Hrs]

5.1 Introduction to SQL
5.2 Basic SQL commands (CRUD)
5.3 HTML forms and Methods
5.4 Database connectivity
5.5 MySQL functions
5.6 Executing DDL and DML queries using PHP
5.7 Login and authentication
5.8 Session and Cookies
8. Responsive Websites and Advanced Server-side Issues [3 Hrs]

7.1 Responsive website strategies and design
7.2 Smart device functionality
7.3 Testing and debugging
7.4 Overview to advanced server-side issues
7.5 MVC Frameworks (Code-Igniter)
Laboratories: There shall be lab exercises covering all features of above chapters.
Reference Books:
1) "Open Sources: Voices from the Open Source Revolution", Chris DiBona, Sam Ockman, Mark
Stone
2) "Perspectives on Free & Open Source Software", Joseph Feller, Brian Fitzgerald, Scott A.
Hissam & Karim R. Lakhani, MIT Press
3) "Open Sources: Voices from the Open Source Revolution", Chris DiBona, Sam Ockman,
O'Rielly Media
4) "Murach's HTML5 & CSS3", Zak Ruvalcaba & Anne Boehm
5) "JavaScript: The Definitive Guide", 6th Edition, David Flanagan, O'Reilly Media
6) "Learning Web Design: A Beginner’s Guide to HTML, CSS, JavaScript, & Web Graphics",
Jennifer Niederst Robbins, O'Rielly
7) "HTML5 Programming with JavaScript", John Paul Mueller, Wiley
8) "HTML5 & CSS3 for the Real World", Estelle Weyl, Louis Lazaris, Alexis Goldstein, Sitepoint
9) David Hunter, "Beginning XML", Wrox Publication
10) Robin Nixon. "Learning PHP, MySQL, & JavaScript", O'Reilly Media
11) Rasmus Lerdorf, Kevin Tatroe, & Peter MacIntyre, "Programming PHP", O'Reilly Media
12) Deitel, Deitel, Goldberg, "Internet & World Wide Web How to Program", Pearson Education
13) Paul S. Wang, "Dynamic Web Programming & HTML 5", Chapman & Hall/CRC
14) Rahul Banerjee, "Internetworking Technologies", PHI Ltd.
15) Charles Ashbacher, “SAMS Teach Yourself XML in 24 Hours”, Techmedia
Computer Graphics
BCA375CO

Teaching Schedule Examination Scheme
Hours/Week
Theory Tutorial Practical Internal Final Total
3 1 2 100
20 20 60 -
Course Objective:
To be familiar with the basic techniques used in computer graphics system
1.1 History of Computer graphics
1.2 Application of computer graphics
2. Graphics Hardware [5 Hrs]
2.1 Keyboard, mouse [mechanical & optical], light pen, touch screen, tablet input
hardware, joystick
2.2 Raster and vector display architecture
2.3 Architecture of graphical display terminals including frame buffer and color
manipulation techniques RGB, CMYK
3. Two-dimensional Algorithms [8 Hrs]
3.1 Direct and incremental line drawing algorithms
3.2 Bresenham’s line drawing algorithms for positive and negative slopes [DDA
algorithm]
3.3 Mid-point circle drawing and mid-point ellipse-drawing algorithms
4. Two-dimensional Transformations [10 Hrs]

4.1 Introduction to transformation
4.2 Two-dimensional translation, scaling and rotation
4.3 Successive and composite transformations
4.4 Pivot-point rotation and fixed-point scaling
4.5 Reflection and shearing
4.6 Viewing transformation and windows-to-viewport transformation
4.7 Clipping [The Cohen-Sutherland line-clipping algorithm, The Sutherland-
Hodgman polygon cliping algorithm]
5. Three-dimensional Graphics [12 Hrs]

5.1 Projection [parallel and perspective]
5.2 3D transformations
5.2.1 Translation, scaling, reflection
5.2.2 Rotation [About axex, line parallel to cordinate axis, and line not
parallel to cordinate axis]
5.2.3 Windows to viewport transformation
5.3 Hidden line and Hidden Surface Removal Techniques [Back face detection,
Z-buffer, A-buffer, scan-line]
5.4 Introduction to Non-planar surfaces [Bezier, Splines]
6. Light, Color and Shading [5 Hrs]
6.1 Introduction
6.2 Need for shading in engineering data visualization
6.3 Algorithms to simulate ambient, diffuse, and specular reflections
6.4 Constants, Gouraud, and Phong-shading models
7. Graphical Languages [2 Hrs]
7.1 Need for machine independent graphical languages [PHIGS, GKS]
7.2 Discussion of available languages and file formats [graphical file format]
8. Introduction to Animation [1 Hr]

8.1 Introduction to Open GL
8.2 Application & today’s trends
Laboratories:
1. Introduction to graphics primitives and graphics drivers
2. Implementation of line-drawing algorithms
2.1 DDA
2.2 Bresenham’s algorithm
2.3 Bresenham’s general algorithm
3. Implementation of mid-point circle algorithm
4. Implementation of mid-point ellipse algorithm
5. Implemetation of basic 2D and 3D transformation
6. Implementation of windows-to-viewport transformation
7. Implementation of line-clipping process
Reference Books:
1. D. Harn & M. P. Baker, “Computer Graphics”, PHI Edition
2. T. I. James, D. Foley, A. Van Dam, S. K. Feiner & J. F. Hughes, “Computer
Graphics, Principles and Practices”, PHI Edition
Probability & Statistics
BCA376SH

Teaching Schedule
Examination Scheme
Hours/Week

3 1 1 100
20 20 60 -
Course Objective: After the completion of the subject, students are expected to be able to [i]
assemble data [ii] analyze data [iii] determine central tendency, distribution and make viable
conclusions for decision-making.
Course Contents:
1. Nature and Scope of Statistics [2 Hrs]
1.1. Definitions of statistics
1.2. Descriptive and inferential statistics
1.3. Scope of statistics
1.4. Limitations and distrusts of statistics
2. Data and its Collection [2 Hrs]
2.1. Primary and secondary data
2.2. Sources of primary and secondary data
2.3. Methods of data collection: census method, sample method
2.4. Compilation of administrative records
3. Classification and Tabulation of Data [2 Hrs]
3.1. Classification procedure: qualitative and quantitative classification
3.2. Tabulation of data
4. Diagrammatic and Graphic Presentation of Data [3 Hrs]
4.1. Importance and limitations
4.2. Types of diagrammatic representations: Bar diagram, Pie diagram; Pictogram
4.3. Types of graphic representations: Histogram, Frequency polygon, Frequency curve,
Cumulative frequency curve [Ogive]
5. Measures of Central Tendency [4 Hrs]
5.1. Arithmetic mean
5.2. Geometric mean;
5.3. Harmonic mean
5.4. The median: quartiles; deciles and percentiles
5.5. The mode
5.6. Relation between mean, median and mode
6. Measures of Dispersion [4 Hrs]
6.1. Absolute and relative measures
6.2. The range
6.3. Inter-quartile range
6.4. Quartile deviation
6.5. Mean deviation
6.6. Standard deviation
6.7. Coefficient of variation
6.8. Skewness and Kurtosis
7. Probability [6 Hrs]
7.1. Preliminaries
7.2. Classical, empirical, axiomatic approaches of probability theory
7.3. Conditional probability
7.4. Inverse probability
7.5. Probability distribution
7.6. Mathematical expectation
7.7. Variance of random variable
8. Theoretical Distribution [7 Hrs]
8.1. Introduction
8.2. Binominal distribution and its chief features [without proofs]
8.3. Fitting a Binominal distribution
8.4. Poisson distribution and its chief features [without proofs]
8.5. Fitting Poisson distribution
8.6. Normal distribution and its chief features
8.7. Areas under Normal distribution
8.8. Hyper-geometric distribution
9. Estimation Theory and Testing of Hypothesis [7 Hrs]
9.1. Idea of sample and population
9.2. Point estimation and internal estimation
9.3. Characteristics of a good estimator
9.4. Interval estimation of population parameters
9.5. Sampling distribution and standard error
9.6. Sampling of attribute
9.7. Test of significance for single proportion
9.8. Test of significance for difference between two proportions
9.9. Sampling of variables
9.10. Large sample test
9.11. Test of significance for single mean
9.12. Test of significance for difference between two means
9.13. Small sample test
9.14. Student’s T-distribution and its applications
10. Chi-Square Distribution [3 Hrs]
10.1. Introduction
10.2. Application
10.3. Test of goodness of fit
10.4. Test of independence of attributes
11. Correlation and Regression Analysis [5 Hrs]
11.1. Introduction
11.2. Correlation analysis
11.3. Various methods of calculating correlation coefficient
11.4. Regression analysis
Laboratory: There shall be 12 lab exercises covering all the features of statistical analysis based on
SPSS or any other Statistical Software Packages.
Reference Books:
1. "Statistical Method for Research Workers", Sukhminder Singh Et. Al., Kalyani Publishers,
New Delhi
2. "A Basic Course in Statistics", B. M. Clarke & D. Cooke, Elbs. [U. K.]
3. "Basic Statistics", B. L. Agrawal, Wiley Eastern
4. "Elements of Statistical Reasoning", Minimum & Clarke, Johnwiley & Sons
5. "Statistics for Management", Levin, Prentice Hall of India
6. "Fundamentals of Statistics", S. C. Gupta
Computer Project-V
BCA378CO
Teaching Schedule
Examination Scheme
Hours/Week
- - 3 100
- 60 - 40
Course Objective: After finishing this project, students will be able to develop web-based
application using server-side scripting.
Course Contents:
A total of 45 lab hours covering all the features of Server-side scripting and any RDBMS will
be assigned to every student. Every group of students (upto 3) will be assigned a project
work. Students must develop the assigned application, submit written report, and give oral
presentation.


 VIVA - 10 Marks
Year: III Semester: II
S.N. Course Course Description Credits Lecture Tutorial Practical Total

Code (Hrs) (Hrs) (Hrs) (Hrs)
1 BCA377SH Research Methodology 2 2 1 - 3
2 BCA372CO Management Information 3 3 1 - 4

System
3 BCA380CO Network Programming 3 3 1 2 6
4 BCA381CO Cloud Computing 3 4 1 1 6
5 BCA382CO Artificial Intelligence 3 3 1 2 6
6 BCA379CO Computer Project - VI 3 - - 3 3
Total 17 15 5 8 28
Research Methodology
BCA377SH
Year III Semester II

Hours/week
2 1 - Theory Practical Theory Practical 50
10 40
Course objective:
This course will help you accomplish the following things:
 ability for individual research work on the field of information and communication
technologies,
 ability to research, select and organize information, as well as synthesize solution and
anticipate their consequences,
 mastering of research methods, procedures and processes, development of critical and
self-critical assessment,
 ability to use knowledge in practice,
Course Contents
Unit 1: Introduction to Research - 6 hrs
Meaning of Research, Applied and Fundamental Research, Scientific Research Process, Management
Research Methods: Action Research, Evaluation Research, Managerial Research. Meaning of Project
Work, Objectives of Project Work, Methods of Field and Project Work: Exploratory/Descriptive, Case
Study, Feasible Study.
Unit 2: Research Design – 5hrs
Concept of Research Design, Elements of Research Design, Types of Research Design: Historical,
Descriptive, Developmental, Case Study, Co-relational, Causal- Comparative and Action Research
Design.
Unit 3: Sampling Process and Data Collection - 7hrs
Sampling and its significance in Research, Types of Sampling, Probability and Non- Probability
Sampling: Stratified, Systematic, Multistage, Judgment, Quota, and Convenience sampling, Sampling
Error and Non- Sampling Error, Primary and Secondary Data, Use of Secondary Data, Methods of
Collecting Primary Data: Interviewing, Questionnaire and Observation.
Unit 4: Testing of Statistical Hypothesis – 6hrs
Statistical Hypothesis, Level of Significance, Difference between Parametric and Non- Parametric tests.
Use of z-Distribution in Hypothesis Testing of Population Mean and Population Proportion in one-
Sample Case.
Unit 5: Writing the Research Report 6hrs
Purpose of Writing a Report, Contents and Style of Report, Types of Report: Descriptive and
Analytical Report, Presenting Data, Table and Figures in Report, Use of Quotations,
Abbreviations, Bibliography.
Suggested Text books
1. Kerlinger, Fred N, Foundations of Behavioral Research

MANAGEMENT INFORMATION SYSTEMS
BCA372CO

Teaching schedule
Examination Scheme
Hours/Week
3 1 - 100
20 - 80 -
Objective:
To provide the knowledge of different types of Computer information systems and
primarily focuses on how to use computer information systems and information
technologies to revitalize business processes, improve managerial decision making, and
help organizations gain a competitive edge in business.
Contents:
Unit 1: Information systems in Global business today [6 hrs]
Definition of Information system, Definition of Management Information System,
Role of Information systems in business today, Globalization Challenges and
opportunities, Strategic business objectives of Information systems, Business
perspective of information system.
Unit 2: Global E-Business and Collaboration [6 hrs]

Business processes and Information Systems, Types of Information Systems,
Systems for linking the enterprise systems for collaboration and team work. The
information systems function in business.
Unit 3: Information Systems Organization and Strategy [6 hrs]

Organizations and Information systems, Impacts of information systems on
organizations and business firms, Using information systems to achieve
competitive advantage, Business value chain model.
Unit 4: Information Technology Infrastructure [5 hrs]

IT infrastructure, Infrastructure components, Contemporary hardware platform
trends, Contemporary software platform trends.
Unit 5: Foundation of Business Intelligence [2 hrs]

Using databases to improve business performance and decision making, Case
study.
Unit 6: Decision Support system and Executive Information System [4 hrs]
Definition of Decision Support Systems, Components of DSS, Applications of
DSS, Functions of DSS, Definition of EIS, Characteristics of EIS
Unit 7: Business Information Systems [3 hrs]

Functional Information Systems, Marketing Information Systems, Manufacturing
Information Systems, Finance and Accounting Information Systems, Quality
information system.
Unit 8: Security of Information Systems [2 hrs]

System vulnerability and abuse, Technologies and tools for protecting
information resources.
Unit 9: Achieving Operational Excellence and customer intimacy [4 hrs]

Enterprise Systems, Supply Chain Management Systems, Customer relationship
management systems, Enterprise applications.
Unit 10: Strategic Information Systems [2 hrs]

Definition of Strategic Information System, Strategic Information System Plan,
Strategy for developing Strategic information system.
Unit 11. Case Studies related to Unit 3, Unit 5, Unit 9, and Unit 10. [5 hrs]
Reference Books:
1. Kenneth C. Loudon/ Jane P. Laudon,”Management Information Systems,
Managing the Digital Firm”, Twelfth Edition, Pearson.
2. Uma G. Gupta,”Management Informationn Systems, A Managerial
Perspective”, Tenth Edition, West Publishing Company.
3. Sunil Sharma / Saroj Pandey,”Management Information System”, First
Edition.
Network Programming
BCA380CO

Teaching schedule
Examination Scheme
Hours/Week
3 1 2 100
20 20 60 -
Objectives:
To design and implementnetwork client server applications.
Contents:
1. Introduction to Network Programming: [5 hrs]
Introduction to Computer Network: Client /Server Model, ProtocolSuite (ISO/OSI, TCP/IP), Unix Standards
(POSIX, Open Group, IETF), Network Utilities (telnet, route, ipconfig, ifconfig, ping,netstat,And
ftp)Introduction to Programming: Wrapperfunctions, Header files, libraries and Ports Numbers and its
types,IP address.Iterative Server, Concurrent server, Networked servers.
2. Elementary Operating System Calls: [6hrs]

System Call,Program, Thread ,Process,Kernel,fork(), exec() and its family, waitpid(),wait(),pipe(), Fifo(),
signals (SIGCHLD, SIGINT, SIGIO).IPC Names, Creating and Opening IPC Channels, IPC permissions.
3. TCP/UDP Transport Layer Protocols: [4 hrs]

TCP (Transmission Control Protocol): features, connectionestablishment and termination, states in
communication (LISTEN,TIME_WAIT, ESTABLISHED, BLOCKED)UDP (User Datagram Protocol): features,
uses, comparison with TCP.TCP and UDP Buffer sizes and limitations.SCTP.
4. Elementary Socket Calls: [5hrs]

Socket Address Structure: for IPV4, IPV6, UNIX domain socket andGeneric socket address structure, Value-
result argument.Byte Ordering and manipulating function: htonl(), htons(), ntohl(), ntohs(),inet_addr(),
inet_aton(), inet_ntoa(), inet_pton().
5. Elementary TCP-UDP Socket: [6hrs]

Socket() , connect(), bind(), listen(), accept(),read(),write(), close(),sendto(),recvfrom(),
6. I/Omultiplexing: [4hrs]
Introduction, I/O models: Blocking I/O, non-blocking I/O, I/O multiplexing, signaldriven I/O (SIGIO) and
Asynchronous I/O model.Select (), poll (), shutdown ().
7. Socket Options: [2 hrs]

Getsockopt() and setsockopt() functions, IPV4,IPV6,TCP socket options.
8. Name and Address Conversion: [2 hrs]

Domainname system, gethostbyname (), gethostbyaddr (), uname (),getservbyname () and getservbyport (),
gethostname () Functions,Socket timeouts.
9. Unix Domain Protocol: [3 hrs]
Introduction, Unix Domain socket address structure, socket pair function, Unix Domain Stream Client-
Server,UNIX domain datagram Client/Server.
10. Daemon processes, Inetd super servers: [2 hrs]

Introduction,Sysloged (syslog function), daemon_init function, inetd daemon.
11. Broadcast and Multicast: [3 hrs]

Introduction, Broadcast and Multicast addresses, comparison betweenbroadcast, unicast and Multicast socket
options. Unicast versus Broadcast, Multicast versus Broadcast on LAN.
12. IP Layers and Raw Socket: [3 hrs]

Introduction, Raw socket creation, Input and Output (ping example).
Lab Exercise
There shall be lab strictly using c/c++/Java/Linux.
1. Linux Commands.
2. Shell Programming.
3. IPC (Pipe(), Fifo(), Message Queue)
4. TCP, UDPand Unix Domain socket Client-Server Program.
5. TCP echo client and Server program.
6. Fork() System Call
7. Wait() and waitpid() System Call
8. Uname() ,Gethostbyaddr(),gethostbyname(),gethostname() system Call
Text books:
1. Stevens W.R., "Unix Network Programming", Vol-1.
2. Stevens W.R., "Unix Network Programming", Vol-II
3. Doglous E. Comer, "Internetworking with TCP/IP", Vol - III
CLOUD COMPUTING
BCA381CO

Hours/Week
4 1 1 100
20 80 -
OBJECTIVES:
 To provide students with the fundamentals and essentials of Cloud Computing.

 To provide students a sound foundation of the Cloud computing so that they are able to
start using and adopting Cloud Computing services and tools in their real life scenarios.
 To enable students exploring some important cloud computing driven commercial
systems such as GoogleApps, Microsoft Azure and Amazon Web Services and other
businesses cloud applications.
UNIT-I: Introduction [7 Hrs]

Cloud Computing Overview, Deployment Models, Cloud Service Models, History of Cloud Computing,
advantages and disadvantages of Cloud Computing, Characteristics of Cloud Computing, Components of
Cloud Computing, Risks related to Cloud Computing, Cloud Computing Planning, Cloud Computing Technologies,
Cloud Computing Architecture, Cloud Computing Infrastructure. Challenges for the Cloud computing, Grid
Computing Concept, Distributed Computing in Grid and Cloud. Cloud-Based Services.
Overview of cloud applications. Grid computing Infrastructures, Grid Architecture and
standards, Elements of Grid, Overview of Grid Architecture, Introduction to Mobile Computing,
Introduction to distributed computing, System models for distributed and cloud computing,
Distributed file system.
UNIT-II: Cloud Computing Model [7 Hrs]

Cloud Deployment Models, public, private, Hybrid, Community Cloud and their advantages and
disadvantages, Cloud Service Models , Infrastructure-as-a-Service, Benefits, Issues, Characteristics,
Platform-as-a-Service, Benefits, Issues, Characteristics, PaaS Types, Software-as–a-Service (SaaS),
Benefits , Issues, Characteristics, Identity-as–a-Service (IDaaS), Identity, Single Sign-On (SSO), Federated
Identity Management (FIDM), Network-as-a-Service((NaaS),Communication-as-a-Service (CaaS):
Advantages of CaaS, Mobile NaaS,NaaS Benefits, Cloud Computing Management, Cloud Management Tasks,
Cloud Computing Data Storage, Cloud Storage Classes, Mobile Cloud Computing, Architecture, Issues,
Monitoring-as-a-Service (MaaS), Protection Against Internal and External Threats, Jericho
Cloud Cube Model.
UNIT-III: Building Cloud Networks [6Hrs]

Evolution from Managed service providers (MSP) to Cloud Computing, Single Purpose
architectures to multi-purpose architectures, Data center virtualization, Cloud data center,
Service Oriented Architectures (SOA), Combining and SOA, Characterizing SOA, Open Source
Software in data centers.
UNIT-IV: Virtualization [10 Hrs]
Basics of Virtualization - Virtual machine technology, Virtualization Types, Desktop
Virtualization, Network Virtualization ,Server and Machine Virtualization, Storage
Virtualization, System-level or Operating Virtualization, Application Virtualization,
Virtualization Advantages, Virtual Machine Basics, Taxonomy of Virtual machines, Process
Virtual Machines, System Virtual Machines,Hypervisor, Key Concepts. Hardware
Virtualization, Virtual Hardware Overview, Sever Virtualization, Physical and Logical
Partitioning, Types of Server Virtualization, Business cases for Sever Virtualization, Uses of
Virtual server Consolidation, Planning for Development, Selecting server Virtualization
Platform, Compare SOAP and REST.
UNIT-V: Security in Cloud Computing [10 Hrs]

Cloud Information Security Objectives, Confidentiality, Integrity, and Availability,
Confidentiality, Integrity, Availability, Authentication, Authorization, Cloud Security
Challenges, Software-as-a-Service Security: Security management, Risk Management, Security
Planning, Security Monitoring and Incident Response, Security Architecture Design,
Vulnerability Assessment, Data Privacy and Security, Application Security, Virtual Machine
Security, disaster Recovery, Disasters in cloud, Disaster management,Cloud Security Alliance
(CSA) stack model. Cloud Computing Risk Issues, Cloud Computing Security Challenges,
Cloud Computing Security Architecture. QOS Issues in Cloud.
UNIT VI: Data in the cloud [5 Hrs]

Relational databases, GFS and HDFS, BigTable, HBase and Dynamo, Datastore and SimpleDB,
Multi-entity support, Multi-tenancy using cloud data stores, parallel computing, The MapReduce
model Case study: Google App Engine, Microsoft Azure, Hadoop, Amazon, Aneka.
Laboratory work: As a part of lab work, the students are highly encouraged
 To simulate the concept of virtualization using virtualization programs/systems.
 To understand and practice examples of cloud services and applications.
 To understand and implement distributed storage and security issues in cloud computing
References:
1. Cloud Computing Implementation, Management, and Security by John W. Rittinghouse James

F. Ransome.
2. Cloud Computing Bible by Barrie Sosinsky.
3. Cloud Computing Theory and Practice Dan C. Marinescu.
4. Mastering Cloud Computing Foundations and Applications Programming by RajkumarBuyya,
Christian Vecchiola, S. ThamaraiSelvi.
5. Cloud Application architecture, George Reese
6. Cloud Computing and SOA Convergence in your Enterprise, a step by step guide, David
S. Linthicum.
7. Handbook of cloud computing, BorkoFurht, Armando Escalante
8. Cloud Computing for Dummies, Judith Hurwitz, Robin Bloor, Marcia Kaufman, Fern
Halper.
9. William von Hagen, Professional Xen Virtualization, WroxPublications, January, 2008.
10. Chris Wolf, Erick M. Halter, and Virtualization: From the Desktop to theEnterprise, APress
2005.
Artificial Intelligence
Year III Semester: II

Teaching Schedule
Examination Scheme
Hours/Week
Theory Practical* Theory** Practical

3 1 2 100
20 20 60 -
Course Objective:
 To provide basic knowledge of Artificial Intelligence
 To provide the knowledge of Machine Learning, Natural Language,
Expert Systems and Neural Network
 To develop entrepreneurship skills and leadership in practical fields
UNIT 1: Introduction [2 Hrs]

1.1 Definitions
1.2 Goals of AI
1.3 Challenges of AI
1.4 AI approaches
1.5 AI techniques
1.6 Applications of AI
UNIT 2: Agents [5 Hrs]

2.1 Introduction to agents
2.2 Agent’s performance
2.3 Example of Agents
2.4 Rationality and omniscience
2.5 Types of agent environment
2.6 Agent architecture
2.7 PEAS (Vacuum cleaner agent, human agent, robotic agent, taxi driving
agent, 8-queen problem etc)
2.8 Types of agent (simple reflex, goal based, model based, utility agent,
learning agent)
UNIT 3: Problem solving using searching [8 Hrs]

3.1 Uninformed Search
3.1.1 Problem solving agents
3.1.2 Problem types
3.1.3 Problem formulation
3.1.4 Example problems
3.1.5 Basic search algorithms (BFS, DFS, Depth limited search,
uniform cost search, iterative deepening, bidirectional search)
3.1.6 Comparative study of all uninformed search strategies
(completeness, optimality, time complexity and space
complexity)
3.2 Informed Search

3.2.1 Best first (greedy) search
3.2.2 A* Search
3.2.3 Heuristic function
3.2.4 Hill Climbing and problems
3.2.5 Comparative Study of each type of searching
3.2.6 Simulated annealing
3.2.7 Genetic Algorithm
UNIT 4: Adverbial Search and Constraint satisfaction problem [5 Hrs]

4.1 Games
4.2 Perfect games
4.3 Game tree and formal definition
4.4 Min Max problem
4.5 Alpha beta pruning algorithm
4.6 CSP Problem and examples
4.7 Crypto arithmetic problems and solutions
UNIT 5: Knowledge Representations [8 Hrs]

5.1 Knowledge and its types
5.2 Logic
5.3 Semantic Nets
5.4 Propositional logic vs FOPL
5.5 Resolution in FOPL
5.6 Frames
UNIT 6: Learning System [4 Hrs]

6.1 Rote learning
6.2 Learning from example: inductive learning methods
6.3 Decision trees
6.4 Explanation based learning
6.5 Reinforcement learning
UNIT 7: Reasoning [4 Hrs]
7.1 Monotonic Reasoning
7.2 Statistical Reasoning (Bayesian Network)
7.3 Uncertainty in reasoning
7.4 Case based reasoning
UNIT 8: Expert System [4 Hrs]

8.1 Human Expert vs expert system
8.2 Expert System Structure
8.3 Expert system example
8.4 Characteristics of expert system
8.5 Knowledge acquisition
8.6 Knowledge base
8.7 Inference engine
8.8 Forward chaining and backward chaining
8.9 Design of expert system
UNIT 9: Artificial Neural networks [3 hrs]

9.1 Research history
9.2 Model of artificial neuron
9.3 Neural networks architectures
9.4 Learning methods in neural networks
9.5 Perceptron Network, Multi-layered feed forward network, Hopfield
networks
9.6 Application of neural networks
UNIT 10: Natural language processing [2 Hrs]

10.1 introduction
10.2 components of natural language processing
10.3 natural language understanding
10.4 natural language generation
10.5 steps in language understanding and generation
Laboratory:
Students must do labs on prolog, C or java to cover following topics
 solving family relation problem
 GCD in prolog
 Tower of Hanoi
 Wumpus world
 Using prolog to understand (variable, rules, input output, arithmetic
operations, recursion in prolog)
Students must do case study on expert system or natural language processing also.
References:
1. E. Rich & K. Knight, "Artificial Intelligence", McGraw-Hill, 1991
2. Haykin "Neural Networks: A Comprehensive Fundamentals", Macmillan, 1994
3. E. Turban, "Decision Support and Expert Systems" , Macmillan, 1993
4. R. Shingal, "Formal Concepts in Artificial Intelligence" , Chapman & Hall, 1992
5. G. Gazadar & C. Mellish, "Natural Language Processing in Prolog: and introduction
to computational linguistics", Addison-Wesley, 1989
6. D. Crookes, "Introduction to Programming in Prolog", Prentice Hall, 1988.
7. P. H. Winston, "Artificial Intelligence ", Addison-Wesley, 1984
9. Hecht-Neilson "Neurocomputing", Addison-Wesley, 1990
10. G. F. Luger & W. A Stubblefield, "Artificial Intelligence" , Benjamin Cummings,
1993
Project-V
BCA379CO

Teaching Schedule
Examination Scheme
Hours/Week
Internal
Assessment
- - 3 100
- 60 - 40
Course Objective: After finishing this project, students will be able to develop Unix
Network Programming based Application.
Course Contents:
A total of 45 lab hours covering all the features of Unix Network Programming
project will be assigned to every student. Every group of students (upto 3) will be
assigned a project work. Students must develop the assigned application, submit
written report, and give oral presentation.


 VIVA - 10 Marks
Year: IV Semester: I
S.N. Course Course Description Credits Lecture Tutorial Practical Total
Code (Hrs) (Hrs) (Hrs) (Hrs)
1 BCA411CO Software project 3 3 1 - 4

management
2 BCA412CO E-commerce 3 3 1 2 6
3 BCA413CO Advance Object Oriented 3 3 1 2 6

Programming
4 BCA414** Elective-I 3 - - - -
5 BCA415CO Internship 3 - - - 3
Total 17 15 4 10 29
SOFTWARE PROJECT MANAGEMENT
BCA411CO
Hours/Week
3 1 - 100
20 - 80 -
COURSE OBJECTIVES:
 To know of how to do project planning for the software process.
 To learn the cost estimation techniques during the analysis of the project.
 To understand the quality concepts for ensuring the functionality of the software.
UNIT I: SOFTWARE PROJECT MANAGEMENT CONCEPTS [9Hrs]

Introduction to Software Project Management: An Overview of Project Planning: Select Project, Identifying
Project scope and objectives, infrastructure, project products and Characteristics. Estimate efforts, Identify
activity risks, and Allocate resources.
UNIT II: SOFTWARE EVALUATION AND COSTING [9Hrs]

Project Evaluation: Strategic Assessment, Technical Assessment, cost-benefit analysis, Cash flow forecasting,
cost-benefit evaluation techniques, Risk Evaluation. Selection of Appropriate Project approach: Choosing
technologies, choice of process models, structured methods.
UNIT III: SOFTWARE ESTIMATION TECHNIQUES [9Hrs]

Software Effort Estimation: Problems with over and under estimations, Basis of software Estimation,Software
estimation techniques, expert Judgment, Estimating by analogy. Activity Planning: Project schedules, projects
and activities, sequencing and scheduling Activities, networks planning models,formulating a network model.
UNIT IV: RISK MANAGEMENT [9Hrs]

Risk Management: Nature of Risk, Managing Risk, Risk Identification and Analysis, Reducing the Risk. Resource
Allocation: Scheduling resources, Critical Paths, Cost scheduling, Monitoring and Control: Creating Framework,
cost monitoring, prioritizing monitoring.
UNIT V: SOFTWARE QUALITY MANAGEMENT [9Hrs]

TQM, Six Sigma, Software Quality: defining software quality, ISO9126, External Standards, Comparison of
project management software’s: dot Project, Launch pad, openProj. Case study:PRINCE2
REFERENCES:
1. Bob Hughes & Mike Cotterell, “Software Project Management”, Tata McGraw- Hill Publications,Fifth Edition
2012.
2. S. A. Kelkar,” Software Project Management” PHI, New Delhi, Third Edition ,2013.
3. Richard H.Thayer “Software Engineering Project Management,”: IEEE Computer Society
4. Futrell , “Quality Software Project Management”, Pearson Education India, 2008
E-Commerce
BCA412CO
Hours/Week
3 - 2 100
20 80 -
Course Objectives:
To provide the students with the theoretical background of e-commerce and its
application in business and develop a working e-commerce site.
1. Introduction to Electronic Commerce [4Hours]

1.1 E-Commerce and E-Business
1.2 Comparison of E-Commerce with Traditional Commerce
1.3 Advantages and Disadvantages of E-Commerce
1.4 Media Convergence
1.5 Business Applications of E-Commerce
1.6 Need for E-Commerce and E-Business
1.7 Basics of E-Commerce: Network and Electronic TransactionsToday
1.8 M-Commerce and its application
2. Business Models of E-Commerce [3 Hours]

2.1 Business Models and its Importance
2.2 Business-to-Business (B2B) E-Commerce, uses and advantages/disadvantages
2.3 Business-to-Consumer (B2C) E-Commerce, uses and advantages/disadvantages
2.4 Consumer-to-Consumer (C2C) E-Commerce, uses and
advantages/disadvantages
2.5 Consumer-to-Business (C2B) E-Commerce, uses and advantages/disadvantages
3. The Internet and WWW [3 Hours]

3.1 Evolution and features of Internet
3.2 Domain Names and Internet Organization(.edu , .com , .mil .gov , .net etc)
3.3 Types of Network(LAN , MAN, WAN)
3.4 Internet Service provider
3.5 World wide web
4. Internet and Extranet [7 Hours]

4.1 Definition of Internet
4.2 Advantages and Disadvantages of the Internet
4.3 Information Superhighway (I-way) and its component
4.4 Component of a Intranet Information technology structure
4.5 Development of a Intranet
4.6 Extranet and Intranet Difference
4.7 Role of Intranet in B2B Application
5. Security Framework [10Hours]

5.1 Secure Transaction
5.2 Computer Monitoring
5.3 Privacy on Internet
5.4 Computer Crime ( Laws , Types of Crimes)
5.5 Threats
5.6 Software Packages for Privacy
5.7 Hacking
5.8 Computer Virus ( How it spreads , Virus problem ,
5.9 Virus protection
5.10 Encryption and Decryption
5.10.1 Secret key Cryptography
5.10.2 DES
5.10.3 Public key Encryption
5.10.4 RSA
5.11 Authorization and Authentication
5.12 Firewall
5.13 Digital Signature (How it works )
6. Electronic Data Interchange [4 Hours]

6.1 Concepts of EDI and Limitation
6.2 Application of EDI
6.3 Disadvantages of EDI
6.4 EDI model
7. Electronic payment System [8Hours]

7.1 Introduction
7.2 Importance of Electronic Payment System
7.3 Types of Electronic payment system
7.4 Payment types
7.5 Traditional payment
7.6 Value exchange system
7.7 Credit card system and working principle
7.8 Smart Card and its working mechanism
7.9 Electronic cash, its properties and working mechanism
7.10 E-Cheque
7.11 Electronic funds transfer
8. Internet Marketing [4 Hours]

8.1 The PROS and CONS of online shopping
8.2 The cons of online shopping
8.3 Justify an Internet business
8.4 Internet marketing techniques
8.5 The E-cycle of Internet marketing
8.6 Personalization e – Commerce
9. Management of Change [2 Hours]

9.1 Overview of Change Management
9.2 E-Commerce in Nepal
Case Study
Visa Card, Master Card, PayPal, Amazon Payments, Google Wallets, Apple Pay, eSewa,
Pay Bill, iPay, HelloPaisa
Laboratory Work
Based on subjects students have to make a e-commerce site individually or in group
and complete report have submitted to department via subject teacher for their practical
marks.
Reference books
1. Andrew B. Whinston and Ravi Kalakota, “Frontiers on Electronics”, Pearson 1996,

ISBN 81-7808-357-5
2. Electronic Commerce by Gary P. Schneider
3. Kenneth C. Laudon, Carol G. Traver, “E-Commerce Business, Technology, Society”,
Pearson
4. E-Commerce Concepts, Models, Strategies by G.S.V Murthy
5. E-Commerce by Kamlesh K Bajaj and Debjani Nag
Advanced Object Oriented Programming
BCA413CO
Teaching Schedule
Theor Tutorial Practical Internal Final Total
y Assessment
3 1 2 20 20 60 - 100
Objective
 To understand fundamentals of object-oriented programming in Java
 To have the ability to write a computer program to solve specified problems.
 To be able to use the Java SDK environment to create, debug and run Java
programs.
1. Introduction to Java [12 Hours]

1.1 Overview of Object oriented Programming in Java
1.2 JVM, Java environment , Java tools
1.3 Features of Java
1.4 Control Statements
1.5 Looping
1.6 Array
1.7 String and StringBuffer
1.8 Vector
1.9 Class and Objects
1.10 Inheritance
1.11 Polymorphism
1.12 Working with Collections
1.13 Interface and Packages
1.14 Exception Handling[try, catch, throw, user defined exception]
1.15 Multi-threaded Programming[life cycle, thread creation, thread
synchronization]
2. Applet Programming [2 hours]

2.1 Introduction to Applet
2.2 Standard Applet Methods
2.3 Putting an Applet on a Web Page
2.4 Passing parameter to Applets
2.5 Comparison between Applet and Application
3. GUI Programming [7 hours]

3.1 AWT Vs. Swing
3.2 Using Swing Components
3.3 Using Automic Components [JLabel, JButton etc]
3.4 Using JFrame, JPanal, JTree and JTable
3.5 Event handling[Mouse driven, Keyboard driven and other]
4. Java IO [5 hours]
4.1 Working with Input/output APIs
4.2 Working with scanner class
4.3 Working with Files
4.4 Working with Object Serialization
5. JDBC [4 hours]
5.1 JDBC Basic
5.2 Different Types of Drivers
5.3 Setting up a database
5.4 Setting up a Connection
5.5 Retrieving Values from Result Sets
5.6 Deleting/Updating tables
5.7 Working with Statement and PreparedStatement
6. Socket Programming [6 hours]

6.1 Overview of Socket Programming
6.2 Introduction of APIs related to Socket Programming
6.3 Server Side Programming [TCP and UDP]
6.4 Client Side Programming [TCP and UDP]
6.5 A Sample Program
7. Distributed Application [5 hours]

7.1 Introduction to Distributed Objects
7.2 Overview of RMI
7.3 Rmi Architecture
7.4 Creating Distributed Application using RMI
8. Overview of Servlet and JSP [4 Hours]
8.1 Introduction to Servlet and JSP and its Architecture
8.2 Configuring Apache Tomcat to host Servlet/JSP files
8.3 Sample program of Servlet and JSP.
Laboratory:
There shall be lab exercises covering all features of above chapters.
Books Reference
1. Cay S. Horstman, “Core Java Volume I & II”, PHI
2. Bruce Eckel, “Thinking in Java”, PHI
3. Herbert Schildt, “Java: The Complete Reference”, McGraw Hill
4. Java 2.0 by “Ivan Bayross”
5. Programming with java by: “E. BALAGURUSAMY” latest edition.
Electives-I
1. Data Warehousing and Data Mining

2. Database Administration
3. Geographic Information System
4. Internet-Intranet
5. Network Security
INTERNSHIP
BCA415CO
Hours/Week
3 - - 100
- - - -
Course Synopsis
The students are required to complete a three credit 3 (45 hour) internship as a part of the
course requirement. Business organization is a crucial requirement of the Internship course
and this will have to be secured before getting started with the course. The work that the
students perform during the Internship will have to be supervised by the faculty members
the internship experience is expected to enable the students to assist in the resolution of
complex problem associated with Database systems.
At the end of the Internship, the student(s) are required to write a report on their internship
work. Such a report needs to be structured according to the prescribed format. The Report
forms a major aspect of the evaluation of the Internship work.
Goal
Main goal is to assist students in focusing their interests, thus aiding in their professional
carrier. It gives students the opportunity to re-examine their career objectives and explore
the variety of opportunities in the field of computer application.
Preparation
Students, the advisors, and the organization, with which the student team is affiliated, will
have to agree on a problem that needs to be addressed during the internship. An internship
is designed by the advisor and the student according to mutual interests, needs and
availability of related organization. To develop a rewarding program, at the beginning of
the internship, the advisor and student are asked to establish an internship plan, in the form
of written objectives and goals, and to develop a strategy for attaining those goals. The plan
may include a schedule of activities that need to be carried out in order to reach a solution
for the problem being addressed. The internship plan is not intended to be rigid. Advisor
may be unable to assess certain responsibilities until the student demonstrates his or her
ability. The plan should be flexible and subject to revision. The advisor and student should
assess the student's progress throughout the term of the internship both to evaluate the
student's performance, and to establish new directions as needed.
Role of the Advisor

Advisors are expected to share their experience, insight, and enthusiasm with the student
throughout the internship. They should continually monitor the progress of the student,
assessing written and oral communications and guiding the development of the student's
technical and managerial skills, effectiveness and presentation of self. Advisors are
expected to submit a post-internship evaluation of the student's accomplishments and
abilities and of the internship program in general.
Role of the Student

In order for the internship to be a mutually beneficial experience, a student should begin
with a definition of his/her objectives and specific interests for of 45 hour period to ensure
that appropriate activities and projects are selected by the advisor and the student. The
student will be responsible for the timely completion and professional quality of all
activities and projects assigned. The student is expected to speak frequently with the
advisor on his/her progress and interest in other projects, as well as to discuss observations
and questions about meetings, projects and other activities with which he/she is involved.
The student is required to submit to Advisor, within the first two weeks of the internship, a
brief plan for the internship.
Internship Group Size and document preparation

Each group must be of maximum 3 Students
Each student should prepare Individual document on the basis of his/her part in the
group project.
Supervisors must be assigned to each group
Domain/Scope of Internship (Project Implementation /Research)

-Bank
-Hospitals
-Software Companies
-NTC, Ncell and other Telecommunication Sectors
-Government Organizations (IT Related) etc
Report Format
APA Format
Tentative Contents of Report

 Abstract
 Introduction (organization +Work Done )
 Statement of the problem and Objective
 Literature Review and methodology (Optional)
 System Analysis
 System Design
 Implementation
 System Testing
 Limitation/future enhancement
 Conclusion
 References and Bibliography
Evaluation Criteria
Proposal Defense : 10% weight {Evaluated by Supervisor and Mentor}
Mid-Term : 30% weight {Evaluated by Supervisor and Mentor}
End-Term : 60% weight.
Proposal Defese (At beginning of the internship)

- Topic Selection with Proposal (5 of total)
- Presentation (5% of total).
Mid-Term (After 2 month)

- Program Design (10% of total)
- Demo Presentation (10% of total).
- Viva (10% of total)
End-Term (After Completion of internship and before final Exam)

- Depth of work (15% of total)
- Report (25% of total)
- Viva (10% of total)
- Presentation (10% of total)
Note: External examiner assigned from Purbanchal University (Dean Office,Faculty of

Science & Technology).
Students will be present in final presentation. External Examiner along with

Supervisors.
Year: IV Semester: II
1 BCA451CO e-Governance 3 3 1 - 4
2 BCA452CO 3 3 1 2 6
Multimedia Application
3 BCA453CO Dot Net Programming 3 3 1 2 6
4 BCA454** Electives-II 3 3 - -
6 BCA544CO Apprentice Project 6 - - 3 3
Total 17 15 4 10 29
e-Governance
BCA451CO

Hours/Week
3 1 - 100
20 80 -
Course Objective: This course provides the implementation and management of e-

Government from the technicalities of data flows and process mapping to the policies of
e-government and also provides the case studies of different countries.
Course Contents:
1. Introduction [ 3 Hrs ]
1.1. e-Government and e-Governance.
1.2. e-Government as information system.
1.3. Benefits of e-Government.
1.4. e-Government stages of development.
1.5. Online service delivery and electronic service delivery.
2. Public-Private Partnership for e-Government [ 4 Hrs ]

2.1. G2C Project
2.2. G2B Project
2.3. PPP Forms-JV Model, BOO Model, BOOT model, ASP model
2.4. Issues in PPP for e-Government
2.5. Citizen-centric approach to e-Government.
3. ICT Infrastructure for e-Government [3 Hrs ]

1.1. Network infrastructure.
1.2. Computing Infrastructure.
1.3. Data centers
1.4. E-Government architecture.
1.5. Interoperability framework.
4. e-Government Readiness [ 4 Hrs ]

1.1. e-Readiness framework
1.2. Steps to e-Government readiness.
1.3. Issues in e-Government readiness.
5. Security for e-Government [ 5 Hrs ]

1.1. Challenges of e-government security.
1.2. An approach to security for e-Government.
1.3. Security management model.
1.4. e-Government security architecture.
1.5. Security standards.
6. Managing e-Government [ 8 Hrs ]

1.1. Approaches to management of e-Government systems.
1.2. e-Government strategy
1.3. Managing public data
1.4. Managing issues for e-Government
1.5. Emerging management issues for e-Government.
7. Implementing e-Government [ 8 Hrs ]

1.1. e-Government system life cycle and project assessment
1.2. Analysis of current reality
1.3. Design of new e-Government system.
1.4. e-Government risk assessment and mitigation.
1.5. e-Government system construction.
1.6. Implementation and beyond
1.7. Developing e-Government hybrids.
8. Data Warehousing and Data Mining in Government [2 Hrs]
Introduction; National Data Warehouses: Census Data, Prices of Essential Commodities;
Other areas for Data Warehousing and Data Mining: Agriculture, Rural Development,
Health, Planning, Education, Commerce and Trade, Other Sectors.
8. Case Studies and Applications of e-government system [ 8 Hrs ]

8.1 Nepal: Cyber Laws, ICT development project, Government Integrated Data
Center (GIDC), e-Government master plan, Human resource management
software.
8.2 India: Community information centers, e-Procurement in the government of
Andhra Pradesh, e-Suvida.
8.3 Other Countries: E-Government development in South Korea, e-Government in
China, e-Government in Brazil, Sri Lanka, Singapore, USA.
Reference Books:
1. Implementing & Managing e-Government, Richard Heeks
2. e-Governance: Concepts & Case Studies, C. S. R. Prabhu, Prentice Hall of India
3. e-Government, J. Satyanarayana, Prentice Hall of India
Multimedia Application
BCA452CO
Hours/Week
3 1 2 100
20 20 60 -
Course Objectives:
To introduce the technologies, concept and techniques associated with the development of
multimedia system.
1. Multimedia System [4 hrs]

1.1 Introduction concept and structure
1.2 Media aspect properties
1.3 Definition of multimedia system.
1.4 Traditional data stream characteristics
1.5 Data stream characteristics for continuous media
1.6 Information units.
2. Sound and Audio [4 hrs]

2.1 Basic sound concept representation and formats
2.2 Basic music [MIDI] concepts, devices, messages, standards, and software
2.3 Speech: concept, generation, analysis, and transmission
3. Image and Graphics [4 hrs]

3.1 Basic concepts, Digital image processing and format and Graphics format
3.2 Image processing fundamentals, synthesis, analysis, and transformation.
4. Video and Animation [2 hrs]

4.1 Basic Video concepts, signal representation and format
4.2 Basic concepts of animation, languages, Methods of controlling, display and
transmission
5. Data compression [6 hrs]
5.1 Data compression and coding fundamentals
5.2 Source, Entropy and Hybrid coding
5.3 Basic data compression techniques
5.4 Coding standard JPEG MPEG and DVI
6. Optical Storage Media [3 hrs]

6.1 Basic technology
6.2 Video disk fundamentals
6.3 CD audio, CD ROM and extended Architecture
6.4 Principles of CD Write-Once and CD Magneto Capital.
7. Documents, Hypertext and MHEG [5 hrs]

7.1 Document architecture and multimedia integration
7.2 Hypertext, hypermedia and multimedia
7.3 Hypermedia System: Architecture, nodes and pointers
7.4 Architecture: SGML and ODA and MHEG.
8. Advanced Technologies in Multimedia

8.1 Multimedia Operation System [4 hrs]
8.1.1.Introduction
8.1.2.Resource management
8.1.2.1 Resource, requirements, allocation scheme, Continuous media
resource model
8.1.3.Process management
8.1.3.1 Real-time processing requirement , Real-time scheduling , Earliest
deadline first algorithm , rate monotonic algorithm
8.1.4 System Architecture
8.2 Multimedia communication system [4 hrs]
8.2.1.Application subsystem
8.2.1.1 Collaborating computing
8.2.1.2 Session management
8.2.2.Transport subsystem
8.2.2.1 Requirements, transport layer, and network layer
8.2.3.Quality of service and resource management
8.3 Abstraction of programming [3 hrs]

8.3.1.Abstraction levels
8.3.2.Libraries
8.3.3.system software
8.3.4.Toolkits
8.3.5. Higher programming languages
8.3.6.Object-oriented approaches
8.4 Synchronization [4 hrs]

8.4.1.Introduction
8.4.2.Notion of synchronization
8.4.3.Presentation requirements
8.4.4.Reference model for multimedia synchronization
8.4.5.Synchronization specification
9. Multimedia Application [2 hrs]

9.1 Video-On demand
9.2 Video Conferencing
9.3 Educational Application, Industrial Application
9.4 Information System, Multimedia archives & digital libraries, Media editors.
Laboratory Exercises
1. Integration of multimedia [Audio, Speech, and Music Video, Static and, Movie,
Animation Programming etc.]
2. Image Enhancement in Photoshop.
3. 2D & 3D animation in OpenGL/Maya/Flash/C++
4. Image Compression Algorithm: JPEG
5. Real Time Scheduling Algorithm
Note: Lab on any two topics.
References
1. Steinmetz Ralf, and Nahrstedt Klara., Multimedia Computing Communications and
applications, Pearson Education asia 2001, ISBN 81-7808-319-1
2. Andleigh P. Thakrar, Multimedia System Design Prentice Hall, NJ 1996
3. Gibbs S.J. Tsichritzis, D.C. Multimedia Programming objects, Environment and
frameworks Addsion-wesley-1995
4. Koegel-Buford J.F. Multimedia System Addsion-Wesley, 1994
5. J.Jeffcoate, Multimedia in Practise: Technology &Application, PHI
Dot Net Programming [BCA453CO]
Year – IV Semester – II
Teaching Schedule Examination Schemes

Hour/Weak
3 1 2 20 20 60 - 100
Objectives:
 To understand windows and web based applications using Microsoft .Net Framework.
 To provide theoretical knowledge and practical expertise on DOT NET Technology.
 To gain a basic practical understanding of dot net concepts, technical issues and
application.
1. Overviews of VB.NET and C#.NET Language. [ 4 Hrs ]

1.1 Introduction to .Net Framework.
1.2 Introduction to C# and VB
1.3 Feature of object oriented programming.
1.4 Scope of .Net Technology.
2. Language Basics. [ 4 Hrs ]

2.1 Variables and Data Types.
2.2 String and String Builder.
2.3 Boxing an Unboxing.
2.4 Operators.
2.5 Control statements.
2.6 Arrays and Strings.
2.7 Procedure and Functions.
3. Developing Console Application. [ 4 Hrs ]

3.1 Entry Point Method -Main.
3.2 Command line parameters.
3.3 Compiling and Building Projects.
3.4 Using control statements in Console Application.
4. Essentials of object – oriented programming. [ 6 hrs ]

4.1 Object and Class definition working.
4.2 Understanding Identity, State and Behavior.
4.3 Using encapsulation to combine methods and data in a single class
4.4 Inheritance and Polymorphism with interface.
5. Windows Forms and standard components. [ 14 Hrs ]
5.1 Introduction.
5.2 Basic controls.
5.3 Menu and Context Menus.
5.4 Menu Strip, Toolbar Strip.
5.5 Group box and Panel.
5.6 ListBox.
5.7 RadioButton and CheckBox.
5.8 DateTimePicker
5.9 TabControl
5.10 RichTextBox
5.11 ProgressBar
5.12 ImageList
5.13 HelpProvider
5.14 Error Provider
5.15 Graphics and GDI.
5.16 Timer.
5.17 SDI and MDI Applications.
5.18 Dialog box ( Modal and Modeless )
5.19 Form Inheritance.
5.20 Developing Custom, composite controls.
5.21 Field Validator Control.
5.22 Delegates in c#.
5.23 Events – Types and Handling.
5.24 Exception Handling.
6. Data Access with .NET [ 7 Hrs ]

6.1 Comparison between ADO and ADO.NET.
6.2 ADO.NET Concept and Overviews.
6.3 Working with connection, Command, DataReader.
6.4 Working with Dataset.
6.5 Adding, Deleting and Modifying records in Dataset.
6.6 Using DataView.
6.7 Working with DataGridVeiw.
6.8 Calling stored procedure.
7. Web Application [ 6 Hrs ]

7.1 Basic Concepts of Web Application Development.
7.2 Implementing session and cookies.
7.3 Client and server side validation.
7.4 Building Web Application.
Laboratory:
Lab should cover at least 12 labs and should include.
1. Introduction to IDE.
2. Windows and Web Forms.
3. Events and Event Handling.
4. Controls and its Validations.
5. Web Application Development.
6. Database connectivity with different DBMS.
7. Error Handling.
Reference:
1. Professional c# 2.0 (Wrox Publication), Christian Nagel, Bill Evjen, Jay Glynn, Morgan
Skinner, Karli Watson, Allen Jones.
2. Professional ASP.net 2.0 (Wrox Publication), Scott Hanselman, Farhan Muhammad, Srinivasa
Sivakumar, Devin Rader.
3. Jose Mojica, C# & VB.Net Conversion Pocket Reference, O’Really Media .

4. Evangelospetroutsos, Mastering Visual Basic.Net, BPB Publication.
5. Bill Ejen, Scott Hanselman, Devin Rader, Farhan Muhammad, Srinivasa Sivakumar, “
Professional ASP.NET 2.0 special edition” , ISBN: 978-0-470-04178-9
Electives-II (BCA 8th)
1. Image processing & Patteen Recognition
2. Information Security
3. System Administration
4. Wireless networks and mobile computing
5. Embedded systems
Apprentice Project
BCA544CO
Teaching Schedule
Examination Scheme
Hours/Week
Internal
Assessment
- - 3 100
- 60 - 40
Course Objective: After finishing this project, students will be able to develop 2-tire
or 3-tire or n-tire application using any RDBMS tool.
Course Contents:
A total of 45 lab hours covering all features Client side scripting; Server Side
scripting (2-tire or 3-tire or n-tire application) using any RDBMS tool will be
assigned to every student. Students must develop the assigned application software.

criteria:

criteria:
 VIVA --- 10 Marks
Note: Final Project Documentation should be in APA Format.

BCA Slybus Purbanchal

Uploaded by

Copyright:

Available Formats

BCA Slybus Purbanchal

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BCA Slybus Purbanchal

Uploaded by

Copyright:

Available Formats

Purbanchal University

Bachelor of Computer Application (BCA)

2 BCA105SH Technical English 3 3 1 - 4

3 BCA170CO Computer System Concepts 3 3 1 2 6

4 BCA175CO Computer Programming in C 3 3 1 2 6

5 BCA178CO Computer Project-I 2 - - 3 3

6 BCA190MS Modern Business Practices 3 3 1 - 4

Course Objectives: The main objective of this course is to develop:

Objective : Objective of this course is to provide a sound knowledge of calculus and

Unit - 6: Define Integrals:

Unit 1. Basic Mathematics Vol. 1.

Recommended Text - Book :

Ex. No. Exercise Topic

1. Display messages as output

Course Objective: The main objective of this course is to provide a foundation of

Project Evaluation Criteria for Internal assessment:

S.N. Course Course Description Credits Lecture Tutorial Practica Total

2 BCA171CO Digital Logic 3 3 1 2 6

3 BCA172CO Microprocessor & Assembly 3 3 1 2 6

4 BCA176CO Object-Oriented Programming 3 3 1 2 6

5 BCA179CO Computer Project-II 2 - - 3 3

6 BCA191MS Financial Accounting 3 3 1 1 5

Course Objective: To understand vectors in space, curves in space and their

Unit-2 Differentiation of Vector function: (5 hrs)

Unit-3 Plane Analytic Geometry:

Unit-4 Differential equations: (10 hrs)

Unit-5 Matrix Algebra: (5 hrs)

Unit-6 Linear Equations: (5 hrs)

Objective : To provide a foundation in digital electronics applicable to computers science

Digital Lab Contents:

Experiment 1 To determine the truth table of Two-Input OR Gate

and delete operators, constants, Enumeration, comments. [2 Hrs]

The project document shall include the following:

Project Evaluation Criteria for Internal assessment:

2 BCA271CO Computer Architecture 3 3 1 - 4

3 BCA273CO Data Structure & Algorithm 3 3 1 2 6

4 BCA270CO System Analysis & Design 3 3 1 - 4

5 BCA275CO User Interface Design 3 3 1 2 6

6 BCA278CO Computer Project-III 3 - - 3 3

Year: II Semester: III

Course Objective: To provide fundamental knowledge on the concept of sociology and to

Year: II Semester: III

Course Objective: To provide the concepts of computer architecture as well as computer

2. Computer Organization and Design [5 Hrs]

3. Control Unit [5 Hrs]

4. Central Processing Unit [5 Hrs]

5. Computer Arithmetic [7 Hrs]

6. Input Output Organizations [5 Hrs]

7. Memory Organization [5 Hrs]

8. Pipeline and Vector Processing [5 Hrs]

2. Algorithmic Efficiency and its Complexity [2 Hrs]

5. List and Linked List [6 Hrs]

9. Searching and Hashing [6 hrs]

10. Graphs [7 hrs]

Laboratory: There shall be following lab exercises based on C or C++.

2. Process and Conceptual Modeling [6 Hrs]

3. Logic Modeling [3 Hrs]

4. Systems Analysis [8 Hrs]