Posts

Create Maps that Show a Path Over Time in Tableau

-
Image
  Create Maps that Show a Path Over Time in Tableau: ou can create maps in Tableau Desktop that show a path over time, similar to the example below. These types of maps are called flow maps, or path maps. Flow maps are great for when you want to show where something went over time, such as the path of a storm. This topic illustrates how to create a flow map using an example. Follow the example below to learn how to set up your data source, and build the view for a flow map. Your data source Link opens in a new window) To create a flow map, your data source should include the following types of information: Latitude and longitude coordinates for each data point in a path A column to define the order to connect the points (this can be date information, or manually applied numbers, such as 1, 2, 3, 4, 5) A unique ID for each path Enough data points to shape each path into a line For example, the following table is a snippet of the Storm data source, which is included in the  Crea...
Post a Comment
Read more

Creating Sparklines

-
  Creating Sparklines The example uses the Superstore sample to create a sparkline that shows sales and profit for various product categories over a long period. Create the View 1.        From the  Dimensions  pane, drag  Order Date  to the  Columns  shelf 1.       On the  Columns  shelf, right-click  Order Date  and select the second instance of  Day Alternatively, if you want to view the profits over four years on a continuous axis, select the second instance of Month. 2.        From the  Dimensions  pane, drag  Category  and  Segment  to the Rows shelf 3.        From the  Measures  pane, drag  Sales  to the  Rows  shelf 4.        On the Columns shelf, right-click  Month  and uncheck  Show ...
Post a Comment
Read more

IMPLEMENTATION OF LRU PAGE REPLACEMENT ALGORITHM

-
  IMPLEMENTATION OF LRU PAGE REPLACEMENT ALGORITHM AIM: To write a c program to implement LRU page replacement algorithm ALGORITHM : 1. Start the process 2. Declare the size 3. Get the number of pages to be inserted 4. Get the value 5. Declare counter and stack 6. Select the least recently used page by counter value 7. Stack them according the selection. 8.  Display the values 9. Stop the process PROGRAM: #include<stdio.h> main() { int q[20],p[50],c=0,c1,d,f,i,j,k=0,n,r,t,b[20],c2[20]; printf("Enter no of pages:"); scanf("%d",&n); printf("Enter the reference string:"); for(i=0;i<n;i++)             scanf("%d",&p[i]); printf("Enter no of frames:"); scanf("%d",&f); q[k]=p[k]; printf("\n\t%d\n",q[k]); c++; k++; for(i=1;i<n;i++)             {                ...
Post a Comment
Read more

IMPLEMENTATION OF FIFO PAGE REPLACEMENT ALGORITHM

-
IMPLEMENTATION OF FIFO PAGE REPLACEMENT ALGORITHM  AIM To write a c program to implement FIFO page replacement algorithm ALGORITHM 1. Start the process 2. Declare the size with respect to page length 3. Check the need of replacement from the page to memory 4. Check the need of replacement from old page to new page in memory 5. Forma queue to hold all pages 6. Insert the page require memory into the queue 7. Check for bad replacement and page fault 8. Get the number of processes to be inserted 9. Display the values 10. Stop the process PROGRAM: #include<stdio.h> int main() { int i,j,n,a[50],frame[10],no,k,avail,count=0;             printf("\n ENTER THE NUMBER OF PAGES:\n"); scanf("%d",&n);             printf("\n ENTER THE PAGE NUMBER :\n");             for(i=1;i<=n;i++)    ...
Post a Comment
Read more

Priority Scheduling Program in C

-
  Priority Scheduling Program in C Priority Scheduling  is a CPU scheduling algorithm in which the CPU performs the task having higher priority at first. If two processes have the same priority then scheduling is done on  FCFS  basis (first come first serve). Priority Scheduling is of two types :  Preemptive  and  Non-Preemptive . Preemptive:  In this case, resources can be voluntarily snatched. Non-Preemptive:  In this type, if a process is once started, it will execute completely i.e resources cannot be snatched. Following are the basic terminologies: Waiting Time:  Time for which the process has to wait in the ready queue. Turn Around Time:  Total time taken by the process for execution (waiting time + burst time). Problem Description: Write a C Program to implement priority scheduling. Example: Following is the example of non preemptive scheduling with arrival time zero. Process Burst Time ...
Post a Comment
Read more