Credit Based Grading System Information Technology, III-Semester BE-3001 Mathematics-III
Integral Transforms:
Fourier Transform: Complex Fourier Transform, Fourier Sine and Cosine Transforms, Applications of Fourier Transform in Solving the Ordinary Differential Equation.
Laplace Transform: Introduction of Laplace Transform, Laplace Transform of elementary Functions, Properties of Laplace Transform, Change of Scale Property, First and Second Shifting Properties, Laplace Transform of Derivatives and Integrals. Inverse Laplace Transform & its Properties, Convolution theorem, Applications of Laplace Transform in solving the Ordinary Differential Equations.
Random Variables: Discrete and Continuous Random Variables, Probability Function, Distribution Function, Density Function, Probability Distributions, Mean and Variance of Random Variables.
Distribution: Discrete Distributions- Binomial & Poisson Distributions with their Constants, Moment Generating Functions, Continuous Distribution- Normal Distribution, Properties, Constants, Moments.
Curve Fitting using Least Square Method.
COURSE OUTCOMES- The curriculum of the Department is designed to satisfy the diverse needs of students. Coursework is designed to provide students the opportunity to learn key concept of Applications of Fourier Series, Fourier & Laplace Transforms and Statistical Techniques.
Probability & Statistics by G Shanker Rao, University Press.
Mathematical Statistics by George R., Springer
Erwin Kreyszig: Advanced Engineering Mathematics, Wiley India.
H C Taneja: Advanced Engineering Mathematics, I.K. International Publishing House Pvt. Ltd.
S S Sastri: Engineering Mathematics, PHI
Ramana, B.V.: Advance Engg. Mathematics, TMH New Delhi
Engineering Mathematics By Samnta Pal and Bhutia, Oxford Publication
Probability and Statistics in Engineering, W.W. Hines et. al., Wiley India PVT Ltd.
Credit Based Grading System
Data structure includes analyzing various algorithms along with time and space complexities. It also helps students to design new algorithms through mathematical analysis and programming.
Introduction of Algorithms, Analysis of algorithms: Space Complexity, Time Complexity, recurrence relation and Asymptotic Notation, Divide and Conquer: General Methods, Analysis and Design, Binary Search, Quick sort, Merge sort, Strassen’s matrix multiplication.
Greedy Strategy: Introduction, examples of greedy method like optimal merge pattern, Huffman coding, Minimum spanning trees, knapsack problem, job sequencing with dead lines single source shortest path algorithms.
Dynamic Programming: Introduction, Problem based on this approach such as 0/1 Knapsack Multistage graph, reliability design, Floyd-warshall algorithms.
Backtracking Concept and its example like 8 Queen’s problem, Hamiltonian cycle, Graph coloring problem, 15 Puzzle problem, Least Cost Search
Introduction to branch & bound method, examples of branch & bound methods like traveling sales man problem, meaning of lower bound theory and its use in solving algebraic problem. NP- completeness & NP hard problems. Basic Concept of non deterministic algorithms. NP hard and NP complete classes.
Students will be able to understand fundamentals of algorithms.
Understanding various design methods for graphs.
Learning different concepts of backtracking including puzzle problem and graph coloring.
Getting familiar with non-deterministic algorithms and techniques of branch and bound.
Horowitz, Sahani,Rajasekaran “ Fundamentals of Computer Algorithms”, Universities Press.
Thomas H. Cormen, “Introduction to Algorithms”, PHI.
Harsh Bhasin “Algorithms Design and Analysis” Oxford.
I.Chandra Mohan “ Design and Analysis of Algorithms” PHI
Implement Binary Search using C++.
Implement Quick sort using C++.
Implement Strassen Matrix multiplication on the given matrix.
Implement Merge sort on the given list of elements.
Implement Job sequencing problem using C++.
Implement Floyd warshall algorithm using C++.
Implement 8 – queens problem using backtracking.
Implement graph coloring problem using C++.
Implement 0/1 knapsack using branch and bound.
Implement travelling salesman problem using C++.
Credit Based Grading System Information Technology, III-Semester IT-3003 Digital Circuits and Systems
In the modern age electronic computers, communication systems and Internet became an important part of our life. The operation of these systems is based on the principle of digital techniques. The objective of this course is to get familiar with the concept of digital techniques and these systems are referred to as digital systems.
Number systems and logic gates: Decimal, Binary, Octal, Hexadecimal number systems and radix conversion. Codes- BCD, excess 3, gray, ASCII. Boolean algebra- Theorems and properties, Boolean functions, canonical and standard forms, De Morgans theorem, digital logic gates, Karnaugh maps.
Combinational circuits: Introduction to combinational circuits, multilevel NAND, NOR implementation. Designing binary Adders and Subtractors. Decoder, Encoder, Multiplexer, Demultiplexer circuits.
Sequential circuits: Introduction to Sequential circuits, flip-flops, RS, D, T, JK, M/S JK-flip- flops, truth tables, excitation tables and characteristic equations, clocked and edge triggered flip- flops, Registers- Definition, serial, parallel, shift left/right registers, Johnson counter, asynchronous and synchronous counters.
Digital logic families: Bipolar and unipolar logic families, Digital IC specifications, RTL, DTL, All types of TTL circuits, ECL, IIL, PMOS, NMOS & CMOS Logic.
Clocks and timing circuits: Bistable, Monostable & Astable multivibrator, Schmitt trigger circuit, Introduction of Analog to Digital & Digital to Analog converters, Display devices, 7 and 16 segment LED display, LCD.
On the completion of this course, students will be able to understand the basic building blocks of digital systems. The basic building block includes encoders, decoders, multiplexers and demultiplexers. These are commonly used in digital systems such as computers, communication systems and other modern technologies.
M. Morris Mono, “Digital logic design”, Pearson Education Pvt. Ltd.
A Anand Kumar, “Fundamentals of digital circuits“, PHI Learning Pvt Ltd.
A K Maini, “Digital Electronics Principles and Integrated Circuits, Wiley India Pvt Ltd.
R P Jain, “Modern Digital Electronics”, Tata McGraw-Hill publishing company Ltd.
D P Kothari and J S Dhillon, "Digital Circuits and Design", Pearson Education Pvt. Ltd.
Study and verify the operation of AND, OR, NOT, NOR and NAND logic gates.
Design all basic logic gates using NOR universal gate.
Design all basic logic gates using NAND universal gate.
Verification of Demorgan’s theorem.
Construction and verification of half adder and full adder circuits.
Construction and verification of half subtractor and full subtractor circuits.
Design of Binary to Grey & Grey to Binary code Converters .
Design of BCD to excess-3 code converter.
Design and verification of Multiplexer circuit
Design and verification of De-multiplexer circuit.
Credit Based Grading System
The objective of this course is to understand the advantage of object oriented programming over procedure oriented programming. It helps to understand the key features of Object Oriented Programming and Methodology like objects, methods, instance, message passing, encapsulation, polymorphism, data hiding, abstract data and inheritance.
On the completion of this course students will be able to:
Recognize attributes and methods for given objects.
Define data types but also deals with operations applied for data structures.
Implement algorithms and complex problems.
E. Balaguruswami, ”Object Oriented Programming in C++”, TMH.
Robert Lafore, “Object Oriented Programming in C++”, Pearson.
M.T. Somashekare, D.S. Guru, “ Object-Oriented Programming with C++”, PHI.
Herbert Shildt, “The Complete Reference C++”, Tata McGraw Hill publication.
Write a program to find out the largest number using function.
Write a program to find the area of circle, rectangle and triangle using function overloading.
Write a program to implement complex numbers using operator overloading and type conversion.
Write a program using class and object to print bio-data of the students.
Write a program which defines a class with constructor and destructor which will count number of object created and destroyed.
Write a program to implement single and multiple inheritances taking student as the sample base class.
Write a program to add two private data members using friend function.
Write a program using dynamic memory allocation to perform 2x2 matrix addition and subtraction.
Write a program to create a stack using virtual function.
Write a program that store five student records in a file.
Write a program to get IP address of the system.
Write a program to shutdown the system on windows operating system.
Credit Based Grading System Information Technology, III-Semester IT-3005 Discrete Structure
The main objectives of this course are:
To introduce students with sets, relations, functions, graph, and probability.
Students can perform set operation and solve logical reasoning and verify the correctness of logical statement.
They can apply the properties of relations and find partially ordered set and lattices.
Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job Scheduling problem Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction.
Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results.
Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. Introduction to finite state machine Finite state machines as models of physical system equivalence machines, Finite state machines as language recognizers
Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs.
Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices. Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Recurrence Relation and Generating Function: Introduction to Recurrence Relation
and Recursive algorithms , Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions , Generating functions , Solution by method of generating functions.
On completion of the course;
Students will be able to understand the notion of mathematical thinking, and algorithmic thinking and be able to apply them in problem solving such as formal specification, verification, and basic concepts of set theory.
Students understand the basic principle of Boolean algebra, logic and set theory.
Be able to construct simple mathematical proof and possess the ability to verify them.
C.L.Liu” Elements of Discrere Mathematics” TMH.
Lipschutz, “Discrete mathematics (Schaum)”,TMH.
U.S Gupta “ Discrete Mathematical Structures” Pearson.
S. Santha,” Discrete Mathematics with Combinatorics and graph theory”, Cengage Learning.
Dr.Sukhendu. Dey “ Graph Theory With Applications” Shroff Publishers
Credit Based Grading System
Understand fundamentals of programming such as variables, conditional and iterative execution, methods, etc.
Understand fundamentals of object-oriented programming in Java and be familiar of the important concepts like class, inheritance and multithreading, AWT and JDBC.
Students will able to use the Java SDK environment to create, debug and run simple Java programs.
Object-Oriented Programming , overview of Java, Installation, First Simple Program, Compilation process , Java Keywords , Identifiers , Literals, Comments, Data Types, Variables, Arrays, Declaration a variable, Dynamic initialization, the scope and life time of variable, type conversion and casting, Operators, Control Statements,
Class Fundamentals, Simple Class , Abstract Classes, Declaring Objects, Introducing Methods, Constructors, this Keyword, Garbage Collection, finalize Method, Overloading Methods, Overloading Constructors, Using Objects as Parameters, Inheritance, Creating a Multilevel Hierarchy, Packages and Interfaces, Exception Handling, Multithreaded
The Applet Class: Applet Basics, The Applet Class, Applet Architecture, Applet Initialization and Termination , Simple Applet Display Methods, Simple Banner Applet, Using the Status Window, The HTML APPLET Tag, Passing Parameters to Applets, Improving the Banner Applet.
Introducing the AWT: Working with Windows, Graphics, and Text, AWT Classes, Window Fundamentals, Component, Container, Panel, Frame, Working with Frame Windows, Handling Events in a Frame Window, AWT Controls, Layout Managers, and Menus, Adding and Removing Controls, GridLayout, BorderLayout, introduction to swing and servlet.
Event Handling, Two Event Handling Mechanisms, The Delegation Event Model, Events, Event Sources, Event Listeners, Event Classes, The MouseEvent Class and others, JDBC: JDBC- ODBC bridge, the connectivity model, the driver manager, navigating the result set object contents, the JDBC exceptional classes, connecting to remote database.
On the completion of this course students will be able to understand:
The concepts of object oriented programming.
The basic terminology used in computer programming and write, compile and debug programs in JAVA language.
The different data types, decision structures, loops, functions to design programs.
Develop program using the java collection API as well as the java standard class library.
E. Balagurusamy, “Programming with java A Primer”, McGrawHill.
Sharanam Shah, “ Core Java 8 for Beginners”, Shroff Publisher.
Naughton & Schildt, “The Complete Reference Java 2”, Tata McGraw Hill.
Horstmann & Cornell, “Core Java 2” (Vol I & II ), Pearson.
Write a program that accepts two numbers from the user and print their sum.
Write a program to calculate addition of two number using prototyping of methods.
Program to demonstrate function overloading for calculation of average.
Program to demonstrating overloaded constructor for calculating box volume.
Program to show the detail of students using concept of inheritance.
Program to demonstrate package concept.
Program to demonstrate implementation of an interface which contains two methods declaration square and cube.
Program to demonstrate exception handling in case of division by zero error.
Program to demonstrate multithreading.
Program to demonstrate JDBC concept using create a GUI based application for student information.
Program to display “Hello World” in web browser using applet.
Program to add user controls to applets.
Write a program to create an application using concept of swing.
Program to demonstrate student registration functionality using servlets with session management.
Credit Based Grading System Information Technology, III-Semester BE-3001 Mathematics-III
Integral Transforms:
Fourier Transform: Complex Fourier Transform, Fourier Sine and Cosine Transforms, Applications of Fourier Transform in Solving the Ordinary Differential Equation.
Laplace Transform: Introduction of Laplace Transform, Laplace Transform of elementary Functions, Properties of Laplace Transform, Change of Scale Property, First and Second Shifting Properties, Laplace Transform of Derivatives and Integrals. Inverse Laplace Transform & its Properties, Convolution theorem, Applications of Laplace Transform in solving the Ordinary Differential Equations.
Random Variables: Discrete and Continuous Random Variables, Probability Function, Distribution Function, Density Function, Probability Distributions, Mean and Variance of Random Variables.
Distribution: Discrete Distributions- Binomial & Poisson Distributions with their Constants, Moment Generating Functions, Continuous Distribution- Normal Distribution, Properties, Constants, Moments.
Curve Fitting using Least Square Method.
COURSE OUTCOMES- The curriculum of the Department is designed to satisfy the diverse needs of students. Coursework is designed to provide students the opportunity to learn key concept of Applications of Fourier Series, Fourier & Laplace Transforms and Statistical Techniques.
Probability & Statistics by G Shanker Rao, University Press.
Mathematical Statistics by George R., Springer
Erwin Kreyszig: Advanced Engineering Mathematics, Wiley India.
H C Taneja: Advanced Engineering Mathematics, I.K. International Publishing House Pvt. Ltd.
S S Sastri: Engineering Mathematics, PHI
Ramana, B.V.: Advance Engg. Mathematics, TMH New Delhi
Engineering Mathematics By Samnta Pal and Bhutia, Oxford Publication
Probability and Statistics in Engineering, W.W. Hines et. al., Wiley India PVT Ltd.
Credit Based Grading System
Data structure includes analyzing various algorithms along with time and space complexities. It also helps students to design new algorithms through mathematical analysis and programming.
Introduction of Algorithms, Analysis of algorithms: Space Complexity, Time Complexity, recurrence relation and Asymptotic Notation, Divide and Conquer: General Methods, Analysis and Design, Binary Search, Quick sort, Merge sort, Strassen’s matrix multiplication.
Greedy Strategy: Introduction, examples of greedy method like optimal merge pattern, Huffman coding, Minimum spanning trees, knapsack problem, job sequencing with dead lines single source shortest path algorithms.
Dynamic Programming: Introduction, Problem based on this approach such as 0/1 Knapsack Multistage graph, reliability design, Floyd-warshall algorithms.
Backtracking Concept and its example like 8 Queen’s problem, Hamiltonian cycle, Graph coloring problem, 15 Puzzle problem, Least Cost Search
Introduction to branch & bound method, examples of branch & bound methods like traveling sales man problem, meaning of lower bound theory and its use in solving algebraic problem. NP- completeness & NP hard problems. Basic Concept of non deterministic algorithms. NP hard and NP complete classes.
Students will be able to understand fundamentals of algorithms.
Understanding various design methods for graphs.
Learning different concepts of backtracking including puzzle problem and graph coloring.
Getting familiar with non-deterministic algorithms and techniques of branch and bound.
Horowitz, Sahani,Rajasekaran “ Fundamentals of Computer Algorithms”, Universities Press.
Thomas H. Cormen, “Introduction to Algorithms”, PHI.
Harsh Bhasin “Algorithms Design and Analysis” Oxford.
I.Chandra Mohan “ Design and Analysis of Algorithms” PHI
Implement Binary Search using C++.
Implement Quick sort using C++.
Implement Strassen Matrix multiplication on the given matrix.
Implement Merge sort on the given list of elements.
Implement Job sequencing problem using C++.
Implement Floyd warshall algorithm using C++.
Implement 8 – queens problem using backtracking.
Implement graph coloring problem using C++.
Implement 0/1 knapsack using branch and bound.
Implement travelling salesman problem using C++.
Credit Based Grading System Information Technology, III-Semester IT-3003 Digital Circuits and Systems
In the modern age electronic computers, communication systems and Internet became an important part of our life. The operation of these systems is based on the principle of digital techniques. The objective of this course is to get familiar with the concept of digital techniques and these systems are referred to as digital systems.
Number systems and logic gates: Decimal, Binary, Octal, Hexadecimal number systems and radix conversion. Codes- BCD, excess 3, gray, ASCII. Boolean algebra- Theorems and properties, Boolean functions, canonical and standard forms, De Morgans theorem, digital logic gates, Karnaugh maps.
Combinational circuits: Introduction to combinational circuits, multilevel NAND, NOR implementation. Designing binary Adders and Subtractors. Decoder, Encoder, Multiplexer, Demultiplexer circuits.
Sequential circuits: Introduction to Sequential circuits, flip-flops, RS, D, T, JK, M/S JK-flip- flops, truth tables, excitation tables and characteristic equations, clocked and edge triggered flip- flops, Registers- Definition, serial, parallel, shift left/right registers, Johnson counter, asynchronous and synchronous counters.
Digital logic families: Bipolar and unipolar logic families, Digital IC specifications, RTL, DTL, All types of TTL circuits, ECL, IIL, PMOS, NMOS & CMOS Logic.
Clocks and timing circuits: Bistable, Monostable & Astable multivibrator, Schmitt trigger circuit, Introduction of Analog to Digital & Digital to Analog converters, Display devices, 7 and 16 segment LED display, LCD.
On the completion of this course, students will be able to understand the basic building blocks of digital systems. The basic building block includes encoders, decoders, multiplexers and demultiplexers. These are commonly used in digital systems such as computers, communication systems and other modern technologies.
M. Morris Mono, “Digital logic design”, Pearson Education Pvt. Ltd.
A Anand Kumar, “Fundamentals of digital circuits“, PHI Learning Pvt Ltd.
A K Maini, “Digital Electronics Principles and Integrated Circuits, Wiley India Pvt Ltd.
R P Jain, “Modern Digital Electronics”, Tata McGraw-Hill publishing company Ltd.
D P Kothari and J S Dhillon, "Digital Circuits and Design", Pearson Education Pvt. Ltd.
Study and verify the operation of AND, OR, NOT, NOR and NAND logic gates.
Design all basic logic gates using NOR universal gate.
Design all basic logic gates using NAND universal gate.
Verification of Demorgan’s theorem.
Construction and verification of half adder and full adder circuits.
Construction and verification of half subtractor and full subtractor circuits.
Design of Binary to Grey & Grey to Binary code Converters .
Design of BCD to excess-3 code converter.
Design and verification of Multiplexer circuit
Design and verification of De-multiplexer circuit.
Credit Based Grading System
The objective of this course is to understand the advantage of object oriented programming over procedure oriented programming. It helps to understand the key features of Object Oriented Programming and Methodology like objects, methods, instance, message passing, encapsulation, polymorphism, data hiding, abstract data and inheritance.
On the completion of this course students will be able to:
Recognize attributes and methods for given objects.
Define data types but also deals with operations applied for data structures.
Implement algorithms and complex problems.
E. Balaguruswami, ”Object Oriented Programming in C++”, TMH.
Robert Lafore, “Object Oriented Programming in C++”, Pearson.
M.T. Somashekare, D.S. Guru, “ Object-Oriented Programming with C++”, PHI.
Herbert Shildt, “The Complete Reference C++”, Tata McGraw Hill publication.
Write a program to find out the largest number using function.
Write a program to find the area of circle, rectangle and triangle using function overloading.
Write a program to implement complex numbers using operator overloading and type conversion.
Write a program using class and object to print bio-data of the students.
Write a program which defines a class with constructor and destructor which will count number of object created and destroyed.
Write a program to implement single and multiple inheritances taking student as the sample base class.
Write a program to add two private data members using friend function.
Write a program using dynamic memory allocation to perform 2x2 matrix addition and subtraction.
Write a program to create a stack using virtual function.
Write a program that store five student records in a file.
Write a program to get IP address of the system.
Write a program to shutdown the system on windows operating system.
Credit Based Grading System Information Technology, III-Semester IT-3005 Discrete Structure
The main objectives of this course are:
To introduce students with sets, relations, functions, graph, and probability.
Students can perform set operation and solve logical reasoning and verify the correctness of logical statement.
They can apply the properties of relations and find partially ordered set and lattices.
Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job Scheduling problem Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction.
Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results.
Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. Introduction to finite state machine Finite state machines as models of physical system equivalence machines, Finite state machines as language recognizers
Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs.
Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices. Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Recurrence Relation and Generating Function: Introduction to Recurrence Relation
and Recursive algorithms , Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions , Generating functions , Solution by method of generating functions.
On completion of the course;
Students will be able to understand the notion of mathematical thinking, and algorithmic thinking and be able to apply them in problem solving such as formal specification, verification, and basic concepts of set theory.
Students understand the basic principle of Boolean algebra, logic and set theory.
Be able to construct simple mathematical proof and possess the ability to verify them.
C.L.Liu” Elements of Discrere Mathematics” TMH.
Lipschutz, “Discrete mathematics (Schaum)”,TMH.
U.S Gupta “ Discrete Mathematical Structures” Pearson.
S. Santha,” Discrete Mathematics with Combinatorics and graph theory”, Cengage Learning.
Dr.Sukhendu. Dey “ Graph Theory With Applications” Shroff Publishers
Credit Based Grading System
Understand fundamentals of programming such as variables, conditional and iterative execution, methods, etc.
Understand fundamentals of object-oriented programming in Java and be familiar of the important concepts like class, inheritance and multithreading, AWT and JDBC.
Students will able to use the Java SDK environment to create, debug and run simple Java programs.
Object-Oriented Programming , overview of Java, Installation, First Simple Program, Compilation process , Java Keywords , Identifiers , Literals, Comments, Data Types, Variables, Arrays, Declaration a variable, Dynamic initialization, the scope and life time of variable, type conversion and casting, Operators, Control Statements,
Class Fundamentals, Simple Class , Abstract Classes, Declaring Objects, Introducing Methods, Constructors, this Keyword, Garbage Collection, finalize Method, Overloading Methods, Overloading Constructors, Using Objects as Parameters, Inheritance, Creating a Multilevel Hierarchy, Packages and Interfaces, Exception Handling, Multithreaded
The Applet Class: Applet Basics, The Applet Class, Applet Architecture, Applet Initialization and Termination , Simple Applet Display Methods, Simple Banner Applet, Using the Status Window, The HTML APPLET Tag, Passing Parameters to Applets, Improving the Banner Applet.
Introducing the AWT: Working with Windows, Graphics, and Text, AWT Classes, Window Fundamentals, Component, Container, Panel, Frame, Working with Frame Windows, Handling Events in a Frame Window, AWT Controls, Layout Managers, and Menus, Adding and Removing Controls, GridLayout, BorderLayout, introduction to swing and servlet.
Event Handling, Two Event Handling Mechanisms, The Delegation Event Model, Events, Event Sources, Event Listeners, Event Classes, The MouseEvent Class and others, JDBC: JDBC- ODBC bridge, the connectivity model, the driver manager, navigating the result set object contents, the JDBC exceptional classes, connecting to remote database.
On the completion of this course students will be able to understand:
The concepts of object oriented programming.
The basic terminology used in computer programming and write, compile and debug programs in JAVA language.
The different data types, decision structures, loops, functions to design programs.
Develop program using the java collection API as well as the java standard class library.
E. Balagurusamy, “Programming with java A Primer”, McGrawHill.
Sharanam Shah, “ Core Java 8 for Beginners”, Shroff Publisher.
Naughton & Schildt, “The Complete Reference Java 2”, Tata McGraw Hill.
Horstmann & Cornell, “Core Java 2” (Vol I & II ), Pearson.
Write a program that accepts two numbers from the user and print their sum.
Write a program to calculate addition of two number using prototyping of methods.
Program to demonstrate function overloading for calculation of average.
Program to demonstrating overloaded constructor for calculating box volume.
Program to show the detail of students using concept of inheritance.
Program to demonstrate package concept.
Program to demonstrate implementation of an interface which contains two methods declaration square and cube.
Program to demonstrate exception handling in case of division by zero error.
Program to demonstrate multithreading.
Program to demonstrate JDBC concept using create a GUI based application for student information.
Program to display “Hello World” in web browser using applet.
Program to add user controls to applets.
Write a program to create an application using concept of swing.
Program to demonstrate student registration functionality using servlets with session management.