0% found this document useful (0 votes)

406 views73 pages

Kuvempu. Universe

The document provides details about the BCA syllabus for Semester 1. It includes 6 courses: 1. Language 1 and Language 2, which cover language courses as defined by respective language departments. 2. Mathematics 1, which covers topics like mathematical logic, matrices, set theory, group theory, and trigonometry. 3. Accountancy 1, which introduces concepts of accounting, subsidiary books, final accounts, hire purchase, installment purchase, and departmental and branch accounts. 4. Computers Concepts and C Programming, which has two parts - computer concepts covering hardware, software, problem solving techniques. C programming covering basics, operators, decision making, looping, arrays, and functions

Uploaded by

Rtggh

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

406 views73 pages

Kuvempu. Universe

Uploaded by

Rtggh

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 73

BCA syllabus

SEMESTER-I

BCA 101 : Language – 1

The syllabus for this language is given by the BOS of corresponding language departments.

BCA 102 : Language – 2

The syllabus for this language is given by the BOS of corresponding language departments.

BCA 103 : Mathematics – 1

Number of Teaching Hours – 48

Theory Examination- 80 Max marks. Internal Assessment- 20 Max marks.

Unit 1- Mathematical Logic:

Proposition and its types, Negation, Disjunction, conjunction, Tautologies and

Contradictions, Logical equivalence, Algebra of proposition, conditional proposition, Converse,
Inverse, and contra positive Proposition, Bi-conditional Proposition, Arguments (Formation Of
truth table and simple problems) PRIDICATE CALCULUS; Definition Of Predicate , The
Statement function, variables and Quantifiers, Predicate Formulae, Negation Of quantifiers,
Simple Problems

Unit 2- Matrices and Determinants:

Matrix Types of matrices, Addition, subtraction, scalar multiplication of a matrix, product

of two matrices, Problems Determinants of a square matrix and evaluation, Minor, cofactor of
element of a square matrix, Adjoint, Singular matrices, Inverse of a Square Matrix, Problems
Solution of a system of a linear equation by matrix method, characteristic equation and
characteristic roots of a square matrix of order 2 and 3, Cayley Hamilton theorem(statement
only) and problems

Unit 3- Set Theory:

Sets, Types of sets, difference of sets and problems. Cartesian product of two sets,
relation, domain and range of a relation, Types of Relation, identities, Reflexive, symmetric,
Transitive, Anti-symmetric, Inverse Relation And problems. FUNCTION - Definition, types of
function, Objective function, Inverse unction, inverse of an element, Composition of two
function, Problem.

Unit 4 - Group Theory:

Binary operation algebraic structure, abelian group, finite group, and infinite group, order
of a group, Composition table, modular group, group of matrices, problems. Square roots, Cube
roots, Fourth roots of unity forms abelian groups w.r.t multiplication, properties of groups(with
proof). Sub groups, proof of necessary and sufficient condition for sub groups, permutation
group

Unit 5- Trigonometry:
Definition of trigonometric function, Trigonometric ratio of acute angle, Identities and
problems, Trigonometric functions of standard angles(without proof) problems, Allied
angles(statement only) Problems Compound angles, multiple and sub multiple angles,
Transformation formulae(without proof) simple problems, Inverse trigonometric
function(derivation of standard formulae and problems)

References :

1. Text book of Mathematics – Shanthi Narayan

(for matrices and Trignometry)
2. Text book of Mathematics – S. Lipschutz
( for set theory and related topics)
3. Text book of Mathematics – N.S. Gopalakrishna
( for groups )
4. I & II PUC text books (non CBSC) – G.K. Ranganath
(II PUC books )

QUESTION PAPER PATTERN

PART I
20 Marks
There shall be 12 questions and each carrying 02 Marks. The student has to attend only10
questions. 08 questions from first 4 Units
(02 Questions from each Unit)
04 questions from Fifth Unit.

PART II
15 Marks There shall be 05 questions
and each carrying 05 Marks. The student has to attend only 03 questions. 04 questions from
Mathematical logic and 1 question from set Theory.

PART III
15 Marks
There shall be 05 questions and each carrying 05 Marks. The student has to attend only
03 questions. 02 questions from function and 03 questions from Group
Theory.

PART IV
15 Marks
There shall be 05 questions
and each carrying 05 marks.
The student has to attend only 03 questions. 05 questions from Matrices and Determinants.

PART V
15 Marks There shall be 05 questions and each carrying 05 Marks. The student has to attend
only 03 questions. 05 questions from Trigonometry.

BCA 104 Accountancy-I

Number of Teaching Hours – 48

Theory Examination- 80 Max marks. Internal Assessment- 20 Max marks.

Unit 1-Introduction:
Meaning and definition of accounting, Importance of counting concepts and
conventions, journal, ledger, cash book [Double column] preparation of trial balance.

Unit 2- Subsidiary books:

Introduction, meaning, features, objectives, types of subsidiary books, purchase
books, purchase returns books, sales, sales returns book.

Unit 3 - Final accounts:

Final accounts of a sole trading concern.

Unit 4- Hire purchase and installment purchase.

Unit 5- Departmental Accounts :

allocation of expenses, problems on departmental accounts.

Unit 6- Brach Accounts :

Preparation of accounts in the books of Head Office only
a. Brach which deals in cash and credit sales
b. Branch which receives Goods at invoice price (Including stock and debtors system)

Unit 7: Insurance Claims – With average clause.

Reference :

1. Financial Accounting : Dr. S N Maheshwari

2. Financial Accounting : B S Raman
3. Advanced Accounting : Shukla & Grewal
4. Advanced Accounting : Radhaswamy & R L Gupta

BCA 105: Computers Concepts And C Programming

Number of Teaching Hours – 40

Theory Examination- 80 Max marks. Internal Assessment- 20 Max marks.

PART – A : Computer Concepts

Unit 1- Introduction to Computer Systems: 3 Hrs

Definition of a Computer, History of Computers, Generations of Computers,
Block diagram of a Computer with functional units (explanation), Parts of a computer system
with peripherals (explanation of peripherals briefly) Information processing Cycle.

Unit 2. Software: 3 Hrs

Definition of software, Classifications of programming languages, assembler,
compiler, interpreter, linker, loader (Definitions only). Operating System Basics : Definition,
functions of an operating system, types of operating system, graphical user interface - basic
components of GUI.

Unit 3- Problem Solving Techniques : 8 Hrs

Problem Definition, Problem Analysis, Design of Problems and Design Tools.
ALGORITHMS: Algorithm-definition, Characteristics, Notations, Advantages and
Disadvantages. FLOWCHART: Definition, Symbols, Advantages and Disadvantages.
Debugging, Testing, Documentation and Maintenance. Writing an algorithm and flowchart : Area
of circle, arithmetical operations, simple interest and compound interest, quadratic equation,
largest of three numbers, sum of N natural numbers, factorial of number, Fibonacci series, prime
number, reverse a given number.

PART – B : C – Programming

Unit 4- Introduction: 4 Hours

Features, basic program structure, character set, tokens, keywords and identifiers.
Constants, variables, data types, variable declaration, symbolic constant definition.

Unit 5- Operators: 10Hours

arithmetic, relational, logical, assignment, increment and decrement, conditional,
bitwise and special operators, Arithmetic expressions, precedence of operators and associatively.
Type conversions, mathematical functions. Managing I/O operators – reading and writing a
character, formatted I/O.

Unit 6- Decision making, branching and looping 10 Hours

if and if-else statement, switch statement, ? operator, go to statement, while, do-
while and for statements, break and continue statements.
Unit 7- Arrays and Functions 10 Hours
one and two dimensional arrays, array initialization. Strings - declaration and
initialization of string variable, reading and writing strings, string handling functions. Functions
– Need, syntax of function declaration, all types of functions, nesting of functions, function with
arrays, scope of variables, Recursion.

Reference :

1. Fundamentals of Computers, V. Rajaraman.

2. Computer fundamentals, B. Ram
3. Computer Concepts and Programming, Padma Reddy
4. y4. Let us C , Yashwanth Kanetkar
5. Ansi C, Balagurusamy

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions
and each carrying 01 Marks.
The student has to attend all
the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks.

The student has to attend only 02 questions. 01 question from Unit 1 and Unit 2.
02 questions from Unit 3.
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks.
The student has to attend only 05 questions. 01 question from Unit 4.
01 question from Unit 5.
02 question from Unit 6.
02 questions from Unit 7.

BCA 106: Logic Design

Number of Teaching Hours – 40

Theory Examination- 80 Max marks. Internal Assessment- 20 Max marks.
Part A

Unit 1- Number system and codes: 4 Hrs

Binary number system, decimal number system, octal number system,
hexadecimal number system. Bases inter conversions. Representation of negative numbers 1’s
and 2’s complements. Codes:. BCD, GRAY, EXCESS-3., ASCII,EBCDIC and UNICODE

Unit 2- Memory : 3 Hrs

Semiconductor memories – volatile, non volatile, concepts of RAM, SRAM,
DRAM, SDRAM, Features of ROM, PROM, EPROM, EEPROM, Virtual memory, Cache
memory

Unit 3- Boolean agebra and logic systems: 8 Hrs

Laws of Boolean algebra, Boolean laws. Evaluation of Boolean
expression, De Morgan’s theorems and proof, simplification on Boolean expressions using
Boolean laws Basic gates (AND, OR, NOT): truth table, Definition, Boolean expression and
symbols, universal gates (NAND, NOR): truth table, definition, Boolean expression and
symbols, design of basic gates using NAND and NOR gates. Design of given Boolean
expression using basic gates or NAND gate or NOR gate. XOR and XNOR gate (Definition,
Boolean expression and symbols, truth table).

PART B

Unit 4- Simplication of Boolean functions: 10 Hrs

SOP and POS form, min term and max term , expression of Boolean equation in
Min and Max term(conversion of SOP and POS forms to standard form) K-map method:
simplification of Boolean equation using K-map (up to 4 variables), without and with don’t-care
condition, Implementation using basic gates or NAND gate or NOR gate Quine - Mc Cluskey
Tabulation method (up to 5 variables).determination and selection of prime implicates

Unit 5- Combination logic: 7Hrs

Design procedure, design of half adder and full adder, half subtractor and full
subtractor. Code converters:- BCD to Excess 3 code, gray code, magnitude comparator, encoders
(BCD to decimal), decoder (decimal to BCD), multiplexer(4:1), demultiplexer(1:4).

Unit 6- Sequential logic: 13 Hrs

Introduction, Flip-flops – JK, SR, D, T, JK-MS (Detailed Studey) Registers –
Introduction, shift register- types and applications. Counters – synchronous and asynchronous
counters (Up, down up down and Mod counters).

References:
1. Digital Logic and Computer Design- M. Morris Mono
2. Computer fundamentals - B. Ram
QUESTION PAPER PATTERN
PART I10 Marks There shall be 10 questions and each carrying 01 Marks.
The student has to attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks.

The student has to attend only 02 questions. 01 question from Unit 1 and Unit 2.
02 questions from Unit 3.
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks.
The student has to attend only 05 questions. 02 question from Unit 4.
02 questions from Unit 5.
03 question from Unit 6.

BCA 107 : Excel and C- programming lab

List of Excel sheets problems (03 practical sessions)

Development of Excel sheet with IF(), graphs, filters(auto and advanced), functions,
macros

List of C-programs (08 practical sessions)

1. All roots of quadratic equation

2. First biggest and second biggest among n numbers(without array)
3. Prime numbers between M and N (M<=N)
4. Fibannoci series between M and N
5. Binary to Octal conversion
6. Any ten String handling function using switch-case
7. Sorting and unsorted array’
8. Deleting the repeated elements in an array
9. Addition of two matrices
10. Multiplication of two matrices
11. Comparison of [A] and [A]T
12. Sum of upper triangular, lower triangular and diagonal elements of a square matrix.
13. Binary and linear search in an array using function
14. Norm and trace of a matrix using call by reference
15. Recursive functions –GCD , binomial coefficient, biggest of n numbers (use switch case)
PRACTICAL EXAM SCHEME

Practical Proper - 70 Marks

Viva – voce - 10 Marks

Excel Sheet Successful development of Excel sheet 20 Marks

C-Program
Flowchart/Algorithm 10 Marks
Program Writing 20 Marks
Error free Compilation or Partial output 10 Marks
Correct output with proper display 10 Marks

SEMESTER-II BCA 201 : LANGUAGE - I

The syllabus for this language is given by the BOS of corresponding language departments

BCA 201 : LANGUAGE - II

The syllabus for this language is given by the BOS of corresponding language departments

BCA 2.3 : MATHEMATICS-II

Number of Teaching Hours – 48

Theory Examination- 80 Max marks. Internal Assessment- 20 Max marks

Unit 1- Complex Number: Definition of complex numbers as an order pair, Real and imaginary
parts, modulus and amplitude of a complex number, Polar form of a complex
number,problems.DeMoire’s theorem(statement only) method of finding square roots, cube
roots, and fourth roots of a complex number and their representation in the Argand diagram.

Unit 2- Continuity And Differentiation: Limits and continuity, Diffrentiability, concept and first
principle deritives of xn ,eax logax ,sinax, cosax, tanax, cotax,secax, cosecax, concept of putting
a=1 in above functions, problems upto successive differentiation

Unit 3- Standard Integrals: Integration of algebraic,Logarithmic,exponentional and trigonometric

function, Integration by parts, Definite integrals,Properties and problems.
Unit 4- Numerical Analysis: Finite difference, Forward and Backward difference properties of
the operators, The shift operator E. The relation between forward, backward, and Shift operator
and D=

Unit 5- Interpolation: Newton-Gregory interpolation formula with equal intervals and with
unequal intervals ,Lagranges interpolation formula.

References :
1. Text book of Mathematics – Shanthi Naraya
( for calculus)
2. Numerical Analysis - Schaum Series
3. Complex Numbers - Schaum Series
4. Text book of Mathematics – G.K. Ranganath (non CBSC II PUC book)
5. B.Sc Mathematics volume -5 - G.K Ranganath

QUESTION PAPER PATTERN

PART I
20 Marks
There shall be 12 questions
and each carrying 02 Marks. The student has to attend only10 questions. 03 questions from
Complex number
03 questions from Continuity and differentiation.
03 questions from Integration.
03 from Numerical analysis.

PART II
15 Marks There shall be 05 questions
and each carrying 05 Marks. The student has to attend only 03 questions. 05 questions from
Complex
number

PART III
15 Marks
There shall be 05 questions and each carrying 05 Marks. The student has to attend only
03 questions. 05 questions from Continuity and differentiation.

PART IV
15 Marks
There shall be 05 questions
and each carrying 05 marks. The student has to attend only 03 questions. 05 questions from
Integration.
PART V
15 Marks There shall be 05 questions and each carrying 05 Marks. The student has to attend
only 03 questions. 05 questions from Numerical analysis.

BCA 204 : ACCOUNTANCY – II (Cost & Management Accounting)

Number of Teaching Hours – 48

Theory Examination- 80 Max marks. Internal Assessment- 20 Max marks

Unit 1: Meaning & Definition of Cost, Cost accounting Scope of cost accounting, difference
between cost accounting and financial accounting, classification of cost, preparation of simple
cost sheets.
Unit 2: Definition & Meaning: Objectives of management accounting, Difference between Cost,
Financial and Management accounting, Limitations of management accounting.
Unit 3: Financial Statements –Meaning, Objectives, Methods- Comparative financial Statements,
Common size statements.
Unit 4: Ratio Analysis- Meaning, objectives, limitations, types of ratios - profitability ratio, turn
over ratio, liquidity ratio, quick ratio, inventory turn over ratio, working capital ratio, proprietary
ratio.
Unit 5: Budgetary Control – Meaning, Advantages and limitations of Budgetary Control, Types
of Budgets, Problems on production, Sales, Cash & Flexible Budgets.
Unit 6: Break Even Analysis- meaning, importance , assumptions, limitations, calculation of
contribution, break even point, profit on sales, fixed cost, variable cost, margin of safety.

References Books:
1. Cost Accounting : Jain & Naram
2. Cost Accounting : B S Raman
3. Cost Accounting : S P Iyengar
4. Management Accounting : Sharma & Gupta
5. Management Accounting : Pillai & Bagavathi
6. Management Accounting : J Madegowda

