Computer Architecture

Внимание !
Вопросы к тесту выложены исключительно в ознакомительных целях: количество вопросов может не совпадать с действительным, актуальность не поддерживается,- за решением теста Welcome to the cashier!

---

How many conditions does a trigger have?

4
3
2
1



How many outputs does a trigger have?

2
4
1
3



A register is a set of:

triggers
words
bits
bytes


 
Who constructed the only one computer in the world with the foundation 3?

George Boole
N.Brusnesov
Bonch-Bruevich
Charles Babbage



Who introduced the first trigger in 1918?

Bonch-Bruevich
Charles Babbage
N.Brusnesov
George Boole



Who constructed the first computer?

Charles Babbage
N.Brusnesov
Bonch-Bruevich
George Boole



How many basic operations does Boolean algebra consist of?

3
2
16
4



In Boolean disjunction    output is 0 if:

A=0, B=1
A=0, B=0
A=1, B=1
A=1,B=0



In Boolean conjunction   output is 1 if:

A=0, B=0
A=1, B=1
A=1,B=0
A=0, B=1



What is a high-order bit for positive numbers in computer words?

1 or 0
1
0



What is a high-order bit for negative numbers in computer words?

0
1
1 or 0



Positive number 127 can be represented as:

1 0000000
0 0000000
0 1111111
1 1111111



What is a twos-complement code fore -7?

11111001
01111001
00000111
10000111



What is a twos-complement code for -1?

1 1111111
1 1111110>
0 1000001
1 0000001



What is a twos-complement code for -5?

0 0000101
1 0000101
1 0000011
1 1111011



How many bits are used in a double-precision format for binary floating-point number?

64
128
32
16



How many bits are used in a single-precision format for binary floating-point number?

64
128
32
16



In scientific notation all numbers are written like m*10p, then m is:

numerical notation.
exponent
mantissa
any real number



If an exponent consists only from 1 and mantissa is 0, the number is:

some real number
infinity
not a number
0



If an exponent consists only from 1 and mantissa is not 0, the number is:

not a number
some real number
infinity
0



If an exponent is 0 and mantissa is 0, the number is:

0
not a number
some real number
infinity



If a record is struct (int a, real b) then it can be represented in a computer as:

address - binary a - address - binary b
binary a - binary b
address - binary a - binary b
address - binary a - hold- address - binary b



What does "statical object" mean?

It is possible to calculate everything about the object during run time
It is impossible to calculate everything about the object during compilation time
It is a number or word that doesn't change at all during a long period
It is possible to calculate everything about the object during compilation time



What does "dynamical object" mean?

It is possible to calculate the size of object during run time
It is a number or word that doesn't change at all during a long period
It is impossible to calculate the size of object during compilation time
It is possible to calculate the size of object during compilation time



Element l in a passport of array is:

the address of element with index zero in array
a size of one element in array
the maximum number of elements in array
the minimum number of elements in array



Element u in a passport of array is:

the maximum number of elements in array
the minimum number of elements in array
the address of element with index zero in array
a size of one element in array



Element d in a passport of array is:

the maximum number of elements in array
the minimum number of elements in array
the address of element with index zero in array
a size of one element in array



What does "pipelining" mean?

execution instructions one by one
execution instructions by CPU
execution different instructions at the same time
jumping to some instruction not in strict sequence



How long can pipelining be on average?

8 instructions
10 instructions
20 instructions
4 instructions



What does "branching" mean?

jumping to some instruction not in strict sequence
execution different instructions at the same time
execution instructions by CPU
execution instructions one by one



What passes does Assembler have?

onversion from machine instructions into assembler language
instructions calculations
conversion from assembler language into machine instructions
address calculation



What is the first high-level programming language?

Assembler
C+
Fortran
Algol 60



What is the first low-level programming language?

Fortran
C+
Algol 60
Assembler



Relative address mode means:

The effective address for instruction is the address in the specified register.
The effective address for instruction depends on index and the beginning of segment.
The effective address for instruction is the sum of address parameter and some displacement.
The effective address for instruction is the address parameter itself with no modifications.



Indirect address mode means

The effective address for instruction is the sum of address parameter and some displacement.
The effective address for instruction is the address in the specified register.
The effective address for instruction is the address parameter itself with no modifications.
The effective address for instruction depends on index and the beginning of segment.



Absolute address mode means:

