A. S. Patil College of Commerce (Autonomous), Bijapur ...

B.C.A. Syllabus III Sem (2018-21)

BLDE Association’s A. S. Patil College of Commerce (Autonomous), Vijayapur, BCA Programme

1

Theory

C

om

pute

r

La

b

B.L.D.E. Association’s

A. S. Patil College of Commerce (Autonomous), Bijapur

Bachelor of Computer Applications (BCA)

Paper No. Title of the Subject

BCA 301 Computer Organization & Architecture

BCA 302 Oops Using C++

BCA 303 Discrete Mathematical Structures

BCA 304 Database Management system

BCA 305

BCA306

Operating System (New)

MIL English

BCA 307 Lab :OOPS Using C++

BCA 308 Lab :Data Base Management System



2

BCA – THIRD SEMESTER

Hrs per Marks IA

Total Marks

Paper No. Title of the Subject Week Max Min Max Min

BCA301 Computer Organization & Architecture 4 80 32 20 100 40

BCA302 Oops Using C++ 4 80 32 20 100 40

BCA303 Discrete Mathematical Structures 4 80 32 20 100 40

BCA304 Database Management system 4 80 32 20 100 40

BCA305

BCA306

Operating System (New)

MIL English

4

4

80

80

32

32

20

20

100

100

40

40

BCA307 OOPS Using C++ Lab 6 80 32 20 100 40

BCA308 DBMS Lab 6 80 32 20 100 40



3

BCA 301: COMPUTER ORGANIZATION & ARCHITECTURE

No. of Lecture Hrs. / Week : 04 IA Marks : 20

No. of Lecture Hrs. : 52 Exam Hours : 03

Exam Marks : 80 No. of Tutorial class : 08

Total No. of Lecture Hrs : 60

Objectives:

• To acquaint the students with structure of computer, instruction & programs.

• To acquaint the students with structure of I/O organization & memory system.

• To acquaint the students with structure of arithmetic instructions.

• To acquaint the students with structure of Processing Unit, Computer

Peripherals & standard I/O

UNIT - 1

1. Basic Structure of Computers: Computer Types, Functional Units, Basic Operational

Concepts, Bus Structures, Performance – Processor Clock, Basic Performance Equation,

Clock Rate, Performance Measurement. 6 Hours

2. Machine Instructions and Programs: Numbers, Arithmetic Operations and Characters,

Memory Location and Addresses, Memory Operations, Instructions and Instruction

Sequencing, Addressing Modes, Assembly Language,

7 Hours

UNIT- 2

1. Input/output Organization: Basic Input and Output Operations, Stacks and Queues,

Subroutines, Additional Instructions, Encoding of Machine Instructions Accessing I/O Devices,

Interrupts – Interrupt Hardware, Enabling and Disabling Interrupts, Handling Multiple

Devices, Controlling Device Requests, Exceptions, Direct Memory Access, Buses,

Interface Circuits, 8 Hours

2. Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only

Memories, Speed, Size, and Cost

5 Hours

UNIT – 3

1. Cache Memories – Mapping Functions, Replacement Algorithms, Performance

Considerations, Virtual Memories, Secondary Storage, 5 Hours



4

2. Arithmetic Instructions: Addition and Subtraction of Signed Numbers, Design of Fast

Adders, Multiplication of Positive Numbers, Signed Operand Multiplication, Fast

Multiplication, Integer Division, Floating-point Numbers and Operations 8 Hours

UNIT - 4

1. Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete

Instruction, Multiple Bus Organization, Hard-wired Control, Microprogrammed Control

8 Hours

2. Computer Peripherals and standard I/O Interface Input Devices, Output Devices, Serial

communication links, PCI Bus, SCSI Bus, USB, 5 Hours

TUTORIALS:

Tutorial 1: Problems from Unit I

Tutorial 2: Problems from Unit II

Tutorial 3: Problems from Unit III

Tutorial 4: Problems from Unit IV 8 Hours

TEXT BOOK

1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, 5th Edition,

TMH, 2002.

REFERENCES:

1. M.Moris Mano, Computer System Architecture, 3rd Edition Prentice Hall of India (1993).

