CS 2110 Final: CS 211 Cornell 2006 Fall Final Examsfinalsolcs211sp03
31 Jan 2019
School
Department
Course
Professor
Document Summary
What are the three fundamental principles of object oriented programming? encapsulation, inhertiance, polymorphism (no partial credit) What is an abstract data type? set of data and its associated operations. Fill in the blank: a data structure is an implementation of an adt. Hint: the word we want begins with the letter i . What is a search structure? data structure designed for ef cient searching. What is a sequence structure? data structure designed for ef cient storage and retrieval. Explain your answer in terms of a sequence structure"s put and get operations. put and get do not usually place data in a sorted fashion. Explain why the worst-case asymptotic time complexity for the contains method in a binary search tree is. O n( ) the bst could be unbalanced effectively, a linked list. You must explain your answer for full credit.