The effective address for instruction is the address parameter itself with no modifications.
The effective address for instruction depends on index and the beginning of segment.
The effective address for instruction is the address in the specified register.
The effective address for instruction is the sum of address parameter and some displacement.



Dynamic memory consists of:

drums
triggers
condencers
tapes



Static memory consists of:

drums
condencers
triggers
tapes



Why are triggers not useful for storage information?

they are expensive
they cant storage the information
they break down often
they are slow



you add 1 additional bit to data you can:

notice one mistake
notice two mistakes
notice and fix one mistake
notice and fix two mistakes



Hemming code is:

to every 5 bits add 16 bits of control
to every 8 bits add 3 bits of control
to every 16 bits add 5 additional bits of control
to every 10 bits add 5 bits of control



What is on the top of a cache-table?

often used data
rarely used data
data from the Internet
addresses of data



What is on the top of the memory hierarchy?

cd
cache
the main memory
tape



What is responsible for writing data to the main memory?

cd-room
CPU
cache
program



Who introduced the semaphore in programming?

E. Dijkstra
Bonch-Bruevich
George Boole
Charles Babbage



Special equipment for reading long sequences of bits is?

bandwidth
dma
latency
interleaving



introduced terms "loop", "readdressing" and "working сell"?

E. Dijkstra
Charles Babbage
George Boole
Ada Augusta Lovelace



Who was the first computer programmer?

George Boole
Ada Augusta Lovelace
E. Dijkstra
Charles Babbage



Who translated the Babbage's lecture from Italian into English?

Ada Augusta Lovelace
Charles Babbage
E. Dijkstra
George Boole



The first computer was named:

John I
Mark I
Serena I
Mars I



Who wrote pages memo "Proposal about automatic calculator"?

E. Dijkstra
Ada Augusta Lovelace
Charles Babbage
Hovard Aiken



Pages memo "Proposal about automatic calculator" were written in :

1937
1957
1965
1837



Different punched tapes for program and data later was called :

Hovard architecture
Harvard architecture
Mark architecture
Oxford architecture



How many years did the first computer work?

16
25
10
8



Where was the first computer installed?

Harvard university
Oxford university
Princeton university
Yale university



Who introduced the trigger in America?

Ekkies
A.Bonch-Bruevich
Jordan
Ekkies and F.Jordan



The first university in the world that used a computer for an education is:

Oxford university
Princeton university
ETH university
Harvard university



The first program controlled calculator with float point arithmetic called:

Mars I
John I
Mark I
Z-3



What computer is the first in the world with stored program?

ENIAC
EDSAC
UNIVAC
Mark I



What computer was the first serial production computer?

Mark I
Z-3
UNIVAC
ENIAC



The first electronic computer was called:

Mark I
Z-3
UNIVAC
ENIAC



Where was virtual memory used for the first time?

IBM-709
Atlas
IBM/360
Stretch



Where were I/O channels used for the first time?

Atlas
Stretch
IBM/360
IBM-709



Who suggested the microprogramming principle?

Wilkes
Charles Babbage
Hovard Aiken
E. Dijkstra



A hardware implementation of machine instruction is:

Cheap
not flexible
quick
expensive



The microprogramming is:

Flexible
not free of charge
free of charge
not flexible



Each machine instruction uses:

some electrical scheme
cache
triggers
condenser



What does "pipelining" mean?

execution instructions one by one
execution different instructions at the same time;
execution instructions by CPU
jumping to some instruction not in strict sequence



What does "interleaving" mean?

jumping to some instruction not in strict sequence
dividing memory into several banks with different access mechanism
execution instructions one by one
execution different instructions at the same time



What does "fetching" mean?

execution instructions by CPU
execution different instructions at the same time;
execution instructions one by one
jumping to some instruction not in strict sequence



If one process wants to read from the memory and another wants to write where then:

a computer will break down
both processes will work with memory at the same time
one will work with memory, another will wait until the first done
it is impossible



If two processes want to read the same data from memory and a computer has cache then:

it depends on processes
it depends on data
both processes will work together without any waiting
one will work with memory, another will wait until the first done



The first multi-computer appeared in:

1980-1996
1967-1971
1971-1980
1955-1956



The scheme with cache can work with less or equal:

15 processes
11 processes
10 processes
6 processes



In a multi-computer every computer has:

local control unit
local processor and memory
local memory
local cache



All computers in a multi-computer run:

the same operation with the same data at the same time
the same operation with the same data in different time
the same operation with different data at the same time
the different operations at the same time