2. Heuring and Jordan, Computer systems design and Architecture, Pearson Education

(2003)

3. Computer Organization & Architecture, William Stallings, 7th Edition, PHI, 2006.

4. Computer Systems Design and Architecture, Vincent P. Heuring & Harry F. Jordan, 2nd

Edition, Pearson Education, 2004.



5

BCA 302: OOPS USING C++





Objectives:

• To acquaint the students with concepts of Computer & Its Applications.

• To enable students to write application using C++ Language.

UNIT 1

1. Introduction to Procedural Languages, definition of OOP, Basic concept of OOP, Object, lass,

Data Abstraction, Data Encapsulation, Data Hiding member functions, Reusability, Inheritance,

Creating new Data Types, Polymorphism, Overloading, Dynamic binding, and Message passing.

3 Hours

2. Introduction to C++ & Features: The iostream class, C++ Comments, C++ Keywords, Variable

declaration, The Const Qualifier. The Endl, Set W, set precision, Manipulators, - Expressions and

Control Structures - Pointers the scope resolution operator, the new & delete Operators.

3 Hours

3. Functions: Functions, Function declaration, calling the function, function definition; Passing

argument to functions, returning value from function; passing constants and Variables, pass by

value, passing structure variables, pass by reference, Default arguments, return statements,

return by reference, overloaded functions; Different number of arguments, Different Kinds of

arguments, inline function- Friend and Virtual Functions. 7 Hours

UNIT 2

1. Objects & Classes: Classes & Objects, Class Declaration, Class members; Data Constructors,

Destructors, Member functions, Class member visibility; private, public, protected. The scope of

the class object constructors; Default Constructor, Constructor with argument, constructor with

default arguments, Dynamic constructor, copy constructor, Overloaded constructor, Objects as

function arguments; member functions defined outside the class, - Function Overloading,

Objects as arguments, returning objects from functions, class conversion, manipulating private

Data members, Destructors, classes, objects & memory, array as class member data, Array of



6

objects, string as class member. 13 Hours

UNIT 3

1. Operator Overloading: Overloading unary operator: Operator Keyword, Operator Arguments,

Operator return value, Nameless temporary objects, limitations of increment operator,

overloading binary operator, arithmetic operators, comparison. Operator, arithmetic

assignment operator, Data conversion. Conversion .between Basic types, Conversion between

objects & Basic types, conversion between objects of different classes. 3 Hours

2. Inheritance: Derived Class & Base Class: Specifying the Derived class accessing Base class

members, the protected access specifier, Derived class constructor, Overriding member

functions, public and private inheritance; Access Combinations, Classes & Structures, Access

Specifiers, Level of inheritance; Multilevel inheritance, Hybrid inheritance, Multiple inheritance;

member functions in multiple inheritance, constructors in multiple inheritance, Containership;

Classes within classes, Inheritance & Program Development. 7 Hours

3. Pointers: The address-of operator (&) pointer and arrays. Pointer and Fractions pointer and C-

types string. Memory management: New and Delete, pointers to objects, debugging pointers

3 Hours

UNIT 4

1. Virtual Functions, Templates & Exception Handling: Normal member function accessed with

pointers, Virtual member functions accessed with pointers, Dynamic binding, pure virtual

functions, Friend function; Friends for functional notation, friend classes, this pointer; Accessing

Member Data with this, using this for returning values. 3 Hours

2. Templates and Exception Handling: Introduction, Templates, Class Templates, function

templates, and Exception Handling. 3 Hours

3. Streams and file pointers: The Stream class Hierarchy, Stream classes -Header file, string I/O :

Writing strings, reading strings, character I/O, Detecting End - of - file. Object I/O; writing an

object to disk, reading an object from disk, I/O with multiple objects; the fstream class, The

open function. Specifying the position, specifying the offset. The tellg Function, Disk I/O with



7

Memory Functions; Closing Files, Error Handling, Command Line Arguments. 7 Hours.

TUTORIALS:




Tutorial 4: Problems from Unit IV 8 Hrs

TEXT BOOKS:

1. Prata: C++ Primer Plus, 4/e Pearson Education

