syllabus bsc II year

B.Sc.(Computer Science): II Year

THEORY PAPER - II

Object Oriented Programming with Java and Data Structures.

Unit - 1: Java Fundamentals 

Fundamentals of Object Oriented programming : Object Oriented paradigm - Basic concepts of Object Oriented Programming - Benefits of OOP - Applications of OOP

Java Evolution : Java Features - How Java differs from C and C++ - Java and Internet - Java and World Wide Web - Web Browsers - Hardware and Software Requirements - Java Environment. Overview of Java Language: Simple Java Program - Java Program Structure - Java Tokens- Java Statements - Implementing a Java Program - Java Virtual Machine - Command Line Arguments

Constants, Variables and Data types: Constants - Variables - Data types - Declaration of Variables-Giving Values to variables- Scope of Variables-Symbolic Constants-Type Casting

(Chapters : 1,2,3,4

Unit - 2: OOPS Concepts in Java 

Operators and Expressions: Arithmetic Operators - Relational Operators- Logical Operators - Assignment Operators - Increment and Decrement Operators - Conditional Operators - Bitwise Operators - Special Operators - Arithmetic Expressions - Evaluation of Expressions - Precedence of Arithmetic Operators - Operator Precedence and Associativity

Decision Making and Branching: Decision Making with If statement - Simple If Statement-If else Statement-Nesting If Else Statement- the ElseIf Ladder-The switch Statement - The ?: operator.

Decision Making and Looping: The while statement - The do statement - The for statement - Jumps in Loops

Class , Objects and Methods: Defining a Class - Fields Declaration - Methods Declaration - Creating Objects - Accessing class members - Constructors - Methods Overloading - Static Members - Nesting of Methods - Inheritance - Overriding Methods - Final Variables and Methods - Final Classes - Abstract Methods and Classes - Visibility Control

(Chapters : 5,6,7,8

Unit - 3: Packages and Interfaces in Java 

Arrays, Strings and Vectors: One-dimensional Arrays-creating an Array - Two dimensional Arrays - Strings - Vectors - Wrapper Classes - Enumerated Types

Interfaces: Multiple Inheritance : Defining Interfaces - Extending Interfaces - Implementing Interfaces - Accessing Interface Variables

Packages: Java API Packages - Using system Packages - Naming Conventions - Creating Packages - Accessing a Package - Using a Package - Adding a Class to a Package - Hiding Classes - Static Import

(CHAPTERS : 9,10,11

UNIT - 4: Multithreaded programming and Applets. 

Multithreaded Programming: Creating Threads - Extending the Thread Class - Stopping and Blocking a Thread - Life Cycle of a Thread - Using Thread Methods - Thread Exceptions - Thread Priority - Synchronization

Managing Errors and Exceptions: Types of Errors - Exceptions - Syntax of Exception Handling Code - Multiple Catch Statements - Using Finally Statement - Throwing our own Exceptions - Using Exceptions for debugging

Applet Programming: How Applets differ from Applications - Preparing to write Applets - Building Applet Code - Applet Life Cycle - Creating an executable Applet - Designing a WebPage - Applet Tag - Adding Applet to HTML file - Running the Applet - More about Applet Tag - Passing parameters to Applets - Aligning the display - More about HTML tags - Displaying Numerical Values - Getting Input from the user

(Chapters : 12, 13, 14

Unit - 5: Data Structures 

Sorting: Bubble Sort - Selection Sort - Insertion Sort - Quick Sort-Stacks and Queues: Stacks - Queues - Circular Queue - Deques - Priority Queue - Parsing Arithmetic Expressions - Linked List: Simple Linked List - Finding and Deleting Specified Links - Double Ended Lists - Abstract Data types - Sorted Lists - Doubly Linked Lists - Advanced Sorting : Quick Sort - Binary Trees : Tree Terminology - Finding a Node - Inserting a Node - Traversing the Tree - Finding Maximum and Minimum values - Deleting a Node - Efficiency of Binary Trees - Trees Represented as Arrays - Graphs: Introduction to Graphs - Searches - Minimum Spanning Tree - Topological Sorting with Directed Graphs - Connectivity in Directed Graphs

(Chapters : 3,4,5,7 (Only Quick Sort), 8,13

Prescribed books :

1. E.Balaguruswamy, Programming with Java, A primer, 3e, TATA McGraw-Hill Company (2008).(Chapters : 1 to 14

2. Robert Lafore, Data Structures & Algorithms in Java, Second Edition, Pearson Education(2008

(Chapters: 3,4,5,7 (Only Quick Sort),8,13

Reference Books :

1. John R. Hubbard, Programming with Java, Second Edition, Schaum’s outline Series, Tata McGrawhill (2007)

2. Timothy Budd, Understanding Object Oriented Programming with Java, Pearson Education (2007)

3. Adam Drozdek, Data Structures and Algorithms in Java, Second Edition, Cengage Learning(2008)

4. John R. Hubbard, Anita Hurry, Data Structures with Java, Pearson Education (2008)

5. Jana, Java and Object Oriented Programming Paradigm, PHI (2007)

6. Deitel & Deitel. Java TM: How to Program, 7th Edition, PHI (2008)

7. Samatha, Classic Data Structures, PHI (2005)