Final Exam Solutions
CS 213 Fall 2003
1. V = 2^{n+1} – 1
Copyright By PowCoder代写 加微信 powcoder
2. V = 2^{2 – 2^{k-1}}
Note: 2^n denotes 2 to the power n
A. x->b->j.h[3]
B. x->h[1]
C. x->k->i
1. Could be either 3, 4, or 5
4. Could be either 3 or 4
1. largest value = 2
2. largest value = 2
3. largest value = 4
A, D, and H
**********
Problem 10
**********
Before child exits
8 letters read
1 number read
Immediately before parent exits:
3 letters read since child exited
3 numbers read since child exited
**********
Problem 11
**********
Part 1: Possible output sequences:
Part 2: Possible output sequences:
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com