DHARMSINH DESAI UNIVERSITY, NADIAD

FACULTY OF INFORMATION SCIENCE

BCA-101 -Communicative English I WEF - 2008

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Tw Total
4 - - 60 40 - 100

Looking at the diverse backgrounds & abilities of the thresh hold students, this syllabus aims at
(1) Importing the basic communication competency of the learners.
(2) Familiarize them with the basic contents necessary for English communication during their studies.
(3) Facilitate them in LSRW skills. &
(4) Enable them to use English language for communicational needs.
So the syllabus is need base & it has a tentativeness, to facilitate the various learners of various competencies:

(I) Introduction to Basics of Communication.

(II) What is Communication? Its various definitions.
(III) The salient features / Characteristics of the communication.
(IV) Barriers to effective communication.
(V) Improving LSRW: Introduction.
(VI) The Basic Vocabulary
(a) How to improve vocabulary?
(b) Prefixes / Suffixes (MFU).
(c) Synonyms/ Antonyms.
(d) One word substitution.
(e) Spellings.
(VII) Developing Fluency & Pronunciation.

Text : / Source :
The major source of studies for the students is the classroom, Which will be very interactive & full of
activities related to their syllabus. They must participate actively in their classes. The faculty will be a guide,
helper, motivator & facilitator for the learners, but not the traditional teacher. So the learners evaluation will
be based on the class work only. The tests & exams will be based entirely on the class work & the
participation of the learners in the classroom activities.
--- Prof. Rajanikant Jain.
Co - ordinator English Communication.
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-106-Programming in C W.e.f.: - July 2006

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 4 60 40 25 25 150

Unit-1 Introduction to C [6 Hrs.]

- Introduction to C , History of C ,Features of C , Program characteristics,
- Basic structure of C program
- Character set, C tokens, Keywords and identifiers
- Constants, Variables, Data types, Symbolic constants
- Operators and Expressions, Implicit and explicit type casting
- Operators precedence and associatively

Unit-2 I/O operators , Control statements, array and string handling [10 Hrs.]
- I/0 operation
- Formatted input and output
- Control statements
- Decision-making and branching statements
if statement and various types of if statements,
switch-case statements
- Decision making and looping
while statement,
do while statement
for statement
- Jump in loops break and continue statement
-Arrays
Introduction to array
One-dimensional arrays, two-dimensional arrays
- String handling and in-built string functions

unit 3 User-defined functions and storage class [5 Hrs.]

User-defined functions
- Introduction
- Need for user-defined functions
- The form of C functions
- Return values and their types
- Calling functions
- Category of function
- Nesting of functions
- Recursion
- Call by value and call by reference
- Function with array
Storage classes (Storage, default value, scope, life)
- Static storage class, automatic storage class,
- Extern storage class, register storage class
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

Unit-4 Structures and Unions [4 Hrs.]

Structure definition
Comparison of structure variables
Arrays of structures
Arrays within structures
Nested structures
Structures and functions
Unions
Bit fields

Unit 5 Pointers [8 Hrs.]

Introduction
Understanding pointers
Pointer expressions
Pointer increments and scale factor
Pointers and arrays
Pointers and character strings
Pointer and functions
Pointers and structures
Void pointers

Unit 6 file management in C and the preprocessor

File management [4 Hrs.]
Introductions
Why we need file
Defining and opening a file
Closing a file
Input/Outut operations on files
Error handling during i/o operations
Random access to files
Command line arguments
The preprocessor [3 Hrs.]
Introduction
Categories of preprocessor
Macro substitution
File inclusions
Compiler control directives
#progma and #error directives
stringizing and token-pasting operator

Text Book:
1. Programming in ANSI C, Balagurusamy, Tata McGraw-Hill
Reference Books:
1. Let us C, Kanitkar, BPB.
2. Programming with C, Gottfried, McGraw-Hill International
3. Programming with C , Venugopal & Prasad , Tata McGraw-Hill
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-103-Advanced Mathematics I

Teaching scheme Exam. Scheme (Marks)

L Tu Th Ss Tw Total
5 - 60 40 25 125

Detailed Syllabus: -

(1) Equations and Inequalities :

a) Linear equation
b) Methods to solve Linear equation
c) Quadratic equations
d) Methods to solve Quadratic equations
(2) Determinants :
a) Basic definitions
b) Properties of determinants
c) Creamers Rule
(3) Matrices :
a) Definitions
b) Algebra of Matrices
c) (Addition, Subtraction and Multiplication)
d) Computation of inverse(By Matrix Method)
e) Solution of simultaneous equation in two or three unknown by Matrix Method
f) Row and Column Transformation
g) Computation of Inverse by Gauss elimination Method
h) Solution of simultaneous equation in two or three unknown by Elementary Transformation
Method
i) Rank of Matrix
(4) Co-ordinate Geometry :
a) Introduction
b) Line Quadrants and co-ordinates
c) Distance formula between two points
d) Midpoint formula
e) Section formula
f) Area of a triangle
g) Colinerarity of three points
h) Equations of a Straight Line
i) General Equation of a straight line
j) Angle between two straight line
(5) Set Theory :
a) Introduction
b) Representation
c) Operations
d) Properties on operations
e) Venn diagrams
f) Cartesian Product

(6) Functions
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

a) Definition, Domain and RangeLinear, Quadratic, Polynomial, Rational, Constant, Identity,

Periodic, Power, monotonic, Even & odd , Modulus, Reciprocal Functions
b) Representation of functions
c) Graph of functions
d) One- one functions and its Graph
e) Invertiable function and its Graph
f) Exponential function and its Graph
g) Logarithmic function and its Graph
h) Trigonometric function and its Graph

Reference Books: -
1) Elementary Engineering Mathematics - B. S. Grewal
2) Co-ordinate Geometry - Shantinarayan
3) Mathematics (G. S.) - 11th & 12th Science
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-301-Digital Computer Organization WEF July 2006

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Th Ss Tw Total
4 - 60 40 25 125

1. Representation of Information
- Number systems: binary, octal, hexadecimal 1
- Positive and negative number, integers and reals, 1
- Characters and codes ASCII, EBCDIC 1
- Redundant coding for error detection and correction. 1

2. Basic Logic Design

- Truth tables, Boolean algebra 2
- Combination circuit design with AND, OR 2
- NOT, NAND NOR gates 2
- Multiplexers 2
- Decoder and encoder 2
- Full adder and full sub tractor 2
- Look ahead carry generator with binary adder 2
- Flip-flops : R-S F/F, J-K F/F, 2
- Toggle F/F, D F/F, Master-Slave F/F 2
- Shift registars 2
- counters 3
- Simple arithmetic and logic circuits. 1

3. Memory Devices
- Random access 1
- Serial accesses 1
- Directs access memories and their specifications. 1

