{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":628622983,"defaultBranch":"main","name":"Advanced-Topics-in-C","ownerLogin":"Francesco601","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-04-16T14:27:59.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/130352141?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1690878956.0","currentOid":""},"activityList":{"items":[{"before":"9d7555226568208d2100dfcb0ce850a24c5557e6","after":"af8f6f9ba9c3c24bed72a401bc04963f9cb0668e","ref":"refs/heads/main","pushedAt":"2023-08-01T08:35:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Clairvoyant SJF algorithm in C\n\nHaven't updated this repo in a while until i finally understood this.\r\nDetails in comments....","shortMessageHtmlLink":"Clairvoyant SJF algorithm in C"}},{"before":"aa16857628999d0feabd863260f64a0d6016cef7","after":"9d7555226568208d2100dfcb0ce850a24c5557e6","ref":"refs/heads/main","pushedAt":"2023-07-10T04:14:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add 2nd chance page replacement algorithm\n\ndetails in comments","shortMessageHtmlLink":"add 2nd chance page replacement algorithm"}},{"before":"3a8da6af62c1e0743dd605cce02f493cd05105d4","after":"aa16857628999d0feabd863260f64a0d6016cef7","ref":"refs/heads/main","pushedAt":"2023-07-08T13:18:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Dining Philosophers with arbitrator\n\ndetails in comments...","shortMessageHtmlLink":"Dining Philosophers with arbitrator"}},{"before":"a88c60c65269c5d0c844b7e2e1edcaed33784385","after":"3a8da6af62c1e0743dd605cce02f493cd05105d4","ref":"refs/heads/main","pushedAt":"2023-07-07T11:49:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Dining Philosophers Chandy/Misra solution\n\nA solution to the Dining Philosophers problem using a different algorithm. Details are in the comments.","shortMessageHtmlLink":"Dining Philosophers Chandy/Misra solution"}},{"before":"0e2b7eea1f7f2b7472fcdef2820632aefdfd056f","after":"a88c60c65269c5d0c844b7e2e1edcaed33784385","ref":"refs/heads/main","pushedAt":"2023-07-05T11:39:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Red-Black Tree Insertion, Deletion and Traversal\n\ndetails in comments","shortMessageHtmlLink":"Red-Black Tree Insertion, Deletion and Traversal"}},{"before":"6be002ed7c7f73277e09318a752e117eab7120b8","after":"0e2b7eea1f7f2b7472fcdef2820632aefdfd056f","ref":"refs/heads/main","pushedAt":"2023-07-05T08:02:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Red black tree construction \n\nRed black tree is very important in understanding modern operating systems","shortMessageHtmlLink":"Red black tree construction"}},{"before":"cf0da1dac613a633c197302fd88c4f12fa781dba","after":"6be002ed7c7f73277e09318a752e117eab7120b8","ref":"refs/heads/main","pushedAt":"2023-06-30T11:44:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add C-LOOK algorithm in C++\n\ndetails in comments","shortMessageHtmlLink":"add C-LOOK algorithm in C++"}},{"before":"32c08656de56eabfd768815f0fc7d771b8ddd7a1","after":"cf0da1dac613a633c197302fd88c4f12fa781dba","ref":"refs/heads/main","pushedAt":"2023-06-30T11:43:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Delete CLOOK_disk_scheduling.cpp","shortMessageHtmlLink":"Delete CLOOK_disk_scheduling.cpp"}},{"before":"23acf1c57eaf9938db9912de9c5e28fee914915d","after":"32c08656de56eabfd768815f0fc7d771b8ddd7a1","ref":"refs/heads/main","pushedAt":"2023-06-30T11:39:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add C_LOOK disk scheduling algorithm in C++\n\ndetails in comments","shortMessageHtmlLink":"add C_LOOK disk scheduling algorithm in C++"}},{"before":"7b3f11d877afae6bb80e5ca8730a9904ce17c08c","after":"23acf1c57eaf9938db9912de9c5e28fee914915d","ref":"refs/heads/main","pushedAt":"2023-06-28T11:53:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add producer-consumer problem in C","shortMessageHtmlLink":"add producer-consumer problem in C"}},{"before":"f975133634d9b1198a7e6f6e9ce22940699809c7","after":"7b3f11d877afae6bb80e5ca8730a9904ce17c08c","ref":"refs/heads/main","pushedAt":"2023-06-25T14:44:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Update creduce.c","shortMessageHtmlLink":"Update creduce.c"}},{"before":"6ae6eaa5e6846d8c387685bf92d18b8ba142b964","after":"f975133634d9b1198a7e6f6e9ce22940699809c7","ref":"refs/heads/main","pushedAt":"2023-06-25T14:43:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add Creduce.c \n\nvery short implementation of LISP-like \"reduce\" function in C with function pointer..","shortMessageHtmlLink":"add Creduce.c"}},{"before":"94b69164d18d419297169ac4cacb076709038ac9","after":"6ae6eaa5e6846d8c387685bf92d18b8ba142b964","ref":"refs/heads/main","pushedAt":"2023-06-25T06:05:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"d2fb8ed79857a1c40c3d3af9b0f0c4993fc8ee4a","after":"94b69164d18d419297169ac4cacb076709038ac9","ref":"refs/heads/main","pushedAt":"2023-06-24T12:23:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add LOOK disk schedluling algorithm\n\ndetails in comments","shortMessageHtmlLink":"add LOOK disk schedluling algorithm"}},{"before":"6bfea0918823758673a58385763d42d6c6bf7304","after":"d2fb8ed79857a1c40c3d3af9b0f0c4993fc8ee4a","ref":"refs/heads/main","pushedAt":"2023-06-23T12:16:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"added extensive commentaty","shortMessageHtmlLink":"added extensive commentaty"}},{"before":"16e56176d8c0c0633a62e8292c7741e880eb5dd9","after":"6bfea0918823758673a58385763d42d6c6bf7304","ref":"refs/heads/main","pushedAt":"2023-06-23T12:00:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"C-SCAN disk scheduling in C++","shortMessageHtmlLink":"C-SCAN disk scheduling in C++"}},{"before":"c06171fd5c891e6891d8e6063c7f2852e0045662","after":"16e56176d8c0c0633a62e8292c7741e880eb5dd9","ref":"refs/heads/main","pushedAt":"2023-06-22T12:24:24.824Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"header file and C file for Petersonì\n\nHeader file \"mythreads.h\" and C source file\r\nfor Peterson's algorithm memory fence and yield lock. \r\nDetails in comments....","shortMessageHtmlLink":"header file and C file for Petersonì"}},{"before":"501efbcbfbc71515e21925e4aada0d9291c3aa97","after":"c06171fd5c891e6891d8e6063c7f2852e0045662","ref":"refs/heads/main","pushedAt":"2023-06-21T13:35:54.608Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add SCAN disk scheduling \n\nSCAN disk scheduling algorithm in C.","shortMessageHtmlLink":"add SCAN disk scheduling"}},{"before":"380a9ecd88e5730bf528b025fbf6f77a88817a10","after":"501efbcbfbc71515e21925e4aada0d9291c3aa97","ref":"refs/heads/main","pushedAt":"2023-06-13T14:02:57.595Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add worst fit memoty management\n\nAlmost identical to best fit","shortMessageHtmlLink":"add worst fit memoty management"}},{"before":"5b60079f63f484522e1005492694273c5175f5e4","after":"380a9ecd88e5730bf528b025fbf6f77a88817a10","ref":"refs/heads/main","pushedAt":"2023-06-13T13:09:09.224Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"fixed a bug","shortMessageHtmlLink":"fixed a bug"}},{"before":"7d21dbc06d43db962d5be26c5eae17eff3a15b76","after":"5b60079f63f484522e1005492694273c5175f5e4","ref":"refs/heads/main","pushedAt":"2023-06-13T11:40:15.455Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Best fit memory management algorithm in C\n\nDetails in the comments...","shortMessageHtmlLink":"Best fit memory management algorithm in C"}},{"before":"c3d2ea479ef442dda344c81881b0c7e6e9d27662","after":"7d21dbc06d43db962d5be26c5eae17eff3a15b76","ref":"refs/heads/main","pushedAt":"2023-06-12T14:09:06.094Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"First fit memory management \n\nFirst fit memory management algorithm using linked list.","shortMessageHtmlLink":"First fit memory management"}},{"before":"6cfe6b0660ec1788c81379b0d5dcd0251be7db55","after":"c3d2ea479ef442dda344c81881b0c7e6e9d27662","ref":"refs/heads/main","pushedAt":"2023-06-09T13:48:30.924Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"added First Fit Algorithm \n\nFirst Fit Algorithm for memory management in operating systems.","shortMessageHtmlLink":"added First Fit Algorithm"}},{"before":"ded0a59283ae1e1d7fa141b7ffbd4ba09896009d","after":"6cfe6b0660ec1788c81379b0d5dcd0251be7db55","ref":"refs/heads/main","pushedAt":"2023-06-07T09:33:34.193Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Lamport's Bakery Algorithm\n\ndetails in comments..","shortMessageHtmlLink":"Lamport's Bakery Algorithm"}},{"before":"03b51bc6fc1725632ced53f3ab61ec1a44b02b5a","after":"ded0a59283ae1e1d7fa141b7ffbd4ba09896009d","ref":"refs/heads/main","pushedAt":"2023-06-06T12:58:49.084Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"add Sleeping Barber problem \n\nSleeping Barber problem in C.","shortMessageHtmlLink":"add Sleeping Barber problem"}},{"before":"f9831c46b183cd7f16507f5e9ede1968f515f66a","after":"03b51bc6fc1725632ced53f3ab61ec1a44b02b5a","ref":"refs/heads/main","pushedAt":"2023-06-05T12:28:50.553Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"added optiimal page replacement algorithms.\n\nThis repository has come to have a strong emphasis on operating systems. It should probably be in a separate directory. Details about the algorithm are included in the comments.","shortMessageHtmlLink":"added optiimal page replacement algorithms."}},{"before":"e4bb5040bc954ee5fbb0dcacef343911d21282ee","after":"f9831c46b183cd7f16507f5e9ede1968f515f66a","ref":"refs/heads/main","pushedAt":"2023-06-01T14:43:52.284Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Booth's algorithm in C \n\nBooth's algorithm uses interesting bit-level manipulation achieve fast multiplication.","shortMessageHtmlLink":"Booth's algorithm in C"}},{"before":"87a231b75dcc6baa7ccd53550e89a3c76398ebcf","after":"e4bb5040bc954ee5fbb0dcacef343911d21282ee","ref":"refs/heads/main","pushedAt":"2023-05-31T09:40:09.271Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Add files via upload","shortMessageHtmlLink":"Add files via upload"}},{"before":"27cd8ee709a7580e7bb10d5001d1a6d1c2b3f24f","after":"87a231b75dcc6baa7ccd53550e89a3c76398ebcf","ref":"refs/heads/main","pushedAt":"2023-05-30T07:39:32.795Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"b99f5a43246bef76fafa8b4bcdce81cfc865a7b6","after":"27cd8ee709a7580e7bb10d5001d1a6d1c2b3f24f","ref":"refs/heads/main","pushedAt":"2023-05-30T07:37:31.383Z","pushType":"push","commitsCount":1,"pusher":{"login":"Francesco601","name":"Francesco Franco","path":"/Francesco601","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/130352141?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAADYUppLAA","startCursor":null,"endCursor":null}},"title":"Activity · Francesco601/Advanced-Topics-in-C"}