Zerk Shaban Zerk123
Zerk123
/ Simple Library Management System(Beta Version).cpp
Last active
November 11, 2015 15:53
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| #include<string> | |
| #include <conio.h> | |
| #include <windows.h> | |
| #include<fstream> | |
| using namespace std; | |
| class node{ | |
| private: | |
| string data; | |
| node *next; |
Zerk123
/ Simple Student Record System<Beta Version>
Created
September 26, 2015 19:07
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| #pragma warning(disable : 4996) | |
| #include<iomanip> | |
| #include<Windows.h> | |
| #include<cstring> | |
| #include<string> | |
| #include<ctime> | |
| #include<fstream>; | |
| #include<conio.h> | |
| using namespace std; |
Zerk123
/ Single Link List And Its ADT'S<Beta version>
Last active
September 27, 2015 07:24
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| using namespace std; | |
| struct node{ | |
| int data; | |
| node *next; | |
| }; | |
| node *tail; | |
| node *head; | |
| void Insert(int x){ |
Zerk123
/ Link List ADT V2
Created
September 27, 2015 07:25
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| using namespace std; | |
| struct node{ | |
| int data; | |
| node *next; | |
| }; | |
| node *head; | |
| void Insert(int x){ | |
| node *temp = new node; | |
| temp->data = x; |
Zerk123
/ Double Link List V2
Created
September 27, 2015 07:26
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| using namespace std; | |
| int x; | |
| struct node{ | |
| int data; | |
| node *next; | |
| node *pev; | |
| }; | |
| node *head; | |
| void Insert(int x){ |
Zerk123
/ Double Link List V3
Created
September 27, 2015 07:27
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| using namespace std; | |
| struct node{ | |
| int data; | |
| node *next; | |
| node *prev; | |
| }; | |
| node *head; | |
| node *GetNode(int x){ | |
| node *temp = new node; |
Zerk123
/ Double Link List V1
Created
September 27, 2015 07:28
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| using namespace std; | |
| struct node{ | |
| int data; | |
| node *next; | |
| node *pve; | |
| }; | |
| node *head; | |
| node *GetNewNode(int x){ | |
| node *newnode = new node; |
Zerk123
/ Single Circular Link List
Last active
September 27, 2015 07:31
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| using namespace std; | |
| struct node{ | |
| int data; | |
| node *next; | |
| }; | |
| node *head; | |
| node *tail; | |
| void Insert(int x){ | |
| node *temp = new node; |
Zerk123
/ Double Circular Link List
Created
September 27, 2015 07:32
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<iostream> | |
| using namespace std; | |
| struct node{ | |
| int data; | |
| node *next; | |
| node *prev; | |
| }; | |
| node *head; | |
| node *tail; | |
| void Insert(int x){ |
Zerk123
/ Josephs Problem
Created
September 27, 2015 07:33
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| void JosuphProb(int jump){ | |
| node *temp = head; | |
| node *temp1 = head; | |
| while (temp != head) | |
| for (int i = 0; i < jump - 2; i++){ | |
| temp = temp->next; | |
| } | |
| for (int i = 0; i < jump - 1; i++){ | |
| temp1 = temp1->next; | |
| } |
OlderNewer