CSC 340 Lehigh

Study Material >> Pennsylvania Colleges & Universities >> Lehigh >> Computer Science (CSC) >> CSC 340
Find below a list of sample documents for Lehigh CSC 340 course.
 

Lehigh CSC 340 documents:

  • Lehigh CSC 340 Spring 2001
    CSc 340 Test 1 Wednesday 14 February 2001 Close book. Closed notes. No Calculators allowed. Answers available when you leave. Each question is worth 20 points. 1. A number of students tried to improve on the algorithm for computing the value of a pol
  • Lehigh CSC 340 Spring 2001
    CSc 340 Final Examination Monday 14 May 2001 SUGGESTED ANSWERS 1. Below I give the adjacency matrix of a weighted, undirected graph. The nodes are a, b, c, d, ., m. If there is no arc between two nodes, nothing is shown. If there is an arc betwee
  • Lehigh CSC 340 Spring 2001
    CSc 340 Test 2 SUGGESTED ANSWERS 1. 2. clients Wednesday 21 March 2001 Write the specifications of an ADT for a Queue of ints. See Fig. 2.16, p. 90 of the text. For the Queue ADT of question 1: a. Write out the implementation of enqueue and dequeu
  • Lehigh CSC 340 Spring 2001
    CSc 340 Test 3 Wednesday 18 April 2001 -SUGGESTED ANSWERS -1. Show the nine comparisons which would occur when the tournament algorithm is applied to find the 2nd largest entry in the array x[1],.,x[8] = {8, 4, 9, 7, 3, 2, 6, 1}. In practice, of cour
  • Lehigh CSC
    CSc 340 Test 3 Wednesday 18 April 2001 -SUGGESTED ANSWERS -1. Show the nine comparisons which would occur when the tournament algorithm is applied to find the 2nd largest entry in the array x[1],.,x[8] = {8, 4, 9, 7, 3, 2, 6, 1}. In practice, of cour
  • Lehigh CSC
    CSc 340 Test 1 Wednesday 14 February 2001 Close book. Closed notes. No Calculators allowed. Answers available when you leave. Each question is worth 20 points. 1. A number of students tried to improve on the algorithm for computing the value of a pol
  • Lehigh CSC
    CSc 340 Final Examination Monday 14 May 2001 SUGGESTED ANSWERS 1. Below I give the adjacency matrix of a weighted, undirected graph. The nodes are a, b, c, d, ., m. If there is no arc between two nodes, nothing is shown. If there is an arc betwee
  • Lehigh CSC
    CSc 340 Test 2 SUGGESTED ANSWERS 1. 2. clients Wednesday 21 March 2001 Write the specifications of an ADT for a Queue of ints. See Fig. 2.16, p. 90 of the text. For the Queue ADT of question 1: a. Write out the implementation of enqueue and dequeu
  • Lehigh CSC
    CSE 17 Final Examination Wednesday 20 December 2006 <SUGGESTED ANSWERS> 1. For each of the questions below, assume the following data are processed in the given order: 11, 26, 64, 63, 76, 50. (a) Assume the data are entered into a binary tree, where