Study Material

Operating Systems Lecture Notes 

Martin C. Rinard

• Lecture 1: Overview and History 
• Lecture 2: Processes and Threads 
• Lecture 3: Thread Creation, Manipulation and Synchronization 
• Lecture 4: Deadlock 
• Lecture 5: Implementing Synchronization Operations 
• Lecture 6: CPU Scheduling 
• Lecture 7: OS Potpourri 
• Lecture 8: Introduction to Memory Management 
• Lecture 9: Introduction to Paging 
• Lecture 10: Issues in Paging and Virtual Memory 
• Lecture 11: MIPS TLB Structure 
• Lecture 12: Introduction to File Systems 
• Lecture 13: File System Implementation 
• Lecture 14: Monitors 
• Lecture 15: Segments 
• Lecture 16: Disk Scheduling 
• Lecture 17: Networking 
• Lecture 18: UDP and TCP 

                                             
  Computer Networks

1. ISO-OSI 7-Layer Network Architecture
2. Network Architecture(Contd) and Physical Layer
3. Physical Layer (Contd) - Data Encoding
4. Multiplexing, Network Topology, Aloha and CSMA/CD
5. CSMA/CA, Contention Free Protocols and Limited Contention Protocols
6. IEEE 802.3 and Ethernet
7. IEEE 802.5: Token Ring Network
8. Token Ring Network(Contd...) and IEEE 802.4: Token Bus Network
9. Data Link Layer(DLL)
10. Network Layer
11. Network Layer(cont) - Routing Algorithms Classification
12. Routing Algorithms
13. ARP,RARP,ICMP Protocols
14. Transport Layer Protocol (TCP)
15. TCP (continued)
16. TCP - Implementation Issues
17. Unix Socket Programming - Part 1
18. Unix Socket Programming - Part 2
19. Unix Socket Programming - Part 3
20. Unix Socket Programming - Part 4 and Some Topics in TCP
21. TCP Congestion Control, Random Losses, PAWS
22. UDP and DNS
23. DNS(Continued), BOOTP, DHCP
24. Routing in Internet
25. Routing(Continued)- Algortihms
26. Remote Procedure Call
27. Remote Procedure Call - Using rpcgen(Contd..)
28. Distributed Applications
29. Applications- FTP and EMAIL
30. PEM and SNMP
31. Firewalls
32. Wireless Networks
33. Network Security
34. Network Security(Contd...)
35. Network Security(Contd...)
36. Kerberos and Public Key Authentication
37. NFS and AFS

C Lecture Notes

       click here

Algorithm lecture Notes

1)download pdf

2)Topicwise Notes

1. Introduction
2. Mathematics for Algorithmic
• Sets
  
• Functions and Relations
  
• Vectors and Matrices
• Linear Inequalities and Linear Equations
3. Greedy Algorithms
   • Knapsack Problem
     • O-I Knapsack
     • Fractional Knapsack
   • Activity Selection Problem
   • Huffman's Codes
   • Minimum Spanning Tree
   • Kruskal's Algorithm
   • Prim's Algorithm
   • Dijkstra's Algorithm
4. Divide & Conquer Algorithms
5. Dynamic Programming Algorithms
   • Knapsack Problem DP Solution
   • Activity Selection Problem DP Solution
6. Amortized Analysis
   • Aggregate Method
   • Accounting Method
   • Potential Method
   • Dynamic Table
7. Hash Table
8. Binary Search Tree
9. Graph Algorithms
   • Breadth First Search (BFS)
   • Depth First Search (DFS)
   • Topological Sort
   • Strongly Connected Components
   • Euler Tour
   • Generic Minimum Spanning Tree
   • Kruskal's Algorithm
   • Prim's Algorithm
   • Single Source Shortest Path
     • Dijkstra's Algorithm
     • Bellman-Ford Algorithm
10. String Matching
    • Naïve String Matching
    • Knuth-Morris-Pratt Algorithm
    • Boyer-Moore Algorithm
11. Sorting
    • Bubble Sort
    • Insertion Sort
    • Selection Sort
    • Shell Sort
    • Heap Sort
    • Merge Sort
    • Quick Sort
12. Linear-Time Sorting
    • Counting Sort
    • Radix Sort
    • Bucket Sort
13. Computational Geometry
14. Computational Complexity
    • Information-Theoretic Argument
    • Adversary Argument
    • NP-Completeness And Reduction
15. Approximate Algorithms
    • Vertex Cover
    • The Traveling Salesman Problem
16. Linear Programming
17. Appendix
    1. Parabola
    2. Tangent
18. Codes
19. References