BCA 205 : DATA STRUCUTRES

Number of Teaching Hours – 48
Theory Examination- 80 Max marks. Internal Assessment- 20 Max marks.

PART – A
Unit 1- Review Of Structures And Pointers: Pointers- concept, pointer operator and operation,
pointer arithmetic, dynamic memory allocation, command line arguments. Structure : Definiton,
declaration, accessing structure members, bit fields, array of structure, union and enum Files :
system call VS library call, opening disk files, fopen, I/O library functions, copying a file, fclose.
8 Hrs
Unit 2- Stack: Definition and example, operations, representation of stack in C, evaluation of
postfix expression, conversion from infix to postfix 6 Hrs
Unit 3- Recursion: Recursive definition, and process, Recursion in C, writing Recursive
programs, efficiency of recursion- examples 2 Hrs

PART - B
Unit 4- Queues and lists: The Queue and its sequential representation, circular queue, priority
queues,. Linked list – linked representation, stacks and queue using linked list, other list
structures-circular and doubly linked list (concepts only).
10 Hrs
Unit 5- Trees: Binary tree, binary tree representation - linked representation, tree traversals, and
binary search tree and their applications. 7 Hrs
Unit 6- Searching: Basic search technique, sequential search, and its efficiency searching ordered
table-index sequential search, Binary search, interpolation search, binary tree searching,
3 Hrs
Unit 7- Sorting: General background, quick sort, insertion sort – simple insertion, shell sort,
radix sort, selection sort-straight selection sort, binary tree sort, heap sort.
10 Hrs
References;
1. Data structures using C and C++ - Yedidyiah et al PIII publications
2. Programming in ANSI C - E. Balagursamy
3. Datastructures and programming design using C - Robert Kruse PIII publications
4. Datastructures and applications - Trembly and Sorenson
5. Systematic approach to data structure Padmareddy
6. Robert L Kruse, “data structure and program design using c”, PHI.

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions
and each carrying 01 Marks.
The student has to attend all
the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions

and each carrying 10 Marks.
The student has to attend only 02 questions. 01 and half question from Unit 1.
01 and half questions from
Unit 2 and Unit 3.
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks.
The student has to attend only 05 questions. 02 question from Unit 4.
02 questions from Unit 5 and 6.
03 question from Unit 7.
BCA 206 : COMPUTER ORGANISATION AND ARCHITECTURE

Number of Teaching Hours – 48

Theory Examination- 80 Max marks. Internal Assessment- 20 Max marks

Part – A
Unit 1- Basic Structure of Computers: Basic operational concepts, Bus Structures, performance,
Multiprocessors and Multicomputer, Historical perspective.
3 Hrs
Unit 2- Machine instructions and programs : Numbers, Arithmetic Operation and Characters,
Memory Location and Addresses, Memory Operations, Instruction and Instruction Sequencing,
Addressing Modes, Assembly Language, Basic Input/output Operation, Stacks and Queues,
Subroutines, Additional Instructions.
5 Hrs
Unit 3- ARM, Motorola, and Intel instruction sets : IA-32 Pentium:- Registers and Addressing,
IA -32 Instructions, IA-32 Assembly Language, Program Flow Control, Logic and Shift / Rotate
Instructions, I/O Operations, Subroutines.
7 Hrs
Part – B
Unit 4- Input/ output organization : Accessing I/O Devices, Interrupts, Direct Memory Access,
Buses, Interface Circuits, Standard I/O interfaces 8 Hrs
Unit 5- The memory system : Basic Concepts, Semiconductor RAM memories, Cache memories,
Virtual Memories. 8 Hrs
Unit 6- Arithmetic : Addition and subtraction of signed , Design of fast adders , Multiplication of
positive numbers, Signed – operand multiplication, Fast multiplication, Integer division, Floating
– point numbers and operation.
8 Hrs
Unit 7- Basic processing unit : Some fundamental concepts , execution of complete instruction,
multiple-bus organization , introduction on hardwired control and Micro programmed control;
Embedded systems - Embedded systems, processor chips for embedded application, a simple
microcontroller. 10 Hrs

References:
1. Computer organization : Carl Hamacher, Zvonko Vranesic and Safwat Zaky Mcgraw
2. Digital Logic and computer design : Morris Mano, M.
3. Digital Computer Fundamentals : Bartee, T.C.
4. Computer Architecture and Organisation : Tanenbaum, A.S.
5. Computer Architecture and Organisation : Hayes, J.P
6. Introduction to Microprocessors : Gaonkar

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each arrying 01 Marks. The student has to
attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each arrying 10 Marks. The
student has to attend only 02 questions. Half questions from Unit 1.
01 and half question from Unit 2.
01 questions from Unit 3.
PART III 50 Marks
There shall be 07 uestions and each carrying 10 Marks.
The student has to attend only 05 questions. 02 question from Unit 4.
02 question from Unit 5.
01 question from Unit 6.
02 questions from Unit 7.

BCA 207 : DATA STRUCTURES LAB

Part – A

1. Implementation of stack using structure

2. Evaluation of post fix expression
3. Implementation of queue using structures
4. Implementation of circular queue using structures
5. Shell sort

Part – B
1. Conversion of infix to postfix
2. Implementation of linked list (ordered insertion, deletion and searching a node)
3. Implementation of stack using linked list
4. Implementation of using linked list
5. Binary tree traversals
6. Binary tree searching
7. Quick sort
8. Heap sort
9. Tree sort
10. Radix

PRACTICAL EXAM SCHEME

Practical Proper - 70 Marks
Viva – voce - 10 Marks

Part –A

One Program
Max marks 25
Flowchart/Algorithm 05 Marks
Program writing 10 Marks
Error free compilation or partial output 05 Marks
Correct result with proper display 05 Marks

Part - B
One Program
Max marks 45 Flowchart/Algorithm 10 Marks
Program writing 15 Marks
Error free compilation or partial output 10 Marks
Correct result with proper display 10 Marks

SEMESTER-III

BCA 301 : LANGUAGE - I

The syllabus for this language is given by the BOS of corresponding language departments

BCA 302 : LANGUAGE - II

The syllabus for this language is given by the BOS of corresponding language

BCA 303:Object Oriented Programming with C++

PART-A
chapter 1: Principles of OOPS:
Object Oriented Programming paradigm, Basic concepts of Object Oriented Programming-
Classes, Objects, Data Abstraction and Encapsulation, Polymorphism, Inheritance, Dynamic
Binding, Message passing, Benefits of OOP, Object Oriented languages, applications of OOP.
6 Hrs

Chapter 2: Introduction to C++ Programming:

C++ features, Comparison with C, Structure of a C++ program, input and output statements,
Keywords, symbolic constants, type compatibility, declaration of variables, reference variables,
operators in C++, control structures. 8 Hrs
PART- B
Chapter 3 : Classes Objects and Member Functions:
Limitations of structures in C, specifying a class, creating objects, memory allocation for objects,
static data members, arrays within a class, local classes. Defining member functions, call by
reference, return by reference, inline functions, default arguments, making an outside function
inline, nesting of member functions, private member functions, function overloading, static
member functions, const member functions, pointer to members, friend and virtual functions.
8 Hrs
Chapter 4 : Constructors and Destructors:
Introduction, constructors, parameterized constructors, multiple constructors in a class,
constructors with default arguments, dynamic initialization of objects, copy constructor, dynamic
constructors, constructing two dimensional arrays, const objects, destructors. 6 Hrs
Chapter 5 : Operator overloading and type conversions:
Introduction, definition, overloading unary operators, overloading binary operators, overloading
operators using friends, string manipulations using operators, rules for operator overloading, type
conversions. 6 Hrs
Chapter 6 : Inheritance:
Introduction, defining derived classes, single inheritance, making a private member inheritable,
multilevel inheritance, multiple inheritance, hierarchical inheritance, hybrid inheritance, virtual
base classes, abstract classes, constructors in derived classes, member classes, nesting of classes.
10 Hrs
Chapter 7 : Templates:
Introduction, class templates, class templates with multiple parameters, function templates,
function templates with parameters. 6 Hrs

Reference Books:
1. Object Oriented Programming with C++ - E balaguruswamy
2. C++ Prime – Stanly Lippaman and Jose Lajoie
3. Object Oriented Programming in Turbo C++ - Robert Lafore
4. C++ The complete Language – Bjarne Schildt

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each arrying 01 Marks. The student has to
attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend only 02 questions. 01 questions from Unit 1.
02 question from Unit 2.
.
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks.
The student has to attend only 05 questions. 02 question from Unit 3.
02 question from Unit 4.
02 question from Unit 5.
01 question from Unit 6.

BCA 304:SYSTEM SOFTWARE
PART-A
1. Machine Architecture and assemblers:
Introduction, System software and machine architecture, Simplified Instructional Computers
(SIC) and its architecture, Instruction Formats of IBM-360. 4 Hrs
2. Assembler: Introduction, General design procedure, design of Assembler, statement of
problem, data Structure, Format of Date bases, Algorithm for pass 1 and pass 2, look for
modularity. Explanation along with flowcharts for both pass 1 and pass 2 (detail flowchart).
8 Hrs
3. Table Processing :Searching & sorting - Linear and binary search , comparison,
examples. Interchange sort,, shell sort, bucket sort, radix exchange sort, address calculation sort,.
Random entry searching 4 Hrs.
PART-B
4. Macro Language and macro processor:
Introduction, Macro instructions, Features of macro facility-macro instruction arguments,
Conditional macro Expansion, Macro calls within macro, Macro instruction defining macro
implementation: statement of problem, Specification of databases and specification of data base
format, Algorithm and flowchart for processing macro definitions and Macro expansion
10 Hrs.
5. Loader:
Introduction, Loader schemes-compile and go loader scheme, general loader, Absolute loader,
Sub routine linkage, Relocating loader, Direct linking loader, overlays, Dynamic loading.
10 Hrs.
6. Compiler:
Introduction, Statement of problem, Phases of compiler, Lexical phase, syntax phase,
interpretation phase optimization phase, storage assignment phase, code generation phase,
Assembly phase, passes of compiler. Data Structures: statement of problem, storage classes and
its use. Block structure. 12 Hrs.

References:
1. System programming – John. J. Donovan
2. System Software – Leland L. Beck, Third edition, Addison Wesley 1997
3. Systems programming and operating systems – Dhamdare
QUESTION PAPER PATTERN
PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend any 02 questions. 01 question from Unit 1.
02 questions from Unit 2
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks. The student has to attend any 05
questions. 02 question from Unit 4.
02 question from Unit 5.
03 question from Unit 6.

BCA 305:DATABASE MANAGEMENT SYSTEM

PART – A
1. SQL:
Background, basic structure, set operation, aggregate functions, NULL values, nested sub
queries, Views, complex queries, Modification of the database, joined relations, Data Definition
Language, domain constraints, referential integrity in SQL
Assertions, authorization, privileges in SQL, Encryption techniques. 10 Hrs.
2. PL/SQL
Introduction to PL/SQL Concepts, PL/SQL Programming Fundamentals, data types SQL in
PL/SQL, Conditional Control structure – if and case statements, Iterative Control structure, Error
Handling and built in exceptions, Cursors, procedures, functions, Triggers.
10 Hrs.
PART- B
3. Introduction:
Meaning of data and information, data processing, need for data, data processing and
information. Meaning of persistent data, definitions for DBMS, database, database system,
examples, database system applications. Meaning of file and file management system, database
management system vs. file management system, views of data, data independence, data models,
database languages, database users and administrators, database system structure, application
architecture, advantages of using DBMS, classification of DBMS, meaning of schema and
instance. Data mining and data ware housing(Definition, concept in brief)
6 Hrs.

4. E-R Model:
Using high-level, conceptual data models for database design, basic-concepts, constraints, keys,
an example database application, E-R diagram, types of entities, entity sets, attributes, types of
attributes, weak entity sets, cardinality ratios (mapping cardinality), specialization,
generalization, attribute inheritance, constraints on generalization, aggregation, the Unified
Modeling Language (UML). 6 Hrs.
5. Relational Model:
Structure of relational Databases, Relational algebra - select, project. union, set difference,
rename, division operations, Modification of the database, queries using relational algebra.
Extended relational algebra operations. 6 Hrs.
6. Relational Database Design:
Pitfalls in relational data base design, Normalization for relational databases. Normal forms
based on primary keys, General definitions of first, second and third normal forms, Functional
Dependency (concept and example) decomposition, Boyce-Codd Normal Form - definition and
example, fourth Normal form - Multi valued Dependencies - definition and example.
6 Hrs.
7. Storage and File Structure
Overview of physical storage media, RAID, Organisation of records in files, Data dictionary,
Ordered indicies, B+ tree index files, introduction to transactions.
6 Hrs

Reference Books:
1. Korth, Sudarshan “Database System concepts”, Mcgraw Hill-IV Edition.
2. Navathe, Silberchatz and Elmasri “fundamentals of database Systems”-Addison Wesley-
2004
3. C.J. Date “Introduction to Database systems” Addison-wesley.
4. J.D.Ullman “Principals of Data base systems” computer science press”.
5. Bipin C Desai “Introduction to Data base system” Galgotia publications

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend only 02 questions. 02 questions from Unit 1.
01 questions from Unit 2.
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks.
The student has to attend only 05 questions. 02 question from Unit 3.
01 question from Unit 4.
01 question from Unit 5.
01 question from Unit 6
02 question from unit 7.

BCA 306: C++ LAB LIST

PART A

1. Write a c++ program to accept the marks of three subject of a student and Calculate the
result. The output should be in the following format.
Statement of Marks
Name: RegNo:
Combination:
Max/Min Marks obtained
Sub1
Sub2
Sub3
Total: Result:
2. Write a c++ program to define a class BankAccount including the following class
members.
DataMembers:, cust name, accno, balance.
Member Functions: a) getdata(custname,accno,balance).
b) display(accno).
c) deposit(acno,amt).
d) withdrow(accno,amt) updation aftern checking the balance.
e) To display name & balance of all the records.
3. Write a c++ program to search the given element in a group using function overloading
4. Write function using polymorphism to
Reverse an integer, reverse a float ( 23.8 ♥8.23), to reverse a string
5. Let A be a class with member function to addmat(), B be a class with member function
multimat(). Let readmat() and printmat()be two friend functions to both classes. Using the above
concept write a program to find the sum and product of two matrices. ( Take different matrices
for addition and multiplication).
6. Write a c++ program to read an integer number and find the sum of all digits until it
reduces to a single digit using constructor and default constructor
7. Write a c++ program to create a class complex and perform the following operations
using friend function
Addition of two complex numbers
Multiplication of two complex numbers
8. Define a class P to calculate the remainder and class Q to calculate quotient. Inherit the
class P and Q to reverse the given integer and check for polyndrome.

PART – B

9. Write a c++ program to define a class STACK using an array of integers and to
implement the following operations by overloading the operators + and –
i. S1=s1+ele ; where s1 is an object of the class STACK and ele is an integer to be pushed
on to top of the stack
ii. S1=s1-; where s1 is an object of the class STACK and operator pops the top element.
Handle the STACK Empty and Full conditions. Also display the contents of the stack after each
operation, by overloading the operator <<.
10. Write a c++ program to create a class string where S1,S2 & S3 are objects, Initialize the
objects S1 & S2 using parameterized constructor and do the following operations using operator
overloading
Concatenate S1 & S2 object using “+” operator and assign the result to S3 object
Concatenate S1 & S2 object using “==” use friend operator function
Compare two strings S1 & S2 with respect to length using”<=” operator
11. Write a c++ program to calculate age of a person by passing object as arguments. Create
two objects O1 and O2. O1 reads the current date in the format of DD/MM/YYYY and O2 reads
the date of birth in the same format
12. Write a c++ program to transform the amount from one account to another account using
objects as function arguments.
13. Write a c++ program to store the following information in base class with members
Ename,Ecode,Design and the Derived class with data members year of experience , age.
Construct an object oriented database to carry out the following using single inheritance
Input records
Display records
Delete record
Sort the records by employee name
14. Write a c++ program to store the following information in base class (name of patient,
age, sex). Another base class consists of (ward number, bed number, nature of illness). The
derived class consists of (date of admission). Construct an object oriented database to carry out
the following using multiple inheritance
Input records
Display records
Delete particular patient record
Sort records by patient name
15. Write a c++ program to implement multilevel inheritance
a. College—> name_id, location,dept
b. Student—>name ,reg_no, course,age
c. DOB—>date, month, year, place
16. Write a function template to search an element in an array.
17. Write a function template to sort N numbers in ascending/descending order.
18. Write a class template to implement linked implementation of queue for operations
Qinsert, Qdelete, Qempty, Qfull.
19. Write a class template to represent a generic vector( a series of values). Include member
functions to perform the following tasks.
i. To create a vector
ii. To modify the value of given element
iii. To multiply by a scalar value.
iv. To display vecot in the form (10,20,30,…)

