This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # CS 2200 Systems and Networking | |
| ## Prof. Ramachandran, Prof. Daglis, Prof. Sarma | |
| ## Project 5: Networking | |
| ## Due: April 22nd 2025 | |
| ## 1 Introduction |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Computer Systems and Networks | |
| ## Prof. Ramachandran, Prof. Daglis, Prof. Sarma | |
| ## Project 4 - Process Scheduling | |
| ## Due: April 8th, 2025 | |
| ## Project 4: Process Scheduling Simulation |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def dict_merge(d1:dict, d2:dict, ret_dict:dict): | |
| for k in sorted(set(d1.keys()).union(d2.keys())): | |
| if k in d1 and k in d2: | |
| if isinstance(d1[k], dict) and isinstance(d2[k], dict): | |
| ret_dict[k] = {} | |
| dict_merge(d1[k], d2[k], ret_dict[k]) | |
| else: | |
| ret_dict[k] = d2[k] | |
| elif k in d2: | |
| ret_dict[k] = d2[k] |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| languages = { | |
| 'aa': 'Afar', | |
| 'ab': 'Abkhazian', | |
| 'af': 'Afrikaans', | |
| 'ak': 'Akan', | |
| 'sq': 'Albanian', | |
| 'am': 'Amharic', | |
| 'ar': 'Arabic', | |
| 'an': 'Aragonese', | |
| 'hy': 'Armenian', |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public boolean linearIn(int[] outer, int[] inner) { | |
| int i=0, j=0, out, in; | |
| while (i<outer.length && j < inner.length){ | |
| out = outer[i]; in = inner[j]; | |
| if (out<in){ | |
| i++; | |
| } |