Credit Based Grading System
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
Semiconductor devices, theory of P-N junction, temperature dependence and break down characteristics, junction capacitances. Zener diode, Varactor diode, PIN diode, LED, Photo diode, Transistors BJT, FET, MOSFET, types, working principal, characteristics, and region of operation, load line biasing method. Transistor as an amplifier, gain, bandwidth, frequency response, Type of amplifier.
Feedback amplifier, negative feedback, voltage-series, voltage shunt, current series and current shunt feedback, Sinusoidal oscillators, L-C (Hartley-Colpitts) oscillators, RC phase shift, Wien bridge, and Crystal oscillators. Power amplifiers, class A, class B, class A B, C amplifiers, their efficiency and power Dissipation.
Switching characteristics of diode and transistor turn ON, OFF time, reverse recovery time, transistor as switch, Multivibrators, Bistable, Monostable, Astable multivibarators. Clippers and clampers, Differential amplifier, calculation of differential, common mode gain and CMRR using hparameters.
Operational amplifier characteristics, slew rate, full power bandwidth, offset voltage, bias current, application ,inverting , non inverting amplifier , summer, differentiator, integrator, differential amplifier
, instrumentation amplifier, log and antilog amplifier , voltage to current and current to voltage converters , comparators Schmitt trigger .
Introduction to IC, Advantages and limitations, IC classification, production process of monolithic IC, fabrication of components on monolithic IC, IC packing, general integrated circuit technology, photolithographic process, un polar IC’s, IC symbols.
Milliman Hallkias - Integrated Electronics; TMH Pub.
Gayakwad; OP-amp and linear Integrated Circuits; Pearson Education
Salivahanan; Electronic devices and circuits; TMH
Robert Boylestad & Nashetsky; Electronics Devices and circuit Theory; Pearson Ed.
Salivahanan; Linear Integrated Circuits; TMH
Miliman Grabel; Micro electronics, TMH
Diode and Transistor characteristics
Transistor Applications (Amplifier and switching)
OP-Amp and its Applications
555 timer and its Applications
Credit Based Grading System
To expose the students to perform binary arithmetic and conversion from one number system to another and learn different Boolean simplification techniques. We learn the design and analysis of combinational and sequential circuits.
Number systems & codes, Binary arithmetic, Boolean algebra and switching function. Minimization of switching function, Concept of prime implicant, Karnaugh map method, Quine McCluskey’s method,Cases with don’t care terms, Multiple output switching function.
Introduction to logic gates, Universal gate, Half adder,Half subtractor, Full adder, Full subtractor circuits, Series & parallel addition, BCD adders, Look-ahead carry generator.
Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt Trigger circuits
& Schmitt-Nand gates. Logic families:RTL, DTL, All types of TTL circuits, ECL, I2L, PMOS, NMOS, & CMOS logic, Gated flip- flops and gated multivibrator, Interfacing between TTL to MOS.
Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor memories, & designing with ROM and PLA. Introduction to Shift Registers, Counters, Synchronous & Asynchronous counters, Designing of combinational circuits like code converters.
Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and V-F converters.
M. Mano; “ Digital Logic & Computer Design”; Pearson
Malvino Leach; “Digital Principles & Applications”;TMH
Millman & Taub; “Pulse Digital & Switching Waveforms”;TMH
W.H Gothman; “Digital Electronics”;PHI
R.P.Jain “Modern Digital Electronics” TMH
To study and test operation of all logic gates for various IC’s )IC#7400, IC#7403, IC#7408, IC#7432, IC#7486)
Verification of DeMorgan’s Theorem.
To construct half adder and full adder.
To construct half subtractor and full subtractor circuits.
Verification of versatility of NAND gate.
Verification of versatility of NOR gate.
Designing and verification of property of full adder.
Design a BCD to excess-3 code convertor.
Design a Multiplexer/Demultiplexer
Credit Based Grading System
Data structures play a central role in modern computer science. In addition, data structures are essential building blocks in obtaining efficient algorithms. The objective of the course is to teach students how to design, write, and analyze the performance of programs that handle structured data and perform more complex tasks, typical of larger software projects. Students should acquire skills in using generic principles for data representation & manipulation with a view for efficiency, maintainability, and code- reuse. Another goal of the course is to teach advance data structures concepts, which allow one to store collections of data with fast updates and queries.
Introduction –Common operations on data structures, Types of data structures, Data structures & Programming, Program Design, Complexities, Time Complexity, order of Growth, Asymptotic Notation.
Advanced Data Structures-Hash tables ,Heaps , Complexity , Analysis of Heap Operations , Application of Heap , AVL tress , Insertion & Deletion in AVL tree , Red Black Trees , Properties of Red Black trees ,Insertion & Deletion in Red Black tree .
Sorting –Need for sorting , Types of sorting algorithm-Stable sorting Algorithm, Internal & External sorting algorithm , Outline and offline algorithm ,Sorting Techniques-Insertion , Shell , Selection , Merge ,Quick sort, Radix sort ,bucket sort .
Augmenting Data structures – Augmenting a red black trees, Retrieving an element with a given rank , Determining the rank of element ,Data structure Maintenance ,An augmentation strategy ,Interval Trees.
File structures- Basic file operations, File organization –Sequential file organization, Indexed sequential file organization, Direct file organization. External merge sort, Multiway Merge sort, Tournament Tree
,Replacement Selection .
Horowitz and Sahani, “Fundamentals of data Structures”,University Press
Trembley and Sorenson , “Data Structures”, TMH Publications
.A. M. Tenenbaum, “Data Structures using C & C++”, Pearson Pub
Venkatesan , Rose, “Data Structures” Wiley India Pvt.Ltd
Pai; Data structure and algorithm , TMH Publications
T.H.Coreman,”Introduction to algorithm”,PHI.
Credit Based Grading System
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, Cosets, factor group, Permutation 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, Multimonial Coefficients 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.
C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.
Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill.
Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.
Bisht, “Discrete Mathematics”,Oxford University Press
Biswal,”Discrete Mathematics & Graph Theory”, PHI
Credit Based Grading System
Basic Java Features - C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data Types, Class, Methods,Objects, Strings and Arrays, Type Casting, Operators, Precedence relations, Control Statements, Exception Handling, File and Streams, Visibility, Constructors, Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract methods and Classes
Java Collective Frame Work - Data Structures: Introduction, Type-Wrapper Classes for Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees, Generics: Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface Collection and Class Collections, Lists, Array List and Iterator, Linked List, Vector. Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java. Util, Class Priority Queue and Interface Queue, Maps, Properties Class, Un-modifiable Collections.
Advance Java Features - Multithreading: Thread States, Priorities and Thread Scheduling, Life Cycle of a Thread, Thread Synchronization, Creating and Executing Threads, Multithreading with GUI,Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI, Networking, Accessing Databases with JDBC: Relational Database, SQL, MySQL, Oracle
Advance Java Technologies - Servlets: Overview and Architecture, Setting Up the Apache Tomcat Server, Handling HTTP get Requests, Deploying a web Application, Multitier Applications, Using JDBC from a Servlet, Java Server Pages (JSP): Overview, First JSP Example, Implicit Objects, Scripting, Standard Actions, Directives, Multimedia: Applets and Application: Loading, Displaying and Scaling Images, Animating a Series of Images, Loading and playing Audio clips
Advance Web/Internet Programming (Overview): J2ME, J2EE, EJB, XML.
E. Balaguruswamy, “Programming In Java”; TMH Publications
The Complete Reference: Herbert Schildt, TMH
Deitel & Deitel, ”JAVA, How to Program”; PHI, Pearson.
Cay Horstmann, Big JAVA, Wiley India.
Merlin Hughes, et al; Java Network Programming , Manning Publications/Prentice Hall
Installation of J2SDK
Write a program to show Scope of Variables
Write a program to show Concept of CLASS in JAVA
Write a program to show Type Casting in JAVA
Write a program to show How Exception Handling is in JAVA
Write a Program to show Inheritance
Write a program to show Polymorphism
Write a program to show Access Specifiers (Public, Private, Protected) in JAVA
Write a program to show use and Advantages of CONTRUCTOR
Write a program to show Interfacing between two classes
Write a program to Add a Class to a Package
Write a program to show Life Cycle of a Thread
Write a program to demonstrate AWT.
Write a program to Hide a Class
Write a Program to show Data Base Connectivity Using JAVA
Write a Program to show “HELLO JAVA ” in Explorer using Applet
Write a Program to show Connectivity using JDBC
Write a program to demonstrate multithreading using Java.
Write a program to demonstrate applet life cycle.
Write a program to demonstrate concept of servlet.
Credit Based Grading System
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
Semiconductor devices, theory of P-N junction, temperature dependence and break down characteristics, junction capacitances. Zener diode, Varactor diode, PIN diode, LED, Photo diode, Transistors BJT, FET, MOSFET, types, working principal, characteristics, and region of operation, load line biasing method. Transistor as an amplifier, gain, bandwidth, frequency response, Type of amplifier.
Feedback amplifier, negative feedback, voltage-series, voltage shunt, current series and current shunt feedback, Sinusoidal oscillators, L-C (Hartley-Colpitts) oscillators, RC phase shift, Wien bridge, and Crystal oscillators. Power amplifiers, class A, class B, class A B, C amplifiers, their efficiency and power Dissipation.
Switching characteristics of diode and transistor turn ON, OFF time, reverse recovery time, transistor as switch, Multivibrators, Bistable, Monostable, Astable multivibarators. Clippers and clampers, Differential amplifier, calculation of differential, common mode gain and CMRR using hparameters.
Operational amplifier characteristics, slew rate, full power bandwidth, offset voltage, bias current, application ,inverting , non inverting amplifier , summer, differentiator, integrator, differential amplifier
, instrumentation amplifier, log and antilog amplifier , voltage to current and current to voltage converters , comparators Schmitt trigger .
Introduction to IC, Advantages and limitations, IC classification, production process of monolithic IC, fabrication of components on monolithic IC, IC packing, general integrated circuit technology, photolithographic process, un polar IC’s, IC symbols.
Milliman Hallkias - Integrated Electronics; TMH Pub.
Gayakwad; OP-amp and linear Integrated Circuits; Pearson Education
Salivahanan; Electronic devices and circuits; TMH
Robert Boylestad & Nashetsky; Electronics Devices and circuit Theory; Pearson Ed.
Salivahanan; Linear Integrated Circuits; TMH
Miliman Grabel; Micro electronics, TMH
Diode and Transistor characteristics
Transistor Applications (Amplifier and switching)
OP-Amp and its Applications
555 timer and its Applications
Credit Based Grading System
To expose the students to perform binary arithmetic and conversion from one number system to another and learn different Boolean simplification techniques. We learn the design and analysis of combinational and sequential circuits.
Number systems & codes, Binary arithmetic, Boolean algebra and switching function. Minimization of switching function, Concept of prime implicant, Karnaugh map method, Quine McCluskey’s method,Cases with don’t care terms, Multiple output switching function.
Introduction to logic gates, Universal gate, Half adder,Half subtractor, Full adder, Full subtractor circuits, Series & parallel addition, BCD adders, Look-ahead carry generator.
Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt Trigger circuits
& Schmitt-Nand gates. Logic families:RTL, DTL, All types of TTL circuits, ECL, I2L, PMOS, NMOS, & CMOS logic, Gated flip- flops and gated multivibrator, Interfacing between TTL to MOS.
Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor memories, & designing with ROM and PLA. Introduction to Shift Registers, Counters, Synchronous & Asynchronous counters, Designing of combinational circuits like code converters.
Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and V-F converters.
M. Mano; “ Digital Logic & Computer Design”; Pearson
Malvino Leach; “Digital Principles & Applications”;TMH
Millman & Taub; “Pulse Digital & Switching Waveforms”;TMH
W.H Gothman; “Digital Electronics”;PHI
R.P.Jain “Modern Digital Electronics” TMH
To study and test operation of all logic gates for various IC’s )IC#7400, IC#7403, IC#7408, IC#7432, IC#7486)
Verification of DeMorgan’s Theorem.
To construct half adder and full adder.
To construct half subtractor and full subtractor circuits.
Verification of versatility of NAND gate.
Verification of versatility of NOR gate.
Designing and verification of property of full adder.
Design a BCD to excess-3 code convertor.
Design a Multiplexer/Demultiplexer
Credit Based Grading System
Data structures play a central role in modern computer science. In addition, data structures are essential building blocks in obtaining efficient algorithms. The objective of the course is to teach students how to design, write, and analyze the performance of programs that handle structured data and perform more complex tasks, typical of larger software projects. Students should acquire skills in using generic principles for data representation & manipulation with a view for efficiency, maintainability, and code- reuse. Another goal of the course is to teach advance data structures concepts, which allow one to store collections of data with fast updates and queries.
Introduction –Common operations on data structures, Types of data structures, Data structures & Programming, Program Design, Complexities, Time Complexity, order of Growth, Asymptotic Notation.
Advanced Data Structures-Hash tables ,Heaps , Complexity , Analysis of Heap Operations , Application of Heap , AVL tress , Insertion & Deletion in AVL tree , Red Black Trees , Properties of Red Black trees ,Insertion & Deletion in Red Black tree .
Sorting –Need for sorting , Types of sorting algorithm-Stable sorting Algorithm, Internal & External sorting algorithm , Outline and offline algorithm ,Sorting Techniques-Insertion , Shell , Selection , Merge ,Quick sort, Radix sort ,bucket sort .
Augmenting Data structures – Augmenting a red black trees, Retrieving an element with a given rank , Determining the rank of element ,Data structure Maintenance ,An augmentation strategy ,Interval Trees.
File structures- Basic file operations, File organization –Sequential file organization, Indexed sequential file organization, Direct file organization. External merge sort, Multiway Merge sort, Tournament Tree
,Replacement Selection .
Horowitz and Sahani, “Fundamentals of data Structures”,University Press
Trembley and Sorenson , “Data Structures”, TMH Publications
.A. M. Tenenbaum, “Data Structures using C & C++”, Pearson Pub
Venkatesan , Rose, “Data Structures” Wiley India Pvt.Ltd
Pai; Data structure and algorithm , TMH Publications
T.H.Coreman,”Introduction to algorithm”,PHI.
Credit Based Grading System
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, Cosets, factor group, Permutation 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, Multimonial Coefficients 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.
C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.
Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill.
Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.
Bisht, “Discrete Mathematics”,Oxford University Press
Biswal,”Discrete Mathematics & Graph Theory”, PHI
Credit Based Grading System
Basic Java Features - C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data Types, Class, Methods,Objects, Strings and Arrays, Type Casting, Operators, Precedence relations, Control Statements, Exception Handling, File and Streams, Visibility, Constructors, Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract methods and Classes
Java Collective Frame Work - Data Structures: Introduction, Type-Wrapper Classes for Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees, Generics: Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface Collection and Class Collections, Lists, Array List and Iterator, Linked List, Vector. Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java. Util, Class Priority Queue and Interface Queue, Maps, Properties Class, Un-modifiable Collections.
Advance Java Features - Multithreading: Thread States, Priorities and Thread Scheduling, Life Cycle of a Thread, Thread Synchronization, Creating and Executing Threads, Multithreading with GUI,Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI, Networking, Accessing Databases with JDBC: Relational Database, SQL, MySQL, Oracle
Advance Java Technologies - Servlets: Overview and Architecture, Setting Up the Apache Tomcat Server, Handling HTTP get Requests, Deploying a web Application, Multitier Applications, Using JDBC from a Servlet, Java Server Pages (JSP): Overview, First JSP Example, Implicit Objects, Scripting, Standard Actions, Directives, Multimedia: Applets and Application: Loading, Displaying and Scaling Images, Animating a Series of Images, Loading and playing Audio clips
Advance Web/Internet Programming (Overview): J2ME, J2EE, EJB, XML.
E. Balaguruswamy, “Programming In Java”; TMH Publications
The Complete Reference: Herbert Schildt, TMH
Deitel & Deitel, ”JAVA, How to Program”; PHI, Pearson.
Cay Horstmann, Big JAVA, Wiley India.
Merlin Hughes, et al; Java Network Programming , Manning Publications/Prentice Hall
Installation of J2SDK
Write a program to show Scope of Variables
Write a program to show Concept of CLASS in JAVA
Write a program to show Type Casting in JAVA
Write a program to show How Exception Handling is in JAVA
Write a Program to show Inheritance
Write a program to show Polymorphism
Write a program to show Access Specifiers (Public, Private, Protected) in JAVA
Write a program to show use and Advantages of CONTRUCTOR
Write a program to show Interfacing between two classes
Write a program to Add a Class to a Package
Write a program to show Life Cycle of a Thread
Write a program to demonstrate AWT.
Write a program to Hide a Class
Write a Program to show Data Base Connectivity Using JAVA
Write a Program to show “HELLO JAVA ” in Explorer using Applet
Write a Program to show Connectivity using JDBC
Write a program to demonstrate multithreading using Java.
Write a program to demonstrate applet life cycle.
Write a program to demonstrate concept of servlet.