2. Lafore Robert: Object Oriented Programming in Turbo C++, Galgotia Publications

References:

1. Lippmann: C++ Primer, 3/e Pearson Education

2. E. Balaguruswamy: Object Oriented Programming with C++, Tata McGraw Hill.

Publications.

3. Strousstrup: The C++ Programming Language, Pearson Edition, 3rd Edition



8

BCA 303: DISCRETE MATHEMATICAL STRUCTURES





Objectives:

• To acquaint the students with counting.

• To acquaint the students with fundamental of logic.

• To acquaint the students with set theory.

• To acquaint the students with relations and function.

UNIT 1

1. Fundamental Principles of Counting: The rules of sum and product, Permutations. 7 Hours

2. Fundamental Principles of Counting (contd...): combinations, the Binomial Theorem,

Combinations with repetitions. 6 Hours

UNIT 2

1. Fundamentals of Logic: Basic connectives and truth Tables, Logical equivalence, the laws of

logic, logical implication, rules of inference. The Use of Quantifiers, Quantifiers, Definitions and

the Proofs of Theorems. 13 Hours

UNIT 3

1. Set Theory: Sets and subsets, set operations and the laws of set theory, counting and venn

diagrams, Probability. 6 Hours

2. Properties of the Integers: Mathematical Induction, The Well Ordering Principle – Mathematical

Induction, Recursive Definitions the division algorithm, the division algorithm. prime numbers,

the GCD, Euclid's algorithm, the fundamental theorem of Arithmetic. 7 Hours

UNIT 4

1. Relations and functions: Cartesian Products and relations. Functions. plain & one one function.

Onto functions, stirling numbers of the second kind. 6 Hours

2. Relations and functions (conti...)Special functions, the Pigeonhole Principle, function

composition and inverse functions, computational complexity, Analysis of Algorithms. 7 Hours

TUTORIALS:



9




Tutorial 4: Problems from Unit IV 8 Hours

TEXT BOOK

Discrete and Combinatorial Mathematics, Ralph P. Grimaldi, 5th Edition, PHI/Pearson Education, 2004.

References:

1. Discrete Mathematics and its Applications, Kenneth H. Rosen, 6th Edition, McGraw Hill,

2007.

2. Discrete Mathematical Structures: Theory and Applications, D.S. Malik and M.K. Sen,

Thomson, 2004.

3. Discrete Mathematics with Applications, Thomas Koshy, Elsevier, 2005.



10

BCA 304: DATABASE MANAGEMENT SYSTEMS





Objectives:


• To enable students to write application using SQL.

UNIT - 1

1. INTRODUCTION: Introduction; An example; Characteristics of Database approach; Actors on the

screen; Workers behind the scene; Advantages of using DBMS approach; A brief history of

database applications; when not to use a DBMS. Data models, schemas and instances; Three-

schema architecture and data independence; Database languages and interfaces; The database

system environment; Classification of Database Management systems. 6 Hours

2. ENTITY-RELATIONSHIP MODEL: Using High-Level Conceptual Data Models for Database Design;

An Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship

types, Relationship Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER

Design; ER Diagrams, Naming Conventions and Design Issues; Relationship types of degree

higher than two. 7 Hours

UNIT - 2

1. RELATIONAL MODEL AND RELATIONAL ALGEBRA: Relational Model Concepts; Relational Model

Constraints and Relational Database Schemas; Update Operations, Transactions and dealing

with constraint violations; Unary Relational Operations: SELECT and PROJECT; Relational

Algebra Operations from Set Theory; Binary Relational Operations : JOIN and DIVISION;

Additional Relational Operations; Examples of Queries in Relational Algebra; Relational Database

Design Using ER- to-Relational Mapping. 7 Hours

2. SQL-1: SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change

statements in SQL; Basic queries in SQL; More complex SQL Queries. 6 Hours

UNIT - 3



11

1. SQL-2: Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and

Trigger; Views (Virtual Tables) in SQL; Additional features of SQL; Database programming issues

and techniques; Embedded SQL, Dynamic SQL; Database stored procedures and SQL / PSM.

7 Hours

