Any computer engineers, or Students? - GoFuckYourself.com

Pete-KT · 06-30-2005, 07:27 AM

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 · 06-30-2005, 08:13 AM

anyone???

colpanic · 06-30-2005, 09:15 AM

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 · 06-30-2005, 09:17 AM

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

LittleSassy · 06-30-2005, 09:37 AM

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

loverboy · 06-30-2005, 09:58 AM

you calling? got my degree last 2000

Pete-KT · 06-30-2005, 10:59 AM

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 · 06-30-2005, 11:01 AM

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

wedouglas · 06-30-2005, 11:03 AM

i can answer some of these.

wedouglas · 06-30-2005, 11:04 AM

is this for a Dscreet Math Course?

Pete-KT · 06-30-2005, 11:05 AM

Quote:

Originally Posted by wedouglas

is this for a Dscreet Math Course?

No its for Data structures

BigBen · 06-30-2005, 11:06 AM

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

wedouglas · 06-30-2005, 11:08 AM

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 · 06-30-2005, 11:09 AM

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 · 06-30-2005, 11:11 AM

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

wedouglas · 06-30-2005, 11:11 AM

where do you go to school? whats your major?

Pete-KT · 06-30-2005, 11:15 AM

Im majoring in Computer engineering

wedouglas · 06-30-2005, 11:20 AM

yeah same here. dual in EE/CE at UofM

Pete-KT · 06-30-2005, 11:21 AM

Oh no way, our fraternity has a chanpter up there

wedouglas · 06-30-2005, 11:24 AM

dearborn or aa? ot many at dearborn i dont think

Pete-KT · 06-30-2005, 11:26 AM

webdouglas icq me please

Pete-KT · 06-30-2005, 11:27 AM

Both we are at both of them

WiredGuy · 06-30-2005, 11:28 AM

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

Pete-KT · 06-30-2005, 11:34 AM

Quote:

Originally Posted by WiredGuy

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 · 06-30-2005, 12:32 PM

sorry, went away. i dont use icq

Pete-KT · 06-30-2005, 12:38 PM

Do u have aim or yahoo?

woj · 06-30-2005, 01:06 PM

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

wdsguy · 06-30-2005, 01:08 PM

Better help this guy or hes gonna fail the midterm!

LittleSassy · 06-30-2005, 01:11 PM

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

Pete-KT · 06-30-2005, 03:35 PM

Quote:

Originally Posted by woj

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 · 06-30-2005, 04:08 PM

yeah. went away again. aim willyd0ug

High Plains Drifter · 06-30-2005, 04:18 PM

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).

06-30-2005, 07:27 AM	#1
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	Any computer engineers, or Students? I need some help with my Take home Test for Data structures class, just seeing if someone can give me a hand with it.

06-30-2005, 09:15 AM	#3
colpanic Confirmed User Join Date: May 2004 Location: San Diego, CA Posts: 1,007	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 __________________ I like ducks.

06-30-2005, 09:17 AM	#4
tungsten Too lazy to set a custom title Join Date: Mar 2004 Posts: 10,579	your best bet is to just post the question and see if anyone can contribute __________________ VOYEUR /HOMEMADE, HENTAI / CARTOON, Reality, Amateur, Shemale, Hardcore, Cuckold, Celebrity, Retro/Vintage, ect...ALL OUR SITES >> Unbelievable Ratio \| High % of Rebills \| Bi-Monthly Payments (also to E-Passporte) Ton's of EXCLUSIVE Free content & FHG's \|=> GREAT REVENUE $$$ GUARANTEED!

06-30-2005, 09:37 AM	#5
LittleSassy Confirmed User Join Date: May 2005 Location: behind you Posts: 7,402	let's see what i can do...i had that subject last last term... __________________ Proadultoutsourcing.com ~ version 2.0 OFFSHORE SOLUTIONS PROVIDER SINCE 2003 ACCOUNT EXECUTIVE 264-580-554

06-30-2005, 11:28 AM	#23
WiredGuy Pounding Googlebot Industry Role: Join Date: Aug 2002 Location: Canada Posts: 34,503	You want us to do your midterm for you? LOL WG __________________ I play with Google.

06-30-2005, 08:13 AM	#2
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	anyone???

