From 0fc003326595b70c08e7d255338442579d9b46f4 Mon Sep 17 00:00:00 2001
From: sherlock <git@aaditagrawal.com>
Date: Thu, 3 Apr 2025 19:01:46 +0530
Subject: [PATCH] added optimised OS codes

---
 CNP/Wireshark/SMTP/mail-sender.py |  14 +++++
 CNP/Wireshark/SMTP/smtp-server.py |  33 +++++++++++
 OS/C/Week8/aq1                    | Bin 0 -> 33680 bytes
 OS/C/Week8/aq1.c                  |  95 ++++++++++++++++++++++++++++++
 4 files changed, 142 insertions(+)
 create mode 100644 CNP/Wireshark/SMTP/mail-sender.py
 create mode 100644 CNP/Wireshark/SMTP/smtp-server.py
 create mode 100755 OS/C/Week8/aq1

diff --git a/CNP/Wireshark/SMTP/mail-sender.py b/CNP/Wireshark/SMTP/mail-sender.py
new file mode 100644
index 0000000..186f05e
--- /dev/null
+++ b/CNP/Wireshark/SMTP/mail-sender.py
@@ -0,0 +1,14 @@
+import smtplib
+from email.message import EmailMessage
+
+# the email message
+msg = EmailMessage()
+msg['Subject'] = 'CNP Assignment Email'
+msg['From'] = 'aadit@example.com'
+msg['To'] = 'shreyas@example.com' # used example.com just to not have a DNS error.
+msg.set_content('Hello World. This is a message that is to be captured for the CNP FISAC II.')
+
+#SMTP server running on localhost on port 25
+with smtplib.SMTP('127.0.0.1', 25) as server:
+    server.set_debuglevel(1)  # debug output to see the SMTP conversation (for dev log)
+    server.send_message(msg)
diff --git a/CNP/Wireshark/SMTP/smtp-server.py b/CNP/Wireshark/SMTP/smtp-server.py
new file mode 100644
index 0000000..1868743
--- /dev/null
+++ b/CNP/Wireshark/SMTP/smtp-server.py
@@ -0,0 +1,33 @@
+import asyncio
+import uvloop
+from aiosmtpd.controller import Controller
+
+# handler that just prints the message content
+class PrintHandler:
+    async def handle_DATA(self, server, session, envelope):
+        print("Message from:", envelope.mail_from)
+        print("Recipients:", envelope.rcpt_tos)
+        print("Message data:")
+        print(envelope.content.decode('utf8', errors='replace'))
+        print("End of message")
+        # Respond with a success code
+        return '250 Message accepted for delivery'
+
+# uvloop for better performance
+asyncio.set_event_loop_policy(uvloop.EventLoopPolicy())
+
+def run_server():
+    # SMTP server controller, binding to localhost on port 25
+    controller = Controller(PrintHandler(), hostname='127.0.0.1', port=25)
+    controller.start()
+    print("SMTP server running on port 25. Press Ctrl+C to stop.")
+    try:
+        # Run forever
+        asyncio.get_event_loop().run_forever()
+    except KeyboardInterrupt:
+        pass
+    finally:
+        controller.stop()
+
+if __name__ == '__main__':
+    run_server()
diff --git a/OS/C/Week8/aq1 b/OS/C/Week8/aq1
new file mode 100755
index 0000000000000000000000000000000000000000..901915ed1adafa94b59a1b06309a15b0b0bbc2df
GIT binary patch
literal 33680
zcmeI5e{2-T6~||N81DQ78*qW}Bb-X9eEcwwRw6|<*qj|~lYp_EV5Pv;oX^<tFR;&m
z!;iSR5D{!DwjmX*i;z;a-8&p9t<v=PBL&s{!C$SeiP8{KqzXYzF)eCEdrlzk_s#B}
z_YNNrl|SD|v$Hch^WK}!ym@ygdDegY^ycSTLMQ?$4S5=}dy)``g&TK5JceA3tg2Nd
z>&u=mtKLMdiAfGlY`UjLa*m**s@9g()h0fc<BJp9gjr8VGi8`0ld1;%`vPVKMY6nG
zD~-vFU{aK*PV<VVNuoD?j~i9(3Uu%2iZ><8`(%wFZ-v=|>UMcfQ=X{~@_b!^&gS-=
zX8&Y)S!)e>-#4FA-Ja~Ssa;jO+xIrNH>l0+jUBR{$WJ%r)tN%5o-D(BBnw)HlgO%C
zT2fo0dN*yXF;=74bOMwzC6x{|Ql_=aMOM|F9kyjiDbM02ijDCYD$`_Ktu>{FaX)*y
zV&jIg(hAE*dXwxzozihK28ryE{v&Hbd|ilMvX53dg5qmtJ%T#fLTqLu-$LDq^5nOL
zXhNBZT!m~;)R!{ZnkwzW_>2i2PDPs=nfzjTcUR}~*5)0{8+uwBP^UB(ne15FbnvzG
zORGxGez5wJ>%aNM#V63_Mplr8$bkVl@?P?v^36$$(JJRBp9_(X`N{df&+UoyK8Z}v
zXbwWG$2L;NZGk;CJzW8RTfw>l*wws4b`oDjLGp)t4L%;TPP{11N0$0u#u^w#%67gm
z0Vco%m;e)C0!)AjFaajO1egF5U;<2l2`~XBzyz286JP>NfC(@GCcp%k025#WOn?b6
z0Vco%m;e)C0!)AjFaajO1en01C2*(XSE0N6mC#+U(8hx4QTz@3+fG;Us8cB()q{`6
z&Uqh?I7RPtJvc7{&Bw)xLT#l(oEY<p=yiwC^q`35D`HfC9c8*0m3>MJwF0A$rVnk4
zP`{94Ud(m-(EFYup?Pi|_-;6;L@Sis82)zr?cB8DQIWRx!w}jQD^)S-?@=;ttW|^-
z_8I;3;M|z**bZ6Fu<lTzE{rAFVXqP`$GzvEbHHPlzi<NiXj=mLA&mE+{5$kiDw#J_
z=s9ymL|=fMkOO*xbH;UHesNtxVq#rC68FvpZBiG;-=oWC>4Ki%V{u&}hc%}ZdKONg
z2W`fj66X^R(p(@rI9qbEvky6@C2$WrHYYF-1*gHLiN;M&8dse(ZaVbMlJiN_HzR3W
zP13j-7&FnhyrglpN#pXMZ)QyTTwS5omnKe}^Ujap7($-z-4+SKKb(rIW%!q;=ai?3
zRkGcuM4jXV-cu2$%hhN3G5N5R(^ROv1UYEeEIH0}F-?cu8)IX$WS>Bxwu^KHO<h6g
zf^S;7j!ZIirLtw%vgL{}Z87{l6g(C29LyLXyY6S-mK63~gMHFw*duL*eHSg8`wKPi
zqp%siEBOrxxmO?7=EYyo=2UEl)9=r=++-gLR>gF$h-PA~b=aIiC2Y>7@`^EsL9Y`1
z4(fy8-hXf^xM%eZl3(<+MvS)Xfl9Nj5^YW;qa}>Kl?O8iJg$tsF#6{AEROq|<tLXW
zScgBDZRfl*Bj+5*Ltl!d@{bFOF~?A_8nzq$O1hjqFGN!5{3qn6V%8LwR}&-q5znjR
zcH4aAUzXjD=MwzcIn`tygv}{@-kD|e(StQH@(E{8GkA&J!&6SrIg(*K%ZFawn|j_(
zhi%?izcAKs1J=i4?lhTO96aD5_uTKHLzp%~KF(+5CGXv<n49i>*05>T={XlHKXRCR
z*pV17E?9dMYY>9}Pz(>lf9&>1A8?$CEQTE+lrHSse5Lp-{3H|c<gBy-a;0BD&);A}
zI9LllHL){bL_G3)mPA5WgEQXmMMfN%;eN!LLHI}owPPJTsE6P$I@psuE9<s(J4JH~
znsWnhoL`f%4(Gh`j?pvwdg8fmK9}n;WXRQnTglFqv|dfKjq&=>IInzjU&;74Sg5T~
zQpdk|td(;G7x==k!xg?K)_zo|Jq|hXSZkY8Jl2jBYO~P?ht=|=?puW#Ae=zZH|kkM
zTDBp>_&)N!@qNUK<yoeDeP}BfTHj%cG#q_P`B{-4U;EAX{hYWhY_@yNb@tAWjDUHn
zy<Hynaa()}ZicVZp27Ye`e8zRvHSQ1bKT_JN{h5VLI1m^PtfO`6@RYWM}OR}5m#Ik
z3+=jLLrQ)7iZtjt@q-EUkzc2p?-6sK>DbR9>}UC1g>+(1RZ{H5o{}*b_VlCv7HnAF
z(-xufm@B()5c{cL$!QtHexlgCjAAnwQM|Td^V5jYN71iR$<92Ae#BDlN%Zp|R$HH^
zw*A=>-=8*aQOrZKeWys<kGa0_IrdJfJ&?Ob!};5k-vPeJ9@qvs584A;(B~VL&zG*z
zYEY*=s}Idf`8o24*k?W@`<91fKOP&C*jurUO8VWQJGRCa;Jdl*-5v?OuHbh@E@I{O
znA7$f1@ZsJFygrt^QI6N^c6}KxQOW8{UxD09lzGkJJb*5Z;i?HTVsK7Kh<_W-F83I
zxUX_ouNI3M7Bz^HJ#-_Uso%FcLzJ|(cKA@%lsr{d;I8rSUM<{Jcq*RVNKK-uqSReY
zt@2XV*|{1wYc~4*4Pr}ub3oQg_S84G3U8C&*MhU*?oR)1cUOI*KhRT9P(b6{n>LuD
zsZv_Dv7)Tho!{L~o#+UzJOezBZjkIHo$aMF?!_o6)A@8t#qv6Sq4UF8kdiAU$uqpR
z<JY;pSOcWoUXn+palAUW*XWenOK0$rdgYZbOn?b60Vco%m;e)C0!)AjFaajO1egF5
zU;<2l2`~XBzyz286JP>NfC(@GCcp%k025#WOn?b60Vco%m;e)C0!)AjFaajO1egF5
zU;<2l2`~XBzyz286JP>NfC(@GCcp%kz#}K%hQumlyi-B`uXE#F0H`3@UJ@Yxm$=bt
z{9kcVj5qHTTP?;r3KYCRK=}%CIdVJlA>^azqpGT}siiB>qBhib;y>C`Lsy{Q*Fw!|
zBfTCWp=D=xeP@GEcXc+m2O3d!2fBpX<*RRRG!!bTm`-=}!UBi5<-?uY)};FP`F-61
zzuM%lZ}4{tS6e+)W#b(Q=s=0O=O}nH1QN}2CUOpL=p71Fr*|u$q+6Mm;cBn1O{!NX
z)t^tQe=Dg@?^U38DS({7yDLod4bJv<H)z~D9aT=}QKJ0xa@Kjw@HkAd=A4H%TEzn*
z4Xd9fP27s-b;y)lLcA>8Y4Ts&8!h*}W{sGSmHOQ)#ho`V-94PKV5Dr;j#r+Tx$dJy
zZO^&)hUc$e6<V6se@k8X)=Pswuj}~T^~Up){v3_Aq;0B8A3N~Qffo;d{9a%AYfFFn
zpy#jT{b$eZfBg1nUBk&;bC%s4)824RZ9Vq!d+YXJdvb2hn{9{uUp`uPIj?zmc(nGj
z_4&^nyY}jypI!d%kN<M@-~BT-58Ql^{QviP?c|j|Idbu@vp(4S+2z53q9s?~y?tZZ
Q*i*h^=cD_!z1T7MKWQd5kN^Mx

literal 0
HcmV?d00001

diff --git a/OS/C/Week8/aq1.c b/OS/C/Week8/aq1.c
index e69de29..8b4318b 100644
--- a/OS/C/Week8/aq1.c
+++ b/OS/C/Week8/aq1.c
@@ -0,0 +1,95 @@
+#include <stdio.h>
+
+// C program for Banker's Algorithm (Safety & Resource Request)
+// Optimized for minimal code size (e.g., for writing on paper)
+
+int main() {
+    int p, r, i, j, k, pid, req_pid = -1; // p=procs, r=res; req_pid: -1=initial, >=0 processing req
+    printf("P R:"); scanf("%d%d", &p, &r); // Input num processes and resources
+    int av[r], max[p][r], al[p][r], nd[p][r], req[r]; // av=avail, al=alloc, nd=need
+    int w[r], fin[p], seq[p]; // w=work, fin=finish, seq=safe sequence
+
+    // Input available, max, allocation matrices
+    printf("Av:"); for(j=0; j<r; j++) scanf("%d", &av[j]);
+    printf("Max:\n"); for(i=0; i<p; i++) for(j=0; j<r; j++) scanf("%d", &max[i][j]);
+    printf("Alloc:\n"); for(i=0; i<p; i++) for(j=0; j<r; j++) scanf("%d", &al[i][j]);
+
+    // Calculate need matrix: need = max - alloc
+    for(i=0; i<p; i++) for(j=0; j<r; j++) nd[i][j] = max[i][j] - al[i][j];
+
+S:; // Safety Check Algorithm Label
+    int s_idx = 0, c = 0, safe = 0; // s_idx=seq index, c=count finished, safe=flag
+    for(j=0; j<r; j++) w[j] = av[j]; // work = avail
+    for(i=0; i<p; i++) fin[i] = 0; // finish[p] = {false}
+    // Find sequence using safety algorithm logic
+    while(c < p) { // Loop until all processes are finished or deadlock
+        int found = 0; // Flag to check if a process was found in this pass
+        for(i=0; i<p; i++) { // Iterate through processes
+            if(!fin[i]) { // If process i not finished
+                int possible = 1; // Check if need <= work
+                for(j=0; j<r; j++) if(nd[i][j] > w[j]) { possible = 0; break; }
+                if(possible) { // If need <= work
+                    for(k=0; k<r; k++) w[k] += al[i][k]; // work = work + alloc
+                    fin[i] = 1; seq[s_idx++] = i; c++; found = 1; // Mark finished, add to seq
+                }
+            }
+        }
+        if(!found) break; // If no process found in a full pass, break (unsafe state)
+    }
+    if(c == p) safe = 1; // If all processes finished, state is safe
+
+    // --- End Safety Check ---
+
+    // Handle result based on phase (initial check or request check)
+    if(req_pid == -1) { // Phase 1: Initial State Check
+        if(safe) {
+            printf("SAFE. Seq:"); for(i=0; i<p; i++) printf(" P%d", seq[i]); puts("");
+        } else { puts("UNSAFE"); goto end; } // If unsafe initially, exit
+
+        // Phase 2: Resource Request
+        printf("PID Req:"); scanf("%d", &pid); req_pid = pid; // Get requesting proc ID
+        printf("Req:"); for(j=0; j<r; j++) scanf("%d", &req[j]); // Get request vector
+
+        // Check 1: Request <= Need
+        for(j=0; j<r; j++) if(req[j] > nd[pid][j]) { puts("Err:Req>Need"); goto end; }
+        // Check 2: Request <= Available
+        for(j=0; j<r; j++) if(req[j] > av[j]) { puts("Wait:Req>Avail"); goto end; }
+
+        // Tentatively allocate resources
+        for(j=0; j<r; j++) { av[j]-=req[j]; al[pid][j]+=req[j]; nd[pid][j]-=req[j]; }
+        puts("Checking req safety...");
+        goto S; // Re-run safety check on the new state
+
+    } else { // Phase 3: Post-Request Safety Check Result
+        if(safe) { // Request is granted if new state is safe
+             printf("Req OK. Seq:"); for(i=0; i<p; i++) printf(" P%d", seq[i]); puts("");
+        } else { // Request denied if new state is unsafe
+            puts("Req DENIED (unsafe)");
+            // Rollback state to before tentative allocation
+            pid = req_pid; // Restore pid for rollback
+            for(j=0; j<r; j++) { av[j]+=req[j]; al[pid][j]-=req[j]; nd[pid][j]+=req[j]; }
+        }
+         // No further action needed after handling the single request
+    }
+
+end: return 0; // End of program
+}
+
+/*
+```
+P R: 5 3
+Av: 3 3 2
+Max:
+7 5 3
+3 2 2
+9 0 2
+2 2 2
+4 3 3
+Alloc:
+0 1 0
+2 0 0
+3 0 2
+2 1 1
+0 0 2
+```
+*/