🚌 to add notes

iiithf · Dec 2, 2020 · 510f0ef · 510f0ef
1 parent 12cba82
commit 510f0ef
Show file tree

Hide file tree

Showing 24 changed files with 6 additions and 3 deletions.
diff --git a/Assignments/01. Notion of a Monitor.pdf b/Assignments/01. Notion of a Monitor.pdf
diff --git a/Assignments/01. The Bakery Algorithm.pdf b/Assignments/01. The Bakery Algorithm.pdf
diff --git a/Assignments/01. The Dekker Algorithm.pdf b/Assignments/01. The Dekker Algorithm.pdf
diff --git a/Assignments/01. The Dining Philosophers Problem.pdf b/Assignments/01. The Dining Philosophers Problem.pdf
diff --git a/Assignments/01. The Sleeping Barber Problem.pdf b/Assignments/01. The Sleeping Barber Problem.pdf
diff --git a/Assignments/02. ABA Problem.pdf b/Assignments/02. ABA Problem.pdf
diff --git a/Assignments/02. MCS Queue Lock.pdf b/Assignments/02. MCS Queue Lock.pdf
diff --git a/Assignments/03. Bitonic Counting Network.pdf b/Assignments/03. Bitonic Counting Network.pdf
diff --git a/Assignments/04. Elimination Backoff Stack.pdf b/Assignments/04. Elimination Backoff Stack.pdf
diff --git a/LICENSE b/LICENSE
@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2020 iiithf
+Copyright (c) 2020 Subhajit Sahu
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

diff --git a/Presentations/01. DDR, GDDR, HBM Memory.pdf b/Presentations/01. DDR, GDDR, HBM Memory.pdf
diff --git a/Presentations/02. Leslie Lamport - Turing Lecture.pdf b/Presentations/02. Leslie Lamport - Turing Lecture.pdf
diff --git a/Project/01. Proposal.pdf b/Project/01. Proposal.pdf
diff --git a/Project/02. Paper.pdf b/Project/02. Paper.pdf
diff --git a/Project/03. Implementation.pdf b/Project/03. Implementation.pdf
diff --git a/Project/04. Presentation 1.pdf b/Project/04. Presentation 1.pdf
diff --git a/Project/05. Presentation 2.pdf b/Project/05. Presentation 2.pdf
diff --git a/README.md b/README.md
@@ -1,2 +1,5 @@
-# concurrent-data-structures
-A Concurrent data structure is a particular way of storing and organizing data for access by multiple computing threads (or processes) on a computer.
+A Concurrent data structure is a particular way of storing and organizing
+data for access by multiple computing threads (or processes) on a computer.
+
+**Course**: Concurrent Data Structures, Monsoon 2020<br>
+**Taught by**: Prof. Govindarajulu Regeti
diff --git a/Tutorials/01. Fine-grained Locking.pdf b/Tutorials/01. Fine-grained Locking.pdf
diff --git a/Tutorials/02. Lock-based Stack.pdf b/Tutorials/02. Lock-based Stack.pdf
diff --git a/Tutorials/03. N-ary Combining Tree.pdf b/Tutorials/03. N-ary Combining Tree.pdf
diff --git a/Tutorials/04. Lock-based Array Queue.pdf b/Tutorials/04. Lock-based Array Queue.pdf
diff --git a/Tutorials/05. N-gender Bathroom Lock.pdf b/Tutorials/05. N-gender Bathroom Lock.pdf
diff --git a/Tutorials/06. Savings Account.pdf b/Tutorials/06. Savings Account.pdf