PRACTICAL EXAM SCHEME

Practical Proper - 70 Marks
Viva – voce - 10 Marks
Part –A
One Program
Max marks 25 Program writing 15 Marks
Error free compilation or partial output 05 Marks
Correct result with proper display 05 Marks

Part - B

One Program
Max marks 45 Program writing 25 Marks
Error free compilation or partial output 10 Marks
Correct result with proper display 10 Marks

BCA 307: SQL - PL/SQL LAB LIST

II. Create tables as below

Student(name string, regno string primary key, dob date, doj date ,course string foreign key)
Markscard(regno foreign key, sem string, sub1 number, sub2 number, sub3 number, tot number,
avge number, result string)
Write SQL statements for the following queries.
1. List the names of students studying in BCA course in the order of their joining
2. Find the name of student who has scored highest marks in every sem of each course
3. Count the number of students in each course
4. Find the course having second highest number of students
5. Find the course having least students in I semester
6. Raise the marks of sub3 in III sem BCA students by 5% if the student has failed in that
subject
7. Display the details of student ‘xxx’ in every semester.
8. Find the names of al juniors of ‘yyy’ in course ‘c1’
9. Find all students studying with ‘xxx’ and elder to him (compare DOB)
10. Find the year in which highest and lowest students have admitted to the college.
PL/SQL problems
1. Write PL/SQL code block to calculate the result of studetns using cursor
2. Create a trigger which has to be fired whenever any modification is done to the
markscard table. Store the modification in the back up table.
3. Write PL/SQL function to count the number of students in a sem of a course.
4. Write pL/SQL procedure to retrieve the total, avge and result of a student given his regno,
course and sem

III. Dept(deptno integer pkey, dname string not null, loc string not null)
Emp(eno integer pkey, ename string, deptno fkey, desgn string not null, bsal number>0)
Salary(eno fkey,da,hra,gross,it,pf,net,comm)
DESGN ARE manager,clerk,salesman
Comm=5% of basic if desgn=salesman otherwise null
Da=15% bsal hra = 7% of bsal gross=bsal+da+hra
It =0 if gross<15000
= 10% of gross if gross between 15000 and 30000
=20% of gross if gross between 30000 and 50000
= 30% of gross otherwise
pf = 10% of gross or 1000 whichever is less
Write sql statements for
1. Count the number of employees in every designation
2. List the employees of every department in descending order of their net salary
3. List the name and salary of highest salary payer in every department
4. List the name of employee paying highest IT
5. List the total IT paid by each department
6. List the departments in every location
7. Raise the basic salary by 10% for the managers of every department.
8. Find the number of employees having atleast 10 years of experience in every
department.
9. Count the number of employees who are not getting commission in every department
10. Create a new table manager using above tables containing columns dname,name,net.

PL/SQL problems
1. Write PL/SQL program to compute DA,HRA,… using cursor
2. Write PL/SQL function to accept eno and return his net salary if eno is valid otherwise
raise exception ‘no data found’
3. Write PL/SQL procedure to extract the details of an employee given his eno. Display
appropriate message for wrong eno
4. The HRD manager has decided to raise the salary of all employees in the department
number 20 by 0.05%. Whenever such raise is given to the employees, a record for the same is
maintained in the emp_raise table. This table has the columns eno,the date of raise and raised
amount.Write PL/SQL code block to achieve the above.
5. Write a statement trigger on emp table such that the insertion is possible only on
Thursday.

IV. Create tables as below

Employee(eno, ename,street,city)
Company(cno,cname,city)
Works(eno,cno,sal)
Manages(mno,eno)

Write sql statements for the following queries

1. Find the name of all employee working in the city in which they live
2. Find the company having most employee
3. Count the number of employees under each manager.
4. Find the company having second highest payroll
5. Find employee drawing more salary than his manager in every company
6. Raise the salary of every manager by 25%
7. Find name of employees who are not having managers
8. Find average, highest and lowest salary of every company
9. Delete the employees and the information of company ‘xxx’
10. Rollback the deleted information only (using savepoint)

PL/SQL problems
1. Write pl/sql program to display ename,city,cname,city,sal,manager name of every
employee , company wise using cursor
2. Write pl/sql procedure to display the employee details of the company ‘c1’ who draw
salary greater than 50000 per month
3. Write PL/SQL function to test the validity of an employee number. If it is valid display
his details (personal and professional). Otherwise display appropriate message
4. Create a trigger which keeps track of any changes done to the company and works table.
Record the changes (old and new) in a backup table.

PRACTICAL EXAM SCHEME

Practical Proper - 70 Marks

Viva – voce - 10 Marks

Part –A
Table Creation
SQL queries
Table creation & data insertion 10 marks
4 SQL queries 20 marks
Queries writing 3 marks (each)
Execution 2 marks (each)

Part - B

Two PL/SQL programs Program writing (10*2) 20 Marks

Execution & result (10*2) 20 marks

SEMESTER-IV

BCA 401 : LANGUAGE – I

The syllabus for this language is given by the BOS of corresponding language departments

BCA 402: LANGUAGE – II

The syllabus for this language is given by the BOS of corresponding language departments

BCA 403 : JAVA Programming

PART – A

1. Introduction to Java and Java Program Structure: 14 Hrs.

History of Java, Java features, Difference between C/C++ and Java, Java program structure, Java
tokens, Statements, JVM, Introduction to packages in Java, Applets, Operators & Expressions,
Data types, Constants and Variables, Type conversions, Mathematical functions; Control
Statements: Decision making and Branching with while, do-while, for and labeled loops; Arrays,
Vectors & Strings: Initialization, Declaration of 1D, 2D arrays, String arrays, String methods,
Vectors, Wrapper classes.

PART - B
2. Overview: 10 Hrs.
Class, Objects, Constructor, Method overloading, Static members; Inheritance: Single,
Multilevel, Hierarchical, Visibility modes, Method overriding, Final variable, Abstract methods
and classes; Interface: Defining, Extending and Implementing assigning interface variables ;

3. Packages and multithreading 06 Hrs.

Java API Packages, using system packages, naming convention, accessing and using a package,
adding a class to packages, hiding classes. Multithreaded programming: Creating a thread,
extending the thread class, stopping and blocking a thread, life cycle of a thread, using thread
methods, thread exceptions, thread priority, synchronization, implementing the runnable
interface.
4. Exceptions and Debugging: 06 Hrs.
Meaning of errors and exceptions, Dealing with errors, Classifications of exceptions, syntax of
handling exceptions, advertising the exceptions, throwing and rethrowing exceptions, creating
Exception classes, multiple catch statements, finally clause, tips for using exceptions, Debugging
techniques – tricks for debugging, Assertions, Java Debugger (JDB).
5. Applets and Graphics: 10 Hrs.
Applets basics, applets and application, Life cycle, Life cycle of Applet programming- passing
parameter to applets, paint and repaint methods, Graphics class, Line, Rectangle, Circle, Ellipse,
Arcs and Polygon. Using control loops in applets, drawing bar charts.
Reference Books:
1. Java, The Complete Reference – Patrick Naughton and Schildt
2. Programming in Java – Joseph L Weber
3. Java Programming – E Balagurusamy

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend only 02 questions. 03 questions from Unit 1.
Covering all concepts
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks.
The student has to attend only 05 questions. 02 question from Unit 2.
02 question from Unit 3.
01 question from Unit 4.
02 question from Unit 5
1.

BCA 404 : OPERATIONS RESEARCH

PART-A
1. Operations research:
Nature and meaning, models characteristics, advantatges. General methods for solving O.R.
models - analytical, numeric and Monte Carlo. Advantages and scope.
4 Hrs.
2. Linear Programming Problems:
Formulation (both minimization and maximization type) solution of LPP using graphical
method. General LPP. Basic solutions and degenerate solutions. Standard form and canonical
form. Characteristic features of LPP. 8 Hrs.

PART-B
3. Simplex Method:
Simplex method, algorithm and flowchart for maximization type problem. Big-M method for
solving LPP. 10 Hrs
4. Transportation Problem.:
Formulation, Necessary and sufficient condition for the existence of feasible solution to a T.P.
IBFS by NWCR, LCM and VAM. Optimal solution using U-V method. Algorithm and flow-
chart for minimization T.P. 8 Hrs.
5. Assignment Problem.:
Formulation, optimal solution using Hungarian algorithm, traveling salesman problem.
6 Hrs.
6. Game Theory:
Basic definitions, minmax - maxmin principle and optimal strategy solution of games with
saddle point, dominance rule for solving a two-person Game, graphical method for solving two-
person game. 6 Hrs.
7. Network analysis:
Network and basic components, Rules for network construction, basic steps in PERT/CPM
techniques and applications. Time estimates and critical path in network analysis.
6 Hrs.

References:
2. S. D. Sharma – Operations research
3. Hamdy A. Taha, “ Operation Research – An introduction” 5th edition, PHI.,
4. Kanti Swarup, P. K. Gupta & Manmohan – “Operation Research”, 1996.
5. S. Kalavathy: “Operations Research”, Second Edition – Vikas Publications
6.
QUESTION PAPER PATTERN
PART I10 Marks There shall be 10 questions each carrying 01 Marks. The student has to
attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions each carrying 10 Marks. The student
has to attend any 02 questions. 01 questions from Unit 1.
02 questions from Unit 2.
PART III 50 Marks
There shall be 07 questions each carrying 10 Marks. The student has to attend any 05
questions. 02 question from Unit 3.
02 question from Unit 4.
01 question from Unit 5.
01 question from Unit 6
01 question from unit 7.

BCA 405: COMPUTER GRAPHICS

PART – A
1. Multimedia : Definition, CD-ROM and the multimedia highway, Uses of Multimedia,
Introduction to making multimedia – The stages of Project, the hardware & software
requirements to make good multimedia, Multimedia skills . 4 Hrs.

2. Multimedia building blocks: SOUND: MIDI, Digital audio, audio file formats. Images:
still images, color and file formats. ANIMATION: principles of animation, making animation.
VIDEO: using video, how video works, and video standards. 8Hrs
PART - B
3. Introduction : Graphics applications – CAD , presentation graphics, computer art,
entertainment, education and training, visualisation, image processing. Display devices – raster
scan displays – color CRT, DVST, LCD, 3D viewing devices. Raster scan systems, Random scan
systems. List of I/O devices. 5 Hrs
4. Output primitives – points and lines, line drawing algorithm, DDA algorithm,
Bresenham’s line algorithm, examples, parallel line algorithm, loading the frame buffer, circle
generating algorithm, midpoint circle algorithm, ellipse generating algorithm. Pixel addressing
and object geometry. Color and gray scale levels, color tables, character attributes.
10 Hrs
5. 2D Transformation - Basic Transformations- translation,. Scaling, rotation, matrix
representation and homogeneous coordinates, composite transformations- translation, scaling,
general pivot point and fixed point rotation, scaling directions, other transformations – reflection,
shear, transformation between coordinates, inverse transformations.
10 Hrs.
6. Windowing and Clipping-Introduction, the viewing transformation, viewing
transformation implementation, clipping, the Cohen-Sutherland outcode algorithm, Liang-Barsky
line clipping algorithm, the Sutherland-Hodgeman algorithm, the clipping of polygons and
adding clipping to the system, text clipping, exterior clipping, curve clipping. 6 Hrs.

7. Three Dimensional Concepts: Introduction, Three dimensional geometry, three

dimensional primitives and transformations. Rotation about an arbitrary axis. Fractal- geometry
– fractal genetation procedures, classification, fractal dimension,construction of self similar
fractals 5
REFERENCES :
1. Tay Vaughan “Multimedia – making it work”, TMH publication, fifth edition.
2. D Hearn & M P Baker: “Computer Graphics C version”, Pearson Education
3. D Newman and Sproull: “Principles of Interactive Computer Graphics -, TMH, second
edition.
4. Steven Harrington “Computer graphics: A programming Approach”, TMH publication.
Second edition
5. Roy plastock and Zhigang Xiang: “ Computer graphics”. Schaum’s outline series, II
edition.
6. Ralf Steinmetz and Klara Naharstedt, “Multimedia: Computing, Communications and
Applications”, Pearson, 2001

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend any 02 questions. 01 question from Unit 1.
02 questions from Unit 2
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks. The student has to attend any 05
questions. 01 question from Unit 3.
02 question from Unit 4.
02 question from Unit 5.
01 question from unit 6
01 question from unit 7

BCA 406: JAVA Programming Lab

PART A
1. Write a Java program to generate first n odd numbers and pick and display prime
numbers among them. Read value for n as command line argument.
2. Write a Java program to encode the given set of characters using simple encryption.
3. Write a Java program to create a vector, add elements at the end, at specified location
onto the vector and display the elements. Write an option driven program using switch…case.
4. Write a Java program using function over loading to find biggest among two, three and
‘N’ numbers.
5. Write a java program to find area of geometric figures (atleast 3) using method
overloading.
6. Write a Java program to find the circumference and area of the circle using interface.
7. Write a java program to sort the alphabets in the given string.
8. Write a java program to perform matrix addition and multiplication using case statement
9. Write a java program to accept student information using array of objects and constructor
initialisation.
10. Write a java program to accept student, employee information to perform relevant
computation using hierarchical inheritance.

PART B

11. Write a java program to implement static and dynamic stack using interface using
abstract class.
12. Define an interface with methods to add and subtract two floating point numbers each of
which returns a floating point number. Declare a class Customer, implementing the above
interface by providing definitions for the abstract methods (addition and subtraction) of the
interface to perform the deposit and withdrawal operations respectively. Similarly declare one
more class Bank Staff implementing the above interface by providing definitions for the abstract
methods of the interface to perform the salary hike and salary deduction operations.
13. Write a Java program with a class Person having instance variables to store person name,
date of birth, city, phone and methods to read and display the instance variables. Declare one
more class Student with instance variables to store register number, course, combination,
semester, marks obtained in five subjects, total marks, percentage marks, grade and methods to
accept and display student details, to calculate total and percentage marks and to evaluate grade.
Also, class Student extends class Person. Evaluate the grade based on the following criteria.
If Percentage Marks is 70 and above, Grade will be Distinction.
If Percentage Marks is 60 and above but below 70, Grade will be First Class.
If Percentage Marks is 50 and above but below 60, Grade will be Second Class.
If Percentage Marks is 40 and above but below 50, Grade will be Pass.
The above criteria should be applied only when the marks obtained in each of the subjects is 40
or more.
Also, display the marks sheet of the student as shown below:
Kuvempu University
MARKS SHEET
Name of the Student: Register Number :
Course : Semester :
-----------------------------------------------------------
SUBJECTS MAX. MARKS MIN. MARKS MARKS OBTAINED
-----------------------------------------------------------
1. K/S/H/U 100 40 ---
2. English 100 40 ---
3. Java Programming 100 40 ---
4. Operations Research 100 40 ---
5. Computer Graphics 100 40 ---
-----------------------------------------------------------
Total Marks : 500 200 --- Percentage Marks : ---
Grade : ---
-----------------------------------------------------------
14. Write a java program to implement constructor overloading by passing different number
of parameter of different types.
15. Write a java program to accept employee information to calculate T.A, D.A, HRA, gross
salary, and net information using overriding.
16. . Define a package to contain the class sort to contain methods for various sorting
techniques with time complexity (at least 3)Use this package to sort the list
17. Write a Java program to add two time values. Verify whether the operand time values
and result time are valid or not. If operand times are valid, add the two given time values. If
invalid, throw a user defined exception saying that time value is not valid. Also, adjust the
invalid time value so that it becomes valid.
18. Write a Java program to generate odd, even and Fibonacci numbers simultaneously using
the concept of multi-threading.
19. Write a program to demonstrate priority threads.
20. Write a program to demonstrate how to overcome from producer and consumer problem.
21. Write a program to implement an applet by passing parameter to HTML
22. Write an applet program to display human face
23. Write a program to create student report using applet, read the input using text boxes and
display the output using button.
24. Create an applet to display concentric n circles, input value for n.
25. Design an applet for simple calculator for 4 arithmetic operations.