06-30-2005, 09:58 AM	#6
loverboy When it rains, it pours Industry Role: Join Date: May 2003 Posts: 20,609	you calling? got my degree last 2000

06-30-2005, 10:59 AM	#7
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	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

06-30-2005, 11:01 AM	#8
wdsguy Ryde or Die Industry Role: Join Date: Dec 2002 Location: California-Shanghai Posts: 19,568	lol its a midterm and you have to cheat on it by coming to gfy? pretty sad.

06-30-2005, 11:03 AM	#9
wedouglas So Fucking Banned Join Date: Aug 2004 Location: Dearborn, MI Posts: 5,921	i can answer some of these.

06-30-2005, 11:04 AM	#10
wedouglas So Fucking Banned Join Date: Aug 2004 Location: Dearborn, MI Posts: 5,921	is this for a Dscreet Math Course?

06-30-2005, 11:06 AM	#12
BigBen Confirmed User Join Date: Nov 2004 Location: scv Posts: 2,299	"If things go right I might be showing her my O-face. You know: Oh. Oh"

06-30-2005, 11:08 AM	#13
wedouglas So Fucking Banned Join Date: Aug 2004 Location: Dearborn, MI Posts: 5,921	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

06-30-2005, 11:09 AM	#14
wedouglas So Fucking Banned Join Date: Aug 2004 Location: Dearborn, MI Posts: 5,921	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

06-30-2005, 11:11 AM	#15
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	Ya I know but ive got so much work goin on I asked for a lil help before pulling the book out

06-30-2005, 11:15 AM	#17
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	Im majoring in Computer engineering

06-30-2005, 11:20 AM	#18
wedouglas So Fucking Banned Join Date: Aug 2004 Location: Dearborn, MI Posts: 5,921	yeah same here. dual in EE/CE at UofM

06-30-2005, 11:21 AM	#19
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	Oh no way, our fraternity has a chanpter up there

06-30-2005, 11:24 AM	#20
wedouglas So Fucking Banned Join Date: Aug 2004 Location: Dearborn, MI Posts: 5,921	dearborn or aa? ot many at dearborn i dont think

06-30-2005, 11:26 AM	#21
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	webdouglas icq me please

06-30-2005, 11:27 AM	#22
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	Both we are at both of them

06-30-2005, 12:32 PM	#25
wedouglas So Fucking Banned Join Date: Aug 2004 Location: Dearborn, MI Posts: 5,921	sorry, went away. i dont use icq

06-30-2005, 12:38 PM	#26
Pete-KT Workin With The Devil Industry Role: Join Date: Oct 2004 Location: West Bloomfield, MI Posts: 51,532	Do u have aim or yahoo?

06-30-2005, 01:06 PM	#27
woj <&(©¿©)&> Industry Role: Join Date: Jul 2002 Location: Chicago Posts: 47,882	Those questions are not really that hard, they are straight from the book, all you have to do is look up the answers... __________________ Custom Software Development, email: woj#at#wojfun#.#com to discuss details or skype: wojl2000 or gchat: wojfun or telegram: wojl2000 Affiliate program tools: Hosted Galleries Manager Banner Manager Video Manager Wordpress Affiliate Plugin Pic/Movie of the Day Fansign Generator Zip Manager

06-30-2005, 01:08 PM	#28
wdsguy Ryde or Die Industry Role: Join Date: Dec 2002 Location: California-Shanghai Posts: 19,568	Better help this guy or hes gonna fail the midterm!

06-30-2005, 01:11 PM	#29
LittleSassy Confirmed User Join Date: May 2005 Location: behind you Posts: 7,402	LOL...that's too many....and some of these are ffrom my discreet math...i so suck at math... __________________ Proadultoutsourcing.com ~ version 2.0 OFFSHORE SOLUTIONS PROVIDER SINCE 2003 ACCOUNT EXECUTIVE 264-580-554

06-30-2005, 04:08 PM	#31
wedouglas So Fucking Banned Join Date: Aug 2004 Location: Dearborn, MI Posts: 5,921	yeah. went away again. aim willyd0ug

06-30-2005, 04:18 PM	#32
High Plains Drifter Confirmed User Join Date: Jun 2005 Location: ♠ ♣ ♥ Posts: 2,341	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). __________________