In MIMD computers use:

common bridges
common registers
common channels
common triggers



The scheme to achieve parallelism where computers share memory is:

VLIW
MIMD
SIMD
EPIC



Which computer uses VLIW?

Mark
ILLIAK IV
Z-3
ELBRUS



Which scheme executes different sub-steps of sequential instructions simultaneously?

MIMD
SIMD
EPIC
VLIW



Which scheme executes operations when programs are compiled?

VLIW
SIMD
MIMD
EPIC



What is the most popular protocol in Internet?

FTP
TCP/IP
EDGE
Ethernet



What equipment controls communications usually?

cabel
chip
condenser
trigger



If some data were used from cache-table then:

it will be given the highest priority
it will be given the lowest priority
it will be sent to the main memory
it will be erased from cache



A memory consistency means:

the process when cache are writing into the main memory
all memory elements are in different states
dividing memory into some banks
all memory elements are in the same state



What is responsible for writing to the main memory?

CPU
chip
cache
trigger



When does a collision appear?

when two processes are trying to read some information from cache
when CPU writes in the main memory
when process is trying to work with some data but cache is still working with those data
when cache write and read at the same time



How often are compare operations used according to statistics?(in percent)

40
90
10
20



How often are branch operations used according to statistics?(in percent)

10
40
90
20



How often are memory exchange operations used according to statistics?(in percent)

10
40
90
20



RISK faster than CISK in … times

3
4
2
5



If compare RISK and CISK:

RISK has longer object code
CISK has longer object code
CISK faster
RISK faster



The main idea of RISK is:

using a lot of processors
place several instructions in one chip
using cache
place several instructions in a lot of chips



According to RISK principals:

RISK computer must have a lot of registers
RISK computer must work only with high-level languages
RISK computer must have a lot of triggers
RISK computer must work only with low-level languages




A set of microinstructions is in:

bus
CPU
the main memory
micro memory



How many instructions are in micro instruction register?

8
it depends on size of register
2
1



Opcode is:

integer number from 5 to 260
real number from 0 to 255;
real number from 0 to 551
integer number 0..255



Each I/O channel is a:

register
condenser
small processor
trigger



I/O channels can organize:

only output operations without using a CPU
input and output operations without using a CPU
only input operations without using a CPU
input and output operations using a CPU



When did I/O channels appear?

1948
1958
1937
1938



DMA means:

working with memory though the bus
working with memory though the bus without CPU
working with memory though the bus using CPU
working with I/O devices



Multi - core architecture means:

several CUs
several CPUs
several buses
several memories



Scheme "arbitration" guarantees that:

only one element of equipment has access to the bus
two elements of equipment can use the bus without any collision
several elements of equipment can read information though the bus
several elements of equipment can write information though the bus



An interruption is:

synchronous or synchronous signal
synchronous signal
asynchronous signal
special register




A device that is used to combine several sources of interrupt onto one or more CPU lines, while allowing priority levels to be assigned to its interrupt outputs, is called:

Interrupt Arbitrageur
CPU
Interrupt Controller
Collision Controller



Combining multiple physical disks into a logical unit is called :

multi-core architecture
RAID
SCSI
multi-computer architecture



How many levels does the TCP/IP model have?

3
7
2
5



The first wide area network is:

ALFANET
RAPRANET
KIBERNET
ARPANET



The most common used protocol is:

Ethernet
FTP
TCP
UDP



Who constructed Strela?

I.Bruk
S.Lebedev
Y. Bazilevsky
S.Burcev



When was Strela introduced?

1933
1985
1943
1953



Who projected a digital automatic calculator?

I.Bruk
B. Rameev
S.Lebedev
Y. Bazilevsky



The first Soviet semiconductor is:

BESM-1
BESM-4
M-50
M-20



The military computer is:

M-20
M-50
BESM-1
BESM-4



Gagarin's trajectory was calculated on:

M-20
BESM-1
M-50
Strela



Who constructed the first antirocket system:

I.BrukS.
LebedevS
BurcevY.
Bazilevsky



M-50 was constructed in:

1939
1979
1995
1959



Who constructed M-50:

Y. Bazilevsky
S.Lebedev
S.Burcev
I.Bruk



The final Lebedev's result is:

BESM-6
M-20
Mark I
M-50



The first antirocket system was called:

System Z
System A
System X
System B



The first antirocket system was constructed in :

1969
1960
1982
1970



