COP 3530, Discrete Data Structures and Algorithms, Summer 1999, Homework 5

Class Note: Data structure and algorithm Summer - C semester 1999 - M WRF phase 2 CSE / E 119, section 7344 Issue number 5 - Wednesday 30th June 1999: 09.30am In the revised day class, First - First search (BFS and DFS) algorithm used to scan graphs. Use class notes and text (Chapter 12) as a guide to answer the following questions. Note: The answer is a blue font. * The problem is to write pseudocode (not Java code) for the BFS algorithm described in the class. Outside each step, the number of external inputs / outputs written, memory I / O, increment, comparison, and other types of operations used.

If you are not used to data structures and algorithms and do not have a computer science background, Grokking Algorithms' book is the best book on this subject. To illustrate some of the data structures described in this article, I use some intelligible explanations and funny hand-drawn illustrations (the author is Etsy's lead developer).

If you are interested in how to implement the data structure, check Lago (the data structure and algorithm library for JavaScript). It is almost still a WIP, but I will change it to a library that can be used for production, and a reference resource to learn data structures and algorithms. Practice and solve algorithm problems in the selected language. Interview coding interview is a wonderful resource but I prefer to solve problems by inputting and running code and getting feedback right away. There are various online judges such as LeetCode, HackerRank, CodeForces. You can practice questions online and get used to that language. In my experience, the problem of LeetCode is most similar to that presented in the interview. The problem with HackerRank and CodeForces is similar to the problem of competing programming

HashMaps is probably the most commonly used data structure for algorithmic problems. If there is a problem, the last approach is to enumerate the possible data structures (not fortunately) and consider whether each can be applied to the problem. This is sometimes useful to me. If you are cutting corners with code, explain it to your interviewer and explain to them what you do outside the interview setup (no time limit). For example, instead of using split, you want to write a regular expression to parse a string. This does not include everything.