from collec ons import Counter import numpy as np # Func on for Selec on Sort # Func on for Inser on Sort

for Selec on Sort # Func on for Inser on Sort # Func on to perform Quick Sort
def selec on_sort(arr): def inser on_sort(arr): def quick_sort(arr):
# Func on to compute the required informa on # Func on to add two matrices n = len(arr) for i in range(1, len(arr)): if len(arr) <= 1:
def compute_class_sta s cs(marks, absent_count): def add_matrices(A, B): for i in range(n): key = arr[i] return arr
# Remove None for absent students and calculate total return np.add(A, B) min_idx = i j=i-1 pivot = arr[len(arr) // 2] # Choosing the middle
marks for j in range(i + 1, n): while j >= 0 and arr[j] > key: element as pivot
valid_marks = [mark for mark in marks if mark is not # Func on to subtract two matrices if arr[j] < arr[min_idx]: arr[j + 1] = arr[j] le = [x for x in arr if x < pivot] # Elements
None] def subtract_matrices(A, B): min_idx = j j -= 1 smaller than pivot
return np.subtract(A, B) arr[i], arr[min_idx] = arr[min_idx], arr[i] arr[j + 1] = key middle = [x for x in arr if x == pivot] # Elements
# 1. Average score of the class equal to pivot
if valid_marks: # Func on to mul ply two matrices # Func on for Bubble Sort # Func on for Shell Sort right = [x for x in arr if x > pivot] # Elements
avg_score = sum(valid_marks) / len(valid_marks) def mul ply_matrices(A, B): def bubble_sort(arr): def shell_sort(arr): larger than pivot
else: return np.dot(A, B) n = len(arr) n = len(arr) return quick_sort(le ) + middle +
avg_score = 0 quick_sort(right)
for i in range(n): gap = n // 2
# Func on to transpose a matrix for j in range(0, n-i-1): while gap > 0:
# 2. Highest and lowest scores def transpose_matrix(A): if arr[j] > arr[j+1]: for i in range(gap, n): # Func on to display the top five scores
highest_score = max(valid_marks, default=None) def display_top_five(scores):
return np.transpose(A) arr[j], arr[j+1] = arr[j+1], arr[j] temp = arr[i]
lowest_score = min(valid_marks, default=None) j=i # Sort the scores using Quick Sort
sorted_scores = quick_sort(scores)
# Example matrices # Main program while j >= gap and arr[j - gap] > temp:
# 3. Count of students who were absent (students with A = np.array([[1, 2], [3, 4]]) def main(): arr[j] = arr[j - gap]
None marks) # Display the top five scores
B = np.array([[5, 6], [7, 8]]) # Array of first year percentages j -= gap
absent_students = absent_count percentages = [72.5, 85.3, 60.4, 90.0, 78.6, 88.7, arr[j] = temp print("Top 5 Scores:")
# Perform opera ons 65.2, 94.3, 76.8, 81.5] gap //= 2 for score in sorted_scores[-5:]:
# 4. Mark with the highest frequency print(f"{score:.2f}")
print("Matrix A:")
mark_frequency = Counter(valid_marks) print(A) # Sor ng using Selec on Sort # Main program
most_frequent_mark = selec on_sort(percentages) # Main program to store first-year percentages in
print("Matrix B:") if __name__ == "__main__":
mark_frequency.most_common(1)[0][0] if valid_marks print("Sorted (Selec on Sort):", percentages) an array and display top 5
print(B) # Storing second-year percentages
else None def main():
print("Top 5 Scores (Selec on Sort):", percentages = [89.5, 92.3, 76.4, 85.2, 95.0,
percentages[-5:]) 88.1, 91.6, 84.7, 80.5, 78.9] # Example of student percentages
print("\nAddi on of A and B:")
# Return all the computed values student_percentages = [75.4, 82.3, 91.2, 56.8,
print(add_matrices(A, B))
return avg_score, highest_score, lowest_score, # Sor ng using Bubble Sort 67.9, 84.5, 95.1, 88.0, 72.4, 66.5]
# Choose sor ng algorithm (Inser on Sort)
absent_students, most_frequent_mark bubble_sort(percentages) print("Using Inser on Sort:")
print("\nSubtrac on of A and B:")
print("\nSorted (Bubble Sort):", percentages) # Display the top five scores
print(subtract_matrices(A, B)) inser on_sort(percentages)
# Example of marks for N students (None indicates print("Top 5 Scores (Bubble Sort):", display_top_five(student_percentages)
print("Sorted Percentages:", percentages)
absent students) percentages[-5:])
print("\nMul plica on of A and B:") print("Top 5 Scores:", percentages[-5:])
marks = [85, 90, 78, 92, None, 75, 85, 95, None, 90] # Running the program
print(mul ply_matrices(A, B))
absent_count = marks.count(None) # Execute main program if __name__ == "__main__":
# Choose sor ng algorithm (Shell Sort)
if __name__ == "__main__": main()
print("\nTranspose of Matrix A:") percentages = [89.5, 92.3, 76.4, 85.2, 95.0,
# Compute sta s cs main() 88.1, 91.6, 84.7, 80.5, 78.9]
print(transpose_matrix(A))
avg_score, highest_score, lowest_score,
print("\nUsing Shell Sort:")
absent_students, most_frequent_mark =
shell_sort(percentages)
compute_class_sta s cs(marks, absent_count)
print("Sorted Percentages:", percentages)
print("Top 5 Scores:", percentages[-5:])
# Display the results
print(f"Average Score: {avg_score}")
print(f"Highest Score: {highest_score}")
print(f"Lowest Score: {lowest_score}")
print(f"Absent Students Count: {absent_students}")
print(f"Most Frequent Mark: {most_frequent_mark}")
#include <iostream> #include <iostream> cout << "Enter first binary number: ";
#include <string> #include <string> cin >> binary1;
using namespace std; using namespace std; bin1.insertBinary(binary1);

// Define the structure for a node in the doubly linked class Node { cout << "Enter second binary number: ";
list public: cin >> binary2;
struct Node { int data; bin2.insertBinary(binary2);
int data; // Binary digit (0 or 1) Node* prev;
Node* next; Node* next; cout << "\nBinary Number 1: ";
bin1.display();
Node* prev; Node(int val) : data(val), prev(nullptr), next(nullptr) {}
}; };
cout << "Binary Number 2: ";
bin2.display();
// Func on to create a new node class DoublyLinkedList {
Node* createNode(int value) { private: // Compute 1's complement
Node* newNode = new Node(); Node* head; bin1.onesComplement();
newNode->data = value; cout << "\n1's Complement of Binary 1: ";
newNode->next = nullptr; public: bin1.display();
newNode->prev = nullptr; DoublyLinkedList() : head(nullptr) {}
return newNode; // Compute 2's complement
} // Func on to insert binary number into the doubly linked list bin1.twosComplement();
void insertBinary(string binary) { cout << "2's Complement of Binary 1: ";
// Func on to append a node at the end of the doubly for (char c : binary) { bin1.display();
linked list int val = c - '0';
void appendNode(Node*& head, int value) { // Add two binary numbers
Node* newNode = new Node(val);
DoublyLinkedList result =
Node* newNode = createNode(value); if (!head) {
DoublyLinkedList::addBinary(bin1, bin2);
if (!head) { head = newNode;
cout << "\nSum of the Binary Numbers: ";
head = newNode; } else { result.display();
} else { Node* temp = head;
Node* temp = head; while (temp->next) { return 0;
while (temp->next) { temp = temp->next; }
temp = temp->next; }
} temp->next = newNode;
temp->next = newNode; newNode->prev = temp;
newNode->prev = temp; }
} }
} }

