DAYANANDA SAGAR COLLEGE OF ENGINEERING

An Autonomous Institute Affiliated to VTU, Belagavi Approved by AICTE ; ISO 9001:2015 Certified
Accredited by National Assessment Accreditation Council (NAAC) with ‘A’ grade
Shavige Malleshwara Hills, Kumaraswamy Layout, Bengaluru-560078

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHEME & SYLLABUS-2019
III SEMESTER
Sl. Teaching Teaching
Course Code Course Title Examination Credits
No Department Hours/Week
L T P CIE SEE Total
Discrete
1 19CS3DCDMS Mathematical MAT 3 0 0 50 50 100 3
Structures
Data Structures
2 19CS3DCDSA with CSE 4 0 0 50 50 100 4
Applications
Object oriented
3 19CS3DCOPJ programming CSE 3 0 0 50 50 100 3
with Java
Automata
Theory and
4 19CS3DCAFL CSE 3 0 0 50 50 100 3
Formal
Languages
Computer
5 19CS3DCCOG CSE 3 0 0 50 50 100 3
Organization
6 19CS3DCLDN Logic Design CSE 3 0 0 50 50 100 3
Data Structures
7 19CS3DLDSL Laboratory with CSE 0 2 2 50 50 100 2
Applications
Java
Programming
8 19CS3DLJPL CSE 0 2 2 50 50 100 2
Laboratory with
Mini-Project
19HS3ICKAN/
9 Kannada /CIPH HSS 1 0 0 50 -- 50 1
19HSS3ICCIP
Total 20 04 04 450 400 850 24

Course prescribed to lateral entry Diploma holders admitted to III Semester of Engineering Programs
10 19MA3IMMAT Advance MAT 4 0 0 50 -- 50 0
Mathematics-I
a) The mandatory non – credit courses Advance Mathematics- I and II prescribed at III and IV semesters
respectively, to lateral entry Diploma holders admitted to III semester of BE/B.Tech programs shall
compulsorily be registered during respective semesters to complete all the formalities of the course
and appear for examination.
b) The mandatory non – credit courses Advance Mathematics I and II, prescribed to lateral entrant
Diploma holders admitted to III semester of BE/B.Tech programs, are to be completed to secure
eligibility to VII semester. However, they are not considered for vertical progression from II year to
III year of the programme.
 DISCRETE MATHEMATICAL STRUCTURES

Course code: 19CS3DCDMS Credits: 03

L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:
1. Analyze Mathematical Logic using truth tables, laws of logic, Rules of Inference and
Proofs.
2. Explain Fundamentals of Sets, Functions, and Relations. Understanding more abstract
view of algebraic structures.
3. Using graphs to model almost every conceivable discipline.

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

Comprehend the fundamentals of logic can be applied for applications like switching
CO1
networks.

Understand and apply various concepts of set theory, functions and relations for solving
CO2
computing problems.

Generate groups under specific conditions and symmetry using group theory.
CO3
Understand the major concrete models of Boolean algebra.

Develop the concept of matrix representation of graphs with understanding of paths and
CO4
walks and Boolean concepts.

CO5 Understand the concept of tress and lattices and use the same for Graph colouring.

Module Contents of the Module Hours CO’S

Propositional Logic and Counting Theory
1 Fundamentals of Logic: Basic Connectives and Truth Tables,
Logic Equivalence – The Laws of Logic, Logical Implication
– Rules of Inference Quantifiers, Definitions and Methods of
Proof and disproof . 08 CO1
Counting Theory: The basics of counting, the pigeonhole
principle, permutations and combinations, recurrence
relations, solving recurrence relations, generating functions,
inclusion-exclusion principle, application of inclusion-
exclusion
Sets, Relations and Functions
2 Inductive definition and properties of sets, functions and
relations, representation of relations by graphs, Inductive
definition of functions partition functions-mappings, injection 08 CO2
and surjection, composition of functions, inverse functions,
properties of relations, equivalence relations. Boolean Algebra.
 Algebraic Structures
3 Rings- Inductive definition, properties, matrix rings, subrings,
Fields- Isomorphism, homomorphism, Groups- Inductive 08 CO3
definition, properties, subgroups, normal subgroups,
homomorphism of groups.
Graph Theory I
4 Graph and their basic properties -
degree,walk,path,cycle,subgraph,isomorphism,,degree,walk,pa 08 CO4
th,cycle,subgraph,isomorphism, bipartite graph, Eulerian walk,
Hamiltonian walk, graph coloring, planar graph.

