We managed to complete one cycle of the Feistel network (out of 16) for the Data Encryption Standard. I copied down the work of the classroom. It was a team effort, and now the process of pseudo-random permutation creating is a little bit more concrete.
K =
10101011
01010100
11001101
00110010
10101011
01010100
11001101
00110010
X=
11111111
00001111
00001111
11111111
11111111
00001111
00001111
11111111
IP=
10011001
10011001
01110111
01110111
10011001
10011001
01110111
01110111
L0=
10011001
10011001
01110111
01110111
R0=
10011001
10011001
01110111
01110111
C0=
0101010
1011001
1010011
0011010
D0=
1001100
1011001
1001010
1011010
C1=
1010101
0110011
0100110
0110100
D1=
0011001
0110011
0010101
0110101
K1=
100111
100001
110010
110110
111110
001100
010100
010001
E=
110011
110011
110011
110010
101110
101110
101110
101111
E^K1=
010100
010010
000001
000100
010000
100010
111010
111110
S1=
0110
S2=
0111
S3=
1101
S4=
1110
S5=
1000
S6=
1110
S7=
0101
S8=
1000
P=
0101
1111
0111
0001
1101
0011
0101
1000
L1=
10011001
10011001
01110111
01110111
R1=
11000110
11101000
10100100
00101111