2. DATABASE DESIGN - 1: Informal Design Guidelines for Relation Schemas; Functional

Dependencies; Normal Forms Based on Primary Keys; General Definitions of Second and Third

Normal Forms; Boyce-Codd Normal Form. 6 Hours

UNIT - 4

1. DATABASE DESIGN: Properties of Relational Decompositions; Algorithms for Relational

Database Schema Design; Multivalued Dependencies and Fourth Normal Form; Join

Dependencies and Fifth Normal Form; Inclusion Dependencies; Other Dependencies and

Normal Forms. 6 Hours

2. TRANSACTION MANAGEMENT: The ACID Properties; Transactions and Schedules;

Concurrent Execution of Transactions; Lock - Based Concurrency Control; Performance of

locking; Transaction support in SQL; Introduction to crash recovery; 2PL, Serializability and

Recoverability; Lock Management; Introduction to ARIES; The log; Other recovery-related

structures; The write-ahead log protocol; Checkpointing; Recovering from a System Crash;

Media Recovery; Other approaches and interaction with concurrency control. 7 Hours

TUTORIALS:







12

TEXT BOOKS:

1. Fundamentals of Database Systems – Elmasri and Navathe, 5th Edition, Addison-Wesley,

2007

REFERENCE BOOKS:

1. Database Management Systems – Raghu Ramakrishnan and Johannes Gehrke – 3rd Edition,

McGraw-Hill, 2003.

2. Data Base System Concepts – Silberschatz, Korth and Sudharshan, 5th Edition, Mc-GrawHill,

2006.

3. An Introduction to Database Systems – C.J. Date, A. Kannan, S. Swamynatham, 8th Edition,

Pearson Education, 2006



13

BCA 305: OPERATING SYSTEM(NEW)





Objectives:

• To acquaint the students with basic structure, process management and

scheduling.

• To acquaint the students with deadlock.

• To acquaint the students with memory management and file system.

• To acquaint the students with secondary storage structure and protection.

UNIT - 1

1. INTRODUCTION TO OPERATING SYSTEMS, SYSTEM STRUCTURES: What operating

systems do; Computer System organization; Computer System architecture; Operating

System structure; Distributed system; Computing environments. Operating System Services; User

- Operating System interface; Virtual Machine; Operating System design and implementation.

6 Hours

2. PROCESS MANAGEMENT: Process concept; Process scheduling;

Operations on processes; Inter-process communication; Multithreading models; 3 Hours

3. PROCESS SCHEDULING: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-

Processor scheduling; Thread scheduling. 4 Hours

UNIT - 2

1. PROCESS SYNCHRONIZATION: Synchronization: The Critical section problem; Synchronization

hardware; Semaphores; Classical problems of synchronization; Monitors.

6 Hours

2. DEADLOCKS: System model; Deadlock characterization; Deadlock prevention; Deadlock

avoidance; Deadlock detection and recovery from deadlock.

7 Hours

UNIT - 3

1. MEMORY MANAGEMENT: Logical and Physical address space; Swapping; Contiguous memory

allocation; Paging; Segmentation. Virtual Memory Management: Demand paging & its

performance Page replacement; Allocation of frames; Thrashing. 6 Hours



14

2. FILE SYSTEM, IMPLEMENTATION OF FILE SYSTEM: File System: File concept; Access methods;

Directory structure; Protection. Implementing File System: File system structure; Directory

implementation; Allocation methods; Free space management.

7 Hours

UNIT – 4

1. SECONDARY STORAGE STRUCTURES, PROTECTION: Disk structure; Disk attachment; Disk

scheduling; Disk management; Swap space management. 7 hours

2. Protection: Goals of protection, Domain of protection. 6 Hours

TUTORIALS:





TEXT BOOK:

1. Operating System Principles - Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 7th

edition, Wiley-India, 2006.

REFERENCE BOOKS:

1. Operating Systems: A Concept Based Approach - D.M

2. Dhamdhere, 2nd Edition, Tata McGraw- Hill, 2002.

3. Operating Systems - P.C.P. Bhatt, 2nd Edition, PHI, 2006.

4. Operating Systems - Harvey M Deital, 3rd Edition, Addison