Graph Theory II
5 Trees, spanning trees, Lattices, principle of duality, algebraic
system defined by lattices, Boolean lattices, Boolean algebra. 08 CO5
Application of Graphs in solving problems of organizing data,
data retrieval times, finding shortest path and other problems of
practical use.

Text Books:

Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, 5th Edition, Pearson,

Education, 2004.

Reference Books:

1. Kenneth H. Rosen: Discrete Mathematics and its Applications, 7th Edition, McGraw
Hill, 2010.
2. Jayant Ganguly: A Treatise on Discrete Mathematical Structures, Sanguine-Pearson,
2010.
3. D.S. Malik and M.K. Sen: Discrete Mathematical Structures: Theory and Applications,
Cengage Learning, 2004.
4. J. P. Tremblay and R.Manohar: Discrete Mathematical Structures with Applications to
Computer Science, Tata McGraw-Hill edition.
5. Thomas Koshy: Discrete Mathematics with Applications, Elsevier, 2005, Reprint 2008.
 DATA STRUCTURES WITH APPLICATIONS

Course code:19CS3DCDSA Credits: 04

L: P: T: S: 4:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 50

Course objectives:
1. Explain fundamentals of data structures and their applications essential for
programming / problem solving
2. Analyse Linear Data Structures: Stack, Queues, Lists
3. Analyse Non-Linear Data Structures: Trees, Graphs
4. Assess appropriate data structure during program development / problem solving

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

CO1 Apply the concept of data structures to solve problems

CO2 Develop applications using stacks and queues
CO3 Analyze and implement operations on linked lists and demonstrate their applications.
Demonstrate the implementation of various types of Binary Search Trees and their
CO4
traversals order.
CO5 Perform various operations on tree, AVL tree & RB tree
Ability to conduct practical experiment for demonstrating the operation using data
CO6
structures

Module Contents of the Module Hours

1. Basic Concepts: Introduction to Data Structure and its classification, the
need for Data structure, Algorithm specification, performance analysis 10
& measurements, Sparse Matrices.

2. Stacks And Queues: Introduction to Stacks, Stacks Using Dynamic

Arrays, Conversion of Infix expression to Postfix expression, Evaluation
of Postfix Expressions, Introduction to Queues, Types of Queue: 10
Ordinary queue, Circular Queues & Double ended queue, Application of
stacks and Queues.

3. Linked Lists: Definition of Linked lists and Chains, Types of Linked

List: Singly Linked List, Circular Singly Linked List, Doubly Linked 10
Lists & Circular doubly linked list, Application of Linked List.

4. Trees: Introduction to Binary Trees, Properties of Binary Tree,

Operation on Binary Tree, Traversals in Binary Trees, Binary Search 10
Tree, Expression Trees, Heaps.

5. Efficient Binary Search Trees: Optimal Binary Search Trees, AVL

Trees, Properties of AVL tree, Construction of AVL tree, Red-Black 10
Trees, Properties of red black tree, Construction of red black tree.
Text Book:
1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd Edition,
Universities Press, 2007.

Reference Books:

1. Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and C++, 2nd Edition,
Pearson Education, 2003.
2. Richard F. Gilberg and Behrouz A. Forouzan: Data Structures A Pseudocode
Approach with C, Cengage Learning, 2005.
3. A.M Padma Reddy,” Approach of Data Structures”, Person Publication, 5th Edition,
2015.
 OBJECT ORIENTED PROGRAMMING WITH JAVA

Course code: 19CS3DCOPJ Credits: 03

L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:
1. Understand fundamentals of object-oriented programming in Java.
2. Gain knowledge on working of Packages, Interfaces & Files in Java
3. Understand the importance of Generic classes, Strings and Multithreaded
Programming.

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

CO1 Demonstrate the Object Orientated Principles and Approach in programming.

CO2 Design and Implement programs using Classes, Objects and Constructors.
CO3 Apply the concept of polymorphism and exception handling in programming.
CO4 Implement Multithreading feature of Java.
CO5 Implement Generics Classes and use String methods in Programs.
CO6 Design and develop applications in Java using OOPs Principles.

Module Contents of the Module Hours COs

1. Overview of Java: Creation of Java, How Java changed the
Internet, Byte code, Buzzwords, Object Oriented Programming, A
simple program, arrays, the for loop, lexical issues CO1
Introducing Classes: Class fundamentals, declaring Objects, 10 &
assigning object reference variables, introducing methods, CO2
constructors, this keyword, garbage collection, the finalize()
method.

