cs32s10final

cs32s10final - CS32: Introduction to Computer Science II...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Discussion 1B Notes (Week 10, June 4) TA: Brian Choi (schoi@cs.ucla.edu) Section Webpage: http://www.cs.ucla.edu/~schoi/cs32 Final Practice Big-O Provide the complexity of each algorithm below. 1. Assume N >> 5. for (int i = 0; i < N; i++) { for(int j = 0; j < i; j++) { for(int k = 0; k < 5; k++) { for(int l = 0; l < N; l += 2) { cout << arr[l] << endl; } } } } 2. Depth-First Traversal on a binary tree 3. Breadth-First Traversal on a binary tree 4. Suppose there is an array of n (~ 1 million) elements in a random order. You want to run a search and look for a certain item. What is the best you can do if: 1) you run a search once (i.e. “Is there 5 in the array?”) 2) you run search million times (i.e. “Is there 5? 16? 73? . ..) Discuss the algorithm you would use for each case. You’re free to construct/destruct other data structures as you need them. 5. Which one takes longer? O(log n) O(n) O(n log n) O(n 2 ) O(n log n) O(n) O(n!) O(2 n ) CS32: Introduction to Computer Science II Spring 2010 Copyright 2010 Brian Choi Week 10, Page 1/6
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Binary Trees 6. Write a recursive function that counts the number of nodes in a binary tree. Use the following structure. struct Node { int val; Node* left; Node* right; }; int nodeCount(Node* root) { } 7. Write a one-line function that returns you the number of edges in a binary tree, using the function you defined above. int edgeCount(Node* root) { } 8. Suppose you have a template class called BinaryTree , with the member function insert properly defined.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 6

cs32s10final - CS32: Introduction to Computer Science II...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online