My Learnings
Through this Portfolio i have learned many things including the design intution on how the real world applications are designed with the help of datastructures and algorithms. I have explored a wide range of data structures and algorithms such as B trees , segment trees,lazy propogation,dynamic programming and many more. By analyzing their performance characteristics and suitability, I have been able to apply these concepts effectively to real business cases from Zillow. This Portfolio gave me an idea on how the things really work in real applications and how they are designed and efficient accessible for the users.
References
- J. S. Vitter, "External Memory Algorithms and Data Structures: Dealing with Massive Data," ACM Computing Surveys (CSUR), vol. 33, no. 2, pp. 209-271, June 2001.
- R. Bayer and E. M. McCreight, "Organization and Maintenance of Large Ordered Indexes," ACM Computing Surveys (CSUR), vol. 6, no. 4, pp. 291-322, Dec. 1974.
- R. E. Bellman, "Dynamic Programming Treatment of the Knapsack Problem," Operations Research, vol. 8, no. 1, pp. 60-65, Jan. 1960.
- D. A. Huffman, "A Method for the Construction of Minimum-Redundancy Codes," Proceedings of the IRE, vol. 40, no. 9, pp. 1098-1101, Sept. 1952.
- P. E. Hart, N. J. Nilsson, and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Transactions on Systems Science and Cybernetics, vol. SSC-4, no. 2, pp. 100-107, July 1968.
- J. L. Bentley and J. B. Saxe, "Decomposable Searching Problems I: Static-to-Dynamic Transformation," Journal of Computer and System Sciences, vol. 17, no. 3, pp. 365-373, Dec. 1978.
- APS Prakash Hegde Class Notes.