5. Wesley, 1990.



15

Theory

C

om

pute

r

La

b

B. L. D.E. Association’s

A. S. PATIL COLLEGE OF COMMERCE (AUTONOMOUS), VIJAYPUR

B.C.A. 4th Semester

Paper No. Title of the Subject

BCA401 Design and Analysis of Algorithm

BCA402 Object oriented System Analysis and Design

BCA403 VB.Net

BCA404 Computer Networks

BCA 405

BCA 406

Programming with JAVA

MIL English

BCA 407 Lab : Mini Project using VB.net & My SQL

BCA408 Lab : Programming with JAVA



16

BCA – Fourth Semester

Paper No. Title of the Subject Hours / week

Exam Marks IA

Total Marks

Duration Max Min Max Min

BCA 401 Design and Analysis of Algorithm 4 3 Hrs 80 32 20 100 40

BCA 402 Object Oriented System Analysis and Design

4 3 Hrs 80 32 20 100 40

BCA 403 VB.Net 4 3 Hrs 80 32 20 100 40

BCA 404 Computer Networks 4 3 Hrs 80 32 20 100 40

BCA 405

BCA 406

Programming with JAVA

MIL English

4

4

3 Hrs

3Hrs

80

80

32

32

20

20

100

100

40

40

BCA 407 Lab : Mini Project using VB.Net & My SQL

4 3 Hrs 80 32 20 100 40

BCA 408 Lab : Programming with JAVA 4 3 Hrs 80 32 20 100 40



17

BCA 401: DESIGN AND ANALYSIS OF ALGORITHMS





Objectives:

• To acquaint the students with concepts of Algorithms.

• To enable students to study sorting techniques.

UNIT- 1:

1. Introduction: What is an Algorithm?, Fundamentals of Algorithmic Problem Solving,

Important Problem Types, Fundamental Data Structures 7 Hours

2. Fundamentals of the Analysis of Algorithm Efficiency: Analysis Framework,

Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of No

recursive and Recursive Algorithms. 6 Hours

UNIT 2:

1. Brute Force: Selection Sort and Bubble Sort, Sequential Search and Brute-Force

String Matching, Exhaustive Search

3 Hours

2. Divide and Conquer: Merge sort, Quicksort, Binary Search, Binary tree traversals and

related properties. 4 Hours

3. Decrease and Conquer: Insertion Sort, Depth First Search, and Breadth First Search,

Topological Sorting, Algorithms for Generating Combinatorial Objects 6

Hours

UNIT 3:

1. Transform and Conquer: Presorting, Balanced Search Trees, Heaps and Heapsort,

Problem Reduction Space and Time Tradeoffs: Sorting by Counting, Input

Enhancement in String Matching 7 Hours

2. Space and Time Tradeoff contd.: Hashing Dynamic Programming: Computing a

Binomial Coefficient, Warshall’s and Floyd’s Algorithms, The Knapsack Problem and

Memory Functions 6 Hours

UNIT 4:



18

1. Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm,

Huffman Trees 3 Hours

2. Limitations of Algorithm Power: Lower-Bound Arguments, Decision Trees, NP and

NP-Complete Problems

4 Hours

3. Coping with the Limitations of Algorithm Power: Backtracking, Branch-and-Bound,

Approximation Algorithms for NP-Hard Problems 6 Hours

TUTORIALS:





Note : TWO questions should be framed from each unit.

Text Book

1. Introduction to The Design & Analysis of Algorithms, Anany Levitin, 2nd Edition, Pearson

Education, 2007.

(Chapter 1, 2.1 to 2.5, 3.1, 3.2, 3.4, 4.1 to 4.5, 5.1 to 5.4, 6.1, 6.3, 6.4, 6.6, 7.1 to 7.3, 8.1,

8.2, 8.4, 9, 11.1, 11.2, 11.3, 12.1, 12.2, 12.3).

Reference Books

[1] Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson,

Ronal L. Rivest, Clifford Stein, 2nd Edition, PHI, 2006.

[2] Computer Algorithms by Horowitz E., Sahni S., Rajasekaran S., Galgotia

