Posted
by samurai_01
on Stack Overflow
See other posts from Stack Overflow
or by samurai_01
Published on 2010-06-13T10:45:49Z
Indexed on
2010/06/13
10:52 UTC
Read the original article
Hit count: 165
i have to create a program which can have n number of nodes and each subnode can have n number of subnodes and so on, its not a binary tree. i need to know how can one create it?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
;; structure representing homework points
;; nr: number - the number of the homework
;; points: number - the number of points reached
(define-struct homework (nr points))
;; parse-homework: (list of number pairs) -> (list of homework)
;; The procedure takes a list of number pairs and produces…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Okay so I have started a new language in class. We are learning Scheme and i'm not sure on how to do it. When I say learning a new language, I mean thrown a homework and told to figure it out. A couple of them have got me stumped.
My first problem is:
Write a Scheme function that returns true (the…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm very new to Unix, and currently taking a class learning the basics of the system and its commands.
I'm looking for a single command line to list off all of the user home directories in alphabetical order from the /etc/passwd directory. This applies only to the home directories, and not the contents…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi,
For a school project i need to write or use a online programming editor. It is a part of a bigger project. I thought of a java application, php/html/javascript or flash.
I have a couple of things i could do:
Find a good working application and edit it so it works with the rest of the project
Find…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Consider a disk file containing 100 records
a. How many comparisons would be required on the average to find a record using sequential search, if the record is known to be in the file?
I figured out that this is 100/2 = 50.
b. If the record has a 68% probability of being in the file, how many comparisons…
>>> More
