Profile

Cover photo
Usman Ashraf
522 followers|19,545,365 views
AboutPostsPhotosYouTube

Stream

Usman Ashraf

Shared publicly  - 
 
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                    ...
1
ezekwe Nicholas's profile photo
 
Can packet tracer support SSH configuration ?

Add a comment...

Usman Ashraf

Shared publicly  - 
 
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...
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 */ typedef TreeNode *TreeNodePtr; /* synonym ...
1
Add a comment...

Usman Ashraf

Shared publicly  - 
 
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;  ...
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; while(1) //infinite loop is used to insert/delete ...
1
Add a comment...

Usman Ashraf

Shared publicly  - 
 
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...
Home; Networking Tutorial. Packet Tracer Tutorial · NS2 Tutorial · ITGURU Tutorial · Networking Tutorial. Programming Tutorial. Programming Tutorial · C programming · Linux · Data Structures · Object Oriented Programming · DBMS Tutorial · Manuals; Articles. Quotes · Articles ...
1
Abiya Carol's profile photo
 
Very nice post here thanks for it .I always like and such a super contents of these post.Excellent and very cool idea and great content of different kinds of the valuable information's.

http://www.thinkittraining.in

Add a comment...

Usman Ashraf

Shared publicly  - 
 
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-) ...
Home; Networking Tutorial. Packet Tracer Tutorial · NS2 Tutorial · ITGURU Tutorial · Networking Tutorial. Programming Tutorial. Programming Tutorial · C programming · Linux · Data Structures · Object Oriented Programming · DBMS Tutorial · Manuals; Articles. Quotes · Articles ...
1
Add a comment...

Usman Ashraf

Shared publicly  - 
 
Paper Question
Question # 2:                                                                                                                               [ M a r k s 40 ] Analyze the performance of RIP, a
routing protocol built on a distance-vector routing algorithm. Exa...
Home; Networking Tutorial. Packet Tracer Tutorial · NS2 Tutorial · Networking Tutorial. Programming Tutorial. Programming Tutorial · C programming · Linux · Data Structures · Object Oriented Programming · DBMS Tutorial · Manuals; Articles. Quotes · Articles · Tips and Techniques. Labels ...
2
Add a comment...

Usman Ashraf

Shared publicly  - 
1
Add a comment...

Usman Ashraf

Shared publicly  - 
 
 
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 
5
Omar Nasri's profile photo
 
subhan allah
Add a comment...

Usman Ashraf

Shared publicly  - 
 
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;  ...
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; while(1) //infinite loop is used to insert/delete ...
1
Mr Altaf's profile photo
 
nice pic
Add a comment...

Usman Ashraf

Shared publicly  - 
 
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-) ...
Home; Networking Tutorial. Packet Tracer Tutorial · NS2 Tutorial · ITGURU Tutorial · Networking Tutorial. Programming Tutorial. Programming Tutorial · C programming · Linux · Data Structures · Object Oriented Programming · DBMS Tutorial · Manuals; Articles. Quotes · Articles ...
1
Add a comment...

Usman Ashraf

Shared publicly  - 
 
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...
#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]); stack[top] = 0; ...
1
Add a comment...

Usman Ashraf

Shared publicly  - 
 
WAN _ LAN implementation on IT Guru
http://www.filedropper.com/wanlan
Home; Networking Tutorial. Packet Tracer Tutorial · NS2 Tutorial · Networking Tutorial. Programming Tutorial. Programming Tutorial · C programming · Linux · Data Structures · Object Oriented Programming · DBMS Tutorial · Manuals; Articles. Quotes · Articles · Tips and Techniques. Labels ...
1
Add a comment...
Basic Information
Gender
Male
Links
Other profiles
Contributor to