2. A Closer Look at Methods and Classes: Overloading methods &

Constructors, using objects as parameters, a closer look at
argument passing, returning objects, recursion, introducing access
control, understanding static, introducing final, nested and inner
classes, using command line arguments 10 CO3
Inheritance: inheritance basics, using super, creating multilevel
hierarchy, when constructors are called, method overriding,
dynamic method dispatch, using abstract classes, using final with
inheritance.

3. Packages & Interfaces: Defining a package, Access protection;

importing packages. Interfaces: Defining an Interface,
7 CO3
Implementing Interface, Nested Interface, Applying interfaces,
Variables in interfaces.
 Exception Handling: Fundamentals, Exception types, uncaught
exceptions, using try and catch, nested try statements, throw,
throws, finally, Java’s built in Exceptions.

4. Multithreaded Programming: Java thread model, main thread,

creating a thread, creating multiple threads, using isAlive() and
join(),thread priorities, suspending, resuming thread. 7 CO4
Input/Output: I/O Basics, Reading Console Input, Writing
Console Output, Reading and Writing files.

5. Generics: What are Generics? A Simple Generics Example, A

generics Class with two type parameters, The General form of a
Generic Class, creating a generic method.
String handling: String Constructors, String Length, Special string 6 CO5
operators, character extraction, string comparison, string
modification, changing the case of characters within the string,
additional string methods, String Buffer.

Text Books:
1. Herbert Schildt: Java The Complete Reference, 7th Edition, Tata McGraw Hill, 2007
Reference Books:
1. Y. Daniel Liang: Introduction to JAVA Programming, 6th Ed, Pearson Education, 2007.
2. Kathy Sierra and Bert Bates: Head First Java, 2nd Edition, O' Reilly.
3. Understanding OOP with Java, updated edition, T. Budd, pearson product
 AUTOMATA THEORY AND FORMAL LANGUAGES

Course code: 19CS4DCAFL Credits: 03

L: P: T: S: 3: 0: 0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:

1. Introduce principles and applications of Automata theory.

2. Cover basic concepts of Regular Expressions, Pushdown Automata and Context Free
Grammar.
3. Explain concepts related to turing machines and Undecidability.

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

CO1 Analyze problems using principles of Automata theory.

CO2 Design finite automata, regular expressions and context-free grammars accepting
certain language and to apply these concepts in solving problems of various software
and hardware designs.
CO3 Apply transformation between equivalent deterministic and non-deterministic finite
automata, and regular expressions.
CO4 Determine whether a given language is context-free language or not by contradiction.
CO5 Design Pushdown automata for a given language
CO6 Design Turing machine for a given language

Module Contents of the Module Hours CO’s

Introduction To Finite Automata: Introduction to Finite

Automata; The central concepts of Automata theory;
Deterministic Finite Automata (DFA); Nondeterministic
1 Finite Automata (NFA); Nondeterministic Finite Automata CO1 &
10
with Epsilon-transitions (ε – NFA).Equivalent Automata: CO2
Conversion from NFA to DFA, Conversion from ε- NFA to
DFA

Regular Expressions(RE) and Languages: Introduction to

Regular Expressions; Finite Automata and regular
2 expression, Regular languages; Proving languages not to be CO2 &
8
regular languages; Closure properties of regular languages, CO3
Equivalence and minimization of automata.
 Context-Free Grammars and Languages: Types of
Grammar, Context–free grammars; Parse trees; Ambiguity
3 in grammars and Languages, Properties of Context-Free 8 CO3,CO4
Languages: Normal forms for CFGs; The pumping
lemma for CFGs;

Pushdown Automata: Definition of the Pushdown automata;

4 The languages of a PDA; Deterministic Pushdown CO5
7
Automata., Equivalence of PDA’s and CFG’s.

Introduction To Turing Machine: Problems that Computers

cannot solve; The turning machine; Programming
5
techniques for Turning Machines; Extensions to the basic 7 CO6
Turning Machines; Turing Machine and Computers.

Text Books:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata
Theory, Languages and Computation, 3rd Edition, Pearson Education,
2007.(Chapters: 1.1, 1.5, 2.2 to 2.5, 3.1 to 3.3, 4, 5, 6, 7, 8.1 to 8.4, 8.6, 9.1, 9.2,
9.4.1, 9.5)

