John’s Data Structures Week 8

Chapter 6: Stacks

1 . State three more axioms about the stack of T ADT .

For any stack s and element e, pop(push(s,e)) = s .
For any stack s and element e, top(push(s,e)) = e .
For any stack s, and element e, empty?(push(s,e))…

Ahmed week 4 post

Paul was able to find an app for us to work on Jessica, Ulises and I was suppose to make an app for user to see the menu and items the company has on there website. The Android team worked on drawing how the app would look like we researched other apps and how each component of the app was made.

Week 6 Data Structures

3.1

Ahmed Week 5 Blog post

The Android team worked on the green lady app we was able to implement the action bar, color in background, and an image. We was able to run it on are phones and I felt like we accomplished a lot thanks to all of are efforts.

Week 3 Data Structures

1.7

Prove log2 x < x for all x > 0
Solution
It is clear that the theorem is true for 0 < x ≤ 1 because:
if x < 1 then log2 x < 0
if x = 1 then log2 x = 0.
Proof by induction to show that the theorem is true for x > 1:
Base Case:
if 1 < x < 2 then log2 x < 1
if x…

Ahmed week 3 blog post

I started working on and researching how to make android app what I came up with was android studio was the new IDE for android I was looking for the Eclipse plugin but it was no longer being used. I started watching Android studio videos on Lynda.com and was able to learn about how to…

Week 4 Data Structures

2.1

2/N < 37 <√N < N < N log log N < N log N ≤ N log(N2)
< N log2 N < N^1.5 < N^2 < N^2 log N < N^3 < 2^N/2 < 2^N

The only two functions that grow at the same rate are N log N and

Ahmed Week 7 Blog post

The Android team and Paul were able to make a parse account we working on be able to make an app called to to-do list were you add a to-do on the app and it shows up the data that you added from the app with a list view and show’s up on the parse account. I was able to look up a example…