4. CPU Architecture
- Instruction format 1
- Addressing modes-direct, indirect, immediate, relative, indexed
- Addressing formats: Zero, single, double, register etc.
- Instruction set selection 1
- Software hardware tradeoffs
- Instruction execution
- Fetch and execution cycles
- Microprogramming concept 1
- Speed mismatch between CPU and memory and methods of alleviating it.

5. I/O Architecture
- Properties of simple I/O devices and their controllers 1
- Transfer of information between I/O devices
- CPU and memory 1
- Program controlled and interrupt controlled information transfer
- Alleviating speed mismatch between I/O units and memory
- DMA control 1
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

- I/O channels
- Peripheral processors.

6. Case Study of a Micro-Processor

- Study of 8086 Micro-Processor :
o Register Structure 1
o Buses 1
o Instruction Set, 1
Text Book:
Digital Logic and Computer Design
-M. Morris Mano(PHI)
Reference Book:
Computer System Architecture
- M. Morris Mano (PHI)
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA 105-PC Software

Teaching scheme (Hr./W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 4 60 40 25 25 150

Detailed Syllabus: -

a) DOS, Windows: 95/98. Operating Systems. [4 Hr.]

DOS: Internal & External commands, file name, wildcard characters, autoexec.bat & Config.sys,
hidden system files. Command like DIR, MKDIR, CHDIR, COPY, TYPE, DELETE, RENAME,
PRINT, FORMAT, SYS, LABEL, CHKDSK, SCANDISK, ATTRIB, PATH, PROMPT, DATE,
TIME, BACKUP, RESTORE etc.
WINDOWS: 95/98 [5 Hr.]
Concepts of window, icon, menu, picture etc.
Desktop: my computer, network neighborhood, recycle bin, etc; start menu, windows explorer; long &
short file names; creating folder; finding files & folders; copying & moving files, deleting files;
creating shortcuts; adding & deleting from start menu; adding & removing hardware; scanning disk;
defragmentation, security features; installing other software etc.
b) Word Processing Package (MS-Word) [11Hr.]
Create, edit, store, print high quality documents, navigating documents, spell checking cut & paste;
find & replace; word-wrap; alignment; formatting the document; inserting tables; pictures; different
font styles; macros etc.
c) Presentation Package (MS- Power Point) [6Hr.]
Creating /Editing slides; using text, drawings, tables, pictures, charts and other objects in slide;
animator & slide transition, Effects: creating and running slide show; macros, templates; interface with
other package.
d) Spreadsheet Package (MS-Excel)[14Hr.]
Concept of worksheet, navigating worksheet, entering & editing data into cells, formulas & operators,
range of cells, moving copying transposing data, absolute and relative cell references, spell
checking, insert/delete/hide/show rows/columns, change column width/row right, formatting data,
protecting & hiding data, sorting data, searching & replacing data, built-in functions, look up tables,
data organization- analysis, manipulation, queries, what-if analysis, import-export of data, multiple
worksheets & operations on them, charts, pictures, file operations, printing worksheets, macros,
templates, interface with other software packages.

Text Book: PC SOFTWARE For Windows 98 Made Simple by- R.K.TAXALI

(Tata Mc-Graw Hill Publication)

Reference Books:
1. DOS 6.2 : By Robert M.Thomas ( BPB Publication)
2. Mastering Windows-95 by Cowart ( BPB Publication)
3. Mastering Microsoft Office 97 by Lonnie E. Moseley , David Boody ( BPB Publication)
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-206-Data Structure W. e. f. December 2006

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 4 60 40 25 25 150

Unit-1 Linear Data Structures and Their Sequential Storage Representation

Why we study data structure? [2 Hrs.]
- Primitive Data Structures
1. Operations on Data Structure
2. Integers, Real Number, Character Information, logical Information, pointer Information.
- Nonprimitive data Structure
1. Array [2 Hrs.]
(a) Definition of array
(b) Calculate address of elements of the array
(c) Row major order and column major order
(d) Application of array
2. Stacks [5 Hrs.]
(a) Definition of Stack
(b) Operations on Stack
Ex. Push, PoP, Emptystack, Underflow, Overflow.
(c) Implementation of stack
i. Using static allocation ( array & record representation )
ii. Using linked list ( by using pointer data type )
(d) Application of Stack
i. Conversion from infix expression to postfix expression
ii. Evaluation of the given postfix expression by using stack
(Assuming single operand) (e.g 421*+# --- Equivalent infix is 4+2*1)
e) Advantages and Disadvantages of using stack.
3. Queue [6 Hrs.]
a) Definition of Queue
b) Operations like insert, remove, empty, underflow , overflow of Queue.
c) Implementation of linear queue by:
i. Using array representation (static allocation)
ii. Using linked- list representation ( by using pointer data type)
d) Circular Queue & Priority Queue
i. Definition, operations
ii. Implementation by array representation.
e) Advantages and Disadvantages of using different types of queue.

Unit 2 Linear Data Structures and their Linked Storage Representation.

1) Linked List [8 Hrs.]
(a) Definitions. Advantages over sequential allocation list
(b) Operations on linked list
i. Insert new element in front.
ii. Insert new element in last
iii. Insert new element in sorted list
iv. Insert new element after the given location
v. Delete from front
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

vi. Delete from a particular node form list.

(c) Implementation of singly list by using pointer Data type (dynamic
allocation)
(d) Implementation of Circular Singly Linked List with header node by
using pointer Data type.
(e) Implementation of Doubly Linked list by using pointer Data type.
(f) Advantages and Disadvantages of using different types of lists.

Unit 3 Non-linear Data Structures

1) Binary Tree : [6 Hrs.]
(a) Definition (Tree, Binary Tree , Binary Search Tree, Complete Binary Tree, Edge , Path )
(b) Operations
i) Insert new item into Binary Search Tree.
ii) Delete given item from binary search tree.
iii)Inorder, Preorder, Postorder Traversals
2) Graphs : [4 Hrs.]
(a) Definitions (Graph, loop, cycle, acyclic graph, directed graph, forest, path, mixed graph )
(b) Operations on graph
i) Insert new node into graph
ii) Insert new edge into graph.
iii) Graph Traversals - BFS, DFS Traversals
Unit 4 Sorting and Searching Methods
1) Sorting Methods [5 Hrs.]
(a) Exchange Sort
i) Bubble Sort
ii) Quick Sort (partition Exchange sort)
(b) Selection Sort
i) Straight selection sort
ii) Heap Sort
(c) Insertion Sort
i) Simple insertion Sort
ii) Binary insertion sort
iii)Address calculation sort
(d) Merge Sort
(e) Radix Sort.
(f) Comparison of all the sorting techniques.
2) Searching Methods [2 Hrs.]
Sequential Search, Binary Search

Text Book: 1) Data Structure using C

By Aaron M. Tenenbaum, Yedidyah Langsam
and Moshe J. Augenstein.
Reference Book: 2) An Introduction to Data structures with applications
By Jean-Paul Tremblay and Paul Sorenson.
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-202-Advanced Mathematics II

