II BCA SYLLABUS

                                                       III SEMESTER

Title of the Course/	Paper –V   PROGRAMMING IN C++ AND DATA                    STRUCTURES
Core	II Year & Third Semester	Credit: 4
Objective of the course	This course introduces the basic concepts of programming in C++ and Data Structures
Course outline	Unit 1: Introduction to C++;  Tokens, Keywords, Identifiers, Variables, Operators, Manipulators, Expressions and Control Structures in C++;  Pointers - Functions in C++ ‑ Main Function ‑ Function Prototyping ‑ Parameters Passing in Functions - Values Return by Functions - Inline Functions - Friend and Virtual Functions
	Unit-2: Classes and Objects; Constructors and Destructors; and Operator Overloading and Type Conversions - Type of Constructors - Function overloading. Inheritance :  Single Inheritance ‑ Multilevel Inheritance ‑ Multiple Inheritance ‑ Hierarchical Inheritance ‑ Hybrid Inheritance.   Pointers, Virtual Functions and Polymorphism; Managing Console I/O operations.
	Unit 3: Working with Files:  Classes for File Stream Operations ‑ Opening and Closing a File ‑ End‑of‑File Deduction ‑ File Pointers ‑ Updating a File ‑ Error Handling during File Operations ‑ Command‑line Arguments. Data Structures: Definition of a Data structure ‑ primitive and composite Data Types, Asymptotic notations, Arrays, Operations on Arrays, Order lists.
	Unit-4:  Stacks - Applications of Stack ‑ Infix to Postfix Conversion, Recursion, Maze Problems -  Queues ‑ Operations on Queues, Queue Applications, Circular Queue. Singly Linked  List ‑ Operations, Application ‑ Representation of a Polynomial, Polynomial Addition; Doubly Linked List ‑ Operations, Applications.
	Unit-5 : Trees and Graphs: Binary Trees ‑ Conversion of Forest to Binary Tree, Operations ‑ Tree Traversals; Graph ‑ Definition, Types of Graphs, Hashing Tables and Hashing Functions, Traversal ‑ Shortest Path; Dijkstra's Algorithm.

1. Recommended Texts

i. E. Balagurusamy,1995,Object Oriented Programming with C++, Tata McGraw‑Hill

    Publishing Company Ltd.

ii..E.Horowitz  and S.Shani,1999,Fundamentals of Data Structures in C++ , Galgotia Pub.

2.Reference Books

i. Robert Lafore, Object Oriented Programming in Microsoft C++, Galgotia publication.

ii.. H.Schildt,  C++,1998,The Complete Reference-1998-TMH Edition, 1998

iii.R. Kruse C.L. Tondo and B. Leung ,1997, Data Structures and Program design in C,

     PHI.

iii.Cangsam,Auguenstein,Tenenbaum,Data Structures using C & C++,PHI

iv.D.Samantha,2005, Classic Data Structures, PHI,New Delhi.

Title of the Course/	Microprocessors and Its Applications
Core	II Year & Third Semester	Credit: 4
Objective of the course	This course introduces the basic concepts of Microprocessors and Its Applications
Course outline	Unit – I  Introduction to Micro Computers, Microprocessors and Assembly Languages - Microprocessor architecture and its operations - 8085 MPU - 8085 Instruction set and classifications
	Unit – II  Writing assembly levels programs - Programming techniques such as looping, counting and indexing addressing nodes - Data transfer instructions - Arithmetic and logic operations - Dynamic debugging.
	Unit – III Counters and Time delays - Hexadecimal counter - Modulol 0 counter - Pulse Timings for flashing lights - Debugging counter and time delay program - stack - subroutine - conditional call and return instructions.
	Unit – IV  BCD to Binary and Binary to BCD conversions - BCD to HEX and HEX to BCD conversions - AS CII to BCD and BCD to ASCII conversions - BCD to Seven segment LED Code conversions - Binary to ASCII and ASCII to Binary conversions - Multibyte Addition - Multibyte subtraction - BCD addition - BCD Subtraction - Multiplication and Division
	Unit – V  Interrupt - Implementing interrupts - Multiple interrupt - 8085 - trap - Problems on implementing 8085 interrupt - DMA - Memory interfaces - Ram & Rom - I/O interface - Direct I/O - Memory mapped I/O.

