Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 8 years ago.
Improve this question
As part of a homework, the professor said that each expressions can have a maximum of 3 levels.
Just to make sure I understand it:
Does the following have 2 levels?
( (a) (b) )
And does the following have 3 levels?
( a ( b (c) ) )
Thanks.
This is not standard Lisp terminology, so it depends on what the professor means. In particular, is he just counting list nesting, or does he count the leaf objects as a level as well.
What "level" would he consider an atom all by itself (not in a list)? Whatever that is, your first example is 2 more levels, and the second is 3 more.
Related
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
I'm making a GUI in MATLAB. I want to know how to show/represent raise to power in static text in MATLAB.
Use the ^ character. MATLAB implemented basic TeX style formatting several years ago into text boxes, so _ is interpreted as subscript. If you actually want these symbols to appear in your text, place a \ then place your symbol after it (i.e. \_ or \^).
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 9 years ago.
Improve this question
How can I test for the independence between two random variable given another one(i.e. whether P(A|C)=P(A|C,B) or not?) using available samples. in other words, I just have 1000 samplesf for 3 random variables generated by bntoolbox on Matlab and now I wanna test for CI between arbitrary random variables.
I've read something about Fisher's method but honestly don't understand it.
Thanks is advance.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 10 years ago.
Improve this question
I was doing this question of boolean algebra, Simplify f=Σ(8,12,13,14)+dΣ(3,7,9,10) using karnaugh map.. can anyone please tell me what is d in this question? I know its a stupid question but i couldn't find it on google. And please tell me what this question means? i mean like straight away simplifying without the d expression is okay but what does the d expression signify in here ?
d stands for 'don't care'. Cells 3,7,8,10 do not affect the value of F.
This helps because you might be able to get a simpler expression if you ignore those cells.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 11 years ago.
Improve this question
Given a fair coin (0/1), how do you simulate fair dice(0 to 5)
Obvious answer I know is toss 3 times, treat each toss as a bit to produce (2^3 = 0 to 7)
If result == 7, discard and repeat.
Well, theoretically worst case big-O of this is really bad (another question in itself, something to do with monte-carlo algos). Lets keep this soln on shelf.
So now my question is,
Is there/can there be n number of coin toss that can guarantee simulation of dice ?
Of course if exists would like to know minimum number of tosses. :)
In absence of a number that is both divisible by three and 2^n, I couldnt think of any way to solve this. :(
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 11 years ago.
Improve this question
I need a list of Large Carmichael numbers( 10 to 100 digits ). Is there any website which provides such data. It would be more helpful if i can get a list of large odd composite numbers and primes as well.
Did you already try The On-Line Encyclopedia of Integer Sequences? Carmichael numbers are sequence A002997, and from there you can find a link to a Table of n, a(n) for n = 1..10000.
Here's the first 33: http://oeis.org/search?q=carmichael&language=english&go=Search.
This is generally a good site for sequences.