Teaching scheme Exam. Scheme (Marks)

L Tu Th Ss Tw Total
5 - 60 40 25 125

Elements of Differential Calculus

Real numbers and functions
Limits and Continuity of functions
( Trigonometric functions are ommited for limit and continuity)
a) Methods to find the limit of a function
b) Limits of some standard functions
Differentitation
a) Derivative of a function
b) Derivatives of Trigonometirc function
c) Derivatives of some standard function
d) ( Exponential , logarithmic, Polynomial , etc)
e) Derivatives of composite function
f) Differentiation of Implicit function
g) Differentiation of Parametric functions
h) Logarithmic differentitaion
i) Higher order derivatives till order II
Application of Derivatives :
** Arithmetic Aplications.
a) Use of Derivative in Rectilinear motion
b) Use of Derivative as Rate Measurer.
c) Use of Derivative in Approximation
** Geometrical Applications of the derivatives
a) Tangent, Normal, Subtangent, Subnormal
b) Length of Tangent, Subtangent, Normal, Subnormal
c) Maxima and Minima of a function
Integral Calculus :
a) Concept of Integration
b) Indefinite integration
c) Methods of integration
d) ( Subtitution, by parts, Partial fractions)
( Inverse Trignometric functions are ommited)
e) Integral of Type sinmx cosnx
f) Definite integrals
g) Rules of Definite integration
n/2 n/2
n
h) Reduction formula sin (x) dx, cosn(x) dx
0 0
Application of Integration
a) Area and Volume under a curve
Differential Equations
b) Idea of differential and differential euqations
c) Degree and order of differential equation
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

d) Formation of a differential equation

e) Solution of a differential euqation
f) ( General and perticular solution )
g) Differential equations of the first order and first degree
h) Equations where variables are seperable and its solution.
i) Exact differential equation and its solution
j) Linear differen equation and its solution.

Reference Books :
1) Differential Calculus - Shantinarayan
2) Integral Calculus - Shantinarayan
3) Mathematics (G. S.B.) - 11th and 12th science Book.
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-203-Introduction to Internet & HTML Scripting

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 2 60 40 25 25 150

Detailed Syllabus: -

a) Internet Concepts: [22 hr.]

a) Brief history of Internet.
b) Internet:
(i) Basic concept of network, terminologies related to Internet, Interconnection of various networks,
various devices used to form Internet, Methods of connecting to Internet.
(ii) Protocols, Packet switching, Domain names, IP address, URL.
c) Various Services available on Internet-
World Wide Web, e-mail, FTP, Telnet, Chat, Instant Messaging.
b) Static Web Page Development- [18hr.]
a) Tools available for Static Web Page Development
b) Use of tools for Web Page Development
c) HTML Scripting
Hypertext
HTML Document Structure and elements-
HTML tags and attributes for-
(i)Formatting the web page
(ii)Various types of lists.
(iii) Tables
(iv) Forms
(v) Frames
Logical Styles, Physical Styles, Inserting Special Characters, Adding Images, Sound and
animation.
Linking -Various web pages, within the same page.
HTML editors.

Text Book:
1) HTML 4.0 (No Experience Required),By-E.Stephen Mack, Janan Platt.
(BPB Publication)
Reference Books:
1) Internet an introduction, Compiled by Tata McGraw-Hill.
(Cistems, Tata McGraw-Hill publication)

2) The Internet,By Douglas E.Comer

(Prentice Hall of India publication)
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-204-Business Data Processing

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 4 60 40 25 25 150

Detailed Syllabus: -

1.Introduction: Data processing, data and information, data structure, database, data processing cycle,
Methods of data processing, application, system development, MIS, advantages and disadvantages of
EDP. (4 hrs)
2. Electronics Data Processing System: Hard ware and software part of computer system, computer
architecture, Online processing, Time sharing system, Real time system, Batch system,
Multiprogramming, Multiprocessing, SPOOLING, Distributed data processing.
(8 hrs)
3. Evolutions of data processing system: Generation of computers (first second, third and fourth),
Types of computers. Analog and digital computer, main frame computer and mini computer.
(3 hrs)
4.File organisation: Types of files (master, transaction, audit, backup, work), file processing
activities, file design factors, sequential access method, random access method, Index sequential
access method, merits and demerits of file organisation, database management system components of
DBMS,ADBMS. (5 hrs)
5.Introduction to access: datatypes, designing of tables, primary key, various field properties,
working with database, entering, editing, updating data, datasheet view and design view of table,
working with columns, find tool, filtering of data, advanced filter. (5 hrs)
6.Query: Dynaset, Design grid, operators and expressions, expression builder, various functions of
access. (4 hrs)
7. Forms: form wizard, designing, controls used in form, components of form. (2 hrs)
8. Reports: Components of report, ideal report, types of report, designing of report (tabular and
columnar), mailing label. (2 hrs)
9 Relationship: Normalization, Entity, Entity set, Entity schema, binary and ternary relationship, one
to one, one to many, many to one, many to many relationship, master table and transaction table. Join
property. (3 hrs)
10. Advanced Query: select, action, parameter, crosstab, summary query. (3 hrs)
11.Other features: Macro, page, utilities for managing access database, indexing and its advantages.
(3 hrs)

Text Book:
1) Teach yourself Access. : Sieglel, BPB
2) Introduction to Computer Data Processing and System Analysis: V K Kapoor
(Sultan Chand and Sons)
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-205-Communicative English II WEF - 2008

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Tw Total
4 - - 60 40 - 100

Looking at the diverse backgrounds & abilities of the thresh hold students, this syllabus aims at
1. Importing the basic communication competency of the learners.
2. Familiarize them with the basic contents necessary for English communication during their studies.
3. Facilitate them in LSRW skills. &
4. Enable them to use English language for communicational needs.
So the syllabus is need base & it has a tentativeness, to facilitate the various learners of various competencies:

I) Oral Communication
II) Comprehension
III) Compositions & Paragraph writing.
IV) Letter writing
(a) Personal & Social letters
(b) Business letters.
(c) Applications.
V) Developing dialogues
VI) Group Discussion.
VII) Self Presentation.

Text : / Source :
The major source of studies for the students is the classroom, Which will be very interactive & full of
activities related to their syllabus. They must participate actively in their classes. The faculty will be a guide,
helper, motivator & facilitator for the learners, but not the traditional teacher. So the learners evaluation will
be based on the class work only. The tests & exams will be based entirely on the class work & the
participation of the learners in the classroom activities.
--- Prof. Rajanikant Jain.
Co - ordinator English Communication.
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-307 System & Information Concepts in Organizations

W.E.F. July 2007

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Th Ss Tw Total
4 - 60 40 25 125

Organisation Structure and Theory

Basic Model of Organisation Structure (02)
Modification to the basic model of Organisation structure
Organisational Behavior (01)
Organisation as a system

Information and System Concepts

