Short Trick Of Process Synchronization ( Solve any question in few minutes).<\/p>\n
[fvplayer id=”361″]<\/p>\n
Here’s a short trick guide<\/strong> to help you quickly solve any Process Synchronization question<\/strong> in GATE (or similar competitive exams) in a few minutes<\/strong>:<\/p>\n \ud83c\udfaf Goal:<\/strong> Identify Mutual Exclusion<\/strong>, Progress<\/strong>, Bounded Waiting<\/strong> in code Always check if the algorithm\/code satisfies:<\/p>\n Mutual Exclusion<\/strong> \u2013 Only 1 process in the Critical Section<\/p>\n<\/li>\n Progress<\/strong> \u2013 No unnecessary blocking<\/p>\n<\/li>\n Bounded Waiting<\/strong> \u2013 Every process eventually gets a turn<\/p>\n<\/li>\n<\/ol>\n \ud83d\udcdd Tip:<\/strong> If even one of these is violated, it\u2019s not a correct solution<\/strong>.<\/p>\n<\/blockquote>\n \ud83d\udd11 Peterson\u2019s = Most Common in GATE Questions!<\/strong><\/p>\n<\/blockquote>\n Quickly scan the code for these patterns:<\/p>\n Watch for these question patterns:<\/p>\n “Which condition is violated?”<\/strong> “How many processes can be in CS?”<\/strong> “What is the purpose of “Identify correct algorithm from options”<\/strong> \ud83d\udd13
\n\ud83e\udde0 Topic:<\/strong> Process Synchronization<\/h2>\n
\ud83e\uddea Target:<\/strong> GATE-level MCQs or code analysis<\/p>\n
\n\u2705 TRICK 1: Look for the 3 Magic Words<\/strong><\/h3>\n
\n
\n
\n\u2705 TRICK 2: Remember the CORE ALGORITHMS<\/strong><\/h3>\n
\n\n
\n \nAlgo No.<\/th>\n Name<\/th>\n Processes<\/th>\n Hardware Needed<\/th>\n Reliable?<\/th>\n Notes<\/th>\n<\/tr>\n<\/thead>\n \n 1<\/strong><\/td>\n Simple Lock<\/td>\n 2+<\/td>\n No<\/td>\n \u274c<\/td>\n Violates progress<\/td>\n<\/tr>\n \n 2<\/strong><\/td>\n Dekker\u2019s Algo<\/strong><\/td>\n 2<\/td>\n No<\/td>\n \u2705<\/td>\n Software-only<\/td>\n<\/tr>\n \n 3<\/strong><\/td>\n Peterson\u2019s Algo<\/strong><\/td>\n 2<\/td>\n No<\/td>\n \u2705<\/td>\n Easy to simulate<\/td>\n<\/tr>\n \n 4<\/strong><\/td>\n Test-and-Set Lock<\/td>\n 2+<\/td>\n Yes (Atomic op)<\/td>\n \u2705<\/td>\n Uses hardware instruction<\/td>\n<\/tr>\n \n 5<\/strong><\/td>\n Semaphore<\/td>\n 2+<\/td>\n No<\/td>\n \u2705<\/td>\n wait()<\/code> and signal()<\/code><\/td>\n<\/tr>\n\n 6<\/strong><\/td>\n Monitor<\/td>\n 2+<\/td>\n No<\/td>\n \u2705<\/td>\n High-level abstraction<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n \n
\n\u2705 TRICK 3: Identify the Entry & Exit Sections<\/strong><\/h3>\n
\ud83d\udfe9 Entry Section (wants to enter CS):<\/strong><\/h4>\n
\n
flag[i] = true;<\/code> \u2192 intention to enter<\/p>\n<\/li>\nturn = 1 - i;<\/code> \u2192 gives other process a chance<\/p>\n<\/li>\nwhile(...)<\/code> \u2192 busy wait \/ condition checking<\/p>\n<\/li>\n<\/ul>\n\ud83d\udfe5 Exit Section (leaves CS):<\/strong><\/h4>\n
\n
flag[i] = false;<\/code><\/p>\n<\/li>\nturn = ...;<\/code> \u2192 resets turn for the other process<\/p>\n<\/li>\n<\/ul>\n
\n\u2705 TRICK 4: Use This YES\/NO Table<\/strong><\/h3>\n
\n\n
\n \nCondition to Check<\/th>\n Look for in Code<\/th>\n Shortcut Decision<\/th>\n<\/tr>\n<\/thead>\n \n Mutual Exclusion?<\/td>\n Only one process allowed in CS<\/td>\n \u2705 if while(flag[] && turn)<\/code> pattern exists<\/td>\n<\/tr>\n\n Progress?<\/td>\n No unnecessary delay if CS is free<\/td>\n \u2705 if turn<\/code> changes appropriately<\/td>\n<\/tr>\n\n Bounded Waiting?<\/td>\n Process won\u2019t wait forever<\/td>\n \u2705 if turn<\/code> is assigned fairly<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n\u2705 TRICK 5: Look for Common MCQ Keywords<\/strong><\/h3>\n
\n
\u2192 Use the YES\/NO table above<\/p>\n<\/li>\n
\u2192 If more than one, Mutual Exclusion is violated<\/p>\n<\/li>\nturn<\/code> or flag[]<\/code>?”<\/strong>
\u2192 flag[]<\/code> = intent, turn<\/code> = fairness<\/p>\n<\/li>\n
\u2192 Match pattern to Peterson, Dekker, etc.<\/p>\n<\/li>\n<\/ul>\n
\n\u2705 Super Short Summary<\/strong><\/h3>\n
\n
flag[] = true<\/code> \u2192 process wants to enter
\ud83d\uded1 while (flag[other] && turn == other)<\/code> \u2192 wait
\u2705 Critical Section
\ud83d\udd01 Reset flag[i] = false<\/code>, set turn = other<\/code><\/p>\n<\/blockquote>\n
\n\u26a1 Example (Peterson’s):<\/h3>\n