Koofers

Past Exam for 198 112 - DATA STRUCTURES with Hari at Rutgers (RU)

Exam Information

Material Type:Mid-Term
Professor:Hari
Class:198 112 - DATA STRUCTURES
Subject:COMPUTER SCIENCE
University:Rutgers University
Term:Spring 2008
Keywords:
  • Spring 2008 Midterm
  • Average Number
  • Sequential Search
  • Calculators
  • Comparisons
  • Probabilities
  • Implementation
  • Data Structure
  • Public Boolean
  • Binary Search
Login / Sign Up to View Document
Preview Page 1Preview Page 2Preview Page 3Preview Page 4Preview Page 5Preview Page 6

Sample Document Text

1 COMPUTER SCIENCE 112 - SPRING 2008 MIDTERM EXAM Name: ________________________________ TA's Name: ________________________________ Be sure your test has 7 questions. Be sure to fill your name and TA's name above, and your name in all subsequent pages where indi- cated. Do not begin until instructed to do so This is a CLOSED TEXT and CLOSED NOTES exam. You MAY NOT use calculators, cellphones, or any other electronic device during the exam. Do not write below this line Problem Max Score ------- ----- ----- 1 (Linked Lists) 15 _____ 2 (Queue) 15 _____ 3 (Modified Sequential Search) 15 _____ 4 (Postfix Expression Evaluation) 15 _____ 5 (Binary Search Comparison Tree) 15 _____ 6 (Delete-Minimum Data Structure) 15 _____ 7 (Stack-based Count Nodes) 10 _____ TOTAL 100 _____ 2 1. Linked Lists (15 pts) Given two sorted linked lists L1 and L2, find the common elements. You may assume that neither of L1 and L2 has any duplicate items. Build a new linked list of the common elements - do not ...

Related Documents

Implementation Notes
Unauthorized Exam
Unauthorized Exam
Immediately Notes
Immediately Notes
Either...or Exam
Complicated Notes
Complicated Notes
155, "/var/app/current/tmp/"