Information Concepts (01)
Information Quality
Classification of Information (01)
Value and Dimension of Information (01)
Human differences in Information Processing
System Concepts (01)
Type of System (02)
Elements of System

Management Information System

Concept and Importance of MIS (01)
Definition
Role of MIS (01)
Impact of MIS
Information Technology and MIS (01)
Nature and scope of MIS (01)
MIS Characteristics and Function (02)
Structure and Classification of MIS
MIS and User

Development of MIS
Development of long range plans of the MIS (02)
Ascertaining the class of information
Determining the information requirement
Development and implementation of the MIS (02)
Management of quality in the MIS
Organisation for development of the MIS
MIS: The Factors of Success and Failure (01)

Concepts of Strategy And Planning

The Concept of Corporate Planning (02)
Essentiality of Strategic Planning
Planning Terminology: Mission, Objective, Strategy, Policies (01)
Types of Strategies (02)
Short-Range Planning
Tools of Planning (01)

Decision Support Systems and Managerial Decision Making - Concepts

 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

Decision Support Systems (DSS): Concepts and Philosophy (02)

DSS: Deterministic Systems
Example of DSS
Executives Information System (02)
Concepts of Expert Systems
Tools for developing DSS (02)
Characteristics of an EIS (01)

Information system applications- Case Study

Production management (02)
Material management (03)
Sales and Marketing Management (02)
-----
(40)

Textbook: Management Information System: Managerial Perspectives

By D.P. Goyal

Management Information System: A Managerial Perspective

By Uma G. Gupta

Reference Book: Management Information System

By Jawadekar
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-308-Financial Accounting & Management WEF July 2006

Teaching scheme Exam. Scheme (Marks)

L Tu Th Ss Tw Total
4 - 60 40 25 125

(1) Financial Accounting Concepts of Accounting principles and convictions, accounting equation,
accounting definition, accounting mechanism, preparation of Journal Entries, Ledger, trial balance and
Final Accounts (excluding company). Format of Final Accounts of Company Accounts,
Manufacturing Accounts.
(2) Management Accounting Ratio analysis (Ratio based on P&L A/C and Balance sheet), estimation of
working capital, simple presentation of Funds flow analysis. Ratio analysis only following ratios are to
be worked out Current ratio, Liquid ratio, all turnover ratio, Debt-equity ratio, profitability ratio,
Average collection period and Average Payment period, criticisms of ratio are not expected.
(3) Budgetary Control Operational Budget fixed and flexible purchase sales, production, expenses,
and cash budget. Preparation of Flexible budget.
Procedure of Budget Budget Committee, Budget manual, Zero base budget etc.
(4) Capital Budget Method of Evaluation of Capital Budget like Accounting Rate of Return, Payback,
Net present value, Profitability index, Internal rate of return, some simple aspects of project finance.
Risk analysis is not expected.
(5) Cost accounting Concepts of elements of cost product cost sheet, Marginal Costing (problem on
BEP, Margin of Safety etc), decision making based on Marginal costing not expected.
Standard Costing Material Lab. and overhead practical problem of level C (i.e. Cost, Price, Usage,
Rate, Efficiency, Volume etc).
General knowledge of Costing Methods and techniques.
(6) Finance Management. Meaning of Finance Management and roll of Finance Manager.
Level Exposure to the topics and working knowledge of practical problems required so students
can design system when they have to work in practical field.

Reference Book:
(1) Financial Accounting - Advanced Accounting
By R. L. Gupta (Sultanchand & Co.)
(2) Financial Accounting Advanced Accounting
By M. C. Shukla & T. S. Grewal (S. Chand & Co.)
(3) Cost Accounting. - By B. K. Bhar (Academic Publisher.)
(3) Management Accounting. By Ravi M. Kishor (Taxman Publisher).
(4) Cost Accounting. By Ravi M. Kishor (Taxman Publisher).
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-303-Mathematical Foundation of Computer Science I

Teaching scheme Exam. Scheme (Marks)

L Tu Th Ss Tw Total
4 - 60 40 25 125

(Discrete Mathematics)
Detailed Syllabus: -
1. Sets And Propositions (5 hrs)
* Mathematical Logic
Statements and Notation
Connectives: Negation, conjunction, Disjunction, Statement Formulas and Truth Tables.
* Basic Concepts of Set Theory :
Notation, Inclusion and Equality of sets, Power Set
* Operations and Properties on operations.
* Venn Diagrams
* Ordered Pairs and n tuples
* Cartesian products of two and three sets
2. Relations And Functions (8 hrs)
* Relations
Properties of Binary Relations in a set
Relation matrix and the graph of a relation
Partition and Covering of a set
Equivalence Relations
Compatibility relations
Composition of Binary Relations.
Partial Ordering
Partially ordered set
* Functions
Definition and Introduction
Composition of Functions
Inverse functions
Binary and n-ary- operations
Characteristic function of a set
Hashing functions
Natural numbers
Peano Axioms and Mathematical Induction
3. Permutations & Combinations (5 hrs)
Basic Definitions & Examples
Restricted Permutation
4. Lattices & Boolean Algebras (8 hrs)
Lattices as Partially ordered sets
Properties of Lattices
Lattices as algebraic systems
Sub lattices, Direct Product and Homomorphism
Some special Lattices
Boolean Algebra
Subboolean Algebra, Direct Product and Homomorphism
Boolean Functions
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

5. Algebraic Structures (8 hrs)

* Algebraic Systems : Examples and General Properties Lattices as Partially ordered sets
Definitions and Examples
Some simple algebraic systems and General Properties
* Semigroups and Monoids
Definitions and Examples
Homomorphism of Semigroups and Monoids
Subsemigroups and Submonoids
* Groups
Definitions and Examples
Order of a group and order of an element , Cyclic group
Permutation groups and properties
Subgroups and Homomorphism
Cosets, Normal Subgroups, Kernal of a group
* Rings : - Definitions and Examples

6. Graph Theory (6 hrs)

Basic concepts of Graph Theory
Basic Definitions
Paths, Reachability and Connectedness
Matrix Representation of Graphs
* Trees: Trees and some examples
Representation and operation of trees.

Books :

1. Elements Of Discrete Mathematics

-C.L.Liu. Second Edition.
2. Discrete Mathematical Structure With Applications To Computer Science.
-J.P.Tremblay & R. Manohar
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

W.E.F.: 2008
BCA-304-Personality Development

Teaching scheme Exam. Scheme (Marks)

L Tu Th Ss TW Total
2 - 60 40 - 100

Total: 20 Hrs
1. Introduction to Personality Development:
a) The basic traits of a developed personality
b) The Pleasing Personality
2. Health, Hygiene & High Spirit :
a) Physical fitness
b) Positive thinking
3. Proper use of Language:
a) The Communication Skills
b) The effective Speech
4. Goal Setting.
a) How to set goal?
b) Advantages of setting a goal
5. Leader ship & Team Spirit:
a) Effective Leadership qualities
b) How to mobilize the team
6. Effective self-presentation & facing interview.
a) The interview process & preparing for it
b) The presentation skills

