INDEXES
INDEXES Indexing a table is an ‘access strategy’, that is, a way to sort and search records in the table. Indexes are essent…
INDEXES Indexing a table is an ‘access strategy’, that is, a way to sort and search records in the table. Indexes are essent…
SEQUENCE A sequence is a database object used to generate sequence numbers for rows in the tables. It can be used for produc…
VIEWS To reduce redundant data to the minimum possible, Oracles allows the creation of an object called a view. A view is ma…
SUBQUERIES A Sub Query is a form of an SQL statement that appears inside another SQL statement. It is also termed as NESTED …
JOINS Sometimes we require treating multiple tables as though they were a single entity. Then a single SQL sentence can mani…
ORACLE FUNCTIONS Oracle functions serve the purpose of manipulating data items and returning a result. Functions are also ca…
DUAL TABLE Dual is a small Oracle worktable, which consists of only one row and one column, and contains the value X in that…
ARITHMETIC OPERATORS Oracle allows arithmetic operators to be used while viewing records from the table or while performing …
CONSTRAINTS The oracle server uses constraints to prevent invalid data entry into tables. Constraints prevent the deletion o…
DELETE OPERATIONS The verb DELETE in SQL is used to remove rows from table. To remove All the rows from a table. Or …
COMMANDS USED IN A TABLE:- CREATE TABLE COMMAND The CREATE TABLE command includes a single clause for the column definition.…
Categories of SQL statements:- SQL is a simple and powerful language used to create, access, and manipulate data and structu…
DATA TYPES THAT A CELL CAN HOLD Data Types:- CHAR (Size):- This data type is used to store character strings values of fixed…
SQL (STRUCTURED QUERY LANGUAGE) SQL is an ANSI (American National Standards Institution) standard for accessing database sys…
// Addition of polynomials // #include #include #define NULL 0 struct list { int coeff ; int power ; struct list *next; }; t…
// Binary search // #include #include #define NULL 0 struct rec { int num; struct rec *left; struct rec *right; }; typedef s…
//Program to implement stack using linked list// #include "stdio.h" #include "conio.h" #include "al…
//To implement stacks using array// #include "iostream.h" #include"conio.h" #include"ctype.h" …
// Program of tower of Hanoi // #include"iostream.h" #include"conio.h" int main() { int n; char beg=…
//Implementing queue with arrays// #include"iostream.h" #include"conio.h" #define NIL -1 #define MAX 10 …
// Circular linked list // #include #include #define NULL 0 struct list { int data; struct list *next; }; typedef struct lis…
// Merge sort // #include #include #define SIZE 10 class int_list { private: int arr[SIZE]; int no; public: int_list() { no=…
// Quick sort // #include #include #define SIZE 10 int main() { void quick(int [],int,int,int); clrscr(); int i,n,arr[SIZE];…
// Heap sort // #include"iostream.h' #include"conio.h" #define SIZE 30 int main() { int a[SIZE],heap[SIZE…
// Implement queue as linked list // #include"iostream.h" #include"conio.h" #include'alloc.h" #…
//circular Queue// #include #include #define NIL -1 #define MAX 5 typedef struct { int terms[MAX]; int front,rear; }que; cla…
// Program to sort the nos using radix sort// #include"iostream.h" #include"conio.h" #include"math.…
// Circular linked list // #include"iostream.h" #include"conio.h" #define NULL 0 struct list { int data;…
// Doubly linked list // #include #include #define NULL 0 struct list { int data; struct list*next; struct list *prev; }; ty…
PONDICHERRY UNIVERSITY (A Central University) Admission Notice 2008-09 (1) P.G. Programmes (M.A./M.Sc.) (2) P.G. Diploma P…