Prepare for your exams
Get points
Guidelines and tips
Sell on Docsity
Docsity AI

Prepare for your exams

Study with the several resources on Docsity

Earn points to download

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

Guidelines and tips

Sell on Docsity

Docsity AI

Log in Sign 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

20 Points

For each uploaded document

Answer questions

5 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 2 Preparation Guide - Algorithms and Data Structures | CS 200, Study notes of Computer Science

Colorado State University (CSU)Computer Science

Prof. Sangmi L. Pallickara

Mid term 2 Material Type: Notes; Professor: Pallickara; Class: Algorithms and Data Structures; Subject: Computer Science; University: Colorado State University; Term: Fall 2011;

Typology: Study notes

2010/2011

Uploaded on 12/29/2011

boldstepdesign 🇺🇸

5

(1)

5 documents

1 / 2

This page cannot be seen from the preview

Don't miss anything!

CS200MidtermExam2PreparationGuide



ExamDate:Thursday,October27,2011

Location&Time:Inclass,9:30~10:45AM



In this exam, you will have a mix of multiple-choice questions, some

short answer questions and some questions that require you to read

Java code and perform algebraic calculations. You should attempt the

examples and exercises at the end of indicated textbook sections/

chapters. Many of the exam questions will have a similar form. Also

review the in-class quizzes.



Keyconcepts

Theproblemsinthisexamwillbeabouttheconceptscoveredinthelectures(week

1throughweek5).Pleasereviewyourlecturenotes

(http://www.cs.colostate.edu/~cs200/Fall11/Schedule.html)

Thefollowingtextbookexercisesandexamplescanhelpyoupreparefortheexam.



BinaryTree,BinarySearchTree

LectureNotes:part.6(1)

Textbook:Chapter11TreesfromPrichard



1. WhataretheBinaryTreeandBinarySearchTree?

2. SearchandTraversalalgorithms.

3. InsertionandDeletionalgorithms.

4. ImplementationofBSTs.

5. EfficiencyofBinarySearchTree.

6. KnowhowtosortalistusingaBST(treesort)

7. KnowhowtoprovethepropertiesofBSTandbinarytreewithmathematical

induction.

8. Whatisthecomplexityoftreesort?

9. Algorithmsforstoring/restoringBST

10. UnderstandpsuedocodeforBSToperations.



BalancedTrees:23tree,234tree,RedblacktreeandAVLtree

LectureNotes:part6(2).

Textbook:Chapter13,Section1.BalancedSearchTreesFromPrichard



1. Whatare23,234,Redblack,andAVLtrees?

2. Search/Traversal/Inserting/Deletingalgorithmfor23tree

3. Search/Traversal/Inserting/Deletingalgorithmfor234tree

4. Knowhowtoconverta234treetoaRedblacktree

5. KnowhowtoconvertaRedBlacktreetoa234tree.

Discover Study notes of Computer Science Colorado State University (CSU)

Partial preview of the text

Download Midterm Exam 2 Preparation Guide - Algorithms and Data Structures | CS 200 and more Study notes Computer Science in PDF only on Docsity!

CS 200 Midterm Exam2 Preparation Guide

Exam Date: Thursday, October 27, 2011

Location & Time: In-‐class, 9:30 ~ 10:45 AM

In this exam, you will have a mix of multiple-choice questions, some short answer questions and some questions that require you to read Java code and perform algebraic calculations. You should attempt the examples and exercises at the end of indicated textbook sections/ chapters. Many of the exam questions will have a similar form. Also review the in-class quizzes.

Key concepts

The problems in this exam will be about the concepts covered in the lectures (week 1 through week 5). Please review your lecture notes (http://www.cs.colostate.edu/~cs200/Fall11/Schedule.html) The following textbook exercises and examples can help you prepare for the exam.

Binary Tree, Binary Search Tree Lecture Notes: part. 6-‐(1) Textbook : Chapter 11 Trees from Prichard

What are the Binary Tree and Binary Search Tree?
Search and Traversal algorithms.
Insertion and Deletion algorithms.
Implementation of BSTs.
Efficiency of Binary Search Tree.
Know how to sort a list using a BST (treesort)
Know how to prove the properties of BST and binary tree with mathematical induction.
What is the complexity of treesort?
Algorithms for storing/restoring BST
Understand psuedocode for BST operations.

Balanced Trees: 23 tree, 2 34 tree, Red black tree and AVL tree Lecture Notes: part 6-‐(2). Textbook: Chapter 13, Section 1. Balanced Search Trees From Prichard

What are 2-‐3,2-‐3-‐4, Red-‐black, and AVL trees?
Search/Traversal/Inserting/Deleting algorithm for 2-‐3 tree
Search/Traversal/Inserting/Deleting algorithm for 2-‐3-‐4 tree
Know how to convert a 2-‐3-‐4 tree to a Red-‐black tree
Know how to convert a Red-‐Black tree to a 2-‐3-‐4 tree.

What is the advantage of using 2-‐3 trees when compared with the BST?
What is the advantage of using 2-‐3-‐4 trees when compared with the 2-‐3 trees?
What is the advantage of using Red-‐black tree when compared with the 2-‐3-‐ trees?
How do AVL trees keep the balance?

External Methods: Btree Lecture Notes: part 6-‐(3) Text book: Chapter 15-‐1, 3(pp.845~856) from Prichard

What is the advantage of an external storage to maintain a data structure?
What is the B-‐tree?
Know how to use B-‐tree to organize data blocks
Deleting/Inserting/Traversals algorithms