Scheme: Each topic will be covered in TWO sessions / Lectures, so 12 topics in 24 sessions.
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-305-Object Oriented Methods & Programming

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 4 60 40 25 25 150

Object Oriented Programming concepts [10%] (4 hrs)

Functions [10%] (4 hrs)
Arrays, Operator over loading, Type Conversions, [20%] (8 hrs)
Inheritance, Polymorphism, Pointers, I/O Operators [30%] (12 hrs)
Virtual functions, Friend Functions [10%] (4 hrs)
Files and streams [10%] (4 hrs)
Library Functions [10%] (4 hrs)

Text Book : Turbo C++

-Robert Lafore
Reference Book : Object Oriented Programming in C++
-E. Balaguruswami
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA - 306 Yoga

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
1 - 1 50 - 50 - 100

Part 1 Training in Yogic Asanas, Pranayams and Mudras:

1. Kapalbhati, Anulom Vilom Pranayam, Omkar Pranayam, Shavasan, Suryanamskar, Body Rotations.

2. Asanas for Meditation.

Padmasan, Swastikasan, Sidhdhasan, Bhadrasan, Vajrasan, Sukhasan, Savasan

3. Asanas to be performed in standing position

Triconasan, Pervatasan, Utlatukasan, Hastapadasan.

4. Asanas to be performed while lying in supine position.

Servangasan, Halasan, Savasan, Kosthavishramasan, Matshendrasan, Suptavajrasan.

5. Asanas to be performed lying in prone position.

Uttanapadasan, Uttanadhadasan, Sarpasan, Bhujasan, Salabhasan, Dhanurasan, Makarasan.

6. Asanas to be performed in sitting position.

Pavanmuktasan, Hastapadasan, Vajrasan, Ardhamatshyendrasan, Shishuasan, Saptamudrasan,
Gomukhasan.

7. Yoga Mudras (seven Types)

8. Pranayams (seven Types)

Part 2 Rajyoga Meditation Theory and Practice:

1. The True Concept of Yoga

2. Science of Consciousness & Dynamics of Mind
3. Concept of God & True Secularism
4. Principles of Spiritual Science
5. Practical Meditation

Part 3 Moral, Ethical and Spiritual dimensions in development of inner personality:

1. Holistic Health
2. Stress Management and Relaxation Techniques
3. Addiction, Cure and Remedies to get rid of them
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-401-Data Communication & Network

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Th Ss Tw Total
4 - 60 40 25 125

INTRODUCTION: -
1). Communication, Block diagram of communication system, Types of communication, Telecommunication,
Use of communication (TB1)
2). Communication channels, Wavepropogation modes, TE, TM, TEM mode Frequency, Wavelength,
Electromagnetic waves, serial and parallel data transmission, Wireless communication, types of noise,
Wireless communication, Fiberoptics, coaxial cable, channel capacity, Frequency spectrum, Facsimile. (TB1)
3). Design issues of Modulation, Amplitude modulation, Frequency modulation, Phase modulation, Base band
system, Total power, carrier power, Digital communication, ASK, FSK, PSK, Line codes, Synchronous and
Asynchronous modulation, Demodulation, Phase Locked Loop. (TB1)
4). Multiplexing, SDM, FDM, TDM, Combined Multiplexing, TDM designing with counter, decoder and
switches. (TB1)
5). RS 232C standard, Voltage loop, positive and negative logic, Data bits, Slew rate, baud value, RS232
errors, Different lines of RS232 and functions, RS232 applications. (TB1)
6). Network, protocol, Buffers, Design issues of network.(TB1)
7). Use of computer network, open loop and closed loop network, Network topology, Mesh, Star, Ring, Tree,
Bus, Tree topology, LAN, MAN, WAN. (TB1)
8). OSI model, Introduction to each layers of OSI model. (TB1)
9). Physical layer, Transmission media, Geostationary satellites, circuit switching and packet switching, N-
ISDN, N-ISDN channels, N-ISDN interface, Functioning of each parts of ISDN, ISDN services, Broad band
ISDN, B-ISDN and ATM reference model. (TB2).
10). Design issues of Data Link Layer, Elementary data link protocols, UTOPIA protocol, Stop and Wait
protocol. (TB2).
11). The Medium Access Sub Layer, The channel allocation problem, ALOHA and CSMA protocols, IEEE
Standard 802.3(Ethernet), 802.4(Token Bus), 802.5 (Token Ring), Comparison of 802.3, 802.4 and 802.5.
(TB2)
12). The Network Layer, Network layer design issues, The Optimality principle, Shortest path routing, How
Network Differ, The IP protocol, IP address. (TB2).
13). The Transport Layer, The Transport Service, Elements of Transport Protocol. (TB2)
14). The Application Layer, Network Security, DNS Domain Name System. (TB2).

TEXTBOOKS: - 1) Data Communication By W.L, Scweber.

2) Computer Networks By A.S.Tanenbaum. (Third Edition)

REFERENCE BOOK: - 1) Data Communication and Networking By Behrouz Forouzan.

 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

W.E.F.: - Dec-2002
BCA-402-Visual Programming

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 4 60 40 25 25 150

I Introduction to Visual Basic. (6)

a. V.B. Building block.

Forms, Controls, Property
b. V.B. Defaults controls
Control for making Choice
Special purpose control

II Programming with V.B. (13)

a. Responding to users with event procedure.

Introducing Events
Handling Events
b. Giving more controls to users.
Creating Menu, Pop-Up Menu
Toolbars
c. Using dialog boxes to get information.
Message Box, Input Box, Common dialog Control
d. Using variables to store information
e. V.B. Programming Fundamentals.
Assignment Statement, Math Operation
Working with String, Formatting Results
f. Controlling the flow of programme code.
Control Statement, Working with Loops, Debugging program
g. Managing Project: Sub procedures, Function and Multiple forms.

III Visual basic Programme components & Interfaces. (8)

a. Microsoft common Controls.

ImageList , TabStrip, StatusBar, ProgressBar, TreeView, ListView,.etc.
b. Working with control Arrays.
c. Multiple document Interface-Application.
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

IV Visual basic and Databases. (12)

a. Database basics

b. Data control & data bound controls

Understanding data control
Creating simple application
Binding with the controls
c. Using Data Access Object(DAO).
Introduction to DAO
Opening an existing data base
Types of record set
Positioning the record pointer
Navigating records
d. Using Remote Data Object(RDO).
Introduction to RDO
Remote data objects
e. Creating Reports

V. Introduction to ActiveX Controls. (1)

Text Book : Using Visual Basic 6 (PHI)

(Special Edition)
By- Brian Siler and Jeff Spotts

Reference Book: Visual Basic 6 - By Paul Sheriff (PHI)