PRACTICAL EXAM SCHEME

Part - B

One Program
Max marks 45 Program writing 25 Marks
Error free compilation or partial output 10 Marks
Correct result with proper display 10 Marks

BCA407:Computer Graphics Programming Lab

PART A
1. Write a program to draw borders at the four corners of the screen.
2. Program for DDA line drawing algorithm
3. Bresenham’s line drawing algorithm
4. Bresenham’s line drawing algorithm for |m|<1
5. Parallel line algorithm
6. Mid point circle algorithm
7. Ellipse generating algorithm’
8. To draw a line graph for monthly sales data

PART B

9. Program to continuously rotate an object about origin. Small angles to be used for
successive rotation.
10. Write a program that applies any specifies sequence of transformations to a displayed
object. The program is to be designed so that a user selects the transformation sequence and
associated parameter from displayed menus, and the composite transformation is then calculated
and used to transform the object. Display the original and transformed objects in different colors
or different fill patterns.
11. Program to demonstrate clipping by defining world and viewing coordinates
12. Implement Cohen Sutherland line clipping algorithm
13. Implement Liang-Barsky line clipping algorithm
14. Implement Sutherland - Hodgeman polygon clipping algorithm
15. Implement snowflake fractal for a given number of iterations (optional)

PRACTICAL EXAM SCHEME

Part - B

One Program
Max marks 45 Program writing 25 Marks
Error free compilation or partial output 10 Marks
Correct result with proper display 10 Marks

Semester -V
BCA 501: ADVANCED PROGRAMMING IN JAVA
Chapter 1: Revision of Object Oriented Principles and Java Fundamental Concepts:
Class, Object, Inheritance, Polymorphism, Packages, Exception Handling, Multithreading
applets and related concepts of Java programming language. 4 Hrs.

Chapter 2: AWT, Graphics Programming,

AWT and AWT Classes, Window fundamentals – Component, Container, Panel, Window,
Frame, Canvas. Working with frame window.
Graphics Programming: Graphics class, methods, drawing objects, line graphs, polygon
classes, working with colors and fonts. Advanced graphics operations using Java2D. Designing
simple User Interfaces (UIs) using AWT, Layout Manages. 10 Hrs
PART B
Chapter 3: Swing and Event Handling:
Event Handling: Basics of Event Handling, the delegation event model, AWT event
hierarchy and event classes, Event Listener Interfaces, Adapter Classes, Event queue.
Swing: Meaning, need difference between AWT and swing. The Model-View-Controller
(MVC) design patterns, Creating simple UIs using swing, and handling basic events.
10 Hrs.

Chapter 4: Java Beans and Java Archives (JAR):

Meaning and need of Java Beans, Advantages, Bean writing process, Bean properties.
Java Archives (JARs): Meaning, need, the JAR utility, Creating JAR files. 6 Hrs.

Chapter 5: File Management and JDBC:

File, creating a file, writing to a file, opening a file, reading from a file, file management,
checking existence of a file, deleting a file.
JDBC: Meaning, need, concept and structure of JDBC, relation with ODBC, JDBC driver
types and their meaning, the JDBC process – loading the driver, connecting to the DBMS,
creating and executing SQL statement, Connection object, Statement object, Prepared Statement
object, Callable Statement, Result Set, JDBC Exceptions. 8 Hrs.

Chapter 6: Fundamental concepts of Collections, Generics and Network programming:

Collections: Meaning, need, Collection interfaces, Concrete Collections – ArrayList, Hashset,
Map.
Generics: Meaning, need, benefits, generics usage, basics of generic types, type parameter
naming conventions, type wildcards, using type wildcards, generic methods, bound types,
writing simple generic container, implementing the container, implementing the constructors,
implementing generic methods.
Network programming: Meaning of Client, Server, Socket, port. Creating a client socket,
creating a server socket, writing simple server and client. 10 Hrs.

References:
1. The Complete Reference – Java 2: Herbert Schildt, 5th / 7th Edition, Tata McGraw-Hill
Edition.
2. Thinking in Java: Bruce Eckel
3. Core Java 2: Volume I – Fundamentals: Cay S. Horstmann, Gary Cornell, Pearson
Education Asia.
4. Core Java 2: Volume II – Advanced Features: Cay S. Horstmann, Gary Cornell, Pearson
Education Asia.

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend any 02 questions. 01 question from Unit 1.
02 questions from Unit 2
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks. The student has to attend any 05
questions. 02 question from Unit 3.
01 question from Unit 4.
02 question from Unit 5.
02 question from unit 6

BCA 502: SOFTWARE ENGINEERING

PART A

Unit 1: Introduction
Definition of software, software problems (industrial strength software, software is expensive,
late and unreliable maintenance and rework), software engineering challengers (scale, quality
and productivity, attributes), software engineering approach (phased development process,
managing process, components of software engineering).
6 hrs
Unit 2: Software processes
Introduction to software process (processes and process modules, component of software
process), characteristics of software process (predictability, support testability and
maintainability, support change, early defect removal, process improvement and feedback),
software process models (waterfall, prototype, iterative enhancement model, spiral, comparison
of process models). 6 hrs
Unit 3: Software Planning
Introduction to planning, effort estimation (uncertainties, building efforts, bottom-up,
COCOMO model), project scheduling and staffing (overall, detailed scheduling, team structure),
risk management (concepts, assessment), project monitoring plan (measurements, project
monitoring and tracking). 6 hrs

PART B
Unit 4: Analysis and Design
Software requirements (needs and requirement process), problem analysis (informal
approach, data flow modeling, object oriented modeling, prototyping), requirement specification
(characteristics of SRS, components of SRS, specification language, structure of requirement
document), validation.
Design: Function oriented design: design principles, module level concept (coupling,
cohesion), structure design methodology (DFD, first level factoring).
12 hrs
Unit 5: Coding and Testing
Coding: programming principles and guidelines (common coding errors, structured
programming, information hiding, some programming practices, coding standards), refactoring
(basic concepts with examples, common refactoring), verification (code inspections, static
analysis, proving correctness, unit testing).
Testing: testing fundamentals, black box and white box testing, comparison between black box
and white box testing, testing process (levels of testing, test plan).
12 hrs

Unit 6: SCM and UML

SCM: introduction, CM functionalities, CM mechanism, CM process, requirement change
management process, process management process.
UML: object oriented concept, UML(class diagram, sequence diagram, collaboration
diagram, use case diagram) 10 hrs

Reference:
1. An integrated approach to software engineering-Pankaj Jalote.
2. UML in a nutshell- Sinan Si Albir.
3. Roger Pressman, Software Ebgineering- A Practitioner’s Approach TMH
4. Ian Sommerville, Software Engineering, Pearson Publications Ltd.

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units
PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend any 02 questions. 01 question from Unit 1.
01 question from Unit 2
01 question from unit 3
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks. The student has to attend any 05
questions. 02 question from Unit 4.
02 question from Unit 5.
02 question from Unit 6.
01 question from unit 4&5

BCA 503 : Data Communication

PART A

Unit 1: Introduction:
Communication model & Data Communication networking -types. Data Transmission-
Transmission terminology, Analog & Digital data transmission, Transmission impairments –
attenuation, delay distortion & noise. 8 Hrs
Unit 2: Data Transmission media:
Guided Transmission- types- Twisted pair, coaxial cable & optical fiber – physical description,
application & characteristics. Unguided Transmission- wireless transmission: types- Terrestrial
type, Satellite, Broadcast radio – physical description, application & characteristics.
8 Hrs

PART B
Unit 3: Data encoding:
Basics, types and description of different signals, Digital data & digital signals: NRZ, multilevel
binary, Bi phase techniques. Digital data & Analog signals: Encoding techniques- ASK, FSK,
PSK Analog data & Digital signals: PCM & delta modulation Analog data & Analog signals:
Modulation- AM & FM Spread spectrum: Frequency hoping, direct sequence Asynchronous &
synchronous transmission: Line configurations- full duplex & half duplex.
12 Hrs

Unit 4: Data link control & medium access sub layer:

Flow control: Stop and wait & sliding window flow control. Error detection: Parity check, CRC
Error control: Stop and wait ARQ, Go Back-N ARQ High-level data link control: basics,
Characteristics, frame structure, operation Medium access sub layer- the channel allocation
problem. Multiple access Protocol-ALOHA, carriers sense multiple access protocol, collision
free protocol. 10 Hrs

Unit 5: Multiplexing and switching:

Frequency division multiplexing- characterstics, anlog carrier systems, Time division
multiplexing- characterstics, link control. Digital carrier system, ISDN user network interface.
Circuit switching networks- switching concept, space division & time division switching Pocket
switching networks-principles, switching technique, and packet size. Comparison of Circuit
switching & Pocket switching
10 Hrs
Reference books:
1. Data and Computer Communications – William Stallings.
2. Computer Networks – Andrew S. Tanenbaum.
3. Data Communication – Ulysis D Black.
4. Data Communication and Networking – Behrouz A. Forouzan.
5. Internetworking with TCP/ IP – Douglas E comer, PHI

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units

BCA 504: OPERATING SYSTEM

PART A
1. Introduction:
a. Definition of Operating System, need. Early systems – Simple monitors, Batch Systems.
Multiprogramming, Time Sharing, Real time, Parallel and Distributed systems. Special Purpose
Systems – Real Time Embedded Systems, Multimedia Systems, Handheld Systems. Computing
Environments – Traditional, Client Server, Peer-to-Peer and Web based. Open Source Operating
Systems. 06 Hrs
b. Operating System Structure:
Services, User-Operating System Interface, Components, Structure – simple and layered. System
calls and its types, System programs, Virtual machines and its benefits.
06 Hrs

2. Process Management:
Process concept – meaning of process, sequential and concurrent processes, process state,
process control block, threads, Process scheduling – scheduling queues, schedulers, context
switch. Operations on Processes – creation and termination. Inter process communication –
Independent and co-operating processes. Communication in client-server systems – RPC and
RMI. Process scheduling – Basic concepts
6 Hrs
PART B
3. Processor - CPU I/O burst cycle, CPU Scheduler, Preemptive scheduling, dispatcher.
Scheduling criteria, Scheduling algorithm – First-Come-First-Served (FCFS), Shortest Job First
(SJF), Priority Scheduling, Round Robin. Multi-level queue scheduling (Concepts only), multi-
level feedback queue scheduling (Concepts only). Multiple processor scheduling, Real time
scheduling. 6 Hrs

4. Deadlocks:
System model, Dead lock characterization – Necessary Conditions, Resource Allocation Graph,
Dead lock prevention, Avoidance and detection, Recovery from dead lock.
04 Hrs.

5. Memory Management:
Logical and Physical address space, Swapping, Contiguous allocation, Paging, Segmentation,
Virtual memory - demand paging and its performance, Page replacement algorithms, Allocation
of frames, Thrashing. 10 Hrs.

6. Disk and File Management:

a. Secondary Storage Structure and Disk Management:
Disk structure & scheduling methods, Disk management, disk reliability.
b. File concepts, Access methods, Directory structure, Protection and consistency semantics,
File system structure, Allocation methods, free space management, Directory implementation,
Efficiency and performance, Recovery.
10 Hrs.

References:
1. Abraham Silberschatz and Peter Baer Galvin, Operating System Concepts, Fifth edition,
Addison - wesley 1989.
2. Milan Milonkovic, Operating System Concepts & Design, II Edition, McGRaw Hill
1992.
3. Stallings, Operating Systems, Pearson Edition.
4. Tanenbaum, Operating System Concepts, Pearson Education
5. Nutt : Operating System, 3/e Pearson Education 2004
6. QUESTION PAPER PATTERN
PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units
PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend any 02 questions. 02 question from Unit 1.
01 questions from Unit 2
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks. The student has to attend any 05
questions. 02 question from Unit 4.
01question from Unit 5.
02 question from Unit 6.
02 question from unit 7

BCA 505: WEB PROGRAMMING: JEE TECHNOLOGY CONCEPTS AND JSP

PART A

Chapter 1: Client – Server Systems:

Meaning of client and server, Client-Server architecture, benefits, concept of ports and sockets.
Protocol – Meaning, definition, examples, meaning of stateless and state (stateful) protocols.
HTTP protocol – meaning, http protocol request and response header formats, status codes.
Client-Server communication scenario. 06 Hrs.

Chapter 2: JEE Technology Concepts:

Multi-tier architecture for application development – Meaning, need, advantages. Meaning of
enterprise application and web application, challenges of Enterprise application development,
various tiers in enterprise application – client tier, web tier, business tier, enterprise information
system tier. Introduction to JEE concepts – Need, advantages, characteristics of JEE technology,
the concepts of containers, components and services – meaning of web container, application
client container, EJB container. Comparison between traditional approach for application
development and JEE. 08 Hrs.

PART B
Chapter 3: Enterprise Java Bean:
Meaning and use of Java beans and EJBs, meaning of business logic, Common requirements of
business objects. Types of EJBs – Entity Bean – Meaning and Guidelines for using entity beans,
Session beans – types of session beans – stateful, stateless – uses of stateful and stateless session
beans, Message Driven Beans – Meaning only. 08 Hrs.

Chapter 4: Dynamic Content and HTML:

Meaning of dynamic content and static content, history of dynamic content generation in web
pages. Definition and brief discussion on scripting, need for scripting languages. A brief
introduction to HTML and various tags. 06 Hrs.
Chapter 5: Java Scripts:
Meaning, need, Advantages, Details of the language – Java Script Syntax, Using the <SCRIPT>
tag. Comments. Data types and variables, Operators, Loops and conditionals, functions. 08 Hrs.

Chapter 6: Java Server Pages Programming Concepts:

Introduction to JSP - language structure, advantages, characteristics, comparison between Java
and Java Server Pages. Various aspects of Java Server Pages programs, writing and executing
JSP programs. Writing dynamic programs using JSP. Database programming through JSP.
12 Hrs.

Reference Books:
1. The Complete Reference – J2EE – Jim Keogh
2. J2EE – Kevin Mukhar, James L. Weaver, James P Crume, Ron Phillips

BCA 506:Advanced Programming in Java

Part A
1. Write an Applet program to design a user interface to key-in the details of an employee.
2. Write an applet to add, remove, select an item in a list
3. Write a applet display select geometric figure from a list.
4. Write a program to implement mouse events
5. Write a program to implement keyboard events
6. Write a Java program (console) to store the typed text to a file.
7. Write a Java program to display the content of a file.
8. Write a Java program to edit the content of a file.
9. Write a Java program to design a user interface using awt or swing APIs with event
handling (don’t use applet). The program should read, through the text boxes, the details of the
student like student name, Register number, Course, Semester, and marks obtained in 5 subjects
(assume that the number of subjects for all the defined courses and semesters will be same). For
Course and semester, design the combo box. Design three buttons. First, to calculate the total
marks, percentage marks and grade. Second, to clear the fields and the third, to exit. Assume the
suitable criteria to evaluate the grade. Also design text boxes to display the total marks,
percentage and grade. Use appropriate layout manager to arrange the user interface controls.
Part B

10. Write a Java program with JDBC to store the details of a person on to an Oracle database
table.
11. Write a Java program with JDBC to access and display the details of a person stored in an
Oracle database table.
12. Write a Java program with JDBC to access and delete the details of a given person stored
in an Oracle database table.
13. Write a Java GUI program to accept the details of an employee and store the same on to
an Oracle database table.
14. Write a Java GUI program to access and display the details of a given employee stored in
Oracle database table.
15. Write a Java program to design a simple Client and Server components. Pass simple text
(static) from client to the server and a receipt acknowledgement (static) back to the client.
16. Write a Java program to design a Client and Server components. Pass the text from client
console to the server and a receipt acknowledgement (static) back to the client.
17. Write a Java program to design a login session through Client and Server components.
From client, pass the username and password to the server, verify the username and password
combinations at the server and if there is a match, send a success message, otherwise a failure
message back to the client.
18. Write a Java program to demonstrate the use of generics.