Reference:

1. R. S. Gaonkar, 'Microprocessor Architecture, Programming and Applications with 8085/8080A', Wiley East em limited, 1990.
2. A. Mathur, 'Introduction to Microprocessor', Third Edition, Tata McGraw-Hill Publishing Co. Ltd., 1993.

IV SEMESTER

Title of the Course/	Paper –VII   -  PROGRAMMING IN JAVA
Core	II Year & Fourth Semester	Credit: 4
Objective of the course	This course introduces the basic concepts of programming in JAVA
Course outline	Unit 1: Introduction to Java-Features of Java-Basic Concepts of Object Oriented Programming-Java Tokens-Java Statements-Constants-Variables-Data Types- Type Casting-Operators-Expressions-Control Statements: Branching and Looping Statements.
	Unit-2: Classes, Objects and Methods-Constructors-Methods Overloading-Inheritance-Overriding Methods-Finalizer and Abstract Methods-Visibility Control –Arrays, Strings and Vectors-String Buffer Class-Wrapper Classes.
	Unit 3: Interfaces-Packages-Creating Packages-Accessing a Package-Multithreaded Programming-Creating Threads-Stopping and Blocking a Thread-Life Cycle of a Thread-Using Thread Methods-Thread Priority-Synchronization-Implementing the Runnable Interface .
	Unit-4: Managing Errors and Exceptions-Syntax of Exception Handling Code-Using Finally Statement-Throwing Our Own Exceptions-Applet Programming-Applet Life Cycle-Graphics Programming-Managing Input/Output Files: Concept of Streams-Stream Classes-Byte Stream Classes-Character Stream Classes – Using Streams-Using the File Class-Creation of Files-Random Access Files-Other Stream Classes.
	Unit-5: : Network basics –socket programming – proxy servers – TCP/IP – Net Address – URL – Datagrams -Java Utility Classes-Introducing the AWT: Working with Windows, Graphics and Text- AWT Classes- Working with Frames-Working with Graphics-Working with Color-Working with Fonts-Using AWT Controls, Layout Managers and Menus.

1. Recommended Texts

i.E. Balagurusamy,2004,Programming with JAVA, 2^nd Edition,Tata McGraw-Hill Publishing Co.Ltd.

ii.Herbert Schildt,2005,The Complete Reference Java^TM 2, 5^th  Edition,Tata McGraw-Hill Publishing Co. Ltd.

2. Reference Books

i. Y. Daniel Liang ,2003, An Introduction to JAVA Programming, Prentice-Hall of India Pvt. Ltd.

ii. Cay S. Horstmann and Gary Cornell,2005, Core Java^TM2 Volume I-Fundamentals,  7^th Edition- Pearson Education.

iii. Ken Arnold, James Gosling and David Holmes,2003, The Java^TM Programming Language, 3^rdEdition, Pearson Education.

Title of the Course/	Paper –X   -   OPERATING SYSTEMS
Core	II Year	Credit: 4
Objective of the course	This course introduces the functions of operating systems.
Course outline	Unit 1: Introduction: Views –Goals –Types of system – OS Structure –Components – Services - System Structures – Layered Approach -Virtual Machines - System Design and Implementation. Process Management: Process - Process Scheduling – Cooperating Process –Threads -  Interprocess Communication. CPU Scheduling : CPU Schedulers  – Scheduling criteria – Scheduling Algorithms
	Unit-2:– Process Synchronization: Critical-Section problem - Synchronization Hardware – Semaphores – Classic Problems of Synchronization – Critical Region – Monitors. Deadlock : Characterization – Methods for handling Deadlocks – Prevention, Avoidance, and Detection of Deadlock - Recovery from deadlock.
	Unit 3: Memory Management : Address Binding – Dynamic  Loading and Linking – Overlays – Logical and Physical Address Space -  Contiguous Allocation – Internal & External Fragmentation . Non Contiguous Allocation:Paging and  Segmentation schemes –Implementation – Hardware  Protection – Sharing - Fragmentation.
	Unit-4:  Virtual  Memory :: Demand Paging – Page Replacement - Page Replacement Algorithms – Thrashing. – File System: Concepts – Access methods – Directory Structure –Protection Consistency Semantics – File System Structures – Allocation methods – Free Space Management.
	Unit-5 : I/O Systems: Overview - I/O Hardware – Application I/O Interface – Kernel I/O subsystem – Transforming I/O Requests to Hardware Operations – Performance. Secondary Storage Structures : Protection – Goals- Domain  Access matrix – The security problem – Authentication – Threats – Threat Monitoring – Encryption..