Mastering VB 6 (BPB)
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-403-Mathematical Foundation of Computer Science II

Teaching scheme : Examination Scheme

L Tu Th Ss Tw Total
4 - 60 40 25 125

(Linear Algebra & Numerical Methods)

* Linear Algebra *
1. Vector Space (6 hrs)
Definitions and Examples
Vector Subspaces
Algebra of Subspaces
Linear Combination of Vectors, Linear span
Linear sum of two subspaces
Linear dependence and Linear independence of vectors
Basis of a vector space
Finite dimensional vector spaces
Dimension of a vector space
Dimension of a subspace
Homomorphism of vector spaces
Isomorphism of vector spaces
Direct sum of spaces

2. Linear Transformation (6 hrs)

Linear Transformations
Linear operator
Range and null space of a linear transformation
Rank and nullity of a linear transformation
Linear transformations as vectors
Product of linear transformations
Algebra of linear transformations
Invertible linear transformations
Singular and Non singular transformations

3.Matrices (6 hrs)
Basic Definitions
Algebra of Matrices (Addition, Subtraction, Multiplication)
Computation of Inverse ( By Matrix method)
Row and Column Transformation (Elementary Transformation)
Computation of Inverse (By Elementary Transformation)
Rank of Matrix
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

4. Numerical Methods (10 hrs)

* Solution of transcendental equations
Bisection Method
Method of False-Position ( Regula Falsi Method)
Newton-Raphson Methods
* Solution of Linear simultaneous equations
Gauss Elimination Method
Gauss Jordan methods
Jacobis iteration method
Gauss-Seidal iterative methods.

5. Interpolation (10 hrs)

Polynomial interpolation
Finite differences & difference tables
Gauss's forward and backward interpolation formula
Newton's Forward and Backward Interpolation Formula
Stirling, Bessels and Lagranges formula
Divided Differences and Newtons Divided Difference formula.

6. Numerical Integration (2 hrs)

Trapezoidal rule
Simpson's 1/3 Rule.
Simpson's 3/8 Rule.

Text Books:
1) Linear Algebra by J.N. Sharma & A. R. Vasishtha , Krishna Prakasan
2) Higher Engineering Mathematics By B. S. Grewal.

Ref. Book: Numerical Methods By S. S. Sastry

 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-404-Database Management System

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 2 60 40 25 25 150

Overview of Database System [3 hrs]

Introduction, Data, Database, Entities and relationships, properties, data and Data model, DBA, data
independence.
Database system Architecture [2 hrs]
DBMS, DC Manager, utilities.
Introduction to Relational Database [2 hrs]
Relations, Optimisation, Catalog.
SQL : DDL, DML, TCL [9 hrs]
Domains, Relations and Base Relvars [3 hrs]
Introduction, Domains, Attributes, Cardinality, Degree, Properties of relations.
Relational Algebra [3 hrs]
Overview, Relational expressions, Operators: Restrict, Project, Product, Union, Intersect, Divide,
Difference, Join.
Semijoin, Semiminus, Extend, Summarize, Grouping and ungrouping.
Relational Calculus [2 hrs]
Tuple calculus, domain calculus.
Integrity [2 hrs]
Keys: Candidate key, Foreign key, Primary key, Alternate key, Domain constraints, Base table
Constraints, General Constraints, Referential Action: Cascade, Restrict.
Views [2 hrs]
Introduction, Logical data independence, View Retrievals, View Updates.
Functional Dependencies [2 hrs]
Trivial and nontrivial dependencies, Closure of a set of Dependencies, Closure of a set of attributes,
Irreducible set of dependencies.
Normalization [3 hrs]
Introduction, Nonloss decomposition, 1NF, 2NF, 3NF, Dependency preservation.
Denormalization.
Semantic Modeling [3 hrs]
Introduction, E/R Model, E/R Diagram.
Recovery [2 hrs]
Introduction, Transactions, Transaction Recovery, System Recovery, Media Recovery, Two Phase
Commit.
Concurrency [2 hrs]
Introduction, Three concurrency problems, Locking, Deadlock, Serializability, Intent locking.
Security [2 hrs]
Introduction, Discretionary Access Control, Mandatory Access Control, Data Encryption.

Text Book:
Database Management System
By: C. J. Date (Seventh Edition)
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

W.E.F.: July - 2002

BCA-405-Java Programming

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Pr Tw Total
4 - 4 60 40 25 25 150

Syllabus of Java Programming Course

(Total 40 hours)

1. Introduction to Java [6 hrs.]

Features of Java, JDK tools, Application and applet,
Difference between with C and C++, Anatomy of Application and Applet,
Anatomy and structure of Java Program, Applet Life Cycle
2. Java Program Building elements [7 hrs.]
Variables, Scope of variables, blocks, statements,
Data Types, operators, expressions.
Programming style, Control Structure,
Oops, Object, class and instance variables, methods, scope modifiers
Abstract class, interfaces, and packages
3. Arrays and String, Utility classes Vector, BitSet, Stack, Dictionary, HashTable [3 hrs.]

4. GUI (awt package, Font, Color, Image, Button, Label, TextField, TextArea, [10 hrs.]
Choice, List, Scrollbar, Checkbox, CheckboxGroup, Dialog, Menus, Windows)
Layouts, awt package GUI Components
5. Event -Driven programming [4 hrs.]
Applet Programming and GUI and Event-Delegation Model, all Listeners and Event Objects
6. Exception Handling [2 hrs.]
Exception types, How to use try, catch, throw, throws and finally clauses, Nested try, multiple catch,
Javas built-in Exceptions
7. Multithreading [3 hrs.]
Java thread model, Creating threads, Thread priorities, Interthread communication, Synchronization,
Blocking thread
8. Streams and IO [5 hrs.]
The Stream classes,
Byte Streams
InputStream, OutputStream, FileInputStream, FileOutputStream, ByteArrayInputStream,
ByteArrayOutputStream, BufferedByteStreams, RandomAccessFile
Character Streams
Reader, Writer, FileReader, FileWriter, CharArrayReader, CharArrayWriter, BufferedReader,
BufferedWriter,

Text Book: Java Primer - By E. Balaguruswamy (TMH).

Reference Books: 1) Introduction to Java Programming
- By Daniel Liang. (PHI)
2) Java in a Nutshell - (Orelly)
3) The Complete Reference JAVA 2.0
By Patrick Naughton , Herbert Schildt ( TMH)
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

W.e.f.: - July-2002
BCA-501 Internet Technologies & Programming

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Tw Pr Total
4 - 4 60 40 25 25 150

[TCP/IP] [40%]

1. Open system, N/W architecture, Layers, Internet Standards, Protocols. [1 hr]

