Pages

Tuesday, April 6, 2010

OOS Programming Lab-(MCA-451)



List of Programs

  1. WAP to show the implementation of function overloading.
  2. WAP to Implement abstract classes.
  3. WAP to implement function overriding.
  4. WAP to implement WAP to implement final keyword.
  5. WAP to show exception handling.
  6. WAP to implement user defined exceptions.
  7. WAP to implement super keyword.
  8. WAP to implement applet life cycle.
  9. WAP to implement command line argument.
  10. WAP to implement a package.
  11. Write a program to implement various visibility mode.
  12. WAP to draw a line.
  13. WAP to draw a square.
  14. WAP to draw a rectangle.
  15. WAP to draw a hut.
  16. WAP to input data from keyboard.
  17. WAP of Button using Swing.
  18. WAP of Tabbed panes using Swing
  19. WAP of Grid Layout.
  20. WAP of Border Layout.
  21. WAP to demonstrate menu.
  22. WAP to demonstrate database connectivity java with MS Access.
  23. WAP to demonstrate database connectivity jsp with MS Access with the help of beans.
  24. WAP to demonstrate database connectivity jsp with MS Access with the help of servlet.
  25. WAP to demonstrate database connectivity jsp with MS Access.

Wednesday, February 24, 2010

Object Oriented Systems UNIT 1 (NOTES)

OO Analysis and Design-
OO Analysis - examines requirements from the perspective of the classes and objects found in the vocabulary of the problem domain. In other words, the world (of the system) is modelled in terms of objects and classes.
OO Design - OO decomposition and a notation for depicting models of the system under development. Structures are developed whereby sets of objects collaborate to provide the behaviours that satisfy the requirements of the problem.

Object Oriented Analysis-

  • Analyze the domain problem
  • Describe the process systems
  • Identify the objects
  • Specify attributes
  • Defining operations
  • Inter-object Communication
Identifying Object-

• Objects can be:
  • External Entity (e.g., other systems, devices, people) that produce or consume information to be used by system
  • Things (e.g., reports, displays, letters, signals) that are part of information domain for the problem
  • Places (e.g., book’s room) that establish the context of the problem and the overall function of the system.
  • Organizational units (e.g., division, group, team, department) that are relevant to an application,
  • Transaction (e.g., loan, take course, buy, order).
Objects –
  •  Object is an abstraction of something in a problem domain, reflecting the capabilities of the system to  keep information about it, interact with it, or both.
  •  Objects are entities in a software system which represents instances of real-world and system entities.


Object Class-
         Class is a description of a set of objects that share the same attributes, operations, methods, relationship and semantics.
         Object classes are templates for objects. They may be used to create objects.
         An object represents a particular instance of a class.

Term of objects-

         Attribute: data items that define object. An attributes is a data value held by the object in a class. Example- Color, weight and model year are attributes of Car objects.
         Operation: function in a class that combines to form behavior of class. Each operation has a target object as an implicit argument.
         Methods: the actual implementation of procedure (the body of code that is executed in response to a request from other objects in the system).




Encapsulation and Data Hiding-
         Packaging related data and operations together is called encapsulation.
         Data hiding: hides the internal data from external by methods (interface).

Encapsulation-

l      private attributes and methods are encapsulated within the class, they cannot be seen by clients of the class
l      public methods define the interface that the class provides to its clients



Object communication-
         Objects communicate with each other by sending messages
        a message is a method call from a message-sending object to a message-receiving object
        a message consists of
         an object reference which indicates the message receiver
         a method name (corresponding to a method of the receiver), and
         parameters (corresponding to the arguments of the calling method)
        a message-receiving object is a server to a message-sending object, and the message-sending object is a client of the server






Message Passing

Inheritance-
         Object classes may inherit attributes and services from other object classes.
         Inheritance represents the generalization of a class.

A generalisation hierarchy- Generalization and inheritance are powerful abstractions for sharing similarities among classes while preserving their differences. Generalization is the relationship between a class and one or more refined version of it. The class being refined is called its super class and each refined version is called a sub class. The notation for generalization is a triangle connecting a super class to its sub class.









Multiple inheritance-

         Rather than inheriting the attributes and services from a single parent class, a system which supports multiple inheritance allows object classes to inherit from several super-classes
         Can lead to semantic conflicts where attributes/services with the same name in different super-classes have different semantics
         Makes class hierarchy reorganisation more complex



Advantages of inheritance-

         It is an abstraction mechanism which may be used to classify entities
         It is a reuse mechanism at both the design and the programming level
         The inheritance graph is a source of organisational knowledge about domains and systems

Problems with inheritance-
         Object classes are not self-contained. they cannot be understood without reference to their super-classes
         Designers have a tendency to reuse the inheritance graph created during
         analysis. Can lead to significant inefficiency
         The inheritance graphs of analysis, design and implementation have different functions and should be separately maintained