1. Recommended Texts

i. Silberschatz A., Galvin P.B., Gange,. 2002 , Operating System Principles ,Sixth

   Edition, John Wiley & Sons.

2. Reference Books

i. H.M. Deitel ,1990, An Introduction to Operating System,- Second Edition,Addison Wesley.

 

Title of	COMPUTER GRAPHICS
Elective	II Year &	Credit: 5
Objective	This course introduces the fundamental concepts of Graphics.
Course outline	Unit 1: INTRODUCTION TO COMPUTER GRAPHICS : Brief Survey of Computer Graphics – Graphics Systems: Video Display Devices – Types – Raster-Scan Systems and Random-Scan Systems – Input Devices – Hard-Copy Devices – Graphics Software.
	Unit-2: OUTPUT PRIMITIVES AND THEIR ATTRIBUTES Line-Drawing (DDA and Bresenham’s) Algorithms – Circle-Generating (Midpoint) Algorithm – Ellipse-Generating (Midpoint) Algorithms- Area-Filling (Boundary-Fill and Flood-Fill) Algorithms - Line Attributes - Color and Grayscale Levels – Character Attributes – Inquiry Functions.
	Unit 3: TWO-DIMENSIONAL TRANSFORMATIONS AND  VIEWING : Basic Transformations - Matrix Representations and Homogeneous Coordinates – Composite Transformations - Other Transformations – Window-to- Viewport Coordinate  Transformation – Clipping Algorithms: Cohen-Sutherland Line Clipping and Sutherland- Hodgeman Polygon Clipping – Basic Modeling Concepts - Interactive Input Methods: Logical Classification of Input Devices – Interactive Picture-Construction Techniques.
	Unit-4: THREE-DIMENSIONAL CONCEPTS:  Three-Dimensional Display Methods: Parallel and Perspective Projections – Depth Cueing -  Visible Line and Surface Identification – Polygon Surfaces: Polygon Tables, Plane Equations and Polygon Meshes - Three-Dimensional Transformations: Basic, Other and Composite Transformations.
	Unit-5 : THREE-DIMENSIONAL VIEWING : Viewing Pipeline and Coordinates – Transformation from World to Viewing Coordinates – Projection Transformations - Matrices - View Volumes - Hidden Surface and Hidden Line Elimination Methods: Back-Face Detection , Depth-Buffer and A-Buffer Methods –Wireframe Methods- Light Sources – RGB,CMY and HLS Color Models

1. Recommended Texts

i. D. Hearn  and M.P. Baker,2005,Computer Graphics,  2^nd Edition, Pearson Education, Prentice Hall, 19^th Reprint.

2.Reference Books

i.   S. Harrington,1987, Computer Graphics , 2^nd Edition , McGraw-Hill Book Co.

ii. W.M.  Newman  and R.F. Sproull ,1997, Principles  of   Interactive  Computer       

     Graphics, 2^ndEdition,Tata McGraw-Hill Publishing Co. Ltd.

        iii.  D.P. Mukherjee ,1999,Fundamentals   of    Computer   Graphics   and   

     Multimedia ,  1^st  Edition,  Prentice-Hall of India Pvt. Ltd.

      iv.  N. Krishnamurthy ,2002, Introduction to Computer Graphics, 1^st Edition, Tata  

            McGraw-Hill Publishing Co. Ltd.

       v. D.F.Rogers ,2001,Procedural  Elements  for  Computer  Graphics, 2^nd  Edition,

           Tata McGraw-Hill Publishing Co. Ltd.

      vi. Z. Xiang and R.A. Plastock,2002, Computer Graphics, Schaum’s  Outline Series,

           Tata McGraw-Hill  Publishing Co.