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

Final Exam Notes - Algorithms and Data Structures – Fall 2011 | CS 200, Study notes of Computer Science

Colorado State University (CSU)Computer Science
Prof. Sangmi L. Pallickara

Final Exam Notes 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
boldstepdesign 🇺🇸

5

(1)

5 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS#200#Final#Exam#Preparation#Guide#
!
Exam!Date:!Monday,(December(12,(2011!
Location!&!Time:!Clark!A202!6:20(~(8:20(PM!
!
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.
The final exam is comprehensive. About 30 % of total score will be
assigned to the problems repeated from midterms. Make sure you
review the midterms.
Check List
1. Lecture Note and textbook
2. Midterm 1 and Midterm 2
3. Written Assignment #3
4. Quizzes #5, 6
5. Worksheet for Part 10.
6. Examples in the text
!
!
Key(concepts(
The!problems!in!this!exam!will!be!about!the!concepts!covered!in!the!lectures!(week!
1!through!week!16).!!Please!review!your!lecture!notes!
(http://www.cs.colostate.edu/~cs200/Fall11/Schedule.html)!!!
!
For(material(covered(from(week(1B9,(please(refer(to(the(exam(guides(that(were(
provided(for(Midterms(1(and(2.(
!
From!the!lectures!of!week!10!~!week!16.!
!
!
!
Heaps(and(Heapsort(
Lecture!Notes:!part!7!Heaps!and!Heapsort!
Text:!Chapter!12!(Prichard)!
1. What!is!a!heap?!
2. How!to!insert!and!delete!items?!
3. Array!representations!of!heap.!
pf2

Partial preview of the text

Download Final Exam Notes - Algorithms and Data Structures – Fall 2011 | CS 200 and more Study notes Computer Science in PDF only on Docsity!

CS 200 Final Exam Preparation Guide

Exam Date: Monday, December 12, 2011

Location & Time: Clark A 202 6:20 ~ 8:20 PM

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. The final exam is comprehensive. About 30 % of total score will be assigned to the problems repeated from midterms. Make sure you review the midterms. Check List

  1. Lecture Note and textbook
  2. Midterm 1 and Midterm 2
  3. Written Assignment #
  4. Quizzes #5, 6
  5. Worksheet for Part 10.
  6. Examples in the text

Key concepts

The problems in this exam will be about the concepts covered in the lectures (week 1 through week 16 ). Please review your lecture notes (http://www.cs.colostate.edu/~cs200/Fall11/Schedule.html) For material covered from week 1 9, please refer to the exam guides that were provided for Midterms 1 and 2. From the lectures of week 10 ~ week 16. Heaps and Heapsort Lecture Notes: part 7 Heaps and Heapsort Text: Chapter 12 (Prichard)

  1. What is a heap?
  2. How to insert and delete items?
  3. Array representations of heap.
  1. What is the difference between heap and binary tree?
  2. Heapsort algorithm and efficiency Hashing Lecture Notes: part 8. Hashing Text: section 13-­‐2 (Prichard)
  3. Why do we need hashing?
  4. What are linear, and the quadratic probing?
  5. What is chaining? Relations Lecture Notes: part 9. Relations Text: section 8-­‐1 ~ 8-­‐3 (6th^ Ed. Rosen) Revisit the problems in the written assignment #3.
  6. Binary relations
  7. Reflexive relations, Transitive relations, and Symmetric/antisymmetric relations
  8. Combining relations
  9. The powers of a relation R
  10. Representation of the relations Graphs Lecture Notes: part 10. Graphs Text: Chapter 14(Prichard) Section 9-­‐1 ~ 9-­‐6 (6th^ Ed. Rosen) Solve the problems in the worksheet
  11. Know the terminologies of a graph such as vertex, edge, degree, directed graph, undirected graph, loop, subgraph, path, and cycle.
  12. The handshaking theorem
  13. Graph representation
  14. Graph implementation
  15. Graph traversal algorithms. Know both DFS and BFS algorithms.
  16. Connectedness of graphs. What is a strongly connected graph? What is a weakly connected graph?
  17. What is a planar graph?
  18. Topological sorting algorithms
  19. Know the Minimum spanning tree algorithm
  20. Know the Shortest path algorithm
  21. What is an Euler path, and circuits? Know how to find them.
  22. What is an Hamiltonian circuit? Know how to find them.