Any computer engineers, or Students?

[Pete-KT]

I need some help with my Take home Test for Data structures class, just seeing if someone can give me a hand with it.

[Pete-KT]

anyone???

[colpanic]

lol... GFY is your best source of software experts?

I was a comp sci major, a while ago though.

I'm on and off today but post em in here & I'll reply if I can.

Todd

[tungsten]

your best bet is to just post the question and see if anyone can contribute

[LittleSassy]

let's see what i can do...i had that subject last last term...

[loverboy]

you calling? got my degree last 2000

[Pete-KT]

Here are the questions if you can help i can send you the graphs needed

MCS 2534 Data Structures and Algorithm Design
Summer 2005
Midterm Take Home Exam


1. Chapter 2, Algorithm Design:
a. Discuss the meaning of the Big Oh notation. Cover the four cases defined by Big O, Omega, Theta, and Little o.
i. What is the significance of the positive constants used in the formal definition (e.g. ?There are positive constants, c & n such that T(N) >= cF(n) where N >= n0?)
ii. Show graphically (you can use graph of part iii)
iii. See the attached graph and answer the questions.
2. Chapter 3 ? Linked Lists, Stacks & Queues:
a. What is the Big Oh notation for stacks and queues?
3. Chapter 4, Trees:
a. How is the tree height related to running time for tree operations (give a general relationship).
b. What is the Big Oh for Binary Search Trees?
c. What is the basic reason for the Big Oh formula in part b? (develop a simple mathematical basis for this formula)
d. Discuss the affect that balance (or lack of) has on performance (Bog Oh) and why.
e. What is an AVL tree
i. What does it provide vs a BST?
ii. What is the affect on Big Oh vs a BST
f. Explain the basic idea of Splay Trees.
g. What do splay trees provide regarding running time (What is the Big Oh and why).
h. Discuss B- Trees
i. What is a B-Tree
ii. What is the basic idea behind a B-Tree
iii. What is the Big Oh notation
iv. Why use a B-Tree?
i. Balance the tree (attached) so it is AVL. You can use any method you want.

4. Chapter 5 ? Hashing
a. Explain the general idea behind hashing
b. What is the Big Oh for hashing?
c. What is a hashing function?
d. What are the tradeoffs among hashing functions?
e. If you use the table size as part of the hashing function, why should the table size be a prime number?
f. Give an example of a hashing function using table size.
g. Explain collisions.
h. Explain separate chaining
i. Explain Linear Probing
i. What is the basic idea?
j. What is the ?Primary Clustering Problem??
k. Explain Quadratic Probing.
i. What does it provide over linear probing?
l. See attached (5L) and answer questions

[wdsguy]

lol its a midterm and you have to cheat on it by coming to gfy? pretty sad.

[wedouglas]

i can answer some of these.

[wedouglas]

is this for a Dscreet Math Course?

[Pete-KT]

is this for a Dscreet Math Course?

No its for Data structures

[BigBen]

"If things go right I might be showing her my O-face. You know: Oh. Oh"

[wedouglas]

i. What is the significance of the positive constants used in the formal definition (e.g. ?There are positive constants, c & n such that T(N) >= cF(n) where N >= n0?)

i think you have the >= backwards. anyway, it means given two functions T(n) and F(n) this is some constants c and k, these being called witnesses, that cF(n) will always be greater than the function F(n) where n = k > 1

[wedouglas]

You should be able to read all this straight out of your book... all this O,o, Big theta has to dowith growths of functions and what grows faster taking certain constants as witnesses

[Pete-KT]

Ya I know but ive got so much work goin on I asked for a lil help before pulling the book out

[wedouglas]

where do you go to school? whats your major?

[Pete-KT]

Im majoring in Computer engineering

[wedouglas]

yeah same here. dual in EE/CE at UofM

[Pete-KT]

Oh no way, our fraternity has a chanpter up there

[wedouglas]

dearborn or aa? ot many at dearborn i dont think

[Pete-KT]

webdouglas icq me please

[Pete-KT]

Both we are at both of them

[WiredGuy]

You want us to do your midterm for you? LOL
WG

[Pete-KT]

You want us to do your midterm for you? LOL
WG

No im working on my midterm i asked for any help if someone knows the answers off the top of there head

[wedouglas]

sorry, went away. i dont use icq

[Pete-KT]

Do u have aim or yahoo?

[woj]

Those questions are not really that hard, they are straight from the book, all you have to do is look up the answers...

[wdsguy]

Better help this guy or hes gonna fail the midterm!

[LittleSassy]

LOL...that's too many....and some of these are ffrom my discreet math...i so suck at math...

[Pete-KT]

Those questions are not really that hard, they are straight from the book, all you have to do is look up the answers...

Thats what i am doing and I cant find a few of them

[wedouglas]

yeah. went away again. aim willyd0ug

[High Plains Drifter]

Like somebody said, it would be quicker to google those questions or look them up in the book. 90% of the crap I learned in my CS program, back in the mid-90s, I haven't used in real-world development, including the data structures class (which had very similar material).