MAHATMA GANDHI UNIVERSITY
KOTTAYAM
BACHELOR DEGREE COURSE
IN
COMPUTER APPLICATIONS
SCHEME & SYLLABUS
(Effective from 2007 Admissions onwards)
Guidelines for the conduct of Undergraduate and Post graduate courses
in the Off-Campus Academic Centres of the School of Distance
Education, Mahatma Gandhi University, Kottayam Kerala, India.
The following guidelines are to be adopted in the conduct of Undergraduate and
Post graduate courses commencing at the Off-campus academic centres of the School of
Distance Education, Mahatma Gandhi University from 2001
1. Eligibility for Admission: All courses at the Off- Campus academic Centres of the
School of Distance Education will be governed by the rules for private registration in
force at Mahatma Gandhi University.( This is applicable to all subjects including those
for which no private registration is offered at present).Specific details may be had from
the prospectus of individual subjects.
Entrance tests will be conducted for admission to MBA/MCA courses, as per
rules in this regard.
2. Examination: all examinations under the School of Distance Education will be
conducted by the Controller of Examinations, Mahatma Gandhi University
Courses under the School of Distance Education will follow the semester pattern
but annual examination i.e. the first and second semester examination will be conducted
at the end of first year and the third and fourth semester examinations at the end of the
second year as per rules in this regard.Similarly,as in the case of the BCA/ MCA and
similar courses, the fifth and sixth semester examinations will be conducted at the end of
the third year. Examination schedules will be intimated to the Centres concerned
sufficiently in advance.
3. Attendance: 75%of the attendance prescribed by the School of Distance education is
compulsory for all courses.
4. Internal Assesment: Internal Marks will be awarded as per the Norms of Private
registration.
5. Practical Examinations Practical examination for courses requiring the same will be
conducted by officially constituted bodies as per relevant rules in this regard.
6. Optionals/Electives: The Optional/Elective papers to be followed for particular
courses will be decided upon by the SDE.(In the case of courses that have a dissertation
requirement, students will take instead an additional Elective paper prescribed by the
School of Distance Education.)
7. Minimum Marks: The Minimum marks prescribed for pass and Class as in the
regulations for the Regular courses shall be followed without any change.
8. Course Completion: Courses should be completed within the prescribed period as
mentioned in the regulations applicable to regular candidate. Those who do not complete
the Courses within the stipulated period may apply to the University for Extension of the
time to complete the course/re-admission.
9. Viva-Voce: General rules existing in the case of Regular courses will be followed in
the conduct of Viva-Voce examinations and valuation of project studies under the School
of Distance Education. The Viva –Voce will be conducted by Examiners appointed by
the University as in the case of regular candidates
10. Inter Centre Transfer: Inter Centre transfer of students may be allowed as in the
case of inter college transfers as per relevant rules in this regard.
2
SCHEME FOR BCA REVISED CURRICULUM - 2007
I Semester
Course
No.
BCA101
BCA102
BCA103
BCA104
BCA105
BCA106
Sessional
Marks
(max)
English-I
10
Sem.
Exam.
Marks
(max)
40
Mathematics
Probability& Statistics
Introduction to
Computers
Problem Solving and
Programming in C
Software Lab - I
Total
25
25
25
75
75
75
50
100
100
100
25
75
100
25
75
100
Subject
Total Marks
550
II Semester
Course
No.
BCA201
BCA202
BCA203
BCA204
BCA205
BCA206
Sess-ional
Marks
(max)
English-II
10
Sem.
Exam.
Marks
(max)
40
Discrete Mathematics
Accounting &
Business Data
Processing in Cobol
Data Structures
Fundamentals of
Digital Systems
Software Lab- II
Total
25
25
75
75
50
100
100
25
25
75
75
100
100
25
75
100
Subject
Total Marks
550
III Semester
Course
No.
BCA301
BCA302
BCA303
BCA304
BCA305
BCA306
Subject
Advanced Statistical
Methods
Microprocessors & PC
Hardware
Computer Organization
& Architecture.
System Software
Object Oriented
Programming and C++
Software Lab–III
Sess-ional
Marks
(max)
25
Sem. Exam.
Marks
(max)
75
Total Marks
25
75
100
25
75
100
25
25
75
75
100
100
25
75
100
Total
100
600
3
IV Semester
Course
No.
BCA401
BCA402
BCA403
BCA404
BCA405
BCA406
Subject
Operations Research
Data Communications
& Networking
System Analysis &
Design
Database
Management Systems
Visual Programming
Techniques
Software Lab–IV
Sessional
Marks
(max)
25
Sem. Exam.
Marks
(max)
75
Total
Marks
25
75
100
100
25
75
100
25
75
100
25
75
100
25
75
100
Total
600
V Semester
Course
No.
BCA501
BCA502
BCA503
BCA504
BCA505
BCA506
Computer Graphics
25
Sem.
Exam.
Marks
(max)
75
Operating Systems
Internet & Java
Programming
Linux OS &
Programming
Software Lab - V
Mini Project
Total
25
25
75
75
100
100
100
25
75
100
25
25
75
75
100
100
Subject
Sess-ional
Marks
(max)
Total Marks
600
VI Semester
Course
No.
BCA601
BCA602
BCA603
BCA604
BCA605
BCA606
Subject
Web Technology
Software Engineering
Client Server
Computing
Seminar
Project
Course Viva
Total
Sess-ional
Marks
(max)
25
Sem. Exam.
Marks
(max)
75
Total Marks
25
25
75
75
100
100
100
50
100
-
100
50
50
200
50
600
4
BCA 102 Mathematics
Unit-1: Matrices & Determinants: Introduction-Definition-special matrices–addition
and subtraction of matrices, multiplication of a matrix by a scalar, multiplication of
matrices, related matrices, matrix method of solution of simultaneous equations, rank of a
matrix, normal form of a matrix. Determinants –Grammar’s rule-consistency of
equations.
Unit-2: Partial Differential Equations: Introduction, formulation of PDE by
elimination of arbitrary constants and by lamination of an arbitrary function solution of
Lagrange’s partial differential equation.
Unit-3: Differential Calculus: Differentiation of hyperbolic and inverse of hyperbolic
function-differentiation of a function with respect to another function’s the nth derivative
of functions, statement (without Proof) and application of Leibnitz theorem.
Unit-4: Fourier series: Euler’s formulae, condition for a Fourier expansion functions
having points of discontinuity. Odd and even functions - definition - Expansion of odd or
even periodic functions.
Unit-5: Laplace Transforms: Definitions-transforms of elementary functions, properties
of Laplace transforms, Inverse transforms-Convolution theorem (no proof).
Text Book:
Higher Engineering Mathematics -Dr.B.S Grewal
BCA 103 Probability & Statistics
Unit-1: Statistical inquiries and sampling: Collection of Data, Primary & secondary,
questionnaire, definition of statistics, population, census and sampling different sampling
techniques, simple random sampling, stratified random sampling, systematic sampling,
cluster sampling, sampling and non sampling errors
Unit-2: Data analysis and characteristics of statistical data: Classification tabulation,
diagrams and graphs Frequency distribution one &two dimensional bar diagram, pie
diagram, line graph, histogram frequency polygon, curve, ogive, range, Q.D, M.D, Mean,
Median, Mode, Standard deviation, coefficient of variation.
Unit-3: Probability: Random experiment, Sample Space, Event, Definition of
probability: (Axiomatic, Frequency, Classical.), Conditional probability - Addition &
Multiplication rule, Bayes theorem - Independent & dependent events.
Unit-4: Correlation & Regression: Different types of correlation, Different methods of
studying correlation, Correlation coefficient, Rank correlation coefficient .Two
regression lines, Estimation of dependant variable - Difference between correlation &
regression.
5
Unit-5: Analysis of Time series: Components of time series, Different Methods of
measuring trend. Different Methods of measuring seasonal variations (simple averages,
moving averages only)
Text book:
1. Statistical method - S.P. GUPTA--13th revised edition 2001(Units 1,2,4,5)
2. An Introduction to Statistical Methods - C B GUPTA, 19th revised edition (Unit 3)
References:
1. Statistics for management Richard I. Levin & David S Rubin, 6th edition
2. Fundamental of mathematical statistics - S.C Gupta & V.K Kapoor, 8th edition
BCA 104 Introduction to Computers.
Unit-1: Parts of a Computer System: Hardware, Software, Data, Users, Different types
of computers, Computer Languages - Categories of Languages - Machine and Assembly
Language, Higher Level languages - 3GL, 4GL, 5GL
Unit-2: Interacting with Computers:-Input Devices - Key Board, Mouse, Variants of
Mouse, Hand held devices, Optical Input devices. Output Devices: Monitors, Sound
Systems, and Printers.
Unit-3: Data Processing: Representation of data, processing of data - The CPU,
Memory, Factors affecting speed, Different types of CPU used in PCs.
Unit-4: Storing Information in a Computer: Types of Storage Devices - Magnetic
Storage Devices - Disk Devices - Organization of data on a Magnetic Disk - Finding data
on a disk -Diskettes - Hard Disks- Tape drives- Optical Storage devices - Measuring
Drive Performance.
Unit-5: Operating Systems and Networking: Definition of an Operating System Different types of PC Operating Systems. Computer Networks – uses - categories of
networks - LAN, WAN, The Internet - Working of Internet - Major Features of Internet.
Security Measures: Need, Basic Security Concepts, Threats to Users, Hardware and
Data
Text Book: Peter Norton’s Introduction to Computers, Sixth Edition, Published by Tata
McGraw Hill.
BCA 105 Problem Solving and Programming in C
Unit 1: Problem Solving: Problem Definition, Problem Solving, Goals and Objectives, InputOutput-Process Sequence, Program and Program Life Cycle, Steps in Computer Programming,
6
Logic developments tools - Algorithm, Flowcharts, pseudo code, Modular programming,
structured and object oriented – top down and bottom up approaches, features of a good computer
program.
Unit 2: C language basics: C character set, Identifiers and keywords, Data types, constants,
variables, declarations, qualifiers – long, short and unsigned declarations, expressions,
symbolic constants, standard input/output functions – scanf(), printf(), compound statements,
arithmetic operators, unary operators, relational and logical operators, assignment operators,
increment and decrement operators, Precedence and order of evaluation, conditional
operators, bit operators, type casting, using library functions in math.h
Unit 3: Control flow: If statement, if….else statement, nested if ..else statement, switch
statements, looping – for loop , while loop, do … while statements, nested loop structure,
break and continue statements.
Arrays & Strings: Single dimensional arrays, multidimensional arrays, initializing array
using static declaration, Searching and sorting of Arrays, Array of Characters, String
manipulation using Library Functions in string.h and ctype.h.
Unit 4: User Defined Functions: Function declaration, definition & scope, recursion, Arrays
and functions, call by value, call by reference, Storage Classes: automatic, external (global),
static & registers.
Structures: Definition of Structures, declaration, structure passing to functions, array of
structures, structure containing arrays, unions, typedef statements.
Unit 5: Pointers: Pointer Definition, pointer arithmetic, array & pointer relationship, pointer
to array, pointer to structure, array of pointers, pointer to pointer, dynamic memory
allocation, Simple program using dynamic memory allocation.
Files & Preprocessor directives: Introduction to files, fopen(), fscanf(), fprintf(), getc(),
putc(), fclose(), Simple file handling programs. Preprocessor directives -#include,
#define, Enumeration type, Command line arguments.
Text Book:
1. E. BalaGuruswamy, “Programming in ANSI C”, TMH
References:
1. Schetler, Programming in C , Shaum’s Outline series.
2. B. Kernighan and D. Ritchie, “The ANSI C Programming Language”, PHI
BCA 106 Software Lab I
[There will be two questions: the first (30 marks) from Exercises 3 to 5 and the second
(45 marks) from Exercises 6 to 10. Exercises 1 and 2 will be included in the viva]
1. Familiarization of Computer System: Demonstration of various units of Computer system,
handling of devices, demo on hardware units, Login process, Booting Process
(2 hrs)
2. Practicing Operating System Commands: MS-DOS internal & External commands (dir,
copy, del, ren, copy con, date, time, chkdsk, mkdir, cd, rmdir, EDIT etc). MS-WINDOWS –using
start menu, desk top, task bar, word pad, note pad, file management- creation, copy, delete,
moving of files in directories, selecting and executing a program - Demonstration of editing,
compiling and executing a C program using a C compiler.
(4 hrs)
7
3. Programs using Basic Constructs: Fundamental data types, qualifiers- long, short,
unsigned, input/output functions – scanf(), printf(), Arithmetic expressions, Evaluation of
integer, real and mixed mode arithmetic expressions, truncation effect, type casting, relational
and logical expressions, Conditional operators, trigonometric functions- sin(), cos(), tan(),
mathematical functions – abs(), sqrt(), round() defined in math.h, printing formatted outputs using
width specifier.
( 8 hrs)
4. Programs using control structures: if, switch, for, while, do…while, nested structures, break
and continue. Sample programs should include printing of Fibonacci numbers, prime numbers,
check for armstrong numbers, summation series – exp(x), sin series etc and verification of result
using built in functions, printing pyramid like pattern & other similar patterns using nested loops.
(10 hrs)
5. Programs using Arrays: Array based programs – Creation of array containing prime
numbers, matrix addition, matrix multiplication, transpose of a matrix, array sorting, preparing
rank lists based on marks, searching of arrays(linear) for finding price of an item. static
initialization of arrays.
(6 hrs)
6. String manipulation programs – reading strings using %s, gets(), getchar(), copying one
string into another, counting number of characters, vowels, words etc, searching for substring,
string manipulation using functions in string.h and ctype.h.
(4 hrs)
7. User Defined Functions: Programs using return type functions, void type functions,
example program using recursive functions, array sorting program using function with call by
reference, function to copy one string into another, menu driven program using modular
approach in programming.
(6 hrs)
8. Program using structures: array of structures, dictionary search program using structure
containing arrays and array of structures.
(2 hrs)
9. Program using pointer initialization, pointer arithmetic - swap function to interchange
two locations, array manipulation using pointers- sorting list of names using pointer array,
string handling using pointers, Simple program using dynamic memory allocation. (4 hrs)
10.Program to create a data file, reading a data file , search for record(serial search) and
displaying report, simple program using command line arguments- to copy one file into
another by giving file names as arguments, sorting list of names provided at command line.
(6 hrs)
BCA 202: Discrete Mathematics
Unit-1: Preliminaries: Basic Set Theory Terminology and notation, Venn Diagrams,
Truth Tables and proof, Functions and relations, Partial Orderings and equivalence
relations, mathematical Induction, An application: Hamming codes.
Unit-2: Combinatorics: The theory of counting - The Multiplication Rule, Ordered
samples and Permutations Unordered Samples without Repetition, Permutations
Involving Indistinguishable i.e., objects; Multinomial Coefficients Unordered Samples
with Repetition, Permutation Involving indistinguishable i.e. Objects; Multinomial
coefficients and the Principle of Inclusion and Exclusion.
8
Unit-3: Logic – propositional calculus: Proposition, ,compound proposition, truth table
for basic operators , connectives, theorems from Boolean algebra, De Morgan’s laws,
conjunctive and disjunctive normal forms, rules of inference, chain rule modusponens,
chains of inference, tautology and contradiction, proof by adopting a premise, Reductioad-absurdum, proof by resolution
Unit-4:Predicate Calculus: Quantifiers, The universal quantifier, The existential
quantifier ,combination of quantifiers, semantic constraints of the calculus, negating
quantifiers, examples of quantified statements, conversion to clausal forms, resolution
principle.
Unit-5:Graphs & Algorithms: Leon hard Euler and the seven Bridges of Kongsberg,
Trees and Spanning Trees, minimal Spanning Trees, Binary Trees and tree searching and
Planer Graphs and Euler’s Theorem The Shortest-Path Problem; Dijkstra’s Algorithm
Two “All-Pairs” Algorithms ;Floyd’s Algorithm and Warshall’s Algorithm
Text books:
(1) Logic, Algebra and Databases (Chapters 1&2) Peter gray, Affiliated
East West press pvt Ltd.
(2) Introduction to Discrete Mathematics (Chapters 1, 2, 3&4) -Robert J McEliece,
Robert B Ash and Carol Ash, McGraw-Hill
BCA 203: Accounting and Business Data Processing in Cobol
Unit-1: Accounting Principles and Double entry system: Accounting concepts,
conventions, accounting cycle, Systems of accounting, Double Entry systems, Journal
and Journalizing, Various subsidiary books. Cash book- Single column, Double column,
and three columns, Ledger- Posting and balancing, Trial balance
Unit 2: Statements of final accounts: Manufacturing account, Trading account, Profit
and Loss account, Balance sheet, Bank reconciliation statements.
Unit 3: Business data processing: Introduction to Data Processing, Data, Information,
Records, Files, Master files, Transaction files, Data bases.
Introduction to COBOL: Coding format of COBOL programs-Structure of COBOL
programs- Character set, COBOL words-Data names and Identifiers-Literals-Figurative
constants. Identification Division,-Environment Division, Configuration section, Input –
Output section, Data Division, Level structures-data entries, file section-working-storage
section-editing-REDIFINES and RENAMES clauses- corresponding option, Rounded
option- ON SIZE ERROR option.
Unit 4: Procedure division: Data movement verbs-Arithmetic verbs- Compute verbSequence control verbs-Input and output verbs-Conditional verb-IF statement-Perform
statement -GOTO with DEPENDING phrase- Condition name condition clause.
9
Unit 5: Sequential files- File control entries for sequential files-fixed length recordstatement for sequential files- OPEN, READ, WRITE, REWRITE, DELETE -simple sort
verb-simple MERGE verb.
Text Book:
1. Financial Accounting: Balakrishnan Nair,
2. COBOL Programming: M.K Roy, D.G Dastidar, - Tata McGraw Hill Second
Edition.
BCA 204 Data Structures
Unit 1: Concept of Structured data: Different types of data structures, Complexity of
algorithms, Arrays – Bubble sort, linear search, binary search, sparse matrix.
Unit 2: Stacks and Queues: organization and operation on stacks – Conversion between
infix, suffix & prefix representations, Expression Evaluation. Organization and
operations on queues, multi stacks and queue, dequeue.
Unit 3: Linked list: Concept of dynamic data structures, linked list using pointers,
insertion and deletion – examples, circular list – two way lists, garbage collection.
Unit 4: Trees: Concept of recursion, definition of trees and binary trees, threaded binary
tree, traversing methods - examples.
Unit 5: File organization :Operation on sequential and random files, linked organization,
inverted files, cellular partitioning, hashing.
Text Books:
1.
Fundamentals of Data Structures, Ellis Horowitz and Sartaj Sajni
Galgotia Publications
2.
Data Structures using C and C++ , A M. Tenanbaum
PHI. Publications
BCA 205: Fundamentals of Digital Systems
Unit 1: Number Systems : Base of a number system, Positional number system,
Popular number systems (Decimal, Binary, Octal and Hexadecimal), Counting in binary
number system, Conversion – Decimal to binary, binary to decimal, decimal to octal,
octal to decimal and binary, decimal to hexadecimal, hexadecimal to decimal, binary and
octal, Concept of binary addition and subtraction, Complements in binary number
systems, 1s complement, 2s complement and their applications, Number representation
in memory – bistable devices, signed magnitude form, representation of real numbers,
BCD numbers – concept and addition.
10
Unit 2: Boolean Algebra and Gate Networks : Logic gates – AND, OR, NOT, NAND
and NOR – Truth tables and graphical representation, Basic laws of Boolean algebra,
Simplification of expressions, De Morgan’s theorem, Dual expressions, Canonical forms,
Min terms and Max terms, SOP and POS expressions, Simplification of expressions
using K-MAP (up to four variables), Representation of simplified expressions using
NAND / NOR gates, Don’t care conditions, XOR and its application.
Unit 3: Sequential and Combinational Logic: Flip Flops – latch, clocked, RS, JK, T, D
and master slave, Triggering of flip flops, Counters – synchronous and asynchronous,
BCD, ripple counters, half adder, full adder (need and circuit diagram), Encoders,
Decoders, Multiplexers and Demultiplexers (working of each with diagrams), Concept of
registers, Shift registers – different types, PAL’s and PLA’s.
Unit 4: The Memory Element: Flip Flops as building blocks of memory, RAM,
Organization of RAM, MAR, MDR, word length (e.g. 64 K 8 bit system), SRAM and
DRAM, Read only memory – ROM, PROM, EROM, EEPROM, Organization and logic
diagram.
Unit 5: Introduction to Data Communication: Need for data transfer, Concept of
parity in data transfer, Error detection and correction, Forward error correction, Hamming
codes, Analog to digital and digital to analog converters (diagram and working principle),
Modems.
Text Book:
Digital Logic and Computer Design - Morris M Mano, Prentice Hall Publications.
References: (1) Digital Computer Fundamental.
by Thomas C Bartee, Tata McGraw Hill Publication
(2) Digital Electronics by Floyd
(3) Digital Principles and Applications by Malvino and Leach
BCA 206 Software Lab - II
(There will be two questions; the first (35 marks) from I(4) and second (40 marks) from
II. The other portions will be included in the viva.)
I . Business Data Processing Using COBOL (only business problems may be assigned)
(2 hours per week)
1. Programs using ADD, SUBTRACT, MULTIPLY, DIVIDE, COMPUTE VERBS
2. Programs using IF, IF.. ELSE, GO TO statements
3. Programs using PERFORM statements.
4. Programs using sequential file processing –only Accounting problems are to be given
as listed below.
i)
To create a sequential file to store journal entries. The structure of the file
may be Date, Account Name to be debited, Account Name to be credited,
Amount.
11
ii)
iii)
iv)
v)
Using the journal file created above, display total debit amount, total
credit amount, Debit balance or credit balance for a particular account
name entered through the keyboard. (Balance is the Difference of debit
total and credit total – Debit balance when debit total exceeds credit total,
Credit balance otherwise)
Preparing a sequential file containing Salary statement using an input file
containing employee pay details.
To Display the summary of total deposits and total withdrawals in a day
using a bank transaction file containing date, Account no, Type of
transaction (D-deposit, W-withdrawal) and Amount.
Preparing Electricity Bill using a sequential file containing Consumer No,
Name, Previous Reading and Current Reading. An appropriate tariff
structure may be assumed.
II. Data Structures using C. (4 hours per week)
1. Array search – linear and binary search
2. Stack implementation, Application of stacks – Conversion of infix expression to
postfix, expression evaluation.
3. Queue implementation, Implementation of circular queue.
4. Linked list implementation, concatenation, circular list implementation, polynomial
addition, implementation of stacks and queue using linked lists.
5. Tree implementations – binary tree, traversing methods – inorder, postorder and
preorder.
6. Files: - Creation of sequential file, Random access files.
BCA 301 Advanced Statistical Methods
Unit 1: Random variables: Expectation of a random variable & function of a random
variable, M.G.F, properties - discrete and continuous probability density functions and
distribution functions
Unit 2: Probability distributions: Binomial, Poisson, Normal Distributions Limiting
form of Binomial & Poisson Fitting Binomial & Poisson only
Unit 3: Theory of Estimation: Point estimation, Characteristics of good estimators,
Interval estimation, confidence interval of mean, variance & proportion.
Unit 4: Testing of Hypothesis: Statistical Hypothesis, simple & composite hypothesis,
power of a test, Testing Hypothesis, one sample test, two sample test.(large samples)
[testing mean, proportion]
Unit 5: Tests based on 2 ,F, t :Small sample test, (one sample , two sample test,
paired observations) 2 as a test of independence and as a test of goodness of fit. Testing
population variance and equality of variance
12
Text Book:
Statistics for Management - Richard I Levin & David S. Rubin
Reference
1. Fundamentals of Mathematical Statistics, S.C Gupta & V.K Kapoor 8th edition
BCA 302 Microprocessors and PC Hardware
Unit 1: Introduction to the concept of microprocessors, Organization of a
microprocessor based system. Architecture of 8085.Pin diagram of 8085,Registers in
8085,Introduction to 8085 instruction set, Discussion of fetch, decode, execute operation,
machine cycle, timing diagram.
Unit 2: Classification of instructions: - Data transfer, Arithmetic, Logical, Branch,
Machine control instructions, Stack operation, Addressing modes of 8085,Instruction
formats:- 1 byte ,2 byte,3 byte instructions, Example programs.
Unit 3: Mother board: System Components, Introduction to Microprocessors from 1971
to present, Mother board Form factors -Baby AT, ATX, Components Of Mother Board:Chipset Introduction ,Super I/O Chip, ROM BIOS(Award and Phoenix) System Buses: Processor Bus ,Memory Bus, I/O Bus(ISA,PCI local bus, AGP,USB).Mother Board
Selection Criteria.
Unit 4: Storage Devices: Hard disk drive, Definitions, Hard disk drive Operation, Disk
formatting, Basic hard disk drive components-Hard disk features, hard disk drive
installation procedure ,brief study, FAT Disk, VFAT and log file names ,FAT32 ,NTFS.
Unit 5: Types of memory:- ROM, DRAM, Cache memory-SRAM,RAM Types-FPM
DRAM, EDO RAM, SD RAM, DDR SDRAM, DDR@ SDRAM, RD RAM,,VRAM,
WRAM, SG RAM, MD RAM, Physical Memory, Memory modules-: SIMMs, DIMMs,
RIMMs, Brief study of conventional base memory, Upper memory area, high memory
area, extended memory, expanded memory.
Text Books:
1. RS Goankar, Microprocessor Architecture, Programming and Applications with 8085
Wiley Eastern Edition
2. Scott Muller with Creigzacker, "Upgrading and Repairing PCs"
Reference:
Stephen J Bigelow, Troubleshooting maintaining and repairing PCs
BCA 303 Computer Organization and Architecture
Unit 1: Functional units of a computer, basic operational concepts, bus structure.
Addressing methods: Memory locations and addresses, instructions and instruction
sequencing, instruction execution.
13
Unit 2: Central processing Unit: General Register Organization, stack organization,
instruction formats, instruction classifications, addressing modes.
Unit 3: Main memory : Organization of RAM and ROM, Auxiliary memory, cache
memory, Virtual memory, memory mapping techniques.
Unit 4: Parallel computer structures: Introduction to parallel processing, pipeline
computers, array processors, multi processing systems, architectural classification
scheme: SISD, SIMD, MISD, MIMD.
Unit 5: Pipelining and vector processing. Introduction to pipelining, instruction and
arithmetic pipelines (design), vector processing.
Text book :
Computer Systems Architecture , M.M Mano (PHI)
References :
Computer Organization – Hamachar et al (McGrawHill)
BCA 304 - Systems Software
Unit 1: Language processing concepts: Introduction, Language Processing activities,
Fundamentals of Language Processing, Fundamentals of Language specification.
Unit 2: Scanning-Finite state automata, Regular expressions, Building DFAs, ParsingParse trees and abstract syntax trees, Top Down Parsing, Predictions and backtracking,
Top Down Parsing Without Back tracking, Practical Top Down Parsing, Bottom Up
Parsing, Operator Precedence Grammars and Operator Precedence Parsing.
Unit 3: Assemblers: Elements of Assembly Language programming, A simple
Assembly Scheme, Pass structure of Assemblers, Design of a two pass assembler.
Unit 4: Compilers: Aspects of compilation, memory Allocation, Compilation of
expressions, Compilation of Control Structures.
Unit 5: Macros: Macro Definition and call, Macro Expansion, Nested Macro Calls,
Advanced Macro Facilities. Linkers - Relocation and linking concepts self-relocating
programs, linking for overlays. Loaders: Linking and Loading in MS. DOS
Text book:
Systems programming and Operating Systems by D.M. Dhamdhere, Second
Revised Edition, published by Tata McGraw - Hill
Reference: Principles of Compiler Design by Aho and Ullman
14
BCA 305 Object Oriented Programming and C++
Unit 1: Introduction-Objects-Objects Oriented-object oriented development-Object
oriented Methodology-Object oriented Models, Object oriented themes-Modeling
Unit 2: Object Modeling-Objects and classes-Links and association-Advanced Links
and association concepts-Generalization and Inheritance-Grouping constructs-Dynamic
modeling-Functional modeling
Unit 3: Object Oriented language C++: Structure of C++ Program-Basic and user
defined data types-Functions in C++-The main function, function prototyping-call by
reference-return by reference-function overloading- friend and virtual functions, classes
and objects-specifying a class-Defining member functions-Nesting of member functionsPrivate member functions-arrays within a class-static data members-static member
functions-Arrays of objects-objects as function arguments
Unit 4: Constructors and Destructors-Copy constructor-Dynamic constructorDestructors-operator overloading.
Inheritance-Defining derived classes-Single, Multiple, Multilevel, Hierarchical and
hybrid inheritance-virtual base classes-Abstract classes
Unit 5: Pointers-Virtual functions and polymorphism-Pointers to objects-this pointerpointers to derived classes-virtual functions-C++ streams-Stream classes-Unformatted
and Formatted console I/O operations- Managing output with manipulators.
Text books:
1. Object Oriented Modeling and Design
By James Rumbaugh, Michael Blaha, William Premerlani, Frederick Eddy
2. Object oriented Programming By Balaguruswamy
BCA 306 Software Lab III
[There will be two questions one (30 marks) from 1 to 4 and second (45 marks) from 5
to 8]
1. Programs based on class, objects and manipulation of objects using member
functions
2. Programs based on friend functions, passing objects as arguments to function.
3. Programs based on array of objects.
4. Programs based on function overloading, Default arguments.
5. Programs based on operator overloading (binary, unary) using member functions
and friend functions.
6. Programs based on constructors, different types of constructors- copy constructor,
default constructor.
7. Programs based on Inheritance, different types of inheritance.
8. Programs using virtual functions and polymorphism
15
BCA 401 Operations Research
Unit 1: Basics of O.R The nature and uses of OR –Main concepts and approaches of
OR-models in OR-Advantages of a model phases of OR
Unit-2: Linear programming problems; Mathematical formulation of a L.P.P General
linear programming problems, solution of a L.P.P, graphical method for solving a L.P.P
Unit-3: Simplex Method: slack and surplus variables- reduction of any feasible solution
to a basic feasible solution. Unbounded solution-optimality conditions- artificial variable
Techniques-Big M method Two phase simplex method.
Unit-4: Transportation problems: transportation model- solution by simplex methodnorth west corner lowest cost entry Vogel’s and MODI method-Degeneracy Assignment
problems.
.
Unit-5: Game Theory-Two persons zero sum games-pure and mixed strategy with
saddle point-solution of pure strategy games-solution of mixed strategy problems by
arithmetic method-principle of dominance.
Text Book:
Operations Research, Prem Kumar Gupta & D.S Hira
References:
Operations Research by Kanti Swaroop
BCA 402 Data Communication and Networks
Unit 1:
Data Communication concepts – data, signal, channel, bandwidth, bit rate and baud
rate, simplex and duplex communication – protocols and standards. Network models –
OSI model – layers and their functions in OSI model – TCP/IP Protocol suite – network
classification: LAN, MAN, WAN, wireless network & Internet – narrow band and
broadband ISDN, asynchronous transfer modes
Transmission impairments: attenuation, distortion, noise
Unit 2: Multiplexing: FDM, TDM, spread spectrum - Circuit-switched networks –
datagram networks – virtual circuit networks. Data transfer networks – dial-up modems –
digital subscriber line. Physical layer and media – analog and digital data & signals –
throughput. Guided media and unguided media (wireless)
Unit 3: Data Link Layer: Error detection and correction – block codes, cyclic codes –
framing – flow & error control – sliding window protocol – PPP - ALOHA, CSMA,
CSMA/CD – channelization methods.
Wired LANs – IEEE standards – Ethernet standards - Wireless LANs - Connecting
devices: hubs, switches, repeaters, bridges, routers – gateway.
Cellular telephony and satellite networks – frame relay
16
Unit 4: Network Layer: Host to Host delivery - logical addressing – Internet protocol:
IPV4 and IPV6 – address mapping – ICMP – IGMP - Unicasting, multicasting and
broadcasting
Unit 5: Transport Layer: UDP – TCP- congestion control: open and closed loop - Quality
of service. Application Layer: Name space – domain name system – resolution - Remote
logging – Electronic mail – File transfer – WWW and HTTP.
Multimedia Communication: Audio and Video compression, real time interactive
audio/video – Voice over IP
Text Book:
“Data Communications and Networking” (4th Edition) by Behrouz A. Ferouzan,
TMH
References:
1. “Computer Networks” by A.S. Tanenbaum, Pearson Education
2. “Data and Computer Communications” by William Stallings, Pearson Education
BCA 403 System Analysis and Design
Unit 1: Overview of System analysis and Design: Business system concepts, project
selection, sources of project requests, preliminary investigation, System development life
cycle - Feasibility analysis, design, implementation, testing and evaluation, project
review.
Unit 2: Feasibility study - technical and economical feasibility, cost and benefit
analysis, fact-finding techniques, DFD, Data dictionaries, Decision analysis, decision
trees and tables.
Unit 3: System design -Design objectives, Process and stages of system design, Design
methodologies, structured design, structured walkthrough, audit considerations, audit
trials, detailed design, modularization, module specification, software design and
documentation tools, top down and bottom up approaches
Unit 4: Testing & System Conversion: Unit and integration testing, testing practices
and plans, system control and quality assurance, training, conversion, operation plans,
system administration.
Unit 5: Hardware and Software selection: Benchmarking, Financial considerations in
selection software selection, vendor selection, performance and acceptance criteria.
Text book:
Award, EM, “Systems Analysis and Design”, Galgotia Publications, 1991
References:
1. Lesson, “System analysis and Design“ SRA publications, 1985
2. Rajaraman V, “Analysis and Design of Information systems “
17
Prentice Hall of India Pvt. Ltd, 1991
BCA 404 Data Base Management System
Unit 1: Introduction: Characteristics of database approach, Data base users, Advantages of
using DBMS, Data models, Schemas and Instances, DBMS architecture and data
independence, DBMS languages and Interfaces. Data base system Environment,
Classification of data base management systems.
E-R Modeling: Entity types, entity set, attribute and key, relationships, relation types, roles
and structural constraints, weak entities, Sample E-R Diagrams.
Unit 2: File Organization: Files of unordered records, Files of ordered records, Hashing
Techniques- Internal hashing, external hashing; Index Structure for files – Single level and
multilevel indexes.
Relational Data Model: Relational model concepts, relational constraints and schemas,
relational algebra, Relational data base design using ER-to-Relational Mapping.
Unit 3: SQL: Data definition commands - CREATE, ALTER, DROP , Adding
Constraints, Basic SQL queries – INSERT, SELECT, DELETE, UPDATE, ordering of
rows using ORDER BY option, Set operations using UNION, EXCEPT, INTERSECT,
Substring Comparison using LIKE operator, BETWEEN operator, Complex Queries –
Nested Queries, EXISTS and UNIQUE functions, NULL values, Renaming of attributes and
Joining of tables, Aggregate functions and grouping, Managing views.
Unit 4: Data Normalization: Informal Design Guidelines for Relation Schemas, Functional
dependencies, Normal forms –first, second and third normal form. Boyce-Codd normal form,
Multivalued dependencies and fourth normal form, Join dependencies and fifth normal form.
Unit 5: Transaction Processing: Introduction to transaction processing, Transactions and
system concepts, Desirable properties of transactions.
Concurrency Control: locking techniques for concurrency control.
Database Security and Authorization: Types of Security, Data base security and the DBA,
Access Protection, User Accounts and Database Audits, Access Control Based on
Granting/Revoking of Privileges.
Text book:
R. Elmarsi and SB Navathe, “Fundamentals of Database Systems”, Addison Wesley,
4th Ed., 2004
References:
1. C.J Date , An Introduction to Data base systems.
2. Reghu Ramakrishnan, Database Management Systems, McGraw Hill International Edition.
3. Bipin Desai, “An Introduction to Database Systems”, Galgotia Publications, 1991.
18
BCA 405 Visual Programming Techniques
Unit 1 Visual Basic–Basic Concepts: Getting Started with Visual Basic 6,
Understanding Visual Basic Projects, Designing the user interface, Putting your Forms to
Work with controls, Mastering Menus and Toolbars.
Unit 2 Programming in Visual Basic : Visual Basic Code Basics, Using Visual Basic
Variables, Using the Visual Basic Debugging Tools, Handling Runtime Errors.
Unit 3 Objects and classes :Creating Objects and Classes, Advanced Class Concepts,
Working with objects and collections.
Unit 4 Working with other Applications & Database Access: Integrating with MSoffice package, Mastering the Visual Basic Data Control, Creating Queries in Visual
Basic, Mastering Jet DAO.
Unit 5 Advanced Data Access Methods & Report generation :Using Advanced Data
Access Methods – ADO, OLEDB; Using Crystal Reports, Using the Package and
Deployment Wizard.
Text Book:
Peter Norton’s Guide to Visual Basic 6 by Peter Norton and Michael Groh, Techmedia
Publications -Chapters: 1, 2, 5, 6, 7, 3, 4, 8, 9, 10, 11, 12, 16, 17, 18, 19, 14, 20, 27
References:
1. Visual Basic 6 from the Ground Up by Gary Cornell, Tata McGraw-Hill
2. Using Visual Basic 6 by Bob Roselman, Richard Peasley and Wayne Prunchiah, PHI
BCA 406 Software Lab IV
[There will be two questions, the first one (25 marks) from Group I and second (50
marks) from Group II]
I
SQL Commands: (2 hours per week)
1. Data definition commands - CREATE, ALTER, DROP, Adding Constraints –
Primary key, foreign key, unique key, check, not null.
2. Basic SQL queries – INSERT, SELECT, DELETE, UPDATE, Using multiple
tables, ordering of rows using ORDER BY option, Set operations using UNION,
EXCEPT, INTERSECT, Substring Comparison using LIKE operator, BETWEEN
operator.
3. Complex Queries – Nested Queries, EXISTS and UNIQUE/DISTICNT functions,
NULL values, Renaming of attributes and Joining of tables, Aggregate functions and
grouping.
19
4. Managing views, Simple stored procedures.
5. Data Control commands - Access Control and Privilege commands.
.
II Visual Basic (4 hours per week)
6. Designing User Interface using- List Box, Combo Box, Image and Picture Box,
Directory-File-Drive list boxes, Rich text box, etc
7. Creating Menus- Creating Menus and writing Codes, Linking Menus with SDI
forms, Creating toolbox and access it for loading and working forms.
8. Database Connectivity using Controls - Designing user interface with forms
and controls and create database connectivity by DAO and ADO Control.
9. Database connectivity using Object models - Creating Database connectivity
by DAO Object model and Connectivity Using ADO Object model by OLE
DB as well as ADODC Connectivity.
10. Creating Reports - Create reports using Data Report in VB and also using
Crystal report.
11. Package and deployment Wizard - Package, Deploy and Scripting
BCA 501 Computer Graphics
Unit 1:Practical applications of Computer graphics: Display devices, CRT, Raster
Scan Display, Random Scan Display, DVST, Flat panel, LCD, Raster Scan systems,
Random Scan systems. Input devices, Hard copy devices, Graphics software.
Unit 2: Points and lines : Line drawing algorithms, Simple DDA, Bresenham’s . Circle
generation, Mid point circle algorithm, Character generation, Line attributes, Area fill
attributes, Character attributes, Bundled attributes, Inquiry functions.
Unit 3: 2D Transformations: Translation, Rotation, Scaling, Reflection, Shear- Matrix
representation and homogenous coordinates, Composite transformation, Raster methods
for transformations - 2D Viewing, Viewing pipeline, Concept of window and view port,
Window to view port transformation. Clipping operations-point clipping, line clippingCohen Sutherland line clipping, Basic concepts of Polygon clipping, Curve clipping, Text
clipping.
Unit 4: Structure concepts: Editing structures, Graphical User interface and interactive
input methods, the user dialogue, Input of graphical data, Input functions, Interactive
picture construction techniques.
20
Unit 5: Three-dimensional display methods: three-dimensional Graphics packages,
Polygon surfaces-polygon tables, polygon meshes. Sweep representations, Constructive
solid geometry methods, Octrees and Quad trees.
Textbook:
Hearn D & Baker M.P, “Computer Graphics”, PHI Pvt. Ltd
References
1.
Newman W.M & R.F. Sproul, “ Principles of Interactive Computer
Graphics”,Mc-Graw Hill Book Company.
2.
Plastock R & Xiang Z, “ Theory and Problems of Computer Graphics”, Schaum
Seies, McGraw-Hill Book Company.
BCA 502 Operating Systems
Unit 1: Introduction: OS Functions, Computer System Organization, Computer System
Architecture, Operating System Structure, Operating System Operations, Operating
System Services, User Operating System Interface, System Calls, Types of System Calls.
Unit 2: Process: Basic Concepts, Process Scheduling, Operations on ‘Processes, Inter
process communication, Process Scheduling - Scheduling Criteria, Scheduling
Algorithms, Multiple Processor Scheduling.
Unit 3: Process Coordination : Synchronization - The Critical Section problem,
Synchronization Hardware, Semaphores, Classic Problems of Synchronization, Monitors.
Dead Locks : System Model, Dead Lock Characterization, Methods of Handling Dead
Locks, Dead Lock Prevention, Dead Lock Avoidance, Dead Lock Detection, Recovery
from Dead Lock.
Unit 4: Memory Management: Memory Management Strategies -Swapping,
Contiguous memory allocation, Paging, Segmentation. Virtual Memory Management Demand paging, Copy - on - Write, Page Replacement
Unit 5: Storage Management :-File System :- File Concept, Access Methods, Directory
Structure, protection , Implementing File Systems :-File System Structure, Directory
Implementation, Allocation Methods, Free Space Management, Efficiency and
Performance, Recovery.
Text book :
Operating System Principles, Seventh Edition, Abraham Silberschatz, Peter Galvin and
Greg Gagne, John Wiley
BCA 503 Internet & Java programming
Unit 1: Internet –getting connected to the internet-internet services-clients-servers-client
server architecture-browsers-TCP/IP- addressing scheme-URL-domain name extension
21
types - Study of HTML Tags- formatting tags-Table tags-Form tags-Frame tags Creation and launching of web sites.
Unit 2: Object oriented programming-Encapsulation-Inheritance-Polymorphism-Genesis
of Java-characteristics of java-program structure-identifiers-operators-variables-literalsdata types-Arrays. Control Statements-selection statements-iterative statements-jump
statements - Loops- while loop-do while loop- for loop
Unit 3: Classes-declaration –object references-instantiation- method declaration-method
calling – this operator- constructor-method overloading-constructor overloading-method
overriding-inheritance-super class-dynamic method dispatch-final-static-abstract classes
– Strings.
Unit 4: Packages - creating packages-using packages-Interfaces-Exception Handling
Techniques-try-catch-throw-throws clauses-Multithreading-creation of multithreaded
program-Thread class-Runnable interface- thread priorities
Unit 5: Applets-applet tag-applet life cycle-simple graphics using applets-simple AWT
controls- Event Handling Techniques-Events-Listeners-Event Methods-Simple Swing
controls-Simple study of IO streams.
Text Book:
1. Java 2 ‘The Complete Reference’ – Mr. Patrick Naughton
References:
1. Programming with java – Mr.E. Balagurusamy
2. Internet ‘The Complete Reference’
BCA 504 Linux OS and Programming
Unit 1: Linux introduction and file system - Basic Features, Advantages, Installing
requirement, Basic Architecture of Unix/Linux system, Kernel, Shell - Linux File system
- Boot block, Super block, Inode table, Data blocks, Linux standard directories.
Commands for files and directories – cd, ls, cp, rm, mkdir, rmdir, pwd, file, more, less,
Creating and viewing files using cat, file comparisons, View files, disk related
commands, checking disk free spaces. Partitioning the Hard disk drive for Linux,
Installing the Linux system, System startup and shut-down process
Unit 2: Essential Linux commands, Understanding shells, Processes in Linux, process
fundamentals, connecting processes with pipes, redirecting input/output, Background
processing, managing multiple processes, changing process priority, scheduling of
processes. Batch commands, kill, ps, who, sleep. Printing commands, find, sort, touch,
file, file processing commands - wc, cut, paste etc - mathematical commands - expr,
factor etc. Creating and editing files with vi & joe editors
Unit 3: System administration - Common administrative tasks, identifying
administrative files – configuration and log files, Role of system administrator, Managing
user accounts-adding & deleting users, changing permissions and ownerships, Creating
22
and managing groups, modifying group attributes, Temporary disabling of user’s
accounts, creating and mounting file system, checking and monitoring system
performance - file security & Permissions, becoming super user using su. Getting system
information with uname, host name, disk partitions & sizes, users, kernel - Backup and
restore files, reconfiguration of hardware with kudzu, installing and removing packages
with rpm command
Unit 4: Shell programming - Basic of shell programming, various types of shell
available in Linux, comparisons between various shells, shell programming in bash
Conditional and looping statements, case statement, parameter passing and arguments,
Shell variables, system shell variables, shell keywords, Creating Shell programs for
automating system tasks
Unit 5: Simple filter commands – pr, head, tail, cut, paste, sort, uniq, tr - Filter using
regular expressions – grep, egrep, and sed. Configuring X-windows desktop - Redhat
configuration - Xfree86, understanding XF86config file, starting & using X desktop.
KDE & GNOME graphical interfaces, changing X settings
Text books:
1. “Red Hat Linux Bible” by Cristopher Negus, Wiley Dreamtech India
2. “UNIX Shell Programming” by Yeswant Kanethkar, BPB
References :
1. “Official Red Hat Linux User’s guide” by Redhat, Wiley Dreamtech India
2. “UNIX for programmers and users” by Graham Glass & King Ables, Pearson
Education
3. “Beginning Linux Programming” by Neil Mathew & Richard Stones, Wiley
Dreamtech India
BCA 505 Software Lab V
(Java Programming in LINUX environment)
[There will be two questions, first (30 marks) from Part I and second (45 marks) from
Part II]
Part I
1. HTML Programs (Formatting tags, table tag, form tags, frame tags)
2. Applet Programs (graphics, awt, swing)
Part 1I
3. Programs using Arrays
4. Programs using Method overloading
5. Programs using Method Overriding
6. Programs using Constructor Overloading
7. Programs using Inheritance
8. Programs using Packages
23
9. Programs using Abstract Classes
10. Programs using Interfaces
(Inputs should be given using command line arguments or IO streams)
BCA 506 Mini Project
Mini project shall be a small, yet complete project in Database design/ creation &
access/ management etc so as make the student confident in designing using techniques
learnt in System Analysis & Design course and developing projects using VB and SQL
Server/ ORACLE. A neat report on the work has to be prepared in standard format and
submitted.
BCA 601 Web Technology
Unit 1 Introduction : World Wide Web fundamentals, History of the Web and internet,
URL, Dedicated Connections, Accessing Internet, Cyberspace, Web Browser, Web
Servers, Web server hardware, Setting up a web server - Hardware requirements, Web
server softwares, Web hosting.
Unit 2 DHTML- Dynamic HTML, Document Object Model, Features of DHTML,
CSSP (Cascading Style Sheet Positioning) and JSSS (JavaScript assisted Style Sheet),
Layers of Netscape, The ID Attribute, DHTML Events.
Unit 3 XML -Introduction to DHTML, Using XML, XML tags, XML scripting, XML
Document type description, XML and Dot net technologies, XML in other Web
applications. WAP and XML
Unit 4 Java Script - Objects, Methods, Events and Functions, Tags, Operators, Data
Types, Literals and Type Casting in JavaScript, Programming Construct, Array and
Dialog Boxes, Relating JavaScript to DHTML, Dynamically Changing Text, Style,
Content.
Unit 5 Electronic Commerce: E-Commerce environment, Modes of electronic
commerce, Electronic Data Interchange, Migration to open EDI, Secure Electronic
transactions, Electronic cash and payment schemes-Internet monetary and payment
schemes, Payment and purchase order process, on line electronic cash.
Text Books :
1. HTML, Java Script, DHTML, PERL, CGI – Evan Bayross - BPB
3. Teach Yourself XML in 21 days by Simon North Hermans(SAMS)
2. Web Commerce Technology Handbook by Daniel Minoli, Emma Minoli
References:
Internet ‘The Complete Reference’
24
BCA 602 Software Engineering
Unit 1: Software and software engineering : Phases in software development, software
development process models, role of management in software development, role of
matrices and measurement - Role of software requirements specification, problem
analysis, requirement specification, validation, matrices, monitoring and control.
Unit 2: Planning a software project: Cost estimation, project scheduling, staffing and
personnel planning, Team structure, software configuration management, quality
assurance plans, project monitoring plans, risk management.
Unit 3: System design objectives: Abstraction, OO Analysis and OO Design – classes
and objects, relationships among objects, Inheritance and polymorphism, Design
concepts. Design methodology – Dynamic modeling, Functional modeling, defining
internal classes and operations, matrices.
Unit 4: Detailed design - PDL, Logic /Algorithm design, state modeling of classes,
verification, matrices, Coding – programming practice, Top-Down and Bottom –up –
structured programming – information hiding – Programming style – internal
documentation. Verification – code reading – static analysis – symbolic execution – code
inspections or reviews. Metrics – size measures – complexity metrics – style metrics
Unit 5: Testing- testing fundamentals, functional testing, structural testing, testing
process, comparison of different verification and validation techniques, metricsreliability estimation, monitoring and control.
Text book:
Jalote P, An Integrated Approach to Software Engineering, Narosa Publ.House, 1991.
References
1. Pressman R S, Software Engineering, A Reactioner’s approach, 2nd Ed. McGraw
Hill, 1987.
2. Fairly R, Software Engineering Concepts, McGraw Hill, 1985
3. Charette R N, Software Engineering environment: Concepts and Technology,
McGraw Hill, 1987.
BCA 603 Client Server Computing
Unit 1: Introduction: Client-Server computing Vs Heterogeneous computing, cross
plant form computing, distributed computing. The costs of client-server computing Advantages and disadvantages of client-server databases.
Unit 2: Design: Fundamentals of client-server design managing the interaction in client
and server, communications techniques protocols and client-server interaction protocols Preparing applications for client-server - Optimizing applications for client-server,
25
Examples client-server implementations. Request acceptance dispatching, Execution of
request, Client-server interaction using messages.
Unit 3: Multitasking: Multiprogramming Vs Multitasking, multiprocessing, advantages
and drawbacks of multiple process, child and parent process, developing server
applications, threads, server communication model.
Unit 4: Synchronization: scheduling implementations, processing queues, pre-emptive
systems, critical section, mutual exclusion, semaphores.
Unit 5: Communications: Network communication, inter-process communication,
building portable client server applications.
Text Book:
Novell’s guide to Client Server Application and Architecture- Jeffrey D. Schank- Novell
Press.
References
Client-Server computing – Dawna Travis Dewier- Tata McGraw Hill
BCA 604 Seminar
The student shall choose a modern topic of current day interest in the areas of
Computer Science / Information Technology and present a seminar using appropriate
presentation media such as LCD projector, OHP etc. A seminar report in bound form in
the pattern of a complete technical report (with contents page, well structured
presentation, references etc.) shall be submitted.
BCA 605 Project
The project topic shall be chosen from areas of current day interest using latest
packages/ languages running on appropriate platforms, so that the student can be trained
to meet the requirements of the Industry. A bonafied project report shall be submitted in
hard bound complete in all aspects. For internal evaluation, the progress of the student
shall be systematically assessed through two or three stages of evaluation at periodic
intervals.
BCA 606 Course Viva
In Course Viva, the student is to be assessed on the basis of his knowledge in all
the subjects taught in the curriculum as well as topics of current day interest in the
pertinent areas.
26