Movatterモバイル変換


[0]ホーム

URL:


Computer Science Stack Exchange Community Digest

Top new questions this week:

Binary encoding with short bit sequences

Suppose you have n sequences of bits stacked in rows. The sequences can repeat along their row indefinitely. The goal is to select n sequences such that the following are both true:All $2^n$ ...

countingbinaryencoding-scheme 
user avatarasked byColman Koivisto Score of 6
user avataranswered byEmil Jeřábek Score of 7

Greatest hits from previous weeks:

How can a language whose compiler is written in C ever be faster than C?

Taking a look at Julia's webpage, you can see some benchmarks of several languages across several algorithms (timings shown below). How can a language with a compiler originally written in C, ...

programming-languagescompilersefficiency 
user avatarasked byStrugglingProgrammer Score of 193
user avataranswered bytsleyson Score of 289

Definition of the state of an object in OOP

I need a concise definition of the "state of an object" in object-oriented programming (for a paper).For about half of a day I searched for a paper that I can cite on this topic, but I couldn't find ...

terminologyreference-requestprogramming-languagesobject-oriented 
user avatarasked bymrsteve Score of 14
user avataranswered byVor Score of 11

How to calculate the number of tag, index and offset bits of different caches?

Specifically:1) A direct-mapped cache with 4096 blocks/lines in which each block has 8 32-bit words. How many bits are needed for the tag and index fields, assuming a 32-bit address?2) Same ...

computer-architecturecpu-cache 
user avatarasked bycompski Score of 24
user avataranswered byWandering Logic Score of 24

What are system clock and CPU clock; and what are their functions?

While reading a book, I came across a paragraph given below: In order to synchronize all of a computer’s operations, a system clock—a small quartz crystal located on the motherboard—is used. The ...

computer-architectureclocks 
user avatarasked byswdeveloper Score of 33
user avataranswered byBenjoyo Score of 23

Difference between a turing machine and a finite state machine?

I am doing a presentation about Turing machines and I wanted to give some background on FSM's before introducing Turing Machines. Problem is, I really don't know what is VERY different from one ...

terminologyturing-machinesfinite-automatamachine-models 
user avatarasked byJulio Garcia Score of 42
user avataranswered byPatrick87 Score of 38

How to prove that a language is not context-free?

We learned about the class of context-free languages $\mathrm{CFL}$. It is characterised by both context-free grammars and pushdown automata so it is easy to show that a given language is context-free....

formal-languagescontext-freeproof-techniquesreference-question 
user avatarasked byRaphael Score of 101
user avataranswered byjmad Score of 74

When are adjacency lists or matrices the better choice?

I was told that we would use a list if the graph is sparse and a matrix if the graph is dense. For me, it's just a raw definition. I don't see much beyond it. Can you clarify when would it be the ...

graphsdata-structureslistsadjacency-matrix 
user avatarasked byuser21312 Score of 23
You're receiving this message because you subscribed to the Computer Science community digest.
Unsubscribe from this community digest     Edit email settings     Leave feedback     Privacy
Stack Overflow

Stack Overflow, 14 Wall Street, 20th Floor, New York, NY 10005

<3

[8]ページ先頭

©2009-2025 Movatter.jp