Welcome, Guest
You have to register before you can post on our site.



Search Forums

(Advanced Search)

Forum Statistics
» Members: 159
» Latest member: Tmgonsewski
» Forum threads: 187
» Forum posts: 694

Full Statistics

Online Users
There are currently 6 online users.
» 0 Member(s) | 6 Guest(s)

Latest Threads
-i -b number format
Forum: Project 1
Last Post: clalexander4
6 hours ago
» Replies: 1
» Views: 7
Time Testing
Forum: Project 0
Last Post: rcfrederick
8 hours ago
» Replies: 3
» Views: 105
CDA Test file
Forum: Project 0
Last Post: rcfrederick
9 hours ago
» Replies: 3
» Views: 89
undefined reference
Forum: Project 0
Last Post: alexbusol
9 hours ago
» Replies: 2
» Views: 19
How will real numbers be ...
Forum: Project 1
Last Post: aluong
9 hours ago
» Replies: 1
» Views: 63
Really struggling with 1 ...
Forum: Project 0
Last Post: alexbusol
10 hours ago
» Replies: 2
» Views: 21
What display/comparator f...
Forum: Project 1
Last Post: jaw653
Yesterday, 09:05 PM
» Replies: 0
» Views: 11
Resubmission question
Forum: Project 0
Last Post: thetrentford
Yesterday, 05:38 PM
» Replies: 1
» Views: 28
exam 1 postponed
Forum: Exam 1
Last Post: mkkeffeler
Yesterday, 05:12 PM
» Replies: 7
» Views: 455
Task 8 compare results
Forum: Assignment 1
Last Post: mkkeffeler
Yesterday, 05:10 PM
» Replies: 11
» Views: 487

  Installing Scam
Posted by: etkeats - 08-25-2017, 10:47 PM - Forum: The Scam Programming Language - Replies (5)

I am trying to get Scam to work. I am stuck on step 4:
Extract the files in the tarball:
   tar xvzf scam-2.4-$arch.tgz

When I run this command I get the error
tar: Unrecognized archive format
tar: Error exit delayed from previous errors.

I am working on a Mac. Did anyone else have this problem or know what I am doing wrong?

Print this item

  asserting size
Posted by: ianbway - 08-25-2017, 07:15 PM - Forum: Project 0 - Replies (1)

When asserting "Memory allocated shall not be zero. " in a method, is this referring to the built in "sizeof" function or the size variable of that class?

Print this item

  Missing Due Date
Posted by: julian - 08-25-2017, 02:10 AM - Forum: Project 2 - Replies (2)

On the schedule, there doesn't appear to be a due date for programming assignment #2, only for its four resubmissions.

Print this item

Posted by: jaw653 - 08-24-2017, 09:23 PM - Forum: Project 0 - Replies (1)

Are projects compiled on the same server we've used for 100 & 101?

Print this item

Exclamation Assignment Updates
Posted by: lusth - 08-24-2017, 07:45 PM - Forum: Assignment 1 - Replies (1)

Version 2

Clarified what happens when hops are exhausted for Zeno

Added more explanatory text for other tasks.

Print this item

  If your package manager does not have libreadline6
Posted by: daweil - 08-24-2017, 07:14 PM - Forum: The Scam Programming Language - No Replies

For Debian based / DPKG users, download libreadline6: https://packages.debian.org/jessie/libreadline6

Install it with the following commands:

sudo apt install ./name.deb (or sudo apt install /path/to/file/name.deb)

Sudo will ask for password to your account / root if not done previously, or if you're not a super user.


For Red Hat based / RPM users: https://www.rpmfind.net/linux/rpm2html/s...breadline6

Go to the directory of the .rpm. Type in your bash shell:

sudo rpm -ivh package_name.rpm

Print this item

  Makefile Testing
Posted by: amthompson4 - 08-24-2017, 04:43 PM - Forum: Project 0 - Replies (1)

Will the makefile's output (i.e. the order of the files compiled) need to match the test program, or does the test for the makefile just check to see if any errors were returned? If the files need to match, currently there is not a list of the files on assign0.pdf

Print this item

  Meeting times
Posted by: elelston - 08-20-2017, 01:01 AM - Forum: Meetings - Replies (20)

Hi this is Emma. I'm taking the GRE Tuesday so it's not a great day for me overall. Wednesday I can meeting anytime from 11:00 am to 3:00 pm, and then again after 5:00 pm. Does this work?

Print this item

  Decision Trees, #11
Posted by: etberryhill - 08-19-2017, 04:20 PM - Forum: Prerequisite exam - Replies (5)

In proving a tight lower bound for a class of algorithms, one tries to establish, over all possible algorithms:

  1. the worst possible best case

  2. the worst possible worst case 

  3. the best possible best case

  4. the best possible worst case
This question comes from the decision trees section. If you are proving a lower bound for a class of algorithms, then you have to be looking for the best possible case. But I'm not sure if you are looking for the worst possible best case or best possible best case. My analysis goes like this: 

Lets say you take the class of comparison sort algorithms. The best case for bubble, insertion, selection, quick & merge sort are n, n, n^2, nlogn and nlogn, respectively. If you take the worst possible best case, then you have a lower bound as n^2. But, insertion, bubble, merge, and quick sort perform better in their best cases; therefore, this doesn't actually bound the entire class of algorithms from the bottom. On the other hand, if you take the best possible best case, you have a lower bound of n, which is not asymptotically tight compared to algorithms like selection, merge, and quick sort.

Anyone have the correct answer or any thoughts?

Print this item

  A thread for issues during Scam installation.
Posted by: Benjimin Aaron - 08-19-2017, 03:21 AM - Forum: The Scam Programming Language - Replies (4)

In an ideal world, no other students will have an issue. Let us all hope I am the only idiot here, but just in case I am not, here is the first tip we can add to this thread, concerning hick-ups during the Scam install. 

If you are using a Linux system like me (I am using an Ubuntu dual boot) and you are following the very simple, straight-forward step-by-step instructions supplied on beastie HERE:
Make sure you download the proper "BIT" (32-bit, 64-bit) and obviously, make sure you choose the proper OS download location. 

In my case, I originally followed the provided directions 'to the T', and diligently, but foolishly, downloaded the version of Scam for Linux 32-bit systems which is given in the raw instructions at step 2 and 3. 

I am not, however, using a 32-bit system, and therefore upon attempting to run scam from my terminal, I experienced a: "No such file or directory" error.

I proceeded to act very calmly and logically and pulled out a chunk of my hair as I calmly and logically raged from directory to directory learning all sorts of interesting tid-bits of knowledge about "Linux PATH variables" and just how many different "/bin" directories actually exist on a given installation of Linux.

Finally, I came across a forum post which just so happened to mention the very non-technical and obvious warning: "make sure you are using the proper software version for your system, as most 64-bit installations will not run 32-bit programs without some more technical work-arounds".

I then returned to the installation instructions, noted once more the various versions CLEARLY listed above the step-by-step, replaced the wget location with the proper 64-bit address, and what do you know... it works like a charm. 

So, just to summarize: do not be like Ben, for Ben is not to be been like. Read the instructions carefully, and follow them closely... but not TOO closely, and substitute the proper version of Scam into the wget and tar command lines.

Print this item