SECOND YEAR SYALLABUS

FOR THE STUDENTS ADMITTED FROM 2011-2012 ONWARDS

SEMESTER – III

CORE 7 :  Data Structures And Algorithms

Program Code           : BCAAA                                           Course Code  : 3C1

Credits                        : 4                                                        Max Marks    : 75

Contact Hrs               : 6 Hours per week

Subject Description: This subject deals with the various concepts of data structures.

Goal: To learn data structure concepts and algorithms.

Objective: On successful completion of this subject the students should have understood data structures concepts like  Stacks, Queues, List, Searching and Sorting algorithms etc.,

UNIT - I: Introduction – Overview – How to Create Programs Analyze them. Arrays – Structure – Ordered Lists – Representation of Arrays – Simple Applications.

UNIT - II: Stacks and Queues – Fundamentals – Structure – Operations – Multiple Stacks and Queues. Stack Applications: Evaluation of Expressions, Mazing Problem – Queue Application: Time Sharing.

UNIT- III: Linked lists: Singly Linked Lists – Linked Stacks and Queues – The Storage Pool – Applications: Polynomial Addition, Sparse Matrices. Doubly Linked Lists: Dynamic Storage Management – Garbage Collection and Compaction.

UNIT - IV: Trees: Basic Terminology – Binary Trees – Binary Tree Representation – Binary Tree Traversal – More on Binary Tree – Threaded Binary Trees – Binary Tree Representation of Trees – Application of Tree: Decision Trees. Symbol Tables – Static Tree – Dynamic Tree – Hash Tables: Hashing Functions Overflow Handling.

UNIT- V: Internal Sorting: Searching – Insertion Sort – Quick Sort – Two way Merge Sort – Heap Sort – Radix Sort: Files – Queries and Sequential Organizations – File Organizations – Sequential, Random, Linked Organizations, Inverted Files, Cellular Partitions.

TEXT BOOKS:

1. Ellis Horowitz and Sartaj Sahani, “Fundamentals of Data Structure”, Galgotia book source, 1999.

REFERENCE BOOKS:

1. Samanta, D. “Classic Data structure”, Prentice- Hall of India Pvt Ltd, 9^th  edition, 2007.

2. Trembly & Sorenson, “Data Structures with Applications, Tata McGraw Hill Company, 2nd Edition, 1991 (only for Queue application).

FOR THE STUDENTS ADMITTED FROM 2011-2012 ONWARDS

SEMESTER – III

CORE 8 :  Object Oriented Programming with C++

Program Code           : BCAAA                                           Course Code  : 3C2

Credits                        : 4                                                        Max Marks    : 75

Contact Hrs   : Hours per week

Subject Description: This subject deals with Object–oriented programming concepts like Abstraction, Encapsulation, Inheritance and Polymorphism.

Goal: Knowledge on Object–oriented concept and programming with C++.

Objective: To inculcate knowledge on Object-oriented programming concepts using C++.

UNIT-I: Introduction to C++ - key concepts of Object-Oriented Programming –Advantages –  Object  Oriented  Languages  –  I/O  in  C++  -  C++  Declarations.  Control Structures:  Decision Making and  Statements  :  If , If ...  Else, jump,  go to,  break,  continue,  Switch  case statements -  Loops in C++ : For, While, Do -  Functions in C++ - Inline functions – Function  Overloading.

 UNIT-II  :  Classes   and Objects  :  Declaring  Objects  –  Defining  Member  Functions  –  Static Member variables and functions – array of objects –friend functions – Overloading member functions – Bit fields and classes – Constructor and destructor with static members. 

UNIT-III : Operator Overloading: Overloading unary, binary operators – Overloading Friend functions – type  conversion  –  Inheritance:  Types  of  Inheritance  –  Single,  Multilevel,  Multiple, Hierarchal, Hybrid, Multi path inheritance – Virtual base Classes – Abstract Classes.

UNIT-IV: Pointers – Declaration – Pointer to Class , Object – this pointer – Pointers to derived classes and Base classes – Arrays – Characteristics – array of classes – Memory models – new and delete operators – dynamic object – Binding , Polymorphism and Virtual Functions.

UNIT-V: Files – File stream classes – file modes – Sequential Read / Write  operations  – Binary and ASCII  Files  –  Random  Access  Operation  –  Templates  –  Exception    Handling  -  String  – Declaring and Initializing string objects – String Attributes – Miscellaneous functions .

TEXT BOOKS:

1.    Ashok  N  Kamthane  ,   “Object-Oriented  Programming    With  Ansi  And Turbo C++”, Pearson Education publication. 2003.

