Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Information Hiding
With the information hiding, you see only the details that are significant at a given level of algorithm and data structure design. The Information hiding keeps high-level design decisions separate from the low-level design details that are more likely to be change.
Algorithms
You employ information hiding for the algorithms through top-down design. Once you define the aim and interface specifications of a low-level procedure, you can pay no attention to the implementation details. They are hidden at higher levels. For e.g., the implementation of a procedure named raise_salary is hidden. All you require is to know that the procedure will increase a specific employee's salary by a given amount. Any change in the definition of raise_salary is visible to the calling applications.
Data Structures
You implement information hiding for the data structures through data encapsulation. By developing a set of utility subprograms for a data structure, you protect it from users and other developers. In that way, the other developers know how to use the subprograms that operate on the data structure but not how the structure is represented.
With the PL/SQL packages, you can specify whether the subprograms are public or private. Therefore, the packages enforce data encapsulation by letting you put subprogram definitions in a black box. The private definition is hidden and unapproachable. Only the package, not your application, is affected if definition changes. This simplifies the maintenance and enhancement.
Assigning and Comparing Collections One collection can be assigned to other by an SELECT, INSERT, UPDATE, or FETCH statement, an assignment statement, or by a subprogram call. A
Order of Evaluation When you do not use the parentheses to specify the order of evaluation, the operator precedence determine the order. Now compare the expressions below: NOT
CHECK Constraints in SQL A CHECK constraint is a table constraint defined using the key word CHECK, as already illustrated in several examples in this chapter. In particular,
which operation is used if we are interested in only certain columns of a table?
Recursion The Recursion is a powerful method for simplify the design of the algorithms. Principally, the recursion means the self-reference. In the recursive mathematical serie
I need SQL to infopath data connection Project Description: Want data retrieval connection from SQL to SharePoint infopath Skills required are Sharepoint, SQL
Case Sensitivity Similar to all the identifiers, the variables, the names of constants, and parameters are not case sensitive. For illustration, PL/SQL considers the following n
CLOSE Statement The CLOSE statement allows the resources held by a cursor variable or open cursor to be reused. No more rows can be fetched from the cursor variable or closed
Parameter and Keyword Description: cursor_variable_name: This identifies a cursor variable or the parameter formerly declared within the present scope. host_cursor_va
Using Operator DEREF: You cannot navigate through refs within the PL/SQL procedural statements. Rather than, you should use the operator DEREF in the SQL statement. The DEREF
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd