UCSD Main WebsiteUCSD Jacobs SchoolDepartment of Computer Science and Engineering
About CSECSE PeopleFacultyGraduate EducationUndergraduate EducationDepartment AdministrationContact CSE
spacer gif
spacer gif
CSE People
spacer gifspacer gif
spacer gif
plus signspacer gifDegree Programs
spacer gif
plus signspacer gifAdmissions
spacer gif
minus signspacer gifCourses
spacer gifspacer gifThis Year Schedule
spacer gifspacer gifNext Year Schedule
spacer gifspacer gifCourse Descriptions
spacer gifspacer gifClass Home Pages
spacer gifspacer gifEnrollment Status
spacer gifspacer gifEnrollment Restrictions
spacer gif
plus signspacer gifAdvising
spacer gif
plus signspacer gifFinancial Opportunities
spacer gif
spacer gifspacer gifResources
spacer gif
spacer gifspacer gifUndergraduate Program FAQ
spacer gif
spacer gif
spacer gif
Search
spacer gifspacer gifspacer gif
 
 
Google
spacer gifspacer gif
spacer gif
spacer gif
spacer gif

Home»Undergraduate Education»Courses»Undergraduate Course Descriptions»CSE100

Undergraduate Course Descriptions

CSE100 - Advanced Data Structures

Units: 4

Course Objectives:
Starting Fall 2007 CSE 70 is a prerequisite for CSE 30 and CSE 100. CSE 70 will be waived for students admitted prior to Fall 2007. CSE 70 is also waived for Bioinformatics students. Course information - An advanced data structures course considering practical and analytical aspects. This is a lecture course presenting techniques and evaluation tools and a laboratory course with programming assignments emphasizing efficient implementation methodologies.

NOTE: Repeat credit process for cross-reference courses: Students may receive credit for CSE 100 or Math 176. These courses have been cross-referenced, therefore, a petition is not required for using either course when completing major requirements. However, if you fail one of the courses listed about you should take the SAME COURSE for REPEAT CREDIT. If you use another course that is equivalent, the repeat credit is not automatic and you will need to petition for repeat credit.

Course Description:
Descriptive and analytic presentation of data structures and algorithms. Lists, tables, priority queues, disjoint subsets, and dictionaries data types. Data structuring techniques including linked lists, arrays, hashing, and trees. Performance evaluation involving worst case, average and expected case, and amortized analysis.

Format:
Per week: 3 hours of lecture, 1 hour discussion section, and 8 hours of outside preparation.

Prerequisites:
CSE 12, CSE 21 or Math 15B, CSE 30, CSE 70, or consent of the instructor.

Other restrictions:
Majors only. Credit not offered for both Math 176 and CSE 100. Equivalent to Math 176.

Example Textbook(s):
Data Structure Notes, W. A. Burkhard and optionally Data Structures and Algorithm Analysis, M. A. Weiss, and also Data Structures and Their Algorithms, H.R. Lewis and L. Denenberg.

Laboratory work:
Programming assignments, studying data type implementation and efficiencies.

Offered:
Every quarter: Fall, Winter, and Spring.

back to top ^
spacer gif
spacer gif
spacer gif
9500 Gilman Drive, La Jolla, CA 92093-0404
spacer gif
About CSE | CSE People | Faculty & Research | Graduate Education | Undergraduate Education
Department Administration | Contact CSE | Help | Search | Site map | Home
webmaster@cs.ucsd.edu
Official web page of the University of California, San Diego
Copyright © 2003 Regents of the University of California. All rights reserved.
spacer gif