Database Programming

When we are talking about a big project we Use Water fall model. Water fall model has total of five stages.

We have something like this: 100n^2 < 2n <=> 50n<1 <=> n < 1/50 <=> No n at all Keep in mind that for n to be a size of a problem, it should be a positive integer. Therefore, no N

we can sort unordered list to order list. we fallow a mechanism given list divided into two parts take one-one part ordered them

A line management system refers to the structures and procedures that a business puts in place to guide its line managers. This could include scheduled appraisals and reports, a structured program of salary increments and formal disciplinary procedures.

Line management systems advantage managers by ensuring that they have access to tools and strategies to help them to fulfil their responsibilities. They also boost employee satisfaction and motivation, by helping to create a sense of fair treatment and a level playing field for all staff.

Disadvantage of line management is that since it is one man show the lack of specialization is clearly visible in such type of management as each job requires different skill to complete the job effectively and efficiently and one man cannot learn all the skills alone so there will be always that lack of knowledge or specialization in case of line management.

Line management has both advantages, as well as disadvantages and any company thinking of applying this form of organization structure, should carefully analyze both the aspects and then take the decision.

1. effectiveness of the system if whether it achieves its goals or not.
2. efficiency , check if what is produced is it the product that was supposed to be produced.
3. complexity ,checking on how the system elements are complicated .
4. control ,operate under the given instruction.

The Method To Add an element in Circular Queue

# define MAXQUEUE 100 struct queue{

int items[MAXQUEUE];

int front, rear;

}

struct queue q;

q.front=q.rear=MAXQUEUE -1;

void ENQ(struct queue *pq, int x)

{

/* make room for new element*/

if(pq ->rear = MAXQUEUE - 1)

pq-> rear = 0;

else

(pq->rear)++;

/* check for overflow */

if(pq ->rear==pq->front)

{

printf("queue overflow);

exit(1);

}

pq->items[pq->rear]=x;

return;

}/* end of ENQ*/

A Method to Delete an element from Circular Queue

int DQ(struct queue *pq)

{

if(pq-> rear == pq-> front)

{

printf("queue underflow");

exit(1);

}/*end if*/

if(pq->front = = MAXQUEUE-1)

pq->front=0;

else

(pq->front)++;

return(pq->items[pq->front]);

Advantages of DBMS (Database Management Systems) are followings:

A true DBMS offers several advantages over file processing. The principal advantages of a DBMS are the followings:

• Flexibility: Because programs and data are independent, programs do not have to be modified when types of unrelated data are added to or deleted from the database, or when physical storage changes.

• Fast response to information requests: Because data are integrated into a single database, complex requests can be handled much more rapidly then if the data were located in separate, non-integrated files. In many businesses, faster response means better customer service.

• Multiple access: Database software allows data to be accessed in a variety of ways (such as through various key fields) and often, by using several programming languages (both 3GL and nonprocedural 4GL programs).

• Lower user training costs: Users often find it easier to learn such systems and training costs may be reduced. Also, the total time taken to process requests may be shorter, which would increase user productivity.

• Less storage: Theoretically, all occurrences of data items need be stored only once, thereby eliminating the storage of redundant data. System developers and database designers often use data normalization to minimize data redundancy.

One definition of a "procedural programming language" is a language that is used to describe how a program should accomplish the task it is to perform. This is in opposition to a "declarative programming language" that is used to describe what the program should accomplish rather than how it accomplishes the task.

A data type is, well, the type of data. The most common types are strings (text with spaces, punctuation, etc), integers (whole numbers within a certain range, depending on the specific type), and decimal numbers (1.7). Depending on the database software, there will be many other types.

Same with other Visual Basic program, programming in FoxPro will require you to have the right syntax.

Logical operations involve the use of three operators - NOT, AND and OR. NOT simple negates a value.

It uses one operand.

For Example - a) Not True (which means, False as True and False are the only possible values) b) Knowing English AND French (means someone who knows both English AND French) c) Knowing English OR French (means someone who knows either English or French).

You simply access it. That's what public means. You can access a public member from any other class, or even from non class code, so long as the referenced class is in scope to the referencing code. In order to do that, you need to have a reference (directly or indirectly) to the instance of the class you want to reference. This would generally be passed as an argument to the referencing code.

well ladies and gentelmen kal hai shanivar is the...post office me banta hai card adhaar is the!! :p

NOW seriously,,,take a paper and make the gola with pencil, and take a actor with straight hands and legs and join the gola with the actor using teer..

and u will have ur pyaara data flow diagram.

• The 10 Golden Rules of Systems Analysis

• Rule 1: There Always Is a Client

• Rule 2: Your Client Does Not Understand His Own Problem

• Rule 3: The Original Problem Statement is too Specific: You Must Generalize the Problem to Give it Contextual Integrity

• Rule 4: The Client Does Not Understand the Concept of the Index of Performance

• Rule 5: You are the Analyst, Not the Decision-Maker

• Rule 6: Meet the Time Deadline and the Cost Budget

• Rule 7: Take a Goal-Centered Approach to the Problem, Not a Technology-Centered or Chronological Approach

• Rule 8: Nonusers Must be Considered in the Analysis and in the Final Recommendations