Reference Books:
1. K.L.P. Mishra: Theory of Computer Science, Automata, Languages, and Computation,
3rd Edition, PHI, 2007.
2. Raymond Greenlaw, H.James Hoover: Fundamentals of the Theory of Computation,
Principles and Practice, Morgan Kaufmann, 1998.
3. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition, Tata
McGraw-Hill, 2007.
4. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science, Languages
and Machines, 3rd Edition, Pearson Education, 2006.
 COMPUTER ORGANIZATION

Course code: 19CS3DCCOG Credits: 03

L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:
1. Understand the basics of computer organization, structure and operation of computers
and their peripherals.
2. Expose students to the basic architecture of processing, memory and I/O organization in
a computer system.
3. Understand the basic principles on which computers work, analyze their performance
and appreciate the issues affecting modern processors.
4. Learn different types of addressing modes and memory organization.
5. Understand basic processing unit and organization of simple processor, concept of
pipelining and other large computing systems.

Course Outcomes: At the end of the course, student will be able to:
CO1 Demonstrate understanding of functional architecture of computers.

Identify, compare and assess issues related to ISR, memory, control and I/O
CO2
functions

CO3 Analyze different computer architectures.

CO4 Design large memory banks using basic memory units for better performance

CO5 Analyze the arithmetic computations performed by ALU.

CO6 Design fast methods for basic arithmetic operations on ALU.

Module Contents of the Module Hours COs

1. Introduction: Basic functional units of computer, Basic
operational concepts, Bus structure, Performance,
6 CO1
Numbers Arithmetic operations and characters. Memory
Locations and Addresses.

2. Input /Output Organizations: Accessing I/O devices,

Interrupts, Direct Memory Access, Buses, Standard I/O 8 CO2
interfaces,

3. The Memory System: Basic concepts, Semiconductor

RAM memories, Read Only memories, Speed, size and
9 CO4
Cost, Cache Memories, Performance Considerations,
Virtual memory.

4. Arithmetic: Addition and subtraction of signed numbers,

Design of fast adders, Multiplication of positive numbers, 9 CO5, CO6
Signed operand multiplication, Fast multiplication,
 Integer division (restoring and non-restoring
division).Example problems,

5. Basic Processing Unit: Some fundamental concepts,

Execution of Complete Instruction, Multi-Bus
Organization, Hardwired control, Basic concepts of
8 CO3
Pipelining, Forms of Parallel Processing, Array
Processors, Structure of General-purpose
Microprocessors.

Text Books:
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky: Computer Organization, 5th Edition,
Tata McGraw Hill, 2002.

Reference Books:
1. William Stallings: Computer Organization & Architecture, 7th Edition, PHI, 2006.
2. Vincent P. Heuring & Harry F. Jordan: Computer Systems Design and Architecture,
2nd Edition, Pearson Education, 2004.
 LOGIC DESIGN

Course code: 19CS3DCLDN Credits: 03

L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:
1. To optimize simple logic using Karnaugh maps and understand the concept of "don't
care".
2. To design combinational logic using basic and universal gates
3. To become familiar with basics and usage of sequential logic components and be able to
analyse such circuits.
4. To design various counters by analyzing the concept of sequential logic components.

Course Outcomes: At the end of the course, student will be able to:
CO1 Design and develop digital logic solutions for real life problems.

CO2 Analyze, design and implement combinational logic circuits.

CO3 Analyze, design and implement sequential logic circuits.

CO4 Efficiently use different types of shift registers in digital circuits.

Design various Synchronous and Asynchronous counters by applying the

CO5
knowledge of sequential circuits

CO6 Construct and use state transition diagrams for analysis of sequential circuits.

Module Contents of the Module Hours COs

1. Simplication Of Boolean Expressions: Positive and
Negative logic, Sum-of-Products Method, Truth Table to
Karnaugh Map-up to 5 variables, Pairs Quads, and Octets,
Karnaugh Simplifications, Don’t-care Conditions, Product- 8 CO1
of-sums Method, Product-of-sums simplifications,
Simplification by Quine-McClusky Method-up to 4
variables, MEV method –up to 4 variables.

2. Data Processing Circuits: Multiplexers, Demultiplexers,

Decoders, Encoders, Parity generators and checkers,
Magnitude Comparators, Code converters : BCD to
8 CO2
Excess-3, Binary to Gray code .Adders -Subtracter: Full
adder and Subtracter. Problems solving using
combinational circuits.

3. Sequential Designs: SR-Latch using NAND and NOR