Publications, 2001.

[3] Introduction to the Design and Analysis of Algorithms A Strategic Approach,

R.C.T. Lee, S.S. Tseng, R.C. Chang & Y.T.Tsai, TMH, 2005.



19

BCA 402: OBJECT ORIENTED SYSTEM ANALYSIS AND DESIGN





Objectives:

• To acquaint the students with concepts of Object Oriented system analysis &

Design.

UNIT I

1. An Overview of Object Oriented Systems Development : Two Orthogonal Views of the

software, Object-Oriented Systems Development Methodology, 6 Hours

2. Object Basics: Objects, Objects are Grouped in classes, attributes, Object Behavior and

Methods, Objects respond to messages, Encapsulation and information hiding, class

hierarchy, polymorphism, object relationships and associations, aggregations and

object containment.

7 hours

UNIT 2

1. Object Oriented Systems Development Life Cycle : Software Development process,

Building high quality software, Use-Case Driven Approach, Reusability

7

hours

2. Object-Oriented Methodologies : Survey of some of the Object Oriented

Methodologies, Rum Baugh et al.’s object modeling Technique, The Booch

Methodology, The Jacobson et al. methodologies

6 hours

UNIT 3

1. Unified Modelling Language : Static & dynamics Models, Introduction to UML, UML

Diagrams, UML Class Diagrams, Use –Case Diagram, UML Dynamic Modeling Model

Management, UML Extensibility. 7

hours

2. Why analysis is a difficult activity, Business object Analysis, Use-Case Driven Object

oriented analysis, business Process Modeling 3

Hours

3. Object Analysis Classification: Classification Theory, Approaches for Identifying Classes,

Common class patterns approach. 3

hours



20

UNIT 4

1. The Object Oriented Design process and design Axioms: The Object-oriented design

process, object-oriented design axioms, corollaries, Design patterns 3

Hours

2. Designing classes: The object oriented design philosophy, UML object constraint

language, designing classes, class visibility, designing classes Designing methods and

protocols. 4

hours

3. View Layers : Designing Interface Objects : User Interface Design as a creative process,

Designing view layer classes, Macro-level process, The purpose of a view layer

interface, prototyping the user interface

6 hours

TUTORIALS:






Text book

Object Oriented Systems Development, Ali Bahrami, McGraw Hill International Editions

References: 1. Object-oriented analysis and Design by Grady Booch , Second Edition, Pearson Education Ltd.

2. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw-Hill,



21

BCA 403: VB.NET





Objectives:


• To enable students to write application using VB.NET.

UNIT 1

Visual Basic .NET and the .NET Framework.

Introduction to .net framework -Features, Common Language Runtime (CLR) , Framework

Class Library(FCL), Visual Studio.Net – IDE, Languages Supported, Components.

Visual Programming, VB.net- Features, IDE- Menu System, Toolbars, Code Designer, Solution

Explorer, Object Browser, Toolbox, Class View Window, Properties Window, Server Explorer,

Task List, Output Window, Command Window. 6 Hours

Elements of Visual Basic .net

Properties, Events and Methods of Form, Label, TextBox, ListBox, Combo Box, Radio Button,

Button, Check Box, Progress Bar, Date Time Picker, Calendar, Picture Box, HScrollbar,

VScrollBar, Group Box, ToolTip, Timer. 7 Hours

UNIT 2

Programming in Visual basic .net

Data Types, Keywords, Declaring Variables and Constants, Operators, Understanding Scope

and accessibility of variables, Conditional Statements- If- Then, If-Then-Else, Nested If, Select

Case, Looping Statement- Do loop, For Loop, For Each-Next Loop, While Loop, Arrays- Static

and Dynamic

13 Hours

UNIT 3

Functions, Built-In Dialog Boxes, Menus and Toolbar

Menus and toolbars- Menu Strip, Tool Strip, Status Strip, Built-In Dialog Boxes – Open File

Dialogs, Save File Dialogs, Font Dialogs, Color Dialogs, Print Dialogs, InputBox, MsgBox,

Interfacing With End user- Creating MDI Parent and Child, Functions and Procedures- Built-In

