munotes®

Computer Science Practical 3 Notes | B.Sc. (Computer Science) Semester 3 | Mumbai University | munotes

Official Notes munotes.in

Computer Science Practical 3

B.SC. (COMPUTER SCIENCE) · SEMESTER 3

Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)

For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges

Open the book ↓

munotes.in Second Year

Contents

Module I Principles of Operating Systems: ten exercises in C on Linux

  1. How This Practical Is Examined: the Journal, the 80 Per Cent Rule and the Two Questions 1
  2. The Laboratory from Zero: gcc, a Program, and the Manual 6
  3. Processes: fork, wait, exec, and Why Two Programs Need to Talk 14
  4. Practical 1: Process Communication using Shared Memory 22
  5. Practical 1 continued: the Race Condition, Semaphores, and Producer and Consumer 31
  6. Practical 2: Process Communication with Pipes 40
  7. Practical 2 continued: Message Queues, Blocking and Non-blocking 48
  8. Practical 3: Threading and Single Thread Control Flow 57
  9. Practical 4: Multi-threading and Fibonacci Generation 67
  10. Practical 5: Process Synchronisation and the Bounded Buffer 77
  11. Practical 6: the Readers-Writers Problem 86
  12. Practical 7: CPU Scheduling, FCFS and Non-preemptive Scheduling 95
  13. Practical 8: CPU Scheduling, Round Robin 106
  14. Practical 9: Memory Management, FIFO and LRU Page Replacement 117
  15. Practical 10: Disk Scheduling 128
  16. Practical 10 continued: a Simple File System 137

Module II Data Structures: ten exercises in Python

  1. Python for Data Structures: the Tools This Module Uses 146
  2. Practical 11: Abstract Data Types and Custom Structures 154
  3. Practical 12: Singly Linked Lists 162
  4. Practical 13: Polynomial Operations Using Linked Lists 172
  5. Practical 14: Doubly Linked Lists 181
  6. Practical 15: the Stack ADT 190
  7. Practical 15 continued: Prefix to Postfix, and Evaluating It 198
  8. Practical 16: Queues and Circular Queues 207
  9. Practical 17: Binary Search Trees and Tree Traversals 217
  10. Practical 18: AVL Trees and Rebalancing 230
  11. Practical 18 continued: Heaps and Priority Queues 243
  12. Practical 19: Graph Representations and Traversals 258
  13. Practical 20: Hashing and Collision Handling 272

Module J The journal and the practical examination

  1. Keeping the Journal, and What Goes on the Page 286
  2. A Worked Practical Paper: Q.1 and Q.2 293
munotes.in

The chapters

Every chapter of this book comes with the B.Sc. (Computer Science) Semester 3 notes.

The cover and the contents are free to look through. Buy the notes once to read every chapter of every subject in this semester.

Notes + practical solutions + solved papers: ₹798 Already bought it? Sign in

Or notes + practical solutions: ₹499
Or solved papers only: ₹499

Free either way: question papers, the syllabus, and the cover and contents of every book.

The rest of this subject

These notes are cut from the University's printed syllabus. Open the syllabus itself for the same subject.

Issue
Done!