PRACTICAL EXAM SCHEME

Part - B

One Program
Max marks 45 Program writing 25 Marks
Error free compilation or partial output 10 Marks
Correct result with proper display 10 Marks

SEMESTER- VI
BCA 601: Computer Networks

PART A
Unit 1: Basics:
Uses of computer networks, network hardware- broadcast networks, point – to -point
networks, network software-protocol hierarchies, design issues, interface & services, connection
oriented & connection less services, service primitives 10 Hrs

Unit 2: Reference models:

OSI reference model- description of each layer. TCP/IP reference model, comparison of the two
models, Critique of the OSI model and protocols, Critique of the TCP/IP model and protocols,
Example networks, Example data communication services.
10 Hrs
PART B
Unit 3: The network layer:
Design issues, routing algorithms- the optimality principle, shortest path routing, distance vector
routing, and link state routing. Congestion control algorithms- general principle, Congestion
prevention policies, traffic shaping. The network layer in the internet - the IP protocol, IP
address, and subnet. Internet control protocol.
10 Hrs

Unit 4: The transport layer:

The transport service- services provided to the upper layer, quality service, and transport service
primitives. Elements of transport protocol - addressing, establishing a connection, releasing a
connection. A simple transport protocol- the example service primitives, the example transport
entity. The Internet transport protocol (TCP & UDP)- the service model, the TCP segment
header, the TCP connection management. UDP - header. 10 Hrs

Unit 5: The Application layer:

Network security - traditional cryptography, two fundamental cryptographic principles, secret
key & public key algorithms. DNS - Name space, SNMP - model. Electronic mail, architecture
and services, www. 8 Hrs

Reference books:
1. Data and Computer Communications – William Stallings.
2. Computer Networks – Andrew S. Tanenbaum.
3. Data Communication – Ulysis D Black.
4. Data Communication and Networking – Behrouz A. Forouzan.
5. Internetworking with TCP/ IP – Douglas E comer, PHI

VI SEWMESTER B C A
UNIX Operating System

PART A
Unit – 1 : Introduction: The unix operating system, , A brief Session, The Unix Architecture,
Features of UNIX, POSIX and Single UNIX specification, Locating commands, Internal and
External commands, Command Structure, Flexibility of command Usage, Man Browsing the
Manual Pages ON-line, Understanding the man Documentation. General-Purpose Utilities: Cal
command, date command, echo, printf, bc, script, Email Basics, mailx, passwd, who, uname, tty,
stty. 06 Hours

Unit -2 : The File System : The file, The Parent –Child Relationship, The HOME Variable, pwd,
cd, mkdir, rmdir, Absolute Pathname, Relative Pathname, ls, The Unix File system. Handling
Ordinary Files: Cat, cp, rm, mv, more, The lp subsystem: Printing a File, File, wc, od, cmp,
comm, diff, dos2unix and unix2dos, compressing and archiving files, gzip, and gunzip, tar, zip
and unzip. 07
Hours

Unit - 3 : Basic File Attributes: Listing file attributes, listing directory attributes, File
Ownership, File Permissions, changing file permissions, Directory Permissions, Changing File
Ownership. 04 Hours
PART B
Unit -4 : The Vi Editor: Vi basics, Input Mode, Saving Text and Quitting, Navigation, Editing
Text, Undoing Last Editing Instructions(U and U), Repeating the last command(.), Searching for
a Pattern(/ and ?), Substitution. (Concepts of Advanced VI Editor for Seminar )
08 Hours

Unit - 5 :The process: Process basics, process status, system process, Mechanism of process
creations, Internal and external commands, process states and zombies, running jobs in
background, nice, killing process with signals, job control, at and batch, cron, timing process.
06 Hours

Unit – 6 : Simple filters: The sample database, pr, head, tail,cut, paste, sort, uniq, tr, displaying a
word-count list. Filters using regular expressions: Grep, basic regular expressions, extended
regular expressions and egrep, sed, line addressing, using multiple instructions, context
addressing, writing selected lines to a file, text editing, substitution, basic regular expressions
revisited. 07 Hours

Unit -7 : The Shell: The shell’s Interpretive Cycle, Shell Offering, Pattern Matching, Escaping
and Quoting, Redirection, /dev/null and /dev/tty, Pipes, tee, Command Substitution, Shell
variables. Essential shell programming: Shell scripts, read, using command line arguments, exit
and exit status of command, the logical operators && and ||- conditional execution, the if
conditional, using test and [] to evaluate expressions, the case conditional, expr, $0: calling a
script by different names, while, for, set and shift, the here document (<<), trap, debugging shell
scripts with set –x, sample validation and data entry scripts. (Concepts of Advanced Shell
programming for Seminar ) 10 Hours
Refernces :
1. Sumitabha Das, UNIX System V.4, Concepts and Applications, TMH

QUESTION PAPER PATTERN

PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend any 02 questions. 01 question from Unit 1.
02 questions from Unit 2 and 3
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks. The student has to attend any 05
questions. 02 question from Unit 4.
01 question from Unit 5.
01 question from Unit 6
03.questions from unit 7

VI SEM B.C.A.
BCA 503: DOT NET PROGRAMMING
PART A
Unit1: Introduction to C# & .NET platform : The .NET solution, Building blocks of the .NET
platform(CLR, CTS, CLS), Role of .NET base class libraries, .NET Aware programming
languages, role of common intermediate languages & type metadata and assembly manifests, A
tour of the .NET namespaces.
Unit 2: Building C# Applications : Role of the command line complier(csc.exe), Building a C#
application using csc.exe, the command line debugger(cordbg.exe), using the visual studio .NET
IDE & its debugging, C# ”preprocessor” directives.
Unit 3: C# language fundamentals : Anatomy of a basic C# class, creating objects: constructor
basics, Default assignments & variables scope, variables initialization syntax, basic inputs &
output with the console class, understand static methods, arrays & string manipulations.
PART B
Unit 4: Exception & object life time : Role of .NET exception handling, throwing a generic
exception, catching exceptions, the final block.
Unit 5: Interface & Collections : Definition, Interface members at object level, interface as
polymorphic agents, exploring the system.collections namespaces.
Unit 6: Introducing windows forms : A tale of three GUI namespaces, overview of the
system.windows.Forms Namespaces, Anatomy of a Form, Component class, control class,
controle
Unit 7: Programming with windows forms controls : Working with button types, check boxes,
Radio buttons, Group boxes, list boxes, calander control, assigning tooltips for controls.
Unit 8: Data acess with ADO.NET : The need for ADO.NET, two faces of ADO.NET, role of
ADO.NET data providers, Building a simple test database, selecting a data provider, working
with connected layer of ADO.NET & OleDb Data reader, inserting, updating and deleting
records using OleDb command.Introduction to ASP.NET : Standard controls, list controls,
validation controls, Rich controls.

References Book:
1. “C# & The .NET Platform” second edition by author Andrew Troelsen
QUESTION PAPER PATTERN
PART I10 Marks There shall be 10 questions and each carrying 01 Marks. The student has
to attend all the 10 questions. 10 questions from all the Units

PART II 20 Marks There shall be 03 questions and each carrying 10 Marks. The
student has to attend any 02 questions. 01 question from Unit 1.
01 questions from Unit 2 01 question from unit 3
PART III 50 Marks
There shall be 07 questions and each carrying 10 Marks. The student has to attend any 05
questions. 01 question from Unit 4.
01 question from Unit 5.
03 question from Unit 6 and 7
02 questions from unit 8

UNIX Lab List

PART A
1) Write a shell script to count no of characters in a given string
2) Write a shell script to check of vowels
3) To check for palindrome or not
4) To check given string is reverse or not
5) To find factorial of a no
6) To find out biggest of 3 no
7) To display student information
8) To display employee information ( bs=10000, HRA=20%, DA=50% )
9) To perform mathematical operations
10) To check sent mail delivered or not
11) To remove junk files
12) To remove all files in tmp directory
13) To create nested directory
14) To check whether the given no is odd or even
15) To display current date, time and name of month & present calendar using cal & date
command(with option )
16) To display list of files beginning with chap along with file permissions & change the
permission group to rwx.
17) To convert lower case to upper case
18) To match particular pattern in a file & display in count
19) Swapping of 2 no without using temp.
20) To demonstrate for loop
21) To check whether current date valid or not
22) Taking system date as arguments find out whether its Morning or Afternoon or Night
23) To convert set of lines into columns
24) To find out GCD of a no
25) Write a shell script that accepts filename starting & ending line no as an argument &
display all lines b/w given line no
a) Paging lines
b) Selecting 1st 4 lines & assign to another file as short list
c) Cut the column wise
d) Cut field wise
e) Paste the cutted file
f) Sort in order of 1st field
g) Exit
26) Write shell script
a) Listing of files
b) Processor of user
c) Present date
d) exit
PART B
.NET PROGRAMMING

PRACTICAL EXAM SCHEME

Practical Proper - 70 Marks
Viva – voce - 10 Marks
Part –A
One Program
Max marks 30 Program writing 15 Marks
Error free compilation or partial output 10 Marks
Correct result with proper display 5 Marks

Part - B

One Program
Max marks 40 Program writing 20 Marks
Error free compilation or partial output 10 Marks
Correct result with proper display 10 Marks

BCA 504:PROJECT & VIVA-VOCE

The project is of 3 hours/week for one (semester VI) semester duration and a student is
expected to do planning, analyzing, designing, coding and implementing theproject. The
initiation of project should be with the project proposal. The synopsis approval will be given by
the project guides.

The project proposal should include the following:

Title
Objectives
Input and output
Details of modules and process logic
Limitations of the project
Tools/platforms, Languages to be used
Scope of future application
For the project work, the guide(internal) evaluate the work for 20 marks based on the
performance of the candidates during the development of he project and the external examiner
will evaluate the project work as follows:
Ψ Project Report - 20 marks
Ψ Project Demo -30 Marks
Ψ Viva-Voce - 30 marks

The Project work should be either an individual one or a group of not more than three members.

BCA 505: DOT NET PROGRAMMING

PART A
Unit1: Introduction to C# & .NET platform : The .NET solution, Building blocks of the .NET
platform(CLR, CTS, CLS), Role of .NET base class libraries, .NET Aware programming
languages, role of common intermediate languages & type metadata and assembly manifests, A
tour of the .NET namespaces.
Unit 2: Building C# Applications : Role of the command line complier(csc.exe), Building a C#
application using csc.exe, the command line debugger(cordbg.exe), using the visual studio .NET
IDE & its debugging, C# ”preprocessor” directives.
Unit 3: C# language fundamentals : Anatomy of a basic C# class, creating objects: constructor
basics, Default assignments & variables scope, variables initialization syntax, basic inputs &
output with the console class, understand static methods, arrays & string manipulations.
PART B
Unit 4: Exception & object life time : Role of .NET exception handling, throwing a generic
exception, catching exceptions, the final block.
Unit 5: Interface & Collections : Definition, Interface members at object level, interface as
polymorphic agents, exploring the system.collections namespaces.
Unit 6: Introducing windows forms : A tale of three GUI namespaces, overview of the
system.windows.Forms Namespaces, Anatomy of a Form, Component class, control class,
control eUnit 7: Programming with windows forms controls : Working with button types, check
boxes, Radio buttons, Group boxes, list boxes, calander control, assigning tooltips for controls.
Unit 7: Programming with windows forms controls : Working with button types, check boxes,
Radio buttons, Group boxes, list boxes, calander control, assigning tooltips for controls.
Unit 8: Data acess with ADO.NET : The need for ADO.NET, two faces of ADO.NET, role of
ADO.NET data providers, Building a simple test database, selecting a data provider, working
with connected layer of ADO.NET & OleDb Data reader, inserting, updating and deleting
records using OleDb command.Introduction to ASP.NET : Standard controls, list controls,
validation controls, Rich controls.
References Book:
1. “C# & The .NET Platform” second edition by author Andrew Troelsen

BCA 605: PROJECT & VIVA-VOCE

The project proposal should include the following:

Title
Objectives
Input and output
Details of modules and process logic
Limitations of the project
Tools/platforms, Languages to be used
Scope of future application

For the project work, the guide(internal) evaluate the work for 20 marks based on the
performance of the candidates during the development of he project and the external examiner
will evaluate the project work as follows:
Ψ Project Report - 20 marks
Ψ Project Demo -30 Marks
Ψ Viva-Voce - 30 marks

The Project work should be either an individual one or a group of not more than three members
.

BCA 604: DOT NET PROGRAMMING Lab

PART A
Unit1: Introduction to C# & .NET platform : The .NET solution, Building blocks of the .NET
platform(CLR, CTS, CLS), Role of .NET base class libraries, .NET Aware programming
languages, role of common intermediate languages & type metadata and assembly manifests, A
tour of the .NET namespaces.
Unit 2: Building C# Applications : Role of the command line complier(csc.exe), Building a C#
application using csc.exe, the command line debugger(cordbg.exe), using the visual studio .NET
IDE & its debugging, C# ”preprocessor” directives.
Unit 3: C# language fundamentals : Anatomy of a basic C# class, creating objects: constructor
basics, Default assignments & variables scope, variables initialization syntax, basic inputs &
output with the console class, understand static methods, arrays & string manipulations.
PART B
Unit 4: Exception & object life time : Role of .NET exception handling, throwing a generic
exception, catching exceptions, the final block.
Unit 5: Interface & Collections : Definition, Interface members at object level, interface as
polymorphic agents, exploring the system.collections namespaces.
Unit 6: Introducing windows forms : A tale of three GUI namespaces, overview of the
system.windows.Forms Namespaces, Anatomy of a Form, Component class, control class,
control eUnit 7: Programming with windows forms controls : Working with button types, check
boxes, Radio buttons, Group boxes, list boxes, calander control, assigning tooltips for controls.
Unit 7: Programming with windows forms controls : Working with button types, check boxes,
Radio buttons, Group boxes, list boxes, calander control, assigning tooltips for controls.
Unit 8: Data acess with ADO.NET : The need for ADO.NET, two faces of ADO.NET, role of
ADO.NET data providers, Building a simple test database, selecting a data provider, working
with connected layer of ADO.NET & OleDb Data reader, inserting, updating and deleting
records using OleDb command.I
ntroduction to ASP.NET : Standard controls, list controls, validation controls, Rich controls.
References Book:
1. “C# & The .NET Platform” second edition by author Andrew Troelsen

B.Sc SYLLABUS

KUVEMPU UNIVERSITY

B.Sc SYLLABUS
(With effect from 2012-13)

Sem
No.
Paper
Code
Title of the paper
(Theory/Practical)
Hrs/
week Marks
Theory Practical Th Pr IA Total
I SEM BCS-1 Computers Concepts And C Programming 04 ---
50
40
10
100

C Programming Lab -- 03
II SEMBCS-2 Data Structures 04 --
50
40
10
100
Data Structures lab -- 03
III SEM BCS – 3 Object Oriented programming with C++ 04 ---
50
40
10
100
C++ Lab -- 03
IV SEM BCS-4 Relational Database Management System 04 ---
50
40
10
100
SQL lab -- 03
V SEM BCS - 5.1 System Software and Operating System 04 ---
50
40
10
100
PL/SQL lab -- 03
BCS – 5.2 Java Programming 04 ---
50
40
10
100
Java Lab -- 03
VI SEM BCS – 6.1 Advance Java 04 ---
50
40
10
100
Advance Java Lab -- 03
BCS - 6.2 Software Engineering and Computer Networks 04 ---
50
40
10
100
Project work -- 03
FIRST SEMESTER B.Sc

BCS-1 : Computers Concepts And C Programming

Number of Teaching Hours – 40

Theory Examination- 50 Max marks. Internal Assessment- 10 Max marks

PART – A : Computers Concepts

Unit 1- Introduction to Computer Systems: Definition of a Computer, History of Computers,
Generations of Computers, types of computer – based on size and working principle, Block
diagram of a Computer with functional units (explanation), Parts of a computer system with
peripherals (explanation of peripherals briefly) Information processing Cycle.
2 Hrs
Unit 2- Software- Definition of software, Classifications of programming languages, assembler,
compiler, interpreter, linker, loader (Definitions only). NUMBER SYSTEM – decimal, binary
and hexadecimal number system, representation and inter -conversion, -ve number
representation, character codes- ASCII, EBCDIC and UNICODE.
3 Hrs
Unit 3- Problem Solving Techniques: Problem Definition, Problem Analysis, Design of Problems
and Design Tools (Algorithm and Flowcharts). ALGORITHMS: Algorithm-definition,
Characteristics, Notations. FLOWCHART : Definition, Symbols Writing an algorithm and
Flowchart : Area of circle, arithmetical operations, simple interest and compound interest,
quadratic equation, largest of three numbers, sum of N natural numbers, factorial of number,
Fibonacci series, prime number, reverse a given number 5 Hrs