gates, Gated Flip- flops, Edge triggered SR,D,J&K Master 8 CO3
slave ,T flip flops, Timing diagram of edge triggered flip
 flops, Switch contact bounce circuits, Various
representation of Flip-flops, Analysis of sequential circuits.
Conversion of flip-flops.

4. Shift Registers And Counters: Types of registers, SISO,

SIPO, PISO, PIPO registers, Universal shift register,
Applications of shift registers.
CO4 &
Counters:3 and 4 bit Asynchronous counters using J & K 8
CO5
flip-flops with timing diagrams, Arbitrary asynchronous
counter designs using PRESET and CLEAR. Mod-N
synchronous counter design using any flip -flops.

5. Applications Of Logic Design: Design of synchronous

sequential circuits: Model selection, state transition
diagram, State synthesis table, Design equations and circuit 8 CO6
diagrams, Algorithm State machine, State Reduction
Technique.

Text Books:
1. Donald P Leach, Albert Paul Malvino & Goutam Saha: Digital Principles and
Applications, 7th Edition, Tata McGraw Hill, 2010.

Reference Books:
1. R D Sudhaker Samuel: Illustrative Approach to Logic Design, Sanguine-Pearson, 2010.
2. A.P.Godse, D.A.Godse: Logic Design, Technical Publications,2011
3. M Morris Mano: Digital Logic and Computer Design, 10th Edition, Pearson Education,
2008.
4. Charles H. Roth: Fundamentals of Logic Design, Jr., 5th Edition, Cengage Learning,
2004.
5. Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss: Digital Systems Principles and
Applications, 10th Edition, Pearson Education, 2007.
 DATA STRUCTURES LABORATORY WITH APPLICATIONS

Course code: 19CS3DLDSL Credits: 02

L: P: T: S: 0:2:2:0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50

Course objectives:
1. Introduce the concept of data structures through ADT including List, Stack, Queues
2. To design and implement various data structure algorithms.
3. To introduce various techniques for representation of the data in the real world
4. To develop application using data structure algorithms

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

CO1 Apply appropriate data structures as applied to specified problem definition

Perform operations like searching, insertion, and deletion, traversing mechanism etc.
CO2
on various data structures.
CO3 Implement Linear and Non-Linear data structures.
CO4 Implement various dynamic node insert and delete operations on Linked Lists
CO5 Demonstrate the data structure using Non-Linear data structure.
CO6 Demonstrate of tree operation using dynamic node addition and deletion.

Expt
Content of the Experiment Hours CO’s
No
1a. Program 1: Write a program in C to simulate the working of a stack
of integers using an array. Provide the following operations. a. 02 CO2
Insert b. Delete c. Display
1b. Application: In a calculator application, given an expression with
parenthesis it is required to flag any parenthesis mismatch. CO1
02
Develop a program for this calculator application using CO2
appropriate data structure.
2a. Program 2: Design, develop and execute a program in C to
simulate the working of a queue of integers using an array. Provide 02 CO2
the following operations. a. Insert b. Delete c. Display
2b. Application: In a system, resources are shared among multiple
consumers for optimal performance. Considering jobs submitted
to the printer have to be printed in the order of arrival. In print
spooling, documents are loaded into a buffer and then the printer CO1
pulls them off the buffer at its own rate. Spooling also lets you CO2
place a number of print jobs on a queue instead of waiting for each
one to finish before specifying the next one. Develop a program
for such scheduling using appropriate data structure.
3a. Program 3: Design, develop and execute a program in C to
perform the following operation on Singly linked list
CO3
a. Insert the node at a specific location 02
CO4
b. Delete a node at the beginning of the list
c. Display the list
 3b. Application: Scientific applications involve many polynomials
