Gate Exam

The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?
(A) Finite state automata
(B) Deterministic push down automata
(C) Non-Deterministic pushdown automata
(D) Turing machine

Read Solution (Total 1)

a). finite state automata
8 years agoHelpfull: Yes(0) No(0)

Gate Other Question

A thread is usually defined as a 'light weight process' because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the followings is TRUE?
option
(A) On per-thread basis, the OS maintains only CPU register state
(B) The OS does not maintain a separate stack for each thread
(C) On per-thread basis, the OS does not maintain virtual memory state
(D) On per thread basis, the OS maintains only scheduling and accounting information Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page fault is generated for every 10^6 memory accesses, what is the effective access time for the memory?
option
(A) 21ns
(B) 30ns
(C) 23ns
(D) 35ns