Mathematics Stack Exchange
Mathematics Stack Exchange

Questions tagged [computer-science]

All mathematical questions about computer science, including theoretical computer science, formal methods, verification, and artificial intelligence. For questions about Turing computability, please use the (computability) tag instead. For numerical analysis, use the (numerical-methods) tag. For questions from scientific computing, use (computational-mathematics).

Computer science is the study of the theory, experimentation, and engineering that form the basics for the design and use of computers. It is the scientific and practical approach to computation and its applications and the systematic study of the feasibility, structure, expression, and mechanization of the methodical procedures (or algorithms) that underlie the acquisition, representation, processing, storage, communication of, and access to information. An alternate, more succinct definition of computer science is the study of automating algorithmic processes that scale.

Some fields of computer science such as computational complexity theory (which explores the fundamental properties of computational and intractable problems) are highly abstract, while fields such as computer graphics emphasize real-world visual applications.

5523 questions
0
votes
1 answer

Basic=pre algebra math books?

I have been searching and there is so many, I am in computer science and did not realize how heavy math was in this field. i do not really understand why it is unless you are going to work in the financial side so can someone explain to me why math…
levels ofgeek
  • 3
0
votes
1 answer

show how 42.25 would be stored as a floating point number with an 8-bit mantissa and a 4-bit exponent.

So I know that in binary: 42: 00101000 0.25: 01 I then put combine the numbers so it would be: 00101000.01 Once I get this point I'm not sure how to show the mantissa as an 8-bit and the exponent as a 4 bit? Thank you EDIT: I think I've worked it…
user2047296
  • 101
0
votes
1 answer

Brauer Algorithm

I'm working on a problem and I'm looking at an equation: $lg(n) + (1 + o(1))(lg(n))/(lg(lg(n))$ All I want to know is, what does o(1) mean? Thanks!
Patrick Feltes
  • 154
0
votes
1 answer

Use the Pumping Lemma to prove that $L=\{a^{m}b^{2^{n}} \}$ is not regular.

Normally pumping lemma proofs aren't too hard; you just experiment with different values of $i$ and sort of stumble on the solution. However, this problem is really bugging me and I am spending a lot of time on it. If I let $x=a^k$, $y=b^{2^k}$,…
wdonahoe
  • 103
0
votes
1 answer

NDFSM Transition State Network

My coursework question asks me to "Draw a State Transition for the nondeterministic finite state machine (NDFSM)" from a state transition table. By following the examples in our lecture materials, I've managed to complete this, however, I have a few…
user3494322
  • 1
0
votes
1 answer

Context free language false proof

What is wrong with the following proof? Show whether $L$ is context-free or not, where $L = \left\{ a^nb^{2n}a^n | n \geq 0\right\}$ We know $\left\{a^nb^n | n \geq 0 \right\} $ and $\left\{b^na^n | n \geq 0 \right\} $ are context-free. Notice…
Pure
  • 28
0
votes
1 answer

Prove that the last process is responsible for $\mathrm\lceil {n\over p} \rceil$ elements

In my parallel computing class, I have this proof in one of my HW problems: Suppose we have chosen a block agglomeration of $\mathrm n$ elements (labeled $\mathrm 0, 1, ... , n - 1$) to $\mathrm p $ processes (labeled $\mathrm 0, 1, ... , p - 1$) in…
Samuel Parsons
  • 85
  • 1
  • 1
  • 5
0
votes
1 answer

Boolean Algebra Manipulation #2

Ok, so I know I just asked a similar question recently, but I have one more. I don't even know how to start this one: (De Morgan's maybe?) (x+y+z)(x'+y+z')(x+y')(y'+z) = x'y'z + xy'z' + xyz Any suggestions on how to approach this?
user215717
  • 25
0
votes
1 answer

Boolean Algebraic Manipulation

so I'm stuck on what seems like the very last steps of the problem. I'll leave out the whole problem and just start from where I got stuck at in the very end. How can I show that c'd' + c is equal to c + d' using the identities? It's probably just…
user215717
  • 25
0
votes
1 answer

K map and simplified circuit

4) Draw the Karnaugh map and the resulting simplified circuit for the following function F(w, x, y, z) = !yz + w!y + !wzy + !w!xy!z + w!xy!z YZ WX 00 01 11 10 00 1 1 1 01 1 1 11 1 1 10 1 1 1 Hi. The…
Fivestar
  • 113
0
votes
1 answer

context free languages closure properties

This isn't homework. Prove or dis-prove the statement: If $R$ is a regular language and both $L$ \ $R$ and $L \cup R$ are context-free, then $L$ is context-free.
oadams
  • 293
0
votes
1 answer

How to find bits you need to represent one variable? How many integers( 16 or 32 bits) you need when programming the problem?

Question: Use binary coded GA(Genetic algorithms), your problem is to find vector with real numbers $\in [0,5]$ and you want your answer at least to three decimal places(0.001). a) How many bits you need to represent one variable b) the dimension…
user2723
0
votes
1 answer

Covering Numbers of length 5 Radius 1

Can anyone give an example of 7 binary covering numbers that cover all 32 possible 5 digit binary numbers with an error of up to 1 place? I have proved that 6 binary numbers do not exist, but I am having trouble finding 7 that do. I have combed the…
Karl
  • 1
0
votes
2 answers

Color Gradients

Say I have two Red Green Blue colors (255, 26, 26) and (241, 232, 91) respectively. If I'd like to determine the color halfway between these two colors, how could I solve for it? Is the answer simply the average of each individual color value, or is…
GoldenNewby
  • 113
0
votes
1 answer

Formula to browse through combinations

Can anyone give me an idea of how to be able to browse through a set of combinations? Lets say that I have 3 objects that can hold 3 different values and I want to browse through these. How do I know which is the next combination? I will always know…
rockoroll
  • 1
1 2 3
…
16
17