with varied degree. A polynomial is an expression consisting of
variables and coefficients. Choose an appropriate data structure to CO5
represent the polynomial and perform addition of two
polynomials..
4a. Program 4: Design, develop and execute a program in C to
implement a doubly linked list where each node consists of
integers. The program should support the following operations:
CO3&
a. Create a doubly linked list by adding each node at the front 02
CO4
b. Delete the node of a given data If it is found, otherwise display
appropriate message
c. Display the contents of the list.
4b. Application: Colleges maintain the student’s records. As students
enroll and graduate, the records have to be updated. It is necessary
CO5
to access the student’s data whenever required by college. Using
suitable data structures develop a program for above scenario.
5a. Program 5: Design, develop and execute a program in C to create CO3
02
a Binary tree using arrays and display the tree. CO6
5b. Application: Compilers use expression trees to represent
mathematical expressions where the leaf nodes represent the
operands and the internal nodes represent the operators. Develop CO1
a program to evaluate such an expression tree with non-negative CO6
integers as operands and the arithmetic operators ‘+’, ‘-‘, ‘*’and
‘/’.
6a. Program 6: Design, develop and execute a program in C to create CO3
02
a Binary search tree and perform preorder traversals. CO5
6b. Application: In a payroll management system, it is required to
store the employee data (Employee ID, Employee name, Login
Time) as one logs in to the system. At the end of the day, it is CO1
required to generate a report of all the employee who logged in CO6
that day in ascending order of the Employee ID. Develop a
program to generate this report.

Text Book:
1. Fundamentals of Data Structures, Sartaj Sahni, University Press

Reference Books:
1 Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and C++, 2nd Edition,
Pearson Education, 2003.
2 Richard F. Gilberg and Behrouz A. Forouzan: Data Structures A Pseudocode Approach
with C, Cengage Learning, 2005.
3 A.M Padma Reddy,” Approach of Data Structures”, Person Publication, 5th Edition, 2015
4 ReemaTheraja “ Data Structure using C. 1st Edition , 2014
 JAVA PROGRAMMING LABORATORY WITH MINI-PROJECT

Course code: 19CS3DLJPL Credits: 02

L: P: T: S: 0:2:2:0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50

Course objectives:

1. Implement Object Oriented Concepts in Programming.

2. Design Programs to Demonstrate Overloading and Inheritance in Java
3. Apply the knowledge of multithreading and Exceptions in Programs.
4. Develop Programs using available String methods and Generics

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

CO1 Design and Develop Programs using Object Oriented Principles

CO2 Implement Constructor Overloading in Programs.
CO3 Incorporate Exception Handling Mechanisms appropriately in the code.
CO4 Design & Develop using the concept of Polymorphism.
CO5 Implement multithreading & file handling.
CO6 Demonstrate String Methods & Generic Methods in Programming.

Expt
Content of the Experiment Hours COs
No
Write a Java program to calculate gross salary net salary taking
the following data.

DA=40%of basic
HRA=20%of basic
CCA=Rs250/-
1. 2 CO1
PF=10%of basic
PT=Rs100/-
Income tax = 10% of gross
Gross income: Basic + DA + HRA + CCA
Deductions = PF+PT+IT
Net income = Gross income – Deductions
2. Write a Java program that prints all real solutions to the
quadratic equation ax2 + bx + c = 0. Read in a, b, c and use the
2 CO1
quadratic formula. If the discriminate b2-4ac is negative,
display a message stating that there are no real solutions.
3. Write a Java program to multiply two given matrices. 2 CO1
4. Write a Java program to add and subtract two complex numbers
2 CO2
and using the concept of constructor overloading.
5. Write a program to sort a list of elements in ascending and
2 CO3
descending order and show exception handling.
6. Write a program to calculate the interest amount based on the
rate of interest defined for different banks using the concept of 2 CO4
interface. Also calculate and display the maturity amount.
 7. Write a Java program to compute the surface area and volume
of cylinder, cone and sphere. Create an abstract class “Solid”
2 CO4
and the classes cylinder, cone and sphere have to inherit the
common properties form the class “Solid”.
8. Write a Java program that creates three threads. First thread
displays “Good Morning “every one second, the second thread
displays “Hello” every two seconds and the third thread
2 CO5
displays “Welcome” every three seconds.
Write a Java program to read from console and write these data
into file, again read that file and print the content onto console.
9. Write a java program to implement a stack using generic class
2 CO6
and methods.
10. Write a Java program to read a string from the keyboard and to
do the following
Extract the middle character of the string
2 CO6
Check whether the string entered is palindrome or not
Counting the number of vowels in the string
Counting the total number of characters in this string.

Part B:

Mini Project shall be implemented using JAVA with a report of 8-10 pages with phase wise
reviews and a final demonstration.

Text Books:
1. Herbert Schildt: Java The Complete Reference, 7th Edition, Tata McGraw Hill, 2007

Reference Books:
1. Y. Daniel Liang: Introduction to JAVA Programming, 6th Ed, Pearson Education, 2007.
2. Kathy Sierra and Bert Bates: Head First Java, 2nd Edition, O' Reilly.
3. Understanding OOP with Java, updated edition, T. Budd, pearson product