Functions- Mathematical and String Functions, User Defined Functions and Procedures.

7 Hours



22

Data Access with ADO.Net – What are Databases?, Data Access with Server Explorer, Data

Adapter and Datasets, ADO.NET Objects and Basic SQL. 6 Hours

UNIT 4

Advanced Concepts in VB.Net

Object Oriented Programming- Creating Classes , Objects, Fields, Properties, Methods, Events,

Constructors and destructors, Exception Handling- Models, Statements, File Handling- Using

File Stream Class, File Mode, File Share, File Access Enumerations, Opening or Creating Files

with File Stream Class, Reading and Writing Text using Stream Reader and Stream Writer Classes

13 Hours

TUTORIALS:






Text Books:

1. Visual Basic.Net Black Book by Steven Holzner Dreamtech Press

2. The Complete Reference Visual Basic .NET Jeffery R. Shapiro Tata McGraw Hills

Reference Books:

1 .Murach’s Beginning Visual basic .Net By Anne Bohem

2. Visual Basic .Net by Vijay Mukhi



23

BCA 404: COMPUTER NETWORK





Objectives:

• To acquaint the students with concepts of Computer Network and its Applications

UNIT 1

1. INTRODUCTION: Networks; the Internet; Protocols and Standards; Layered tasks; The OSI

Model and the layers in the OSI model; TCP / IP Protocol Suite. 5 Hours

2. TRANSMISSION MEDIA, ERROR DETECTION AND CORRECTION: Twisted pair

cable, Coaxial cable, Fiber-Optic cable, Radio waves, Microwaves, Infrared. Introduction to

error detection /correction; Block coding; linear block codes; Cyclic codes, Checksum. 8 Hours

UNIT 2

1. DATA LINK CONTROL: Framing; Flow and Error control; Protocols;

Noiseless channels; Noisy channels; HDLC; Point-to-point Protocol -framing, transition phases.

8 Hours

2. MULTIPLE ACCESS, Random Access; Controlled Access; Channelization.

5 Hours

UNIT 3

1. THE TRANSPORT LAYER: Transport service, Elements of Transport protocols, Internet transport

protocols (TCP & UDP). 7 Hours

2. APPLICATION LAYER: DNS; Electronic Mailing, and World Wide Web; Voice Over IP. 6 Hours

UNIT 4

ETHERNET & WIRELESS LANS AND CONNECTION OF LANS: Ethernet: IEEE standards; Standard

Ethernet and changes in the standard; Fast Ethernet; Gigabit Ethernet.IEEE 802.11; Bluetooth.

Connecting devices; Backbone Networks; Virtual LANs.

13

Hours

TUTORIALS:



24






TEXT BOOKS:

1. Computer Networks – Andrew S. Tanenbaum

4th Edition, PHI Learning Pvt. Ltd.

REFERENCE BOOKS:

1. Data Communications and Networking - Behrouz A. Forouzan,

2. Communication Networks: Fundamental Concepts and Key Architectures - Alberto Leon,

Garcia and Indra Widjaja, 3rd Edition, Tata McGraw- Hill, 2004.

3. Data and Computer Communication, William Stallings, 8th Edition, Pearson Education,

2007.

4. Computer Networks: A Systems Approach - Larry L. Peterson and Bruce S. David, 4th

Edition, Elsevier, 2007.

5. Introduction to Data Communications and Networking – Wayne Tomasi, Pearson Education,

2005.

6. Computer and Communication Networks - Nader F. Mir, Pearson Education, 2007



25

BCA 405: PROGRAMMING WITH JAVA





Objectives:


• To enable students to write application using JAVA Language.

UNIT I

Introduction Overview of java Language:

• Introduction to JAVA: Internet origin and development - internet architecture frame work world

Wide Web. JAVA Evolution: Java History, Java Features, How Java Differs from C and C++,

Java and Internet, Java and World Wide Web, Web Browsers, Hardware and Software

requirements, Java Support Systems, Java Environment.

• Overview of JAVA Language: Introduction, Simple Java Program, More of Java, An

Application with Two Classes, Java Program structure, Java Tokens, Java Statements,

