Computer Science 2210A/B Study Guide - Final Guide: Search Algorithm, Information Hiding, Big O Notation
22 May 2017
School
Department
Course
Professor
Document Summary
Lecture summary: in week 1, we go over course content and what can students expect to learn in this course. The course content teaches students useful data structures and algorithms that are essential in core areas of computer science. In this and next lectures we introduce the concepts of: data structure, algorithm, complexity of an algorithm. Given a set s of elements and a particular element x the search problem is to decide whether x . This problem has a large number of applications: s = {names in a phone book} S = {student records: s = {variables in a program, s = {web host names} The solution of a problem has 2 parts: how to organize data. Data structure: a systematic way of organizing and accessing data: how to solve the problem. Algorithm: a step-by-step procedure for performing some task in finite time.
