Dayananda Sagar Academy of Technology & Management

(Autonomous Institute under VTU)

Semester : IV

Course Title : Object Oriented Programming with JAVA

Course Code : BIC403

Course Type Integrated

:
(Theory/ Practical/ Integrated)
Category : IPCC

Stream : CSE-ICB CIE : 50

Teaching hours/ week (L:T:P:S) : 3:0:2:0 SEE : 50

Total Hours : 40 Hours of Theory+ 20 SEE : 3 Hours

Hours of Practical Classes
Duratio
Credits : 04
n
Course Learning Objectives: Students will be able to:
Sl. No Course Objectives
1 Learn fundamental features of object oriented language and JAVA
2 Set up Java JDK environment to create, debug and run simple Java programs.
3 Learn object oriented concepts using programming examples.
4 Study the concepts of importing of packages and exception handling mechanism.

Teaching-Learning Process
Pedagogical Initiatives:
Some sample strategies to accelerate the attainment of various course outcomes are listed below:
 Adopt different teaching methods to attain the course outcomes.
 Include videos to demonstrate various concepts in C.
 Encourage collaborative (Group) Learning to encourage team building.
 Ask at least three HOTS (Higher-order Thinking Skills) module-wise questions to promote critical
thinking.
 Adopt Problem-Based Learning (PBL), which fosters students’ analytical skills, and develops thinking
skills such as evaluating, generalizing, and analyzing information rather than simply recalling it.
 Show different ways to solve a problem and encourage the students to come up with creative and optimal
solutions.
 Discuss various case studies to map with real-world scenarios and improve the understanding.
 Devise innovative pedagogy to improve Teaching-Learning Process (TLP).
 Scheme of Teaching and Examinations for BE Programme -2024-25
Outcome Based Education and Choice Based Credit System (CBCS)
(Effective from the Academic Year 2024-25)
DSATM
COURSE CURRICULUM
Module Topics Hours
No.
An Overview of Java: Object-Oriented Programming, A First Simple Program, A
Second Short Program, Two Control Statements, Using Blocks of Code, Lexical
1
Issues, The Java Class Libraries, Data Types, Variables, and Arrays: Java Is a
Strongly Typed Language, The Primitive Types, Integers, Floating-Point Types, 8 Hours
Characters, Booleans, A Closer Look at Literals, Variables, Type Conversion and
Casting, Automatic Type Promotion in Expressions, Arrays, A Few Words About
Strings.
Text book 1: Ch 2, Ch 3
Pedagogy Think Pair and Share
Operators: Arithmetic Operators, The Bitwise Operators, Relational Operators,
Boolean Logical Operators, The Assignment Operator, The ? Operator, Operator 8 Hours
Precedence, Using Parentheses, Control Statements: Java‟s Selection Statements,
2 Iteration Statements, Jump Statements.
Text book 1: Ch 4, Ch 5
Pedagogy Problem Solving
Introducing Classes: Class Fundamentals, Declaring Objects, Assigning Object
Reference Variables, Introducing Methods, Constructors, The this Keyword,
Garbage Collection, The finalize( ) Method, A Stack Class, A Closer Look at 8 Hours
3 Methods and Classes: Overloading Methods, Using Objects as Parameters, A
Closer Look at Argument Passing, Returning Objects, Recursion, Introducing
Access Control, Understanding static, Introducing final, Arrays Revisited
Text book 1: Ch 6, Ch 7 ( 7.1-7.9 )
Pedagogy Think Pair and Share
Inheritance: Inheritance, Using super, Creating a Multilevel Hierarchy, When
Constructors Are Called, Method Overriding, Dynamic Method Dispatch, Using 8 Hours
Abstract Classes, Using final with Inheritance, The Object Class.
4 Text book 1: Ch 8.

Pedagogy Problem Solving