Overview of TCP/IP Components Telnet, FTP, SMTP, Kerberos.
2. DNS, RPC, TCP, UDP, IP. [1 hr]
3. OSI & TCP/IP, Structure of Internet, Internet Layers, Internet Add,
IP Add, Address Resolution Protocol. [1 hr]
4. The IP, ICMP, IPV6. [1 hr]
5. Internet Protocol Supporting Different Environments DOS,
Windows, NT, OS/2, Macintosh, DEC, IBMs SNA, LANs.
6. TCP & UDP, Ports & Sockets, TCP Timers, UDP. [3 hrs]
7. Gateway & Routing Protocols. [3 hr]
8. Telnet & FTP. [1 hr]
9. Setting hostname, using ipconfig.
10. Intel daemon, netsate command, ping tracing a connection. [1 hr]
LAN Layers, NetBios, XNS, IPX, UDP, Arenet, FDDI n/W, X.25, ISPN,
ATM
11. DNS
12. NFS & NIS [1 hr]
[Advanced JAVA] [60%]
1. TCP Sockets [3 hrs]
TCP socket Basics, Java TCP socket classes,
Creating TCP client/server application
2. UDP Sockets [3 hrs]
Overview, Java UDP classes, Creating UDP client, Using IP multicasting
3. JAVA.net [3 hrs]
URL, URLConnection, HTTPURLConnection, URLEncoder,
URLDecoder, URLStreamHandler, ContentHandler, Socket,
ServerSocket, InetAddress, DatagramSocket, MulticastSocket
4. Java Security in Depth [3 hrs]
The need of Java Security, The Java Security Framework,
Applet restrictions, The SecurityManager Class,
The Java Security API
Symmetric Cryptography, Public key Cryptography,
Certification Authorities (CA), Key Management,
Digitally signing a Jar file, Defining a policy
5. JFC & Adv. JFC [4 hrs]
The nee for JFC, Pane Layering, Jlabel, Jbutton, Tooltips and icons,
Popup Menus, Borders, Jcheckbox, Radio Buttons, Box Layout,
JtabbedPanes, Sliders, ProgressBar
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

Advanced JFC
MVC model, Pluggable look and feel, Menus and toolbars,
ListBox, ComboBox, Tables, Trees, JTextField
6. Object Serialization [1 hr]
Overview, How it works?, Creating Object Serialization based applications.

7. RMI [3 hrs]
What is RMI, Creating Remote Object & Interface, Creating and
Implementing Class, Compiling Remote Servers, Stubs, Client,
8. JAVA Beans [2 hrs]
Concept of component models, The Basics of designing a java bean,
creating and using properties, using events, Introspection.
9. JDBC Concepts. [4 hrs]
Overview, Advanced client/server concepts, JDBC classes overview,
Metadata function
Statements
Statement, preparedStatement, CallableStatements
10. Servlets [3 hrs]
Introduction, Features of Servlet, Servlet Engines, Plugins,
Lifecycle of servlet, Servlet API
[Practical]
1 Setting up sample network servers SCO UNIX, LINUX, NT, Remote Printing.
Setting sample network clients DOS Based, Windows Based.
2 Managing & Trouble Shooting TCP/IP.

Text Books: 1.TCP/IP architecture, protocols & implementation

By Sidnie Feit
2.Using Java 2 Special Edition -By Joseph Weber
PHI publications

Ref. Books: 1. Core Java 2 Volume II, Sun Microsystems

 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-502 Operating System

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Tw Pr Total
4 - 4 60 40 25 25 150

1. Introduction to Operating System, Assembly language, operating system concepts And structure.
(4 hrs)

2. Processes: Process Model, Interprocess communication, Process Scheduler, policies, Algorithms, Cache
memory, Concurrent processes, Parallel processing, Process synchronisation software, Multiprocessing
configuration. (6 hrs)

3. Memory management: Swapping, virtual memory, Fixed Partition, Dynamic partition, Best Fit v/s First Fit
allocation, Deallocation, Paged memory allocation, design issues for paging systems, page replacement
policies, segmentation. (8 hrs)

4. Device Management: System devices, Sequential Access Storage Media, Direst Access Storage Devices,
components of the I/O sub system, Communication among devices, management of I/O Requests, RAID.
(6 hrs)

5. Network Organization Concepts: Basic terminology, Topologies, Network Types, Software design issues.
(2 hrs)

6. File systems: Files, directories, file system implementation, file security, file protection, Data compression,
File organization, access controls. (5 hrs)

7. Deadlocks: Resources, deadlocks, cases and conditions for deadlock, Deadlock detection and recovery,
deadlock avoidance, deadlock prevention,starvation. (5 hrs)

8. Case study: LINUX. (5 hrs)

Text Book : 1.Understanding Operating System(3rd Edition)

By Ida M. Flynn and Ane McIver McHdes
(Thomson Learning Publication)

Reference Books :
1.Dhamdhere "Structured Programming and Operating Systems",
TMH
2. Tannenbaum "Operating Systems"
Prentice-Hall
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-503 Statistical Computing

Teaching scheme (H/W) Exam. Scheme (Marks)
L Tu Th Ss Tw Total
4 - 60 40 25 125

1) Statistical-Methods: (1 hrs)
Inroduction: Statistical methods
Collection and Classification of data
Frequency Distribution (F.D.)
Graphical Representation of F.D.
2) Measures of Centarl Tendency: (3 hrs)
Mean, Arithmetic Mean, Geometric Mean, Harmonic Mean, Medium, Mode, comparison of the various
measures of central tendencies.
3) Measures of Dispersion: (4 hrs)
Range, Quartile Deviation or semi-interquartile range, Mean Deviation, Standard Deviation, Comparison of
various measures of dispersion.
4) Coefficient of variations: (4 hrs)
Skewness and coeffiecient of skewness, Kurtosis and types of kurtosis, Moments, Correlation and coefficient
of correlation.
5) Probability: (5 hrs)
Definition of probability
Events: Mutually exclusive events
Independent events
Compound events
Permutation and Combination
Addition and Multiplication law of Probability
Conditional Probability. (Bay's theorm)
6) Random Variable & Probability Distribution : (3 hrs)
Random variables, Discrete and continuous probability distribution, Discrete and continuous probability
functions, Expectation,Variance of a distribution,
rth moment about mean, Mean deviation from mean, Moment generating function.
7) Repeated Trials & Theoretical Distributions: (10 hrs)
(a) Binominal Distribution: Constant and applications
(b) Poisson Distribution: Constant and applications
(c) Normal Distribution: Properties and applications
(d) Some other Distributions: Uniform or Rectangle Distribution,Geometric Distribution, Negative
Distribution, Hyper geometric Distribution, Exponential Distribution, Weibull Distribution
8) Sampling and sampling Distribution: (10 hrs)
Testing a hypothesis, Test of significance for large samples.
(a) Students-t-Distribution: Properties, significance test of a sample mean,significance test of difference
between sample means.
(b) CHI-SQUARE(X2) Test:
Chi-Square Distribution, Properties and significance test of X2 distribution.
(c) Fisher' Z Distribution and F-Distribution: Significance test and properties of F-distribution.
Text book: Higher Engineering Mathematics By Dr. B. S. Grewal.
Reference books: 1. Engineering mathematics Part-I By Shantinarayan
2. Quatitative techniques in management By N D Vohra
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