REFERENCE BOOKS:

1.E. Balagurusamy,  “Object-Oriented  Programming    With  C++”,  Tata  McGraw Hill Publication, 1998.  

2. Maria Litvin & Gray Litvin , “C++ for you”, Vikas publication, 2002.

FOR THE STUDENTS ADMITTED FROM 2011-2012 ONWARDS

SEMESTER – III       

CORE 9: Programming Lab –Data Structures Using  C++

Program Code           : BCAAA                                           Course Code              : 3CP

Credits                        : 4                                                        Max Marks                : 75

Contact Hrs               : 6 Hours per week

1. Write  a  C++  Program  to  create  a  class  ARITHMETIC  which  consists  of  a  FLOAT  and an INTEGER variable. Write a Member function ADD (),SUB(),MUL(),DIV() to perform addition,  subtraction,  multiplication,  division  respectively.  Write a member function to get and display values.

2. Write a program to use bit fields with classes and display the content of the bit fields

3.Write a program to perform  Addition of two objects and store the result in third object. Display content of all three objects.

4. Write a C++ program to create a class string.  Write a member function to Initialize, get and display stings.  Overload the operator “+” to concatenate two Strings, “= =” to compare two strings

5. Write a program to display name, roll no and grade of the students who have appeared in an examination, declare a class of name, roll no and grade. Create an array of class object. Read and display the content of the array.

6. Write a C++ program to check whether the given string is a palindrome or not using Pointers.

7. Write a C++ program to experiment the operation of STACK using array implementation.

8. Write a C++ program to create menu driven program to implement QUEUE to perform the

     following:

a.       Insertion

b.      Deletion

c.       Modification

d.      Listing of elements

9. Write a C++ program to create LINKED LIST representation of employee records and do

    the following operations using pointers:

a.       To add a new record

b.      To delete an existing record

c.       To print the information about an employee

d.      To find the number of employees in the structure.

10. Write a C++ program to insert an element at the end of the linked list.

11. Write a C++ program to demonstrate Binary search.

12. Write a C++ program to arrange a set of numbers in ascending order using QUICK-SORT.

FOR THE STUDENTS ADMITTED FROM 2011-2012 ONWARDS

SEMESTER – IV       

CORE 10: Operating System

Program Code           : BCAAA                                           Course Code              : 4C1

Credits                        : 4                                                        Max Marks                : 75

Contact Hrs               : 6 Hours per week

Subject Description: This subject deals Operating Systems concepts and Information, Process and Memory Managements. Also it deals with advanced topics like Distributed processing, Remote Procedure call and Clusters.

Goal: Knowledge on Operating system and how it controls the information and hardware.

Objective: To inculcate knowledge on OS concepts and functioning of modern OS.

UNIT I: Introduction: What is OS -History of  OS -The OS Zoo- OS Concepts: Processes-Deadlocks-Memory Management-I/O-Files-Security-The Shell. OS Structure-Monolithic Systems- Layered Systems- Virtual Machines- Exo Kernels-Client Server Models .Processes: The Process Model-Process Creation-Process Termination-Process States. Threads: The Thread Model-Thread Usage-Implementing Threads In User Space & Kernel Space

UNIT II: Interprocess Communication: Race Condition-Critical Regions-Mutual Exclusion With Busy Waiting-Sleep & Wakeup-Semaphores-Message Passing- Mutexes-Monitors-Barriers. Classical IPC Problems: The Dining Philosophers Problems-The Readers and Writers Problem- The Sleeping Barber Problem

UNIT III: Deadlocks: Introduction, Deadlock Detection And Recovery: Deadlock Detection With One Resource of Each Type- Deadlock Detection With Multiple Resource of Each Type-Recovery From Deadlock. Deadlock Avoidance: Bankers Algorithm for Single Resource, Bankers Algorithm for Multiple Resources. Deadlock Prevention: Attacking the Mutual Exclusion Condition-Attacking the Hold and Wait Condition-Attacking the No Preemption-Attacking the Circular Wait Condition.

UNIT IV: Memory Management: Virtual Memory-Paging-Page Tables-Page Replacement Algorithm: The Optimal Page Replacement Algorithm-The Not Recently Used Page Replacement Algorithm- The First In First Out-The Second Chance Page Replacement Algorithm-The Clock Page Replacement Algorithm-The Least Recently Used. Input/output: Principles of I/O Hardware: I/O Devices-Interrupt Handlers

UNIT V: File Systems: Files: File Naming- File Structure-File Types—File Attributes-File Operation. Directories: Single Level Directory Systems-Two Level Directory Systems-Hierarchical Directory Systems. Security: The Security Environment-Basics Of Cryptography-Attacks: Trojan Horses-Login Spooling-Virus Damage Scenarios-Antivirus And Anti Antivirus Technique

