Profile cover photo
Profile photo
Usman Ashraf
545 followers
545 followers
About
Posts

Post has attachment
Networking Terminologies
Please write a brief note on all the terminologies. A quiz will be taken on the following in the upcoming class. Network congestion TCP congestion-avoidance             Additive increase/multiplicative decrease Slow-start Fast Retransmit                    ...
Add a comment...

Post has attachment
Add a comment...

Post has shared content
Banjosa Lake is an artificial lake and a tourist resort 20 kilometers from the city of Rawalakot in District Poonch of Azad Kashmir, Pakistan. 
Sanaullah Khan©

Natural Scenery of Pakistan
#Pakistan   #naturalsceneryofpakistan .  #photography   #photographer 
Photo
Add a comment...

Post has attachment
BST implementation in C
include include include struct treeNode { struct treeNode leftPtr; / pointer to left subtree / int data; / node value / struct treeNode *rightPtr; / pointer to right subtree / }; typedef struct treeNode TreeNode; / synonym for struct treeNode */  ty...
Add a comment...

Post has attachment
Sorted Linked List implementation in C
include "stdio.h" include "stdlib.h" include "conio.h" void del(int data); void insert(int value); void display(); struct node {     int data;     struct node *link; }; struct node *top=NULL,*temp, *temp1, *temp2, *temp3; int main() {     int choice,data;  ...
Add a comment...

Post has attachment
Sorted Linked List implementation in C
include "stdio.h" include "stdlib.h" include "conio.h" void del(int data); void insert(int value); void display(); struct node {     int data;     struct node *link; }; struct node *top=NULL,*temp, *temp1, *temp2, *temp3; int main() {     int choice,data;  ...
Add a comment...

Post has attachment
Priority Queue Implementation in C using Arrays
#include "stdio.h" #include "conio.h" #define size 5 int queue[5][2] = {0}; int top = 1; int bottom; void push(int value, int pr) { int i,j,k; if(top < size-1) { if(queue[top][1] > pr) { for(i=0;i { if(queue[i][1] > pr) { break; } } for(j=top;j>=i;j-) { q...
Add a comment...

Post has attachment
Priority Queue Implementation in C using Arrays
#include "stdio.h" #include "conio.h" #define size 5 int queue[5][2] = {0}; int top = 1; int bottom; void enqueue(int value, int pr) { int i,j,k; if(top < size-1) { if(queue[top][1] > pr) { for(i=0;i { if(queue[i][1] > pr) { break; } } for(j=top;j>=i;j-) ...
Add a comment...

Post has attachment
Priority Queue Implementation in C using Arrays
#include "stdio.h" #include "conio.h" #define size 5 int queue[5][2] = {0}; int top = 1; int bottom; void enqueue(int value, int pr) { int i,j,k; if(top < size-1) { if(queue[top][1] > pr) { for(i=0;i { if(queue[i][1] > pr) { break; } } for(j=top;j>=i;j-) ...
Add a comment...

Post has attachment
C program for Stack implementation using array
#include #include #define size 5 int stack[size] = {0}; int top = -1; void push(int value) { if(top < size) { top++; stack[top] = value; } else { printf("Stack overflow \n"); } } void pop() { if(top >= 0) { printf("The popped element is:\t %d \n", stack[top...
Add a comment...
Wait while more posts are being loaded