Harvard University Programming Languages Questions

  1. SQL is called a declarative language. Describe the pros and cons of a declarative language compared to an imperative language (e.g., C/C++)
  2. Hash can be slower than binary search. Describe the reason why.
  3. Assume you want to implement a parallel hash join. You can use 1000 CPU cores and all the data can fit in DRAM. Describe how you implement it. You need to consider not only search but also hash table construction. Locking should be necessary for parallel building, and an efficient locking system should be preferred.
  4. Describe why DSM is more efficient than NSM for aggregate operation.
  5. When you have N relational tables, how many plans do you have in theory?
  6. When making a query processing pipeline, if you adopt the Volcano method, then you can reduce memory consumption size, which is nice. Then, explain the negative aspect of this method.
  7. If you adopt a just-in-time compilation method, then you generate C language from SQL online, dynamically. The code generation time can be long, but this method is popular in modern databases. Explain the reason why.
  8. Explain false positive and false negative.
  9. In today’s world where software is eating the world, data platforms (DPFs) to manage data are critical. Both GAMA/BATH have their own DPFs. How would a country or an organization without DPF technology be in trouble? Please state your thoughts.
  10. Consider an application of eBPF.

Save Time On Research and Writing
Hire a Pro to Write You a 100% Plagiarism-Free Paper.
Get My Paper
Still stressed from student homework?
Get quality assistance from academic writers!

Order your essay today and save 25% with the discount code LAVENDER