TEXT BOOK

1. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2003.

REFERENCE BOOK

1. Harvey M. Deitel, “Operating Systems”, Second Edition, Pearson Education Pvt. Ltd, 2002.

2.Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 6^th Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.

   

FOR THE STUDENTS ADMITTED FROM 2011-2012 ONWARDS

SEMESTER – IV       

CORE 11 : Java  Programming

Program Code           : BCAAA                                           Course Code  : 5C1

Credits                        : 4                                                        Max Marks                : 75

Contact Hrs   : 5 Hours per week

Subject Description:  This subject deals with Java Programming concepts.

Goal: Enable to create wide range of Applications and Applets using Java.

Objective: To inculcate knowledge on Java Programming concepts

UNIT - I: Introduction  to Object –Oriented Programming – The Java Language -  Variable declarations and Arrays-Operators in Java  -Control Statements: An Introduction-Selection Constructs-Iteration Constructs-  Jump Constructs. Introduction to Classes: Instance variables- Class variables-Instance Methods-Constructors –Class Methods-Declaring Objects-Garbage Collection.

UNIT - II: Classes and Methods in detail: Method Overloading-Constructor Overloading –The this reference –Using Objects in Method-Recursion – Access Modifiers- Inner Classes –Command Line Arguments. Inheritance: Basics of Inheritance –Super Class Variable and Subclass Object -The Super reference-Constructor chaining –Method overriding –The final keyword. Abstract Classes and Interfaces: Extending Interface-Interface Reference. Exception Handling: Types of Exceptions –Uncaught Exceptions-Handling Exceptions-User Defined Exceptions.

UNIT - III: Multithreaded Programming: Concept of Threads –Thread Creations-Thread’s Life Cycle-Thread Scheduling – Synchronization and Deadlock- Inter-Thread Communication. Packages and Access Modifiers: Packages-An Introduction –The Package Declaration-The Import Statements –Illustration Package –The Java Language Packages. Handling Strings:  Creating Strings – Operations on Strings - Character Extractor Methods-String Comparison Methods.

UNIT - IV: Input Output Classes: Input and Output Operations – Hierarchy of classes in java .io Package – File Class-InputStream and OutputStream Classes –FileInputStream and FilterOutputStream Classes- Reader and Writer Classes-Random Access File Class-Stream Tokenizes. Applets: Applets Basics –Applet Life Cycle-Running Applets- Methods of the Applets Class –Font Class-Font Metrics Class.

UNIT V: Abstract Windowing Toolkit-AWT Classes –Hierarchy of Classes- Control Fundamentals-Component Class-Basic Component Classes –Various Container Classes-Frame Window in an Applet –Menus. Layout Management and Event Handling: Layout Management Policies-Standard Layout Managers-Handling Event Listener Interfaces-Adapter Classes.

TEXT BOOK:

1. Instructional Software Research and Development (ISRD) Group, ”Introduction to Object Oriented Programming through Java”, Tata McGraw-Hill Publishing Company Limited, New Delhi, 2007.

REFERENCE BOOK:

1. E.BalaGurusamy, ”Programming  with  JAVA –A Primer”, Tata McGraw-Hill Publishing Company Limited ,Third Edition,2007.

2. John R. Hubbard, “ Schaum’s Outline of Programming with Java”, Tata McGraw-Hill Publishing Company Limited ,Second Edition,2007.                             

FOR THE STUDENTS ADMITTED FROM 2011-2012 ONWARDS

SEMESTER – IV       

Core 12: Programming Lab-Java

Program Code           : BCAAA                                           Course Code              : 4CP

Credits                        : 4                                                        Max Marks                : 75

Contact Hrs   : 5 Hours per week

1.      Program to generate a Pascal Triangle

2.      Program for roots of a Quadratic Equation

3.      Program for merging two sorted arrays

4.      Program for counting letter frequencies in a given string

5.      Program for Multithreading

6.      Program for preparing Mark list using inheritance

7.      Program for Multiple inheritance

8.      Program for creating your own package

9.      Program that counts the number of lines , words and characters in given text file

10.  Program that right-justifies a text file

11.  Program that display a digitals clock using applet

12.  Program that  generate a human face using applet

13.  Create an applet containing three button labeled red, green and blue. Depending on the button pressed; the background color of the applet should change.

14.  Create an applet that accepts two numbers in two text fields. Add a Button labeled “equals” which when pressed should add the two numbers and display the result in the third text field.