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

Class Note: Data Structure and Algorithm Summer - C Semester 1999 - M WRF Phase 2 CSE / E 119, Section 7344 Issue 1 - Solution (Blue Type) Note: There are many questions about this homework assignment. Therefore, the clarification is published in red below. When answering these questions remember that each question counts only 4 out of 1000 points of the course. Therefore, everyone should have a brief answer. There is no need to write a paper. * This problem assumes you want to find the maximum value of n different integers of columns or vector a.

Since programming is a very important part of computer science, this series focuses on programming. But this is not all. After laying the foundation, I begin discussing algorithms and data structures, computer architecture, discrete mathematics, network security / penetration testing / hacking and analysis. Computer science is a very wide field and I think that this essay is not fair. Through this series of processes, I hope that not only will I scratch the surface of this wonderful crazy field, but more things will be possible. There are more than most people can see, I like every aspect of it

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 possible data structures (fortunately not much) 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 about 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.