Which of computers used interleaving?

Mark I
M-20
M-50
BESM-6



Which of computers used virtual memory?

M-20
BESM-6
Mark I
M-50



Which of computers used pipeline?

M-50
M-20
BESM-6
Mark I



Who constructed Ural?

I.Bruk
B.Rameev
S.Lebedev
N.Brusencov



The unique computer in the world with ternary number notation is:

Setun
Strela
BESM-6
BESM-4



Who constructed Setun?

N.Brusencov
Y. Bazilevsky
I.Bruk
S.Lebedev



Who constructed Elbrus?

S.Lebedev
B. Rameev
Y. Bazilevsky
B.Babajan



When did Elbrus become an open computer?

1974
1982
1972
1962



When was Elbrus introduced?

1964
1984
1974
1982



What was used for cooling in Elbrus?

air
liquid oxygen
liquid hydrogen
water



A static language means:

compiler doesn't know types of data at every point of a program
compiler knows types of data at every point of a program
programmer can use a limited amount of programs
programmer can use a stack




register points to the next machine instruction?

PC
L
IC
R



How many segments does every process have?

2
4
3
1



What segments does every process have?

memory segment
data segment
codes segment
addresses segment



For a formula a-f(x) a machine program will be:

L a, L x, -, call f
call f, -, L a, L x
call f, L a, L x, -
L a, L x, call f, -



For a logical formula a+b*c a machine program will be:

+, *, L a, L b, L c
L a, L b, L c, +,*
*, +, L a, L b, L c
L a, L b, L c, *. +




a formula a-f(x) a reverse-minus machine program will be:

rev -, L x, call f, L a
L a, L x, call f, rev -
L x, call f, L a, rev -
rev -, L a, L x, call f



For a formula a-b a reverse-minus machine program will be:

rev -, L a, L b
L a, L b, rev -
rev -, L b, L a
L b, L a, rev –



For formula a/b a reverse-division machine program will be:

rev /, L b, L a
L b, L a, rev /
rev /, L a, L b
L a, L b, rev /



A displacement for a Branch-short is

8 bits
4 bits
2 bits
16 bits



A conditional branch checks the top of an integral stack and if it is true then:

it stops
it goes to the next machine instruction
it goes to an address which depends on the displacement
it goes to the previous machine instruction



A conditional branch checks the top of an integral stack and if it is false then:

it goes to the previous machine instruction
it goes to an address which depends on the displacement
it goes to the next machine instruction
it stops



For a loop for i from A by B to C while D do E the step is:

A
B
D
I



For a loop for i from A by B to C while D do E the initial value is:

A
i
D
B



For a loop for i from A by B to C while D do E the conditional value is:

i
B
A
D



For a loop for i from A by B to C while D do E and B<0 to repeat the loop:

i > c
i ≤ c
i < c
i ≥ c



A loop for i from A by B to C while D do E and is infinite if:

A=C
B=0
B=i
B=A



For a loop for i from A by B to C while D do E and B>0 to repeat the loop:

i ≥ c
i < c
i ≤ c
i > c



If an array is [l:u] m A then a type of elements in this array is:

A
m
u
l



The main machine instruction for arrays is:

store
slice
load
interleaving



the formula    which is used for calculating an address for array's element C0 is:

size of the array
size of each element in array
index of the element
address of an element with index zero



In the formula   which is used for calculating an address for array's element d is:

size of each element in array
address of an element with index zero
index of the element
size of the array



To calculate an address of an element A[i] in some array the following formula is needed:

i *d-C0
C0*i*d
i*d
C0+i*d


a system has a virtual memory often used pages will be:

on a floppy
in a virtual memory
on a cd
in a physical memory



is used to indicate whether the corresponding page is in real memory or not?

displacement of the page
passport of the page
some flag in a page-table
a mathematical address of the page



Each entry in the page-table holds a flag indicating …:

whether the corresponding page is large or small
whether the virtual memory uses mathematical or physical addresses
whether the corresponding page is being used
whether the corresponding page is in the real memory or not



If a flag which is held in each entry of the page-table is zero then:

the corresponding page is in the real memory
the corresponding page is not in the real memory
the corresponding page is too large
the corresponding page is too small

Вы можете обратится к нам напрямую, через:

По Skype: molodoyberkut
По Telegram: @MolodoyBerkut
По ICQ: 657089516

Или через форму обратной связи на нашем сайте

Пока сочиняется...