• Rule 9: The Universal Computer Model is a Fantasy

• Rule 10: The Role of Decision-Maker in Public Systems is Often a Confused One

Stack and Queue have elements enter and leave frequently, and the total number of elements within the container (the stack or the queue) may be unpredictable. That is, the size of the container may be 0 or very huge.

Array is a fixed size collection. When adding an element, if the array is already full, it cannot simply add another "slot" to hold the new entry. The program must create another array instance that is big enough to hold the original elements and the new comers, which means all the elements must be "moved" from the current array to the newly created one.

Linked list has the advantage of easily adding and removing a node (to hold an element) and keep the ones already in the list untouched.

You retrieve, store, and update SQL3 datatypes the same way you do other datatypes. You use either ResultSet. getXXX or CallableStatement. getXXX methods to retrieve them, PreparedStatement. setXXX methods to store them, and updateXXX to update them. Probably 90 percent of the operations performed on SQL3 types involve using the getXXX , setXXX , and updateXXX methods. The following table shows which methods to use:

SQL3 type

getXXX method

setXXX method

updateXXX methodBLOB

getBlob

setBlob

updateBlobCLOB

getClob

setClob

updateClobARRAY

getArray

setArray

updateArrayStructured type

getObject

setObject

updateObjectREF (structured type)

getRef

setRef

updateRef

For example, the following code fragment retrieves an SQL ARRAY value. For this example, the column SCORES in the table STUDENTS contains values of type ARRAY . The variable stmt is a Statement object. ResultSet rs = stmt.executeQuery( "SELECT SCORES FROM STUDENTS WHERE ID = 2238"); rs.next(); Array scores = rs.getArray("SCORES");

The variable scores is a logical pointer to the SQL ARRAY object stored in the table STUDENTS in the row for student 2238.

If you want to store a value in the database, you use the appropriate setXXX method. For example, the following code fragment, in which rs is a ResultSet object, stores a Clob object: Clob notes = rs.getClob("NOTES"); PreparedStatement pstmt = con.prepareStatement( "UPDATE MARKETS SET COMMENTS = ? WHERE SALES < 1000000", ResultSet.TYPE_SCROLL_INSENSITIVE, ResultSet.CONCUR_UPDATABLE); pstmt.setClob(1, notes);

This code sets notes as the first parameter in the update statement being sent to the database. The CLOB value designated by notes will be stored in the table MARKETS in column COMMENTS in every row where the value in the column SALES is less than one million

A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

//posted by Mr. VINOD KUMAR HOODA from HISAR, HARYANA

#include<stdio.h>

#include<conio.h>

void insert(int);

int delet(int);

void display(void);

void run(void);

void checkf(int z);

void checke(void);

int size=5;

int rear=-1;

int front=-1;

int queue[5]={55,66,77};

void main()

{

front+=1;

rear+=3;

int n;

int op;

printf("current queue is:");

display();

printf("\nPress:");

printf("\n1: for insertion of an element into the queue");

printf("\n2: for deletion of an element from the queue");

printf("\n3: check for full queue");

printf("\n4: check for empty queue");

printf("\n5: for exit\n");

scanf("%d",&op);

switch(op)

{

case 1:insert(size);break;

case 2:delet(size);break;

case 3:checkf(size); break;

case 4:checke(); break;

case 5:exit(1); break;

default:printf("\nWrong operator");

}

getch();

}

void insert(int n)

{

int item;

if(front!=-1&&rear!=n)

{

printf("\nEnter the item to be inserted");

scanf("%d",&item);

queue[rear+1]=item;

}

else

{

printf("\ncan not be inserted\n");

}

display();

}

int delet(int n)

{

printf("\ndeleted from queue\n");

if(front!=-1 && front!=rear)

{ run();

display();

}

else if(front!=-1 && front==rear)

{ run();

front=front-1;

display();

}

else if(front==-1)

{ printf("\nQueue is empty"); }

}

void display(void)

{

int i;

printf("\nDisplaying Queue\n");

for(i=0;i<size;i++)

printf("%d ",queue[i]);

}

void run(void)

{ int m,temp;

for(m=front;m<=rear-1;m++)

{temp=queue[m];

queue[m]=queue[m+1];

}

for(m=rear;m<size;m++)

{ queue[m]=0; }

rear=rear-1;

}

void checkf(int z)

{ if(rear==z-1)

{ printf("Queue is Full \n");

}

else

{ printf("Queue is not Full, new values can be inserted. \n");

}

}

void checke(void)

{ if(front==-1)

{ printf("Queue is empty \n");

}

else

{ printf("Queue is not empty, new values can be deleted. \n");

}

}

key is nothing but a attribute and attribute is the aspect of a member in an entity

entity is represented by set of attributes.

primary key is the one which is selected by the database designer to identify a entity in a entity set

super key is one or more attributes which is used to identify the entity in an entity set uniquely

candidate key minimal number of super keys... in some context super key and secondary key are equal.

foreign key is the relational constraint between tables or entities

A secondary key is made on a field that you would like to be indexed for faster searches!

For any Further detail,you visit this website:http://www.iyogibusiness.com