PART – B: C programming
Unit 4- Introduction: Features, basic program structure, character set, tokens, keywords and
identifiers. Constants, variables, data types, variable declaration, symbolic constant definition.
4 Hrs
Unit 5- Operators: arithmetic, relational, logical, assignment, increment and decrement,
conditional, bitwise and special operators, Arithmetic expressions, precedence of operators and
associatively. Type conversions, mathematical functions. Managing I/O operators – reading and
writing a character, formatted I/O. 6 Hrs
Unit 6- Decision making, branching and looping: if and if-else statement, switch statement, ? :
Operator, go to statement, while, do-while and for statements, break and continue statements.
10 Hrs
Unit 7- Arrays and Functions – one and two dimensional arrays, array initialization. Strings –
declaration and initialization of string variable, reading and writing strings, string handling
functions. FUNCTIONS – Need, syntax of function declaration, all types of functions, nesting of
functions, function with arrays, scope of variables , Recursion.
10 Hrs
Reference :
1. Fundamentals of Computers, V. Rajaraman.
2. Computer fundamentals, B. Ram
3. Computer Concepts and Programming, Padma Reddy
4. Let us C , Yashwanth Kanetkar
5. Ansi C, Balagurusamy

QUESTION PAPER PATTERN

PART I05 Marks There shall be 05 questions
each carrying 01 Marks. 02 questions from Part A
03 questions from Part B
PART II 10 Marks There shall be 05 questions
each carrying 02 Marks. 02 questions from Part A
03 questions from Part B
PART III 15 Marks 02 questions from Part A
03 questions from Part B
There shall be 05 questions
and each carrying 05 Marks.
The student has to attend only 03 questions.
(Each question must have two sub question) 01 question from Unit 1, 2 and 3.
01 question from Unit 4.
01 question from Unit 5.
01 question from Unit 6.
01 question from Unit 7

PART iV 20 Marks There shall be 03 questions

and each carrying 10 Marks.
The student has to attend only 02 questions.
(Each question should have
at least three sub questions) 01 question from Unit 4 and 5.
01 question from Unit 6.
01 question from Unit 7

C- PROGRAMMING LAB
1. All roots of quadratic equation
2. First biggest and second biggest among n numbers (without array)
3. Prime numbers between M and N (M<=N)
4. Fibanoci series between M and N
5. Binary to Octal conversion
6. Any ten String handling function using switch-case
7. Sorting and unsorted array’
8. Deleting the repeated elements in an array
9. Addition of two matrices
10. Multiplication of two matrices
11. Comparison of [A] and [A]T
12. Sum of upper triangular, lower triangular and diagonal elements of a square matrix.
13. Binary and linear search in an array using function
14. Norm and trace of a matrix using call by reference
15. Recursive functions –GCD , binomial coefficient, biggest of n numbers (use switch case)

PRACTICAL EXAM SCHEME

Practical Proper - 30 Marks
Viva – voce - 05 Marks
Record - 05 Marks

C-Program Flowchart/Algorithm 05 Marks

Program Writing 10 Marks
Error free Compilation or Partial utput 05 Marks
Correct output with proper display 10 Marks

II SEMESETER B.Sc

BCS2: DATA STRUCUTRES

Number of Teaching Hours – 48

Theory Examination- 50 Max marks Internal Assessment- 10 Max marks

PART-A

Unit 1- Review Of Structures And Pointers: Pointers- concept, pointer operator and operation,
pointer arithmetic, dynamic memory allocation, command line arguments. Structure : Definition,
declaration, accessing structure members, bit fields, array of structure, union and enum. Files :
system call VS library call, opening disk files, fopen, I/O library functions, copying a file, fclose.
4Hrs

Unit 2- Stack: Definition and example, operations, representation of stack in C, evaluation of

postfix expression, conversion from infix to postfix 6 Hrs

Unit 3- Recursion: Recursive definition, and process, Recursion in C, writing Recursive

programs, efficiency of recursion- examples 2 Hrs
PART – B
Unit 4- Queues and lists: The Queue and its sequential representation, circular queue. Linked list
–linked representation, stacks and queue using linked list, other list structures - circular and
doubly linked list (concepts only). 10 Hrs

Unit 5- Trees: Binary tree, binary tree representation - linked representation, tree traversals, and
binary search tree and their applications. 7 Hrs

Unit 6- Searching: Basic search technique, sequential search, and its efficiency searching ordered
table-index sequential search, Binary search, interpolation search, binary tree searching,
3 Hrs

Unit 7- Sorting: General background, quick sort, insertion sort – simple insertion, shell sort,
radix sort, selection sort-straight selection sort, binary tree sort, heap sort.
10 Hrs
References:
1. Data structures using C and C++ - Yedidyiah et al PIII publications
2. Programming in ANSI C - E. Balagursamy
3. Datastructures and programming design using C - Robert Kruse PIII publications
4. Datastructures and applications - Trembly and Sorenson
5. Systematic approach to data structure Padmareddy
6. Robert L Kruse, “data structure and program design using c”, PHI

QUESTION PAPER PATTERN

PART I05 Marks There shall be 05 questions
each carrying 01 Marks. 2 questions from Part A
3 questions from Part B
PART II 10 Marks There shall be 05 questions
each carrying 02 Marks. 2 questions from Part A
3 questions from Part B
PART III 15 Marks 02 questions from Part A
03 questions from Part B
There shall be 05 questions and each carrying 05 Marks.
The student has to attend only 03 questions.
(Each question must have two sub question) 1 question from Unit 1,
1 question from Unit 2 and 3.
1 question from Unit 4 and 5.
1 question from Unit 6.
1 question from Unit 7
PART IV 20 Marks There shall be 03 questions and each carrying 10 Marks.
The student has to attend only 02 questions.
(Each question should have
at least three sub questions) 1 question from Unit 1,2 and 3
1 question from Unit 4 and 5.
1 question from Unit 6 and 7

DATA STRUCUTRES LAB

1. Implementation of stack using structure

2. Evaluation of postfix expression
3. Conversion of infix to postfix
4. Implementation of queue using structures
5. Implementation of linked list (ordered insertion, deletion and searching a node)
6. Implementation of stack using linked list
7. Implementation of using linked list
8. Binary tree traversals
9. Quick sort
10. Heap sort
11. Tree sort
12. Radix sort

PRACTICAL EXAM SCHEME

Practical Proper - 30 Marks
Viva – voce - 05 Marks
Record - 05 Marks

Data Structure Program

Flowchart/Algorithm 05 Marks
Program Writing 10 Marks
Error free Compilation or Partial output 05 Marks
Correct output with proper display 10 Marks

Third Semester BSc

BCS3 : Object Oriented Programming with C++
PART-A
chapter 1: Principles of OOPS:
Object Oriented Programming paradigm, Basic concepts of Object Oriented Programming-
Classes, Objects, Data Abstraction and Encapsulation, Polymorphism, Inheritance, Dynamic
Binding, Message passing, Benefits of OOP, Object Oriented languages, applications of OOP.
6 Hrs
Chapter 2: Introduction to C++ Programming:
C++ features, Comparison with C, Structure of a C++ program, input and output statements,
Keywords, symbolic constants, type compatibility, declaration of variables, reference variables,
operators in C++, control structures. 8 Hrs
PART- B
Chapter 3 : Classes Objects and Member Functions:
Limitations of structures in C, specifying a class, creating objects, memory allocation for objects,
static data members, arrays within a class, local classes. Defining member functions, call by
reference, return by reference, inline functions, default arguments, making an outside function
inline, nesting of member functions, private member functions, function overloading, static
member functions, const member functions, pointer to members, friend and virtual functions.
8 Hrs
Chapter 4 : Constructors and Destructors:
Introduction, constructors, parameterized constructors, multiple constructors in a class,
constructors with default arguments, dynamic initialization of objects, copy constructor, dynamic
constructors, constructing two dimensional arrays, const objects, destructors.
6 Hrs
Chapter 5 : Operator overloading and type conversions:
Introduction, definition, overloading unary operators, overloading binary operators, overloading
operators using friends, string manipulations using operators, rules for operator overloading, type
conversions. 6 Hrs
Chapter 6 : Inheritance:
Introduction, defining derived classes, single inheritance, making a private member inheritable,
multilevel inheritance, multiple inheritance, hierarchical inheritance, hybrid inheritance, virtual
base classes, abstract classes, constructors in derived classes, member classes, nesting of classes.
10 Hrs
Chapter 7 : Templates:
Introduction, class templates, class templates with multiple parameters, function templates,
function templates with parameters. 6 Hrs

Reference Books:
5. Object Oriented Programming with C++ - E balaguruswamy
6. C++ Prime – Stanly Lippaman and Jose Lajoie
7. Object Oriented Programming in Turbo C++ - Robert Lafore
8. C++ The complete Language – Bjarne Schildt

QUESTION PAPER PATTERN

PART I05 Marks There shall be 05 questions
each carrying 01 Marks. 2 questions from Part A
3 questions from Part B
PART II 10 Marks There shall be 05 questions
each carrying 02 Marks. 2 questions from Part A
3 questions from Part B
PART III 15 Marks 02 questions from Part A
03 questions from Part B
There shall be 05 questions and each carrying 05 Marks.
The student has to attend only 03 questions.
(Each question must have two sub question) 1 question from Unit 1,
1 question from Unit 2
1 question from Unit 3.
1 question from Unit 4 and 5.
1 question from Unit 6 and 7
PART IV 20 Marks There shall be 03 questions and each carrying 10 Marks.
The student has to attend only 02 questions.
(Each question should have
at least three sub questions) 1 question from Unit 1,2
1 question from Unit 3 and 4.
1 question from Unit 5 and 6

C++ LAB LIST

PART A
1. Write a c++ program to accept the marks of three subject of a student and Calculate the
result. The output should be in the following format.
Statement of Marks
Name: RegNo:
Combination:
Max/Min Marks obtained
Sub1
Sub2
Sub3
Total: Result:
2. Write a c++ program to define a class BankAccount including the following class
members.
DataMembers:, cust name, accno, balance.
Member Functions: a) getdata(custname,accno,balance).
b) display(accno).
c) deposit(acno,amt).
d) withdrow(accno,amt) updation aftern checking the balance.
e) To display name & balance of all the records.
3. Write function using polymorphism to
Reverse an integer, reverse a float ( 23.8 ♥8.23), to reverse a string
4. Let A be a class with member function to addmat(), B be a class with member function
multimat(). Let readmat() and printmat()be two friend functions to both classes. Using the above
concept write a program to find the sum and product of two matrices. ( Take different matrices
for addition and multiplication).
5. Write a c++ program to read an integer number and find the sum of all digits until it
reduces to a single digit using constructor and default constructor
6. Write a c++ program to create a class complex and perform the following operations
using friend function
Addition of two complex numbers
Multiplication of two complex numbers
7. Write a c++ program to define a class STACK using an array of integers and to
implement the following operations by overloading the operators + and –
i. S1=s1+ele ; where s1 is an object of the class STACK and ele is an integer to be pushed
on to top of the stack
ii. S1=s1-; where s1 is an object of the class STACK and operator pops the top element.
Handle the STACK Empty and Full conditions. Also display the contents of the stack after each
operation, by overloading the operator <<.
8. Write a c++ program to create a class string where S1,S2 & S3 are objects, Initialize the
objects S1 & S2 using parameterized constructor and do the following operations using operator
overloading
Concatenate S1 & S2 object using “+” operator and assign the result to S3 object
Concatenate S1 & S2 object using “==” use friend operator function
Compare two strings S1 & S2 with respect to length using”<=” operator
9. Write a c++ program to calculate age of a person by passing object as arguments. Create
two objects O1 and O2. O1 reads the current date in the format of DD/MM/YYYY and O2 reads
the date of birth in the same format
10. Write a c++ program to transform the amount from one account to another account using
objects as function arguments.
11. Write a c++ program to store the following information in base class with members
Ename,Ecode,Design and the Derived class with data members year of experience , age.
Construct an object oriented database to carry out the following using single inheritance
Input records
Display records
Delete record
Sort the records by employee name
12. Write a c++ program to store the following information in base class (name of patient,
age, sex). Another base class consists of (ward number, bed number, nature of illness). The
derived class consists of (date of admission). Construct an object oriented database to carry out
the following using multiple inheritance
Input records
Display records
Delete particular patient record
Sort records by patient name
13. Write a c++ program to implement multilevel inheritance
a. College—> name_id, location,dept
b. Student—>name ,reg_no, course,age
c. DOB—>date, month, year, place
14. Write a function template to sort N numbers in ascending/descending order.
15. Write a class template to implement linked implementation of queue for operations
Qinsert, Qdelete, Qempty, Qfull.

PRACTICAL EXAM SCHEME

Practical Proper - 30 Marks
Record - 05 Marks
Viva – voce - 05 Marks

One Program
Max marks 30 Program writing 15 Marks
Error free compilation or partial output 05 Marks
Correct result with proper display 10 Marks

IV SEMESTER B.Sc
BCS 4 : DATABASE MANAGEMENT SYSTEM

PART – A
8. SQL:
Background, basic structure, set operation, aggregate functions, NULL values, nested sub
queries, Views, complex queries, Modification of the database, joined relations, Data Definition
Language, domain constraints, referential integrity in SQL
Assertions, authorization, privileges in SQL, Encryption techniques. 10 Hrs.
9. PL/SQL
Introduction to PL/SQL Concepts, PL/SQL Programming Fundamentals, data types SQL in
PL/SQL, Conditional Control structure – if and case statements, Iterative Control structure, Error
Handling and built in exceptions, Cursors, procedures, functions, Triggers.
10 Hrs.
PART- B
10. Introduction:
Meaning of data and information, data processing, need for data, data processing and
information. Meaning of persistent data, definitions for DBMS, database, database system,
examples, database system applications. Meaning of file and file management system, database
management system vs. file management system, views of data, data independence, data models,
database languages, database users and administrators, database system structure, application
architecture, advantages of using DBMS, classification of DBMS, meaning of schema and
instance. Data mining and data ware housing(Definition, concept in brief)
6 Hrs.

11. E-R Model:

Using high-level, conceptual data models for database design, basic-concepts, constraints, keys,
an example database application, E-R diagram, types of entities, entity sets, attributes, types of
attributes, weak entity sets, cardinality ratios (mapping cardinality), specialization,
generalization, attribute inheritance, constraints on generalization, aggregation, the Unified
Modeling Language (UML). 6 Hrs.
12. Relational Model:
Structure of relational Databases, Relational algebra - select, project. union, set difference,
rename, division operations, Modification of the database, queries using relational algebra.
Extended relational algebra operations. 6 Hrs.
13. Relational Database Design:
Pitfalls in relational data base design, Normalization for relational databases. Normal forms
based on primary keys, General definitions of first, second and third normal forms, Functional
Dependency (concept and example) decomposition, Boyce-Codd Normal Form - definition and
example, fourth Normal form - Multi valued Dependencies - definition and example.
6 Hrs.
14. Storage and File Structure
Overview of physical storage media, RAID, Organisation of records in files, Data dictionary,
Ordered indicies, B+ tree index files, introduction to transactions.
6 Hrs

Reference Books:
6. Korth, Sudarshan “Database System concepts”, Mcgraw Hill-IV Edition.
7. Navathe, Silberchatz and Elmasri “fundamentals of database Systems”-Addison Wesley-
2004
8. C.J. Date “Introduction to Database systems” Addison-wesley.
9. J.D.Ullman “Principals of Data base systems” computer science press”.
10. Bipin C Desai “Introduction to Data base system” Galgotia publications

QUESTION PAPER PATTERN

