Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Midterm Exam 1 - Data Structures and Programming | ECS 110, Exams of Data Structures and Algorithms

University of California - DavisData Structures and Algorithms
Prof. Kenneth I. Joy

Material Type: Exam; Professor: Joy; Class: Data Structures & Prog; Subject: Engineering Computer Science; University: University of California - Davis; Term: Fall 2003;

Typology: Exams

Pre 2010
On special offer
30 Points
Discount

Limited-time offer

Uploaded on 07/31/2009

koofers-user-wo0-1
koofers-user-wo0-1 🇺🇸

10 documents

1 / 9

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECS 110
Data Structures and Programming
Midterm Examination #1
Name__________________________________________________
Directions:
This is a closed-book test. Answer all questions on the paper
provided. Use the backs of the provided paper if you need
extra space.
1. What are the primary operations of a stack? What are the primary
operations of a queue?
pf3
pf4
pf5
pf8
pf9
Discount

On special offer

Partial preview of the text

Download Midterm Exam 1 - Data Structures and Programming | ECS 110 and more Exams Data Structures and Algorithms in PDF only on Docsity!

ECS 110

Data Structures and Programming

Midterm Examination

Name__________________________________________________

Directions:

This is a closed-book test. Answer all questions on the paper

provided. Use the backs of the provided paper if you need

extra space.

  1. What are the primary operations of a stack? What are the primary operations of a queue?
  1. What are the advantages of a doubly-linked list over a singly-linked list? What are the disadvantages? Be complete here!
  1. Given the list of integers

4, 7, 10, 3, 2, 9, 1, 5

exhibit a binary tree that, when traversed in inorder, outputs the list in ascending order.

  1. Given the list of integers

4, 7, 3, 10, 2, 9, 1, 5, 12

Add each of these integers to a Min heap. Show the structure of the heap before and after each insertion. Note: We want the minimum value at the top.

  1. The solution to the subway problem is frequently called a “backtracking” algorithm. Explain this term as it applies to the subway problem.
  1. Illustrate a binary search tree which is not an AVL tree, but one that can be made into an AVL tree by using one single rotation. Show the result of the single rotation on the tree.