// Func on to display the binary number stored in the // Func on to display the binary number stored in the list
doubly linked list void display() {
void display(Node* head) { Node* temp = head;
Node* temp = head; while (temp) {
while (temp) { cout << temp->data;
cout << temp->data; temp = temp->next;
temp = temp->next; }
} cout << endl;
cout << endl; } #include <iostream>
} #include <queue>
// Func on to compute the 1's complement of the binary #include <string>
// Func on to compute the 1's complement of a binary number
number void onesComplement() { using namespace std;
Node* onesComplement(Node* head) { Node* temp = head;
Node* temp = head; while (temp) { // Func on to add a job to the queue
while (temp) { temp->data = (temp->data == 0) ? 1 : 0; void addJob(queue<string>& jobQueue, const string&
temp->data = (temp->data == 0) ? 1 : 0; // Flip 0 to temp = temp->next; job) {
1 and 1 to 0 } jobQueue.push(job);
temp = temp->next; } cout << "Job added: " << job << endl;
} }
return head; // Func on to compute the 2's complement of the binary
} number // Func on to delete a job from the queue
void twosComplement() { void deleteJob(queue<string>& jobQueue) {
// Func on to compute the 2's complement of a binary onesComplement(); if (!jobQueue.empty()) {
number Node* temp = head; cout << "Job deleted: " << jobQueue.front() <<
Node* twosComplement(Node* head) { bool carry = true; endl;
Node* temp = head; jobQueue.pop();
bool carry = true; // Add 1 to the least significant bit } else {
while (temp) { while (temp && carry) { cout << "Queue is empty, no job to delete." <<
if (carry) { if (temp->data == 0) { endl;
if (temp->data == 0) { temp->data = 1; }
temp->data = 1; carry = false; }
carry = false; } else {
} else { temp->data = 0; int main() {
temp->data = 0; } queue<string> jobQueue;
} temp = temp->next; int choice;
} } string job;
temp = temp->next; }
} do {
return head; // Func on to add two binary numbers stored in doubly linked cout << "\nJob Queue Menu:" << endl;
} lists cout << "1. Add Job to Queue" << endl;
sta c DoublyLinkedList addBinary(DoublyLinkedList& bin1, cout << "2. Delete Job from Queue" << endl;
// Func on to add two binary numbers stored in doubly DoublyLinkedList& bin2) { cout << "3. Exit" << endl;
linked lists DoublyLinkedList result; cout << "Enter your choice: ";
Node* addBinary(Node* head1, Node* head2) { Node* temp1 = bin1.head; cin >> choice;
Node* result = nullptr; Node* temp2 = bin2.head;
Node* temp1 = head1; int carry = 0; switch (choice) {
Node* temp2 = head2; case 1:
int carry = 0; while (temp1 || temp2 || carry) { cout << "Enter job name: ";
int sum = carry; cin >> job;
while (temp1 || temp2 || carry) { if (temp1) { addJob(jobQueue, job);
int sum = carry; sum += temp1->data; break;
if (temp1) { temp1 = temp1->next; case 2:
sum += temp1->data;
cin >> b
cout << "Enter first binary number: ";
string binary1;
// Read first binary number

} deleteJob(jobQueue);
temp1 = temp1->next; if (temp2) { break;
} sum += temp2->data; case 3:
if (temp2) { temp2 = temp2->next; cout << "Exi ng program..." << endl;
sum += temp2->data; } break;
temp2 = temp2->next; default:
} result.insertBinary(to_string(sum % 2)); cout << "Invalid choice! Try again." << endl;
carry = sum / 2; }
carry = sum / 2; } } while (choice != 3);
appendNode(result, sum % 2);
} return result; return 0;
return result; } }
} };