PART I05 Marks There shall be 05 questions
each carrying 01 Marks. 2 questions from Part A
3 questions from Part B
PART II 10 Marks There shall be 05 questions
each carrying 02 Marks. 2 questions from Part A
3 questions from Part B
PART III 15 Marks 02 questions from Part A
03 questions from Part B
There shall be 05 questions and each carrying 05 Marks.
The student has to attend only 03 questions.
(Each question must have two sub question) 1 question from Unit 1,
1 question from Unit 2
1 question from Unit 3 and 4.
1 question from Unit 5 and 6.
1 question from Unit 7
PART IV 20 Marks There shall be 03 questions and each carrying 10 Marks.
The student has to attend only 02 questions.
(Each question should have
at least three sub questions) 1 question from Unit 1,2,3
1 question from Unit 4 and 5.
1 question from Unit 6 and 7

SQL LAB LIST

I. Use the default emp and dept talbe to write SQL statements for the following queries
1. Find the employee details in ascending order of their name and descending order of their
salary
2. Find names of all employees whose name starts with ‘s’ and having atleast 6 characters in
it
3. Find the name of all managers and number of employees under them
4. Find the details of all employees in the research department
5. Find the minimum, maximum and average salary of each department
6. Find department name having least number of employees
7. Find the department name having highest annual payroll
8. Add an employee under the manager smith
9. Find the employees who are not getting commission
10. Display the eno, name manager name and department name in the order of their
department
II. Create tables as below
Student(name string, regno string primary key, dob date, doj date ,course string foreign key)
Markscard(regno foreign key, sem string, sub1 number, sub2 number, sub3 number, tot number,
avge number, result string)
Write SQL statements for the following queries.
1. List the names of students studying in BCA course in the order of their joining
2. Find the name of student who has scored highest marks in every sem of each course
3. Count the number of students in each course
4. Find the course having second highest number of students
5. Find the course having least students in I semester
6. Raise the marks of sub3 in III sem BCA students by 5% if the student has failed in that
subject
7. Display the details of student ‘xxx’ in every semester.
8. Find the names of al juniors of ‘yyy’ in course ‘c1’
9. Find all students studying with ‘xxx’ and elder to him (compare DOB)
10. Find the year in which highest and lowest students have admitted to the college.
III. Create tables Dept(deptno integer pkey, dname string not null, loc string not null)
Emp(eno integer pkey, ename string, deptno fkey, desgn string not null, bsal number>0)
Salary(eno fkey,da,hra,gross,it,pf,net,comm)
DESGN ARE manager,clerk,salesman
Comm=5% of basic if desgn=salesman otherwise null
Da=15% bsal hra = 7% of bsal gross=bsal+da+hra
It =0 if gross<15000
= 10% of gross if gross between 15000 and 30000
=20% of gross if gross between 30000 and 50000
= 30% of gross otherwise
pf = 10% of gross or 1000 whichever is less
Write sql statements for
1. Count the number of employees in every designation
2. List the employees of every department in descending order of their net salary
3. List the name and salary of highest salary payer in every department
4. List the name of employee paying highest IT
5. List the total IT paid by each department
6. List the departments in every location
7. Raise the basic salary by 10% for the managers of every department.
8. Find the number of employees having atleast 10 years of experience in every
department.
9. Count the number of employees who are not getting commission in every department
10. Create a new table manager using above tables containing columns dname,name,net.

IV. Create tables as below

Employee(eno, ename,street,city)
Company(cno,cname,city)
Works(eno,cno,sal)
Manages(mno,eno)

Write sql statements for the following queries

PRACTICAL EXAM SCHEME

Practical Proper - 30 Marks
Record - 05 Marks
Viva – voce - 05 Marks

One Program
Max marks 30 Table creation and record insertion 10 Marks
5 queries writing 15 Marks
Correct result with proper display 5 Marks
BCS 5.1 :V SEMESTER – SSE 741
SYSTEM SOFTWARE AND OPERATING SYSTEM
PART A
1. Assemblers.
Design of assembler, statement of a problem, data structure, format of databases, algorithm for
Pass1 and pass-2 (overview flowchart only) 8 Hrs.

2. Macro language
Macro instruction featured on macro facility, macro instruction arguments, conditional macro
expansion, macro calls within macros, macro instructions defining macros.
4 Hrs.

3. Loaders.
Loader schemes, compile and go loader, absolute loader, subroutine linkage, relocating loaders,
direct linking loader, overlays, dynamic binders, dynamic loading.
6 Hrs.

PART B

4. Compiler
Phases of compiler, lexical phase, syntax phase, interpretation phase, optimization phase, storage
assignment phase, code generation phase. (brief study) 6 Hrs.

5. Operating systems
Introduction, early system performance, multiprogramming, time sharing, real time systems,
functions of operating systems. 2 Hrs

6. CPU Scheduling
Scheduling concepts, algorithms, performance criteria, FCFS, Shortest job first, priority
scheduling, Preemptive algorithm – round robin 6 Hrs.

7. Memory management
Function, single contiguous allocation, multiprogramming, partitioned allocation. Paged memory
management, demand paging, segmented memory management, virtual memory management
(concept, advantages and disadvantages) 10 Hrs

8. Dead lock
Dead lock problem, deadlock characteristics, deadlock prevention and avoidance
2 Hrs
9. File system
File concept access methods, directory structures, protection and consistency semantics
4 Hrs

10. Secondary storage structure

Disk structure, disk scheduling, disk management, disk reliability, SPOOLing.
4 Hrs.
Reference:
1. Systems programming - John J Donovan
2. Systems programming and operating systems – Dhamdare
3. Operating systems - Silbershatz and Galvin

QUESTION PAPER PATTERN

PART I05 Marks There shall be 05 questions
each carrying 01 Marks. 2 questions from Part A
3 questions from Part B
PART II 10 Marks There shall be 05 questions
each carrying 02 Marks. 2 questions from Part A
3 questions from Part B
PART III 15 Marks 02 questions from Part A
03 questions from Part B
There shall be 05 questions and each carrying 05 Marks.
The student has to attend only 03 questions.
(Each question must have two sub question) 1 question from Unit 1,
1 question from Unit 2 and 3
1 question from Unit 4 .
1 question from Unit 5 6.7
1 question from Unit 8,9,10
PART IV 20 Marks There shall be 03 questions and each carrying 10 Marks.
The student has to attend only 02 questions.
(Each question should have
at least three sub questions) 1 question from Unit 1,2,3,4
1 question from Unit 6,9,10
1 question from Unit 7

PL/SQL Lab

PL/SQL problems
Use the default emp and dept talbe
1. Write pl/sql code block to accept a number and reverse it
2. Write pl/sql code block to accept the name, marks in 4 subjects of a student and find total
average and result.
3. Assume a table number with columns num, reverse. Data is present only in the column
num. Write pl/sql code block to update the number table using cursor. The code should calculate
the reverse of the num, check whether num is prime or not, a member of Fibonacci series or not.
Use Functions to do these jobs.
4. Create a row trigger to keep running count of DML operations performed by different
users on the emp table.
5. Assume two tables item_masert(ino,qty_inhand) and transaction(ino,qty,tr_type). Write
pl/sql code block to update qty_inhand in the item_master table using the records in the
transaction table. The qty_inhand must be decreased by the qty in transaction table if tr_type is
‘Sales’ and has to be increased by qty if tr_type is ‘purchase'. Updation depends on ino. If an
ino is not found in the item_master then insert a new item into the item_master table. Use
function to check the presence of ino in maseter table.

Create tables as below

1. Write PL/SQL code block to calculate the result of studetns using cursor
2. Create a trigger which has to be fired whenever any modification is done to the
markscard table. Store the modification in the back up table.
3. Write PL/SQL function to count the number of students in a sem of a course.
4. Write pL/SQL procedure to retrieve the total, avge and result of a student given his regno,
course and sem

Create tables Dept(deptno integer pkey, dname string not null, loc string not null)
Emp(eno integer pkey, ename string, deptno fkey, desgn string not null, bsal number>0)
Salary(eno fkey,da,hra,gross,it,pf,net,comm)
DESGN ARE manager,clerk,salesman
Comm=5% of basic if desgn=salesman otherwise null
Da=15% bsal hra = 7% of bsal gross=bsal+da+hra
It =0 if gross<15000
= 10% of gross if gross between 15000 and 30000
=20% of gross if gross between 30000 and 50000
= 30% of gross otherwise
pf = 10% of gross or 1000 whichever is less

1. Write PL/SQL program to compute DA,HRA,… using cursor

2. Write PL/SQL function to accept eno and return his net salary if eno is valid otherwise
raise exception ‘no data found’
3. Write PL/SQL procedure to extract the details of an employee given his eno. Display
appropriate message for wrong eno
4. The HRD manager has decided to raise the salary of all employees in the department
number 20 by 0.05%. Whenever such raise is given to the employees, a record for the same is
maintained in the emp_raise table. This table has the columns eno,the date of raise and raised
amount.Write PL/SQL code block to achieve the above.
5. Write a statement trigger on emp table such that the insertion is possible only on
Thursday.

Create tables as below

Employee(eno, ename,street,city)
Company(cno,cname,city)
Works(eno,cno,sal)
Manages(mno,eno)

1. Write pl/sql program to display ename,city,cname,city,sal,manager name of every

employee , company wise using cursor
2. Write pl/sql procedure to display the employee details of the company ‘c1’ who draw
salary greater than 50000 per month
3. Write PL/SQL function to test the validity of an employee number. If it is valid display
his details (personal and professional). Otherwise display appropriate message
4. Create a trigger which keeps track of any changes done to the company and works table.
Record the changes (old and new) in a backup table.

PRACTICAL EXAM SCHEME

Practical Proper - 30 Marks
Record - 05 Marks
Viva – voce - 05 Marks

One Program
Max marks 30 Program eriting 15 Marks
Error free compilation 10 Marks
Correct result with proper display 5 Marks

FIFTH Semester BSc

BCS 5.2 : JAVA Programming
PART - A
6. Introduction to Java and Java Program Structure: 14 Hrs.
History of Java, Java features, Difference between C/C++ and Java, Java program structure, Java
tokens, Statements, JVM, Introduction to packages in Java, Applets, Operators & Expressions,
Data types, Constants and Variables, Type conversions, Mathematical functions; Control
Statements: Decision making and Branching with while, do-while, for and labeled loops; Arrays,
Vectors & Strings: Initialization, Declaration of 1D, 2D arrays, String arrays, String methods,
Vectors, Wrapper classes.

PART - B
7. Overview: 10 Hrs.
Class, Objects, Constructor, Method overloading, Static members; Inheritance: Single,
Multilevel, Hierarchical, Visibility modes, Method overriding, Final variable, Abstract methods
and classes; Interface: Defining, Extending and Implementing assigning interface variables ;
8. Packages and multithreading 06 Hrs.
Java API Packages, using system packages, naming convention, accessing and using a package,
adding a class to packages, hiding classes. Multithreaded programming: Creating a thread,
extending the thread class, stopping and blocking a thread, life cycle of a thread, using thread
methods, thread exceptions, thread priority, synchronization, implementing the runnable
interface.
9. Exceptions and Debugging: 06 Hrs.
Meaning of errors and exceptions, Dealing with errors, Classifications of exceptions, syntax of
handling exceptions, advertising the exceptions, throwing and rethrowing exceptions, creating
Exception classes, multiple catch statements, finally clause, tips for using exceptions, Debugging
techniques – tricks for debugging, Assertions, Java Debugger (JDB).
10. Applets and Graphics: 10 Hrs.
Applets basics, applets and application, Life cycle, Life cycle of Applet programming- passing
parameter to applets, paint and repaint methods, Graphics class, Line, Rectangle, Circle, Ellipse,
Arcs and Polygon. Using control loops in applets, drawing bar charts.
Reference Books:
4. Java, The Complete Reference – Patrick Naughton and Schildt
5. Programming in Java – Joseph L Weber
6. Java Programming – E Balagurusamy
QUESTION PAPER PATTERN
PART I05 Marks There shall be 05 questions
each carrying 01 Marks. 2 questions from Part A
3 questions from Part B
PART II 10 Marks There shall be 05 questions
each carrying 02 Marks. 2 questions from Part A
3 questions from Part B
PART III 15 Marks 02 questions from Part A
03 questions from Part B
There shall be 05 questions and each carrying 05 Marks.
The student has to attend only 03 questions.
(Each question must have two sub question) 2 question from Unit 1,
1 question from Unit 2
1 question from Unit 3 and 4 .
1 question from Unit 5

PART IV 20 Marks There shall be 03 questions and each carrying 10 Marks.

The student has to attend only 02 questions.
(Each question should have
at least three sub questions) 1 question from Unit 2
1 question from Unit 3 and 4
1 question from Unit 5

Java Lab
JAVA Program List
26. Write a Java program to generate first n odd numbers and pick and display prime
numbers among them. Read value for n as command line argument.
27. Write a Java program to encode the given set of characters using simple encryption.
28. Write a Java program to create a vector, add elements at the end, at specified location
onto the vector and display the elements. Write an option driven program using switch…case.
29. Write a java program to find area of geometric figures (atleast 3) using method
overloading.
30. Write a Java program to find the circumference and area of the circle using interface.
31. Write a java program to sort the alphabets in the given string.
32. Write a java program to accept student information using array of objects and constructor
initialisation.
33. Write a java program to accept student, employee information to perform relevant
computation using hierarchical inheritance.
34. Write a java program to implement static and dynamic stack using interface using
abstract class.
35. Define an interface with methods to add and subtract two floating point numbers each of
which returns a floating point number. Declare a class Customer, implementing the above
interface by providing definitions for the abstract methods (addition and subtraction) of the
interface to perform the deposit and withdrawal operations respectively. Similarly declare one
more class Bank Staff implementing the above interface by providing definitions for the abstract
methods of the interface to perform the salary hike and salary deduction operations.
36. Write a java program to implement constructor overloading by passing different number
of parameter of different types.
37. Write a java program to accept employee information to calculate T.A, D.A, HRA, gross
salary, and net information using overriding.
38. . Define a package to contain the class sort to contain methods for various sorting
techniques with time complexity (at least 3)Use this package to sort the list
39. Write a Java program to add two time values. Verify whether the operand time values
and result time are valid or not. If operand times are valid, add the two given time values. If
invalid, throw a user defined exception saying that time value is not valid. Also, adjust the
invalid time value so that it becomes valid.
40. Write a Java program to generate odd, even and Fibonacci numbers simultaneously using
the concept of multi-threading.
41. Write a program to demonstrate priority threads.
42. Write a program to implement an applet by passing parameter to HTML
43. Write an applet program to display human face
44. Write a program to create student report using applet, read the input using text boxes and
display the output using button.
45. Create an applet to display concentric n circles, input value for n.

PRACTICAL EXAM SCHEME

Practical Proper - 30 Marks
Record - 05 Marks
Viva – voce - 05 Marks
One Program
Max marks 30 Program eriting 15 Marks
Error free compilation 10 Marks
Correct result with proper display 5 Marks
VI SEMESTER BSc
BCS 6.1 :ADVANCED PROGRAMMING IN JAVA
Chapter 1: AWT, Graphics Programming,
AWT and AWT Classes, Window fundamentals – Component, Container, Panel, Window,
Frame, Canvas. Working with frame window.
Graphics Programming: Graphics class, methods, drawing objects, line graphs, polygon
classes, working with colors and fonts. Advanced graphics operations using Java2D. Designing
simple User Interfaces (UIs) using AWT, Layout Manages. 10 Hrs
Chapter 3: Swing and Event Handling:
Event Handling: Basics of Event Handling, the delegation event model, AWT event
hierarchy and event classes, Event Listener Interfaces, Adapter Classes, Event queue.
Swing: Meaning, need difference between AWT and swing. The Model-View-Controller
(MVC) design patterns, Creating simple UIs using swing, and handling basic events.
10 Hrs.
PART B
Chapter 4: Java Beans and Java Archives (JAR):
Meaning and need of Java Beans, Advantages, Bean writing process, Bean properties.
Java Archives (JARs): Meaning, need, the JAR utility, Creating JAR files. 8 Hrs.
Chapter 5: File Management and JDBC:
File, creating a file, writing to a file, opening a file, reading from a file, file management,
checking existence of a file, deleting a file.
JDBC: Meaning, need, concept and structure of JDBC, relation with ODBC, JDBC driver
types and their meaning, the JDBC process – loading the driver, connecting to the DBMS,
creating and executing SQL statement, Connection object, Statement object, PreparedStatement
object, CallableStatement, ResultSet, JDBC Exceptions. 8 Hrs.
Chapter 6: Fundamental concepts of Collections, Generics and Network programming:
Collections: Meaning, need, Collection interfaces, Concrete Collections – ArrayList, Hashset,
Map.
Generics: Meaning, need, benefits, generics usage, basics of generic types, type parameter
naming conventions, type wildcards, using type wildcards, generic methods, bound types,
writing simple generic container, implementing the container, implementing the constructors,
implementing generic methods.
Network programming: Meaning of Client, Server, Socket, port. Creating a client socket,
creating a server socket, writing simple server and client. 10 Hrs.

