Show Bid Request
Data Structures Homework
Bid Request Id: 40325
|
|
|
|
Posted by: |
etoso (10 ratings)
(Software buyer rating 9.8 )
|
|
Non-action Ratio: |
Very Good - 15.38%
|
Buyer Security Verifications: |
Excellent
|
|
Approved on: |
Dec 18, 2002
1:38:14 AM EDT
|
|
Bidding Closes: |
Dec 19, 2002
1:45:12 AM EDT
|
|
Viewed (by coders): |
75 times
|
|
Deadline: |
12/20/2002
TIME EXPIRED
|
|
|
|
|
Description:
I have a test on Data Structures course that needs to be done. It's 20 questions: 15 true/false questions, and 5 multiple choice questions. Should be easy for those who knows it.
True/False Questions:
1) A linked list is always dynamic.
2) There are many ways to create a linked list. However, in a sorted list, the only way to create the list is to sort as the elements come in.
3) The number of edges in a tree is one greater than those of the number of nodes.
4) A hash function is used to place data in a specific position in an array of linked lists.
5) A stack has the ability to push on and pop off like routines.
6) A queue is implemented using a tail node.
7) When sorting a linked list, the code that implements the list contains code of a stack and a queue.
8) When sorting, you compare records/structures/classes and sort fields.
9) When using the sum of the ASCII values and a hash table of size 35, ABCD hashes to position 13.
10) Garbage collection is a commonly used application in computer science.
11) The best speed or O notation for a sort is O(N).
12) The order of the fields in a record/structure/class is not important in any case in a program.
13) Anything you can do with a linked list can be done with an array.
14) The reason for a tail in a stack in speed.
15) Recursion is used to manipulate trees.
Multiple Choice:
16) The necessary nodes in a linked list are:
a) head
b) temp
c) tail
d) all of the above
e) A and B
17) The __________ is mostly theory based.
a) sorting algorithms
b) deletion from a binary tree
c) garbage collection
d) all of the above
e) none of the above
18) A __________ adds nodes to the front of a list.
a) stack
b) queue
c) sorted
d) tree
e) all of the above
19) Data Structures is __________.
a) the study of structures
b) the collection of data
c) the manipulation of data
d) sorting data
e) all of the above
20) The __________ is the quickest of the following:
a) bubble sort
b) binary search
c) binary tree search
d) they are all the same
e) B and C
Deliverables:
1) the answers
Platform:
.
Must be 100% finished and received by buyer on:
Dec 20, 2002 EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Special Conditions / Other:
Even though I had to put the delivery deadline in 1 day, I need to have this done ASAP!
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
This bid was accepted by the buyer!
|
$10 (USD)
|
Dec 18, 2002
2:02:15 AM EDT
|
9.81
(Excellent)
|
|
|
Attached are the answers to your questions.
|
|
|
Attached File
|
|
|
|
|
|