Link:
·         A link is a physical or conceptual connection between object instances
·         A link is an instance of an association.
Objects Association-
         Modeling an association between two classes means that there is some sort of relationship between objects of each class that may be connected.
         An association describes a group of links with common structure and common semantics.
         Although associations are modeled as bidirectional they do not have to be implemented in both directions.
         Association may be binary, ternary or higher order.


Object aggregation-
         Aggregation model shows how classes which are collections are composed of other classes Similar to the part-of relationship in semantic data models.
         Aggregation is a strong form of association in which an aggregate object is made of components.
         A single aggregate object may have several parts; each part-whole relationship is treated as a separate aggregation in order to emphasize the similarity to association.


Polymorphism-
         The ability of different objects to perform the appropriate method in response to the same message is known as polymorphism.
         the selection of the appropriate method depends on the class used to create the object



Candidate Keys: A candidate key is a minimal set of attributes that uniquely identifies an object or link by minimal, we mean that you can not be discard an attribute from the candidate key and still all objects and link. A class or association may have one or more candidate keys, each of which may have different combinations and attributes. The object id is always a candidate key for a class. One or more combinations of related objects are candidate key for associations.


Example of candidate objects-

Just a Line management wishes to increase security, both in their building and on site, without antagonizing their employees. They would also like to prevent people who are not part of the company from using the Just a Line car park.
It has been decide to issue identity cards to all employees, which they are expected to wear while on the Just a Line site. The cards records the name, department and number of the member of staff, and permit access to the Just a Line  car park.
A barrier and a card reader are placed at the entrance to the car park. The driver of an approaching car insert his or her numbered card in the card reader, which then checks that the card number is known to the Just a Line system. If the card is recognized, the reader sends a signal to raise the barrier and the car is able to enter the car park.
At the exit, there is also a barrier, which is raised when a car wishes to leave the car park.
When there are no spaces in the car park a sign at the entrance display “Full” and is only switched off when a car leaves.
Special visitor’s cards, which record a number and the current date, also permit access to the car park. Visitor’s cards may be sent out in advance, or collected from reception. All visitor’s cards must be returned to reception when the visitor leaves Just a Line.



Candidate objects:
Just a Line              management                          security                              building
Site                         employee                                people                               company
car park                  card                                        name                                  department
number                   member of staff                     access                                barrier
card reader             entrance                                  driver                                car
system                   signal                                       exit                                    space
sign                        visitor                                     reception

Candidate objects’ rejection-

         duplicates: if two or more objects are simply different names for the same thing.
         irrelevant: objects which exists in the problem domain, but which are not intended.
         vague: when considering words carefully it sometimes becomes clear that they do not have a price meaning and cannot be the basis of a useful in the system.
         general: the meaning is too broad.
         attributes: as the attribute of objects.
         associations: actually represents the relationships between objects.
         roles: sometimes objects referred to by the role they play in a particular part of the system.


Rejected Candidate objects





Rest Objects-
Car park                                   Staff Card                       Visitor’s card
Employee                                 Entrance                          exit                        
card reader                               barrier                              Full sign
space                                        sensor                              car


Object Relationship-






Multiplicity-
  • Multiplicity specifies how many instances of one class may relate to single instances of one class may relate to single instances of associated classes.
  • Multiplicity contains the number of related classes.
  • Multiplicity depends on assumptions and how you define the boundaries of a problem.

Role Name-
  • A role is one end of association.
  • A binary association has two roles, each of which may have a role name.
  • A role name is a name that uniquely identifies one end of association 





Metadata- Metadata is data that describe other data. For example, the definition of a class is metadata. Many real world applications have metadata, such as parts, catalogs, blue-prints and dictionaries.

Constraints- Constraints are functional relationship between entities of an object model. The term entity includes objects, classes, attributes, links and association. A constraint restricts the values that entries can assume. Examples include: No employee’s salary can exceed the salary of the employee’s boss.





Sunday, January 10, 2010

CBNST BOOK FOR MCA STUDENTS ACORDING UPTU


Its a nice book for students of MCA and B.E . There are a lot of solved questions on every topic.  Example gives you a extra edge to understand this subject.It has nice collection of questions. In short i can say that it is a nice creative work of Mr. Udit Aggrwal. I like to congrats him for this valuable book for students.




Sunday, January 3, 2010

USE YOUR BRAIN WITH JAVA


These are nice books on JAVA Technology . Enjoy study and search pearls of creativity in depth of java.   






REGARDING THE USE CALCULATORS IN THE UNIVERSITY EXAMINATION



LIST OF PERMISSIBLE CALCULATORS-

CASIO- fx 82 ES, fx 9928S, fx.........MS series, along with the order models viz. fx 100, fx 115, fx 82, fx 80, series of calculators. The whole of the presently available fx...... MS series of CASIO calculators are permissible. The manufacturer lists these calculators as standard Scientific Calculators.
TEXAS INSTRUMENTS- TI 30, TI 34, TI 36, series of calculators.
HEWLETT PACKERD- HP9s, HP 30s series of calculators.