References:
5. The Complete Reference – Java 2: Herbert Schildt, 5th / 7th Edition, Tata McGraw-Hill
Edition.
6. Thinking in Java: Bruce Eckel
7. Core Java 2: Volume I – Fundamentals: Cay S. Horstmann, Gary Cornell, Pearson
Education Asia.
8. Core Java 2: Volume II – Advanced Features: Cay S. Horstmann, Gary Cornell, Pearson
Education Asia.
QUESTION PAPER PATTERN
PART I05 Marks There shall be 05 questions
each carrying 01 Marks. 2 questions from Part A
3 questions from Part B
PART II 10 Marks There shall be 05 questions
each carrying 02 Marks. 2 questions from Part A
3 questions from Part B
PART III 15 Marks 02 questions from Part A
03 questions from Part B
There shall be 05 questions and each carrying 05 Marks.The student has to attend only 03
questions.(Each question must have two sub question) 1 question from Unit 1,
1 question from Unit 2
1 question from Unit 3
1 question from Unit 4.
1 question from Unit 5

PART IV 20 Marks There shall be 03 questions and each carrying 10 Marks.The

student has to attend only 02 questions.(Each question should have at least three sub questions)
1 question from Unit 1 and 2
1 question from Unit 3 and 4
1 question from Unit 5

ADVANCED JAVA LAB

19. applet to add, remove, select an item in a list

20. Write an applet to display selected geometric figure from a list.
21. Write a program to implement mouse events
22. Write a program to implement keyboard events
23. Write a Java program (console) to store the typed text to a file.
24. Write a Java program to display the content of a file.
25. Write a Java program to edit the content of a file.
26. Write a Java program to design a user interface using awt or swing APIs with event
handling (don’t use applet). The program should read, through the text boxes, the details of the
student like student name, Register number, Course, Semester, and marks obtained in 5 subjects
(assume that the number of subjects for all the defined courses and semesters will be same). For
Course and semester, design the combo box. Design three buttons. First, to calculate the total
marks, percentage marks and grade. Second, to clear the fields and the third, to exit. Assume the
suitable criteria to evaluate the grade. Also design text boxes to display the total marks,
percentage and grade. Use appropriate layout manager to arrange the user interface controls.

27. Write a Java program with JDBC to store the details of a person on to an Oracle database
table.
28. Write a Java program with JDBC to access and display the details of a person stored in an
Oracle database table.
29. Write a Java program with JDBC to access and delete the details of a given person stored
in an Oracle database table.
30. Write a Java GUI program to accept the details of an employee and store the same on to
an Oracle database table.
31. Write a Java GUI program to access and display the details of a given employee stored in
Oracle database table.
32. Write a Java program to design a simple Client and Server components. Pass simple text
(static) from client to the server and a receipt acknowledgement (static) back to the client.
33. Write a Java program to design a Client and Server components. Pass the text from client
console to the server and a receipt acknowledgement (static) back to the client.
34. Write a Java program to design a login session through Client and Server components.
From client, pass the username and password to the server, verify the username and password
combinations at the server and if there is a match, send a success message, otherwise a failure
message back to the client.
35. Write a Java program to demonstrate the use of generics.

PRACTICAL EXAM SCHEME

Practical Proper - 30 Marks
Record - 05 Marks
Viva – voce - 05 Marks

One Program
Max marks 30 Program writing 15 Marks
Error free compilation or partial output 05 Marks
Correct result with proper display 10 Marks

BCS 6.2 : VI SEMESTER – SSF 741

SOFTWARE ENGINEERING & COMPUTER NETWORKS

Part A : Software Engineering

1. Introduction to Software Engineering : Software , Software Engineering, phases in software
development, role of management and matrics.
2. Software process : Software process, waterfall model, prototyping model, iterative
enhancement model and spiral model.
3.Design : Design objectives, design principles, module level concepts, structured design
methodology, introduction to detailed design.
4.Coding and Testing : Programming practice – top – down & bottom – up , structured
programming, programming style.
5.Testing : Testing fundamentals, brief introduction to functional testing and structural testing.
Part B : Computer Networks

11. Introduction : Computer networks, goals of computer network.

12. Network Hardware : Types of Network Broadcast , point to point – LAN, WAN, MAN,
wireless network, Internet.
8. Network Software : Network Architecture, Design issues , connection oriented and
connectionless services.

9.Reference models : OSI – ISO, TCP / IP , Novell netware, ARPANET.

10.Transmission Media : Magnetic media, twisted pair, coaxial cable, fibre optics

References:
1. An integrated approach to Software Engineering : Pankaj Jalote.
2. Software Engineering a practitioners approach : Roger Pressman.
3. Computer networks : Andre S Tanenbaum.

QUESTION PAPER PATTERN

PART I05 Marks There shall be 05 questions
each carrying 01 Marks. 2 questions from Part A
3 questions from Part B
PART II 10 Marks There shall be 05 questions
each carrying 02 Marks. 3 questions from Part A
2 questions from Part B
PART III 15 Marks 03 questions from Part A
02 questions from Part B
There shall be 05 questions and each carrying 05 Marks.The student has to attend only 03
questions.(Each question must have two sub question) 1 question from Unit 1,2,
1 question from Unit 3
1 question from Unit 6,7,8
1 question from Unit 9,10.

PART IV 20 Marks There shall be 03 questions and each carrying 10 Marks.The

student has to attend only 02 questions.(Each question should have at least three sub questions)
1 question from Unit 1 ,2,3
1 question from Unit 4,5
1 question from Unit 6-10

Practical :PROJECT & VIVA-VOCE

The objective of the project is to motivate them to work in emerging/latest technologies, help
the students to develop ability, to apply theoretical and practical tools/techniques to solve real
life problems related to industry, academic institutions and research laboratories.
The project is of 3 hours/week for one (semester VI) semester duration and a student is
expected to do planning, analyzing, designing, coding and implementing the project. The
initiation of project should be with the project proposal. The synopsis approval will be given by
the project guides.

The project proposal should include the following:

Title
Objectives
Input and output
Details of modules and process logic
Limitations of the project
Tools/platforms, Languages to be used
Scope of future application

The examiner will evaluate the project work as follows:

Ψ Project Report - 10 marks
Ψ Project Demo - 10 Marks
Ψ Viva-Voce - 20 marks

Bca Notes
No ratings yet
Bca Notes
8 pages
Duda Problemsolutions
100% (6)
Duda Problemsolutions
446 pages
BCA 6th Sem
No ratings yet
BCA 6th Sem
29 pages
Partial List of Seminole On Dawes Rolls ($5 Indian Signups)
No ratings yet
Partial List of Seminole On Dawes Rolls ($5 Indian Signups)
197 pages
Bca Syllabus
No ratings yet
Bca Syllabus
37 pages
BCA All Semester Syllabus
100% (2)
BCA All Semester Syllabus
53 pages
QWR Template - Generic
100% (2)
QWR Template - Generic
3 pages
BCA Syllabus CBCS 2016-17
No ratings yet
BCA Syllabus CBCS 2016-17
47 pages
Strategy& PwC Booz Casebook Consulting Case Interview Book思略特 - 博斯 - 普华永道咨询案例面试
100% (6)
Strategy& PwC Booz Casebook Consulting Case Interview Book思略特 - 博斯 - 普华永道咨询案例面试
14 pages
Bca PDF
No ratings yet
Bca PDF
44 pages
Jnu Sylabus
No ratings yet
Jnu Sylabus
106 pages
Bca 1 Sem Syllabus
100% (1)
Bca 1 Sem Syllabus
9 pages
B C A
No ratings yet
B C A
51 pages
Thiruvalluvar University: Cbcs Pattern
No ratings yet
Thiruvalluvar University: Cbcs Pattern
52 pages
Bachelor of Computer Application (Part-1,2,3)
No ratings yet
Bachelor of Computer Application (Part-1,2,3)
31 pages
BCA 1 - 6 Sem Syllabus
No ratings yet
BCA 1 - 6 Sem Syllabus
28 pages
Bca Cbcs 2016
No ratings yet
Bca Cbcs 2016
26 pages
B.C.A Part - 1, 2 & 3 - 2018266100601 PDF
No ratings yet
B.C.A Part - 1, 2 & 3 - 2018266100601 PDF
74 pages
The University of Burdwan Syllabus For Bachelor of Computer Application (Honours) (1+1+1 Pattern)
No ratings yet
The University of Burdwan Syllabus For Bachelor of Computer Application (Honours) (1+1+1 Pattern)
16 pages
BSC (CS) Slybus
No ratings yet
BSC (CS) Slybus
35 pages
Bca Dde 2010 PDF
No ratings yet
Bca Dde 2010 PDF
15 pages
Burdwan University BCA Syllabus
No ratings yet
Burdwan University BCA Syllabus
20 pages
Kumaun University, Nainital, Uttarakhand: Bachelor of Computer Application Session 2019-2020
No ratings yet
Kumaun University, Nainital, Uttarakhand: Bachelor of Computer Application Session 2019-2020
9 pages
BCA - 1st To 6th Sem (Effective From 2011-12)
No ratings yet
BCA - 1st To 6th Sem (Effective From 2011-12)
19 pages
Scheme of Examination 2019-2020: Bca Part-I
No ratings yet
Scheme of Examination 2019-2020: Bca Part-I
32 pages
1 Dramatic Techniques in Literature +
100% (4)
1 Dramatic Techniques in Literature +
5 pages
Untitled
No ratings yet
Untitled
64 pages
Syl LBC A 191011
No ratings yet
Syl LBC A 191011
72 pages
DAVANGERE University Syllabus 2016 BCA
71% (7)
DAVANGERE University Syllabus 2016 BCA
14 pages
Bca Part I, Ii, Iii
No ratings yet
Bca Part I, Ii, Iii
34 pages
BCA-101: Computer & Programming Fundamentals External Marks: 80 Time: 3 Hours Internal Marks: 20
No ratings yet
BCA-101: Computer & Programming Fundamentals External Marks: 80 Time: 3 Hours Internal Marks: 20
45 pages
Bca 2023 2025
No ratings yet
Bca 2023 2025
39 pages
B C A
0% (1)
B C A
51 pages
10 44 Bca-1 2019219135844
No ratings yet
10 44 Bca-1 2019219135844
26 pages
Bca SYLLABUSpdf
No ratings yet
Bca SYLLABUSpdf
33 pages
BCA First Syllabus
No ratings yet
BCA First Syllabus
9 pages
The BCA (1) 23
No ratings yet
The BCA (1) 23
36 pages
Note: A Minimum of 40 Lectures Is Mandatory For Each Course
No ratings yet
Note: A Minimum of 40 Lectures Is Mandatory For Each Course
4 pages
Syllabus BCA III 949107588
No ratings yet
Syllabus BCA III 949107588
9 pages
Revised BCA Syllabus
No ratings yet
Revised BCA Syllabus
39 pages
Field Project
No ratings yet
Field Project
16 pages
MCA First Semester Syllabus
No ratings yet
MCA First Semester Syllabus
9 pages
BCA - Syllabi - Modified - Sem I and II 2022-2023
No ratings yet
BCA - Syllabi - Modified - Sem I and II 2022-2023
20 pages
Japanese Verb Tenses 031414
No ratings yet
Japanese Verb Tenses 031414
5 pages
Psychoanalytic Literary Theory and Criticism Presentation
No ratings yet
Psychoanalytic Literary Theory and Criticism Presentation
17 pages
Entrance Test Syllabus - MCA - 2022-23
No ratings yet
Entrance Test Syllabus - MCA - 2022-23
2 pages
Mathematics UG 2024-25 I YEAR
No ratings yet
Mathematics UG 2024-25 I YEAR
11 pages
BCA Syllabus
No ratings yet
BCA Syllabus
13 pages
Bca - Sylabus BB
No ratings yet
Bca - Sylabus BB
23 pages
2000 VISEM Activity Chain Based Modeling
No ratings yet
2000 VISEM Activity Chain Based Modeling
19 pages
BCA
No ratings yet
BCA
32 pages
Microsoft Word BCA III Sem Autonomous 480875326
No ratings yet
Microsoft Word BCA III Sem Autonomous 480875326
10 pages
BCA 3rd Sem Syllebus
50% (2)
BCA 3rd Sem Syllebus
17 pages
Chapter - 3 - Key Notes - Election and Representation
No ratings yet
Chapter - 3 - Key Notes - Election and Representation
2 pages
BCA Word
No ratings yet
BCA Word
37 pages
Optic Disc Cupping
No ratings yet
Optic Disc Cupping
18 pages
JTBS 16.11.2022
No ratings yet
JTBS 16.11.2022
11 pages
B.C.A. (Artificial Intlligence and Data Science) - NEP-Syllabus
No ratings yet
B.C.A. (Artificial Intlligence and Data Science) - NEP-Syllabus
72 pages
BCA Syllubus After BOS 2019
No ratings yet
BCA Syllubus After BOS 2019
40 pages
TOK Draft: Can New Knowledge Change Established Values or Beliefs?
No ratings yet
TOK Draft: Can New Knowledge Change Established Values or Beliefs?
6 pages
JK Tyre Industries LTD
No ratings yet
JK Tyre Industries LTD
15 pages
Truth in Love
No ratings yet
Truth in Love
2 pages
BSC Cs Hons24 25
No ratings yet
BSC Cs Hons24 25
17 pages
I. Definitions of Basic Terms
No ratings yet
I. Definitions of Basic Terms
12 pages
Airtel Information Guide
No ratings yet
Airtel Information Guide
4 pages
Cambridge International AS & A Level: Global Perspectives and Research 9239/12
No ratings yet
Cambridge International AS & A Level: Global Perspectives and Research 9239/12
25 pages
Dissertation Outline Mixed Methods
100% (2)
Dissertation Outline Mixed Methods
8 pages
Sosialisasi Literasi Keuangan Syariah Pada Anak Usia Dini
No ratings yet
Sosialisasi Literasi Keuangan Syariah Pada Anak Usia Dini
10 pages
Bca Page-Merged
No ratings yet
Bca Page-Merged
34 pages
HC Gradation 01.01.2021 New
No ratings yet
HC Gradation 01.01.2021 New
28 pages
PT.2 23-24 Setb
No ratings yet
PT.2 23-24 Setb
2 pages
Edetino Case
No ratings yet
Edetino Case
11 pages
Bca 1sem19
No ratings yet
Bca 1sem19
10 pages
Israeli Special Forces
100% (1)
Israeli Special Forces
14 pages
Solids Lesson Plan
No ratings yet
Solids Lesson Plan
5 pages
New Results Bolster Penrose's Quantum Consciousness Hypothesis
No ratings yet
New Results Bolster Penrose's Quantum Consciousness Hypothesis
7 pages
Inflation in Day To Day Life: Economics Project (2009-2010)
No ratings yet
Inflation in Day To Day Life: Economics Project (2009-2010)
49 pages
BCA 1st 2019-20 KUK
No ratings yet
BCA 1st 2019-20 KUK
11 pages
Nguyen and Peschard
No ratings yet
Nguyen and Peschard
29 pages
IIIPT Answer Template
No ratings yet
IIIPT Answer Template
9 pages
Bhabha University, Bhopal: Department of Computer Science & Application
No ratings yet
Bhabha University, Bhopal: Department of Computer Science & Application
50 pages
bca_ii_sem
No ratings yet
bca_ii_sem
7 pages
6 Authentic Leadership
No ratings yet
6 Authentic Leadership
12 pages
Agt Activity Proposal
No ratings yet
Agt Activity Proposal
6 pages
BCA Full Syllabus
No ratings yet
BCA Full Syllabus
8 pages