University of Engineering and Technology

Department of Electrical Engineering

EE 234: Data Structures and Algorithms
Spring 2023

Problem Set 0 Issue Date: January 16, 2023 Due Date: January 23, 2022

1. (a) Show that

∞
X x
kxk = for 0 < |x| < 1
(1 − x)2
k=0

. What happens when |x| ≥ 1?

(b) Show that
∞
X (k − 1)
=0
2k
k=0

(c) Evaluate
∞
X 1
k
k=1

(d) Evaluate
∞
X 1 1
−
k k+1
k=1

2. Evaluate the product

n
Y
2 · 4k
k=1
Pn 2
3. Show that k=1 1/k is bounded above by a constant.

4. Let A and B be finite sets such that |A| < |B|, and let f : A → B be a function. Can f be
surjective? Why?

5. A binary tree is a rooted tree in which each node (that is not a leaf) has exactly two children.
Show by induction that the number of nodes with 2 chidlren in any non-empty binary tree is 1
fewer than the number of leaves. Conclude that the number of internal nodes in a full binary tree
is 1 fewer than the number of leaves.

6. A person wants to distribute 10 identical chocolates amongst 4 children. How many ways can he
do so? Draw a picture to prove that your answer is correct.