Packages and Interfaces: Packages, Access Protection, Importing Packages,
Interfaces, Exception Handling: Exception-Handling Fundamentals, Exception
5
Types, Uncaught Exceptions, Using try and catch, Multiple catch Clauses, Nested
try Statements, throw, throws, finally, Java‟s Built-in Exceptions, Creating Your 8 Hours
Own Exception Subclasses, Chained Exceptions, Using Exceptions.
Text book 1: Ch 9, Ch 10
Case Studies

Pedagogical Initiatives (Not limited to):

 Think Pair and Share (Blended Learning): provides an opportunity for students to learn from
 one another
 Problem Solving: encourages cognitive thinking and enables creative problem solving
 Poster Presentation: allows students to represent the concepts visually in order to
understand the topics easily.
 Case studies: maps different domains in real time applications
 Demonstration: exhibits the implementation process

List of Programs:

Sl. No. Experiments/Programs COs

1 Write a JAVA program that prints all real solutions to the quadratic equation 5
ax2+bx+c=0. Read in a, b, c and use the quadratic formula.
2 Write a JAVAprogram for multiplication of two arrays. 5
3 Demonstrate the following operations and sign extension with Java programs (i) << 5
(ii) >> (iii) >>>
4 Write aJAVA program to sort list of elements in ascending and descending order 5
5 Create a JAVA class called Student with the following details as variables within it. 5
USN NAME BRANCH PHONE PERCENTAGE Write a JAVA program to create n
Student objects and print the USN, Name, Branch, Phone, and percentage of these
objects with suitable headings.
6 Write a JAVA program demonstrating Method overloading and Constructor 5
overloading.
7 Design a super class called Staff with details as StaffId, Name, Phone, Salary. 5
Extend this class by writing three subclasses namely Teaching (domain,
publications), Technical (skills), and Contract (period). Write a JAVA program to
read and display at least 3 staff objects of all three categories.
8 Demonstrate dynamic dispatch using abstract class in JAVA. 5
9 Create two packages P1 and P2. In package P1, create class A, class B inherited 5
from A, class C . In package P2, create class D inherited from class A in package P1
and class E. Demonstrate working of access modifiers (private, public, protected,
default) in all these classes using JAVA
10 Write a JAVA program to read two integers a and b. Compute a/b and print, when b 5
is not zero. Raise an exception when b is equal to zero. Also demonstrate working
of ArrayIndexOutOfBoundException.
Note : Open ended questions to be farmed by faculty incharge

Text Books
Sl. No. Title of the Book/Name of the author/Name of the publisher/Edition and Year
 1 Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, Fundamentals of Data Structures in C, 2nd
Ed, Universities Press, 2014
2 Introduction to the Design and Analysis of Algorithms, By Anany Levitin, 3rd Edition (Indian), 2017,
Pearson
Reference Books

1
Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1 st Ed, McGraw Hill, 2014.
2 Gilberg & Forouzan, Data Structures: A Pseudo-code approach with C, 2 nd Ed, Cengage Learning,
2014.
3 Computer Algorithms/C++, Ellis Horowitz, SatrajSahni and Rajasekaran, 2nd Edition, 2014,
Universities Press.
4 Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein,
3rd Edition, PHI.

Course Outcomes: At the end of the course, the student will be able to:

RBT Level
CO Course Outcomes RBT
Indicator
Level
CO Explain different data structures and their applications L2 Understan
1 d
CO Apply the knowledge to solve Arrays, Stacks, Queue, Linked List, and
L3 Apply
2 Tree data structures related problems
CO Apply various problem solving methodologies such as brute force, divide
L3 Apply
3 and conquer, greedy, decrease and conquer, dynamic programming and
CO backtracking
Analyze the approach
efficiency toofsolve a givendesign
algorithm problem.
approaches in a problem
L4 Analyze
4 specific manner in terms of space and time complexity.
CO Develop solutions to problems by experimenting the various Algorithm
L3 Apply
5 techniques using relevant Data Structures.