Questions

include<stdio.h>
int main(){

  int s,i,j,temp,a[20];

  printf("Enter total elements: ");
  scanf("%d",&s);

  printf("Enter %d elements: ",s);
  for(i=0;i<s;i++)
      scanf("%d",&a[i]);

  for(i=0;i<s;i++){
      for(j=i+1;j<s;j++){
           if(a[i]>a[j]){
               temp=a[i];
              a[i]=a[j];
              a[j]=temp;
           }
      }
  }

  printf("After sorting is: ");
  for(i=0;i<s;i++)
      printf(" %d",a[i]);

  return 0;
}

Output:
Enter total elements: 5
Enter 5 elements: 4 5 0 21 7
The array after sorting is:  0 4 5 7 21

Selects from among the processes in memory that are ready to execute, and allocates the CPU to one of them. CPU scheduling decisions may take place when a process: 1.Switches from running to waiting state. 2.Switches from running to ready state. 3.Switches from waiting to ready. 4.Terminates. Scheduling under 1 and 4 is non-preemptive. All other scheduling is preemptive.

There are two payment types that will help you stick to your budget.

1. Cash
2. Debit Card

The amount in the debit card is the only amount you can spend to stay within budget.

These method work because once you spend your money, you are done. You don’t have anything else to spend.

Credit cards, payday loans, and cash advances are all loans on future income. When you use a credit card, there is always just a little bit more you can spend. These types do not help you budget properly. In fact, these types encourage you to spend beyond your means and be out of budget.

A data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways.

Linear data structure: A linear data structure traverses the data elements sequentially, in which only one data element can directly be reached.

Ex: Arrays, Linked Lists, Stack, Queue, Any type of List all are linear.

Trees like Binary Tree, B Tree or B+ Tree are examples of non linear data structure.

A database that contains multiple tables related through common fields.

A common field is a field of data that is shared among all forms in a database. Without them, it would be difficult and/or time-consuming to create other forms.