W.E.F.: July - 2002

BCA-504 System Analysis And Design

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Th Ss Tw Viva Total
4 - 60 40 25 25 150

1. Information and management [4 hrs]

Data, Information, system - definition and examples, types of information
Why CBIS ? (computer based information system), management structure
Qualities of information, Classifications or varieties of CBIS - TPS, MIS, DSS, OAS
2. Information system analysis. [8 hrs]
What is system analysis ? what is system design ? What is system analysis and design ?
Characteristics of system - organization, interaction, interdependence, integration, central objective.
Elements of system analysis - output, input, files, processes
System approaches :
i. System development Life cycle (SDLC) When and Why ?
ii. Structured Analysis (The Paris model)
iii. Prototyping, When and why prototyping ?
The role of system analysts, Attributes of system analyst, tools used by system analyst.(data dictionary,
decision trees, decision tables, structured English)
The waterfall model (Classic life cycle or linear sequential model)
Boehm's Spiral model
Object Oriented Design
3. Information gathering (Fact finding) [3 hrs]
Communication with people
Strategy to gather information, information sources (inside and outside of org. )
Methods of searching information - Interviewing, Questionnaires, System observations, Determinations of
DFDs, New system
4. Requirements specifications. [3 hrs]
Data dictionary, major symbols, four rules, Why data dictionary ?
5. Feasibility Analysis. [4 hrs]
Different types of Feasibility, Cost-benefit Analysis (Present value of benefits),
Payback method, Examples.
6. Data flow diagrams. [2 hrs]
What is DFDs ? , Context diagram, Symbols used to construct DFDs, Rules to construct DFDs, Leveling
of DFDs, Logical DFDs, Physical DFDs, Examples
7. Process Specifications. [7 hrs]
Tools used in structured analysis
i. Structured English (types of structured used, examples)
ii. Decision tables ( types of decision tables, examples)
iii. Decision Trees (Examples)
8. Designing Outputs. [3 hrs]
Output devices, objectives of output design, Design of o/p reports, Design of screen, Use of Business
graphics.
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

9. Data input methods. [2 hrs]

Data input, coding techniques, modulus-11 code for detection of errors, validations of input data,
Interactive data input techniques (menus, templates, commands)

10. Control, audit and security of information systems [2 hrs]

Controls in information system, Audit of information systems, Security of information (computer virus)
11. System design example. (How to design any new system) [2 hrs]
12. System implementation. [2 hrs]
Coding and unit test : Employing programmers to write code, Using code Generator
Testing : ensuring the quality, data takeon and conversion, User training, Going live
The maintenance cycle.

Text-Books: 1. Systems Analysis And Design

By Don Yeates
Maura Shields and David Helmy

Reference Books: 1. Analysis And Design of Information Systems.

By V Rajaraman.
Second edition

2. Analysis and Design Of Information Systems

By James A. Senn
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-506 Introduction to Software Verification & Validation w.e.f. July2008

Teaching scheme (H/W) Exam. Scheme (Marks)

L Tu Pr Th Ss Tw Pr Total
4 - 2 60 40 25 25 150

1. Principles of Testing
1.1. Context of testing in producing software 1
1.2. Dijkstras Doctrine
1.3. Test in Time 1
1.4. Test the Tests first
2. Software Development Life Cycle Models (Introduction)
2.1. Phases of Software Project 1
2.2. Quality Assurance and Quality Control
2.3. Testing, Verification and validation concepts
2.4. Life Cycle Models 2
2.4.1. Waterfall
2.4.2. Prototype
2.4.3. Spiral
2.4.4. V Model and Modified V Model
3. White Box Testing
3.1. What is White Box Testing? 2
3.2. Static testing by Humans
3.3. Static Analysis Tools 1
3.4. Structural Testing
3.4.1. Unit/ Code Functional Testing 1
3.4.2. Code Coverage Testing 1
3.4.3. Code Complexity Testing 1
3.5. Challenges in White Box Testing
4. Black Box Testing
4.1. What is Black Bok Testing and what is its importance? 2
4.2. When to do Black Box Testing?
4.3. How to do Black Box Testing?
4.3.1. Requirement based testing 1
4.3.2. Positive and Negative testing
4.3.3. Boundary Value Analysis 1
4.3.4. Decision Tables 1
4.3.5. Equivalence Partitioning
4.3.6. Graph based Testing 1
4.3.7. Compatibility Testing
5. Integration Testing
5.1. Introduction 1
5.2. Top-Down Integration
5.3. Bottom-Up Integration 1
5.4. Bi-Directional Integration 1
5.5. System Integration
6. System and Acceptance Testing
6.1. System Testing Overview 2
 DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

6.2. Functional System Testing

6.2.1. Beta Testing
6.3. Non-Functional System Testing 1
6.3.1. Stress Testing
6.3.2. Interpretability Testing
6.4. Acceptance Testing 1
6.4.1. Acceptance Criteria, Selecting Test Cases
6.4.2. Executing Acceptance Tests
7. Performance Testing
7.1. Introduction 1
7.2. Factors governing performance testing
7.3. Methodology for performance testing
7.3.1. Collecting Requirement 1
7.3.2. Writing Test Cases
7.3.3. Executing and Analyzing Performance test case 1
7.3.4. Performance Tuning
8. Regression Testing
8.1. Introduction 1
8.2. Types of Regression Testing
8.3. Understanding the Criteria for selecting Test Case 1
8.4. Classifying Test Cases
8.5. Methodology for selecting Test Case 1
9. Test Planning, Management, Execution and Reporting
9.1. Test Planning
9.1.1. Preparing a Test Plan 1
9.1.2. Deciding Features to be tested/ Not Tested
9.1.3. Deciding Test Approach/ Strategy 1
9.1.4. Setting up Criteria for Testing
9.1.5. Identify Resource Requirement 1
9.1.6. Activity Breakdown and Scheduling
9.2. Process
9.2.1. Test Case Specification 1
9.2.2. Update of Traceability Matrix
9.2.3. Developing and Executing Test Cases 1
9.2.4. Collecting and Analyzing Metrics 1
9.2.5. Test Summary Report
10. Static Verification
10.1. Introduction 1
10.2. Design and Code Reviews 1
10.3. Program Inspection and checklist 1
10.4. Mathematically based verification 1
-------------------
40

Text Book: Software Testing Principles and Practices

By: Srinivasan Desikan and Gopalaswamy Ramesh
Publisher: Pearson Education
DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF INFORMATION SCIENCE

BCA-601-Project Industrial Training

Exam. Scheme (Marks)

Practical Term-Work Total

300 100 400

BCA-602-Seminar

Exam. Scheme (Marks)

Seminar Total
100 100