Questions tagged [computer-science]
Computer science or computing science (abbreviated CS or CompSci) is the scientific approach to computation and its applications.
199 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
0
votes
1
answer
92
views
Concatenating strings given a BNF grammar
<Definition> ::= <Name> <LeftPar> <param> <RightPar>
<Name> ::= <Letter><LetterTail>
<LetterTail> ::= <Letter><LetterTail> | ‘’
A ...
1
vote
9
answers
3k
views
can every program still be written without recursion or cyclic calls?
I'm wondering if it was theoretically possible for a compiler to determine maximum stack depth at compile time if a limitation was placed on the program. The limitation being that you can't use ...
0
votes
1
answer
227
views
What is meaning of "end-to-end" or "link-to-link" flow control?
I am reading the paper "Ethernet Goes Real-time: a Survey on Research and Technological Developments".
In this paper, it says "Flow control can be implemented on a link-by-link or end-...
-3
votes
3
answers
187
views
NP-complete problem (subset sum) featured in Netflix series "Suits" S1 E8? [closed]
In the Netflix series Suits, Season 1, Episode 8 (Identity Crisis), the legal team, with the help of a hacker, is tasked with proving that a business magnate embezzled funds, splitting them and ...
6
votes
2
answers
1k
views
Object immutability and persistence
While I was learning functional programming I have encounterd two for me very similar terms: immutability and persistence. Also I have read simular questions from stackoverflow, but I am still ...
2
votes
4
answers
481
views
How do we define a "step" when calculating big O notation in an algorithm?
I'm learning about Big O notation and how it relates to computer science and I understand the sentiment behind Big O, however I'm struggling at understanding how we define a "step".
In the ...
0
votes
3
answers
197
views
Prove that an expression can create duplicate
Let's suppose we have this expression:
(i % 1000000) * 1000 + ms
where i is an always increasing number, and ms is the millisecond part of the current time ( ranging 0..999). So each time we are ...
0
votes
3
answers
196
views
Writing a growing simulation that scales
Or ways to get better run time than a nested loop?
How would you design this?
I hope this is the place to ask semi-vague software engineering questions.
My simple simulation is like this:
There is a ...
-1
votes
1
answer
237
views
Is it viable to use imprecise analog computers to simulate equally artificial intelligence?
I was searching about simulation of artificial intelligence, machine learning and subjects alike and saw the news that some startups around of the world are using analog computers to simulate ...
-4
votes
1
answer
298
views
How can I tell if my C function is a computable function in computer science?
How can I tell if my C function is a computable function in computer science?
I am trying to write C code that would be acceptable to computer scientists in the field of the theory of computation.
It ...
0
votes
3
answers
428
views
How to deal with forward references in a compiler?
I'm creating a very simple compiler PoC that only has
Procedures
Calls to procedures.
The syntax of the language is really simple:
Main
{
Call("Proc1");
}
Proc1
{
// Empty
}
I ...
0
votes
3
answers
2k
views
Can more than one memory address be accessed at one time?
Apologies if this isn't the correct place to ask the question.
But, I'm stumped. Can multiple memory addresses be read/written at one time, or must one address be read then another, is it possible for ...
-2
votes
2
answers
146
views
Why does the cpu store the current instructions into a stack once a system interrupt happens? [closed]
I was reading about it and was thinking surely the queue first in first out system would make more sense than using a stack because the last instruction will become the first right because it's lifo?
2
votes
2
answers
574
views
Is sequential consistency equivalent to performing memory accesses by a processes in program order and performing each memory access atomically?
In Fundamentals of Parallel Multicore Architecture, by Yan Solihin, p304 defines sequential consistency memory model:
Overall, we can express programmers’ implicit expectation of memory
access ...
1
vote
1
answer
447
views
Does a safe state not lead to a starvation state?
In Operating System Concepts:
7.5.1 Safe State
A state is safe if the system can allocate resources to each process (up to its
maximum) in some order and still avoid a deadlock. More formally, a ...