int main() { int main() {

Node* num1 = nullptr; DoublyLinkedList bin1, bin2;
Node* num2 = nullptr; string binary1, binary2;

// Read first binary number // Input binary numbers

string binary1;
 Establishing pendulum patrolling to achieve unexpected and difficult target.
 Quick and efficient communication by issuing hand held Radio Sets to all key holders.
 Efficient communication system among security and key holder employees using permanent mobile Nos and Radio Sets.

SURveiLLANce /viGiLANce
 Plan and establish surveillance room based on the requirement of Company including fixing of CCTV cameras in key
location.
 Use footage for vigilance purpose.
 Feedback to the management for up-keeping the system.
 In-site controlling any riots and prompt action on any abnormal issues.
 On site controlling using Hand Held Radio Set sending patrolling party on point within 2 to 3 minutes.
HSe/oHS
 Formulation of HSE policy and manual as part of Factory Act 1948 Chapter IV. Formulation of Emergency evacuation plans
for employees and workers. Management and efficient monitoring of PPEs for workers and employees.
 MIS control for PPE’s for efficient distribution and obligations. Earmarking the Significant Area in the Floors for better
attention.
 Display of safety postures and fixing of Fire Extinguishers / Fire Points for better fire control & First Aid Boxes.
 Plan and execute routine medical check up for all workers and employees.
 More attention for the workers & employees in Grit Blasting and paint booth.
 Establishment of adequate facilities such as rest rooms and provision of minimum facilities.
 Planning and execution training calendar for workers and employees.
 Implementation of Work permit system for all.
 Preparation of HIRA and JAS for routine and non routine activities. Preparation of safety report and give clear picture of
Safety of the Company. Better utilization of resources for workmanship.
 Achieve HSE objectives set for Companies by implementing Safety norms.
 Create safe work condition for employees and workers and ensure NC of job related issues.
 Preparation of MSDS. Imparting training to workers / employees and for middle and top level management in HSE/OHS &
security. Establishment of Safety and Security Control room to monitor round the clock every activities of the employees
and workers including visitors.
ADMiNiStRAtioN

 Working out modalities for deployment and utilization of available resources in pursuit of organizational objectives.
 Conceptualizing and affecting measures / modifications in the Operating procedures to optimize available resources and
capacity of utilization. Planning and budgeting administrative expenses with an eye on measures to minimize expenditure.
 Management and deployment of stores including maintenance of records. Interact with various departments for continued
availability of vital inputs for overall improvements of organization.
 Use of digital media to make awareness for sense of responsibilities among the workers.
 Formulate the system to get feedback from workers and employees for creating better working environment in the
organization. Able to organize events for more than 1000 people with due formulation of role and responsibilities of each
division.
 Strictly follow and execute the rules and regulations of the organization. Maintain law and orders in the organization.
 To take care of House-keeping staffs including office staffs in wide and close view.

LANGUAGe KNowN
 Read - Hindi, English & Marathi
 Write - Hindi, English & Marathi
 Speak - Hindi, English & Marathi
AcADeMic & PRoFeSSioNAL DeveLoPMeNt

 Graduate from Army College Jabalpur in English medium.

 Done Fire and Industrial Training in Reliance Jio Telecom every year.
 Diploma (Equivalent BE) in Electronics and Telecommunication Engineering.

PRoFeSSioNAL GRowtH PoSt RetiReMeNt

 Join Reliance Jio 4G from Army since the date of retirement as H Grade Manager, 2015-2024. Established mile stone in
the field of site safety and security including installation, commissioning, integration and ATP of 4G equipment.
 I have expertise in managing 86 BE engineers, 346 Technicians and 86 Vehicles + Drivers in a particular financial year. I
have managed Micro Wave (MW/UBR) Antennas installation, commissioning, integration and alarm removing and
Technical support to field engineer.