Implementing a Java Program, Java Virtual Machine, Command Line Arguments, Programming

Style. 7 Hours

Data Types, Operators and Expressions:

• Data Types Introduction, Constants, Variables, Data Types, Declaration of Variables, Giving

Values to Variables, Scope of variables, Symbolic Constants, Type Casting, Getting Values of

Variables, Standard Default Values

• Operators and Expressions: Introduction, Arithmetic Operators, Relational Operators, Logical

Operators, Assignment Operators, Increment and Decrement Operators, Conditional Operators,

Bit wise Operators, Special Operators, Arithmetic Expressions, Evaluation of Expressions,

Precedence of Arithmetic Operators, Type conversion and Associatevity, Mathematical

functions. 6 Hours

UNIT II:

Decision Making, Branching and looping:

• Decision Making, Branching Introduction, Decision Making with if Statement, Simple if

Statement, The if - else Statement, Nesting of if else Statements, The else if Ladder, The Switch

Statement, The?: Operator.

• Decision Making and Looping: Introduction. The while Statement, The do Statement, The for

Statement, Jumps in Loops, Labeled Loops. 6

Hours



26

Classes, Arrays Strings and vectors :

• Classes, Objects and Methods: Introduction, Defining a Class, Adding Variables, Adding

Methods, Creating Objects, Accessing Class Members, Constructors, Methods Overloading,

Static Members, Nesting of Methods,

• Inheritance: Extending a Class Overriding Methods, Final Variables and Methods, Finalizer

methods, Abstract Methods and Classes, Visibility Control.

• Arrays, Strings and Vectors: Arrays, One - dimensional Arrays, Creating an Array, Two –

dimensional Arrays, Strings, Vectors, Wrapper Classes.

7 Hours

UNIT III.

Interfaces and packages:

• Interfaces: Multiple Inheritance: Introduction, Defining Interfaces, Extending Interfaces,

Implementing Interfaces, Accessing Interface Variables.

• Packages: Putting Classes together: Introduction, Java API Packages, Using System Packages,

Naming Conventions, Creating Packages, Accessing a Package, Using a Package, Adding a

Class to a Package, Hiding Classes. 7

Hours

Multithreaded Programming and Managing Exceptions

• Multithreaded Programming: Introduction, Creating Threads, Extending the Thread Class,

Stopping and Blocking a thread, Life Cycle of a thread, Using Thread Methods, Thread

Exceptions, Thread Priority, Synchronization, Implementing the 'Runnable' Interface.

• Managing Errors and Exception: Introduction, Types of Errors, Exceptions, Syntax of

Exception Handling Code, Multiple Catch Statements and Finally Statement

6 Hours

UNIT IV:

Applet and Graphics Programming, Input I Output file :

• Applet Programming: Introduction, How Applets Differ from Applications, Preparing to Write

Applets, Building Applet Code, Applet Life Cycle, Creating an Executable applet, Designing a

Web Page, Applet Tag, Adding Applet to HTML File, running the Applet, More about Applet Tag,

Passing Parameters to Applets 3 Hours

• Graphics Programming: Introduction, The Graphics Class, Lines and rectangles, circles, and

Ellipses, Drawing Arcs, Drawing Polygons, Line Graphs, Using Control Loops in Applets,

Drawing Bar Charts.

3 Hours

• Managing Input I Output Files in JAVA: Introduction, Concept of Streams, Stream Classes,

Byte Stream Classes, Character Stream Classes, Using Streams, Other Useful I/O Classes,



27

Using the File Class, Input/Output Exceptions, Creation of Files, Reading Writing Characters,

Reading Writing Bytes 7 Hours

TUTORIALS:






TEXT BOOK 1) E. Balaguruswamy, Programming with JAVA, A Primer, Tata McGraw - Hill Education, Delhi

REFERENCES:

1. Java Complete Reference ( Black Book).

2. Shishir Gundavaram, CGI Programming on the World Wide Web, O'Reilly and Associates,

(1996)

A. S. Patil College of Commerce (Autonomous), Bijapur ...

Documents

Transcript of A. S. Patil College of Commerce (Autonomous), Bijapur ...