sppu-te-comp-content/SystemsProgrammingAndOperatingSystem
sppu-te-comp-content/SystemsProgrammingAndOperatingSystem
3
1
Fork 0
Code Issues Activity
This repository serves as a comprehensive resource for the Systems Programming and Operating Systems (SPOS) course under the 2019 SPPU syllabus. It includes materials such as codes, lecture notes, assignments and question papers covering key topics like system software analysis, data structures, process scheduling, memory management, and the implementation of IoT and HCI applications. This repository holds essential tool for mastering the concepts of systems programming and operating systems.
69 Commits 2 Branches 0 Tags 20 MiB
Python 50.1%
C++ 40.5%
C 4.7%
Java 4.7%
85c6485b97
Go to file
Kshitij 85c6485b97
added warning.
2024-11-06 15:41:31 +05:30
Assignments Added write-up for b4 and added link in readme file. 2024-09-30 21:57:26 +05:30
Codes added warning. 2024-11-06 15:41:31 +05:30
Notes Added notes for unit 2. 2024-08-26 14:56:42 +05:30
Question Papers Added solved SPOS 2022 May-June end-sem question paper (2019 pattern). 2024-10-19 12:29:58 +05:30
Softcopy Added softcopy 2024-10-15 10:33:18 +05:30
README.md Added links for B4. 2024-11-06 15:39:47 +05:30

README.md

Systems Programming and Operating System (SPOS)

This repository serves as a comprehensive resource for the Systems Programming and Operating Systems (SPOS) course under the 2019 SPPU syllabus. It includes materials such as codes, lecture notes, assignments and question papers covering key topics like system software analysis, data structures, process scheduling, memory management, and the implementation of IoT and HCI applications. This repository holds essential tool for mastering the concepts of systems programming and operating systems.

Index

Codes

Checkout python version of all the codes.

Group A
  1. Code-A1 - Pass 1
  2. Code-A2 - Pass 1 and Pass 2 of 2-Pass Macroprocessor
  3. Code-A3 - DLL
Group B
  1. Code-B4 - Mutex and Semaphore
  2. CPU Scheduling Algorithms: FCFS, SJF (Preemptive), Priority (Non-Preemptive) and Round Robin (Preemptive)
  3. Code-B6 - Memory Placement Strategies – Best Fit, First Fit, Next Fit and Worst Fit
  4. Code-B7 - Page Replacement Algorithms - LRU(Least Recently Used), Optimal

Notes

  1. Unit 1 - Introduction
  2. Unit 2 - Macro Processor and Compilers
  3. [Unit 3 - Linkers and Loaders]
  4. [Unit 4 - Operating System]
  5. [Unit 5 - Synchronization and Concurrency Control]
  6. [Unit 6 - Memory Management]

Assignments

Common

Note

These assignments are for both, X and Y group.

Assignment A3
Assignment B5
Assignment B6

Group-X

Note

These assignments are only for group X.

Assignment A1
Assignment B4

Group-Y

Note

These assignments are only for group Y.

Assignment A2
Assignment B7

Question Papers

Sample Photocopy (END-SEM)

Sample IN-SEM Unit Test Paper