LIST OF NON PERMISSIBLE CALCULATORS-

CASIO-         fx ........G, fx..... GB, CFX........GB
                     fx..........p, fx......PA, fx.............Pv, fx.......LA series of             calculators.
ORPAT         fx............P series of calculators.
TEXAS INSTRUMENTS- TI 73, TI 83, TI 84, TI 86, TI 89, Voyage 200 series of calculators.
 HEWLETT PACKERD- HP 33 S, 9G, HP 39G, HP 48G, HP 49G, series of calculators.

Saturday, January 2, 2010

UPTU SYLLABUS - COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES (MCA-212)

MCA-212: COMPUTER BASED NUMERICAL AND  STATISTICAL TECHNIQUES

Unit-I
Floating point Arithmetic: Representation of floating point numbers, Operations, Normalization, Pitfalls of floating point representation, Errors in numerical computation
Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using Bisection Method, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant method, Rate of convergence of iterative methods.
Unit-II
Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination direct method and pivoting, Ill Conditioned system of equations, Refinement of solution. Gauss Seidal iterative method, Rate of Convergence
Interpolation and approximation: Finite Differences, Difference tables
Polynomial Interpolation: Newton’s forward and backward formula
Central Difference Formulae: Gauss forward and backward formula, Stirling’s, Bessel’s, Everett’s formula.
Interpolation with unequal intervals: Langrange’s Interpolation, Newton Divided difference formula, Hermite’s Interpolation
Approximation of function by Taylor’s series and Chebyshev polynomial
Unit-III
Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical Integration, Trapezoidal rule, Simpson’s rules, Boole’s Rule, Weddle’s Rule Euler- Maclaurin Formula
Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method,
Runge-Kutta methods, Predictor-corrector method, Automatic error monitoring, stability of solution.
Unit-IV
Curve fitting, Cubic Spline and Approximation: Method of least squares, fitting of straight lines, polynomials, exponential curves etc
Frequency Chart: Different frequency chart like Histogram, Frequency curve, Pi-chart.
Regression analysis: Linear and Non-linear regression, Multiple regression
Unit-V
Time series and forcasting: Moving averages, smoothening of curves, forecasting models and methods. Statistical Quality Controls methods
Testing of Hypothesis: Test of significance, Chi-square test, t-test, ANOVA, F-Test
Application to medicine, agriculture etc.

References:
1. Rajaraman V., “Computer Oriented Numerical Methods”, PHI
2. Gerald & Wheatley, “Applied Numerical Analyses”, AW
3. Jain, Iyengar and Jain, “Numerical Methods for Scientific and Engineering Computations”, New Age Int.
4. Grewal B. S., “Numerical methods in Engineering and Science”, Khanna Publishers, Delhi
5. T. Veerarajan, T Ramachandran, “Theory and Problems in Numerical Methods”, TMH
6. Pradip Niyogi, “Numerical Analysis and Algorithms”, TMH
7. Francis Scheld, “Numerical Analysis”, TMH
9. Gupta S. P., “Statistical Methods”, Sultan and Sons

UPTU SYLLABUS -OBJECT ORIENTED SYSTEMS (MCA-412)

MCA-412 : OBJECT ORIENTED SYSTEMS

Unit – I
Object Modeling: Objects and classes, links and association, generalization and inheritance, aggregation, abstract class, multiple inheritance, meta data, candidate keys, constraints.
Unit – II
Dynamic Modeling: Events and states, operations, nested state diagrams and concurrency, advanced dynamic modeling concepts, a sample dynamic model.
Unit – III
Functional Modeling: Data flow diagram, specifying operations, constraints, a sample functional model.OMT (object modeling techniques) methodologies, examples and case studies to demonstrate methodologies, comparisons of methodologies, SA/SD, JSD.
Unit – IV
Java Programming: Introduction, Operator, Data types, Variables, Methods & Classes, Multithread Programming, I/O, Java Applet.
Java Library: String Handling, Input/Output exploring Java.io, Networking, Applets classes, Event Handling, Introduction to AWT, Working with window, Graphics, AWT Controls, Layout Manager and Menus, Images, Additional packages.
Unit – V
Software Development using Java:
Java Beans, Java Swing, Java Servlets, Migrating from C++ to java, Application of java, Dynamic Billboard Applet, Image Menu: An image based menu, Lavatron Applets, Scrabblets, JDBC, Brief functioning of upper layer E-mail and their applications.

Text Books:
1. James Rumbaugh etal, “Object Oriented Modeling and Design”, PHI
2. Herbert Schieldt, “The Complete Reference: Java”, TMH.
3. E. Balagurusamy, “Programming in JAVA”, TMH.
References:
1. Booch Grady, “Object Oriented Analysis & Design with application 3/e”, Pearson
Education, New Delhi.
2. Bjarne Stroustrup, “C++ Programming Language”, Addison Wesley
3. E. Balagurusamy, “Object Oriented Programming with C++”, TMH

Followers