Software Engineering Career Guide, Study notes of Network Technologies and TCP/IP

Download Software Engineering Career Guide and more Study notes Network Technologies and TCP/IP in PDF only on Docsity! S O F T W A R E E N G I N E E R I N G C A R E E R G U I D E Student Affairs at Carnegie Mellon University Silicon Valley 2 SOFTWARE ENGINEERING CAREER GUIDE STUDENT AFFAIRS AT CARNEGIE MELLON UNIVERSITY SILICON VALLEY C O N T E N T S I N T R O D U C T I O N . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 E X A M P L E R E S U M E . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 I N T E R V I E W S . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 The Online Assessment (OA). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 The Phone Interview. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 The Technical Interview. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 S Y S T E M D E S I G N . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Co-Curriculars. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Courses at CMU. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 5 SOFTWARE ENGINEERING CAREER GUIDE STUDENT AFFAIRS AT CARNEGIE MELLON UNIVERSITY SILICON VALLEY G E T T I N G R E A D Y F O R I N T E R V I E W S Although the above requirements state the required skills, here is a bunch of material to be covered and helpful links and books that will help achieve the above requirements! Cracking the Coding Interview By Gayle Laakmann McDowell - This is a must have book when you are starting out preparing for interviews. It covers all the basic data structures and has some really good programming questions. Elements of Programming Interviews By Adnan Aziz, Tsung- Hsien-Lee, and Amit Prakash - Once you are familiar with data structures ( Recommend starting with Cracking the Coding Interview book), move on to EPI, which dives more deeply into data structures, and becomes slightly more complex. While preparing with the two books, keep practicing online on LeetCode.com, HackerRank.com, and CodeSignal.com on the data structures that you covered to gain expertise. Some students also buy the premium version and practice questions specific to their dream companies. While it is difficult to recommend a certain number of questions one should do to be able to ace coding interviews, continuity in practice of algorithm questions is the key. One must exercise the data-structures and algorithms skills repeatedly at regular intervals for the interview prep to be most effective. There are several different study-guides/resources available online. I consulted many video tutorials to understand and reinforce several concepts. There are many great Youtubers who share explanations to questions, interview tips, and preparation strategies. I recommend subscribing to your favorite technical interview channel so that you are always reminded of the way they approach problems. I would recommend the following study material: • Overall study guide: https://workflowy.com/s/study-guide/RD5kZ682pWX5oxiE • 12 Week Leetcode based program: https://docs.google.com/document/d/1wUCqhVHydWiDk 6FJdFLSMpgigNrGcs4OFZg0Wa7JGEw/edit • Video playlist of solved leetcode questions: https://www.youtube.com/playlist?list=PLAE- zml3hxQvdC8iD61W9-lqeUd4RWC45 • Individual Topic/Algorithm Explanations by Tushar Roy https://www.youtube.com/channel/UCZLJf_ R2sWyUtXSKiKlyvAw More Youtube Explanation about algorithms and leetcode questions: • Back To Back SWE - YouTube: https://www.youtube.com/ channel/UCmJz2DV1a3yfgrR7GqRtUUA • Irfan Baqui - YouTube: https://www.youtube.com/ channel/UCYvQTh9aUgPZmVH0wNHFa1A • Clément Mihailescu - YouTube: https://www.youtube. com/channel/UCaO6VoaYJv4kS-TQO_M-N_g Interview Tips & Tricks: Programming Interview Questions + Help Getting Job Offers | Interview Cake: https://www. interviewcake.com/ 6 SOFTWARE ENGINEERING CAREER GUIDE STUDENT AFFAIRS AT CARNEGIE MELLON UNIVERSITY SILICON VALLEY Make sure to brush up on the below concepts: BIG O NOTATIONS - Try to develop a good understanding of this, as you will be asked to explain the time and space complexity of every algorithm you write down in front of your interviewer. https://www.bigocheatsheet.com/ - This is a good link to brush up on BIG O, once you are done studying all major algorithms. Following are the Top 10 Algorithm topics (according to TechLead - YouTube (https://www.youtube.com/ channel/UC4xKdmAXFh4ACyhpiQ_3qBw) and Clément Mihailescu - YouTube (https://www.youtube.com/channel/ UCaO6VoaYJv4kS-TQO_M-N_g): 1. DFS - Depth First Search 2. BFS - Breadth First Search 3. Matching Parenthesis - Best way to solve this is stacks 4. Hash Tables - Memoization, Caching 5. Multiple Pointers/Variables - Ex. Longest Palindrome Substring 6. Reversing a Linked List - Ex. Checking for cycles, removing duplicates 7. Sorting Fundamentals - Know runtimes, applications 8. Recursion 9. Custom Data Structures - Ex. Suffix tree like data structure, OOA 10. Binary Search Here are some of the data structures you absolutely must practice: • ARRAYS • STRINGS • LINKED LISTS - SINGLY AND DOUBLY https://www. hackerearth.com/practice/data-structures/linked-list/singly- linked-list/tutorial/ • TREES - BINARY , BST and NARY https://www. hackerearth.com/practice/notes/trees/ • GRAPHS https://www.geeksforgeeks.org/graph-data- structure-and-algorithms/ • STACKS • HEAPS https://www.geeksforgeeks.org/heap-data- structure/ 7 SOFTWARE ENGINEERING CAREER GUIDE STUDENT AFFAIRS AT CARNEGIE MELLON UNIVERSITY SILICON VALLEY The next few are for more advanced preparation, before you start, make sure that you are an expert in the above given structures. • TRIES - https://www.geeksforgeeks.org/trie-insert-and- search/ • QUAD TREE • RED BLACK TREE Along with these data structures, here are some algorithms you absolutely must know: • SORTING - ( bubble, selection, merge, heap, quick, Insertion) - https://www.hackerearth.com/practice/notes/ sorting-code-monk/ • Binary Search and other searching algorithms • Hashing using maps • Graph traversal algos - Breadth-first-search, Depth-first- search, Dijkstras (Use Hackerearth links for these) • Dynamic Programming - https://www.youtube.com/ watch?v=OQ5jsbhAv_M • Greedy Algorithms - https://www.geeksforgeeks.org/ greedy-algorithms/ All of these topics have really good material online, sometimes it is helpful to use multiple links online (hackerearth, geeksforgeeks, tutorialpoint) to get a good grasp. This next section lists a number of extremely helpful conferences! • CPPCon • TAPIA • DeveloperWeek • GoToConference • TOC + Converge every Fall • Grace Hopper Conference If you are a woman, make sure to attend the GRACE HOPPER CONFERENCE. There are many graduate students who get multiple calls from various companies at this conference.