9086216
Descripción
Test por Жарас Мергазы, actualizado hace más de 1 año
|
Creado por Жарас Мергазы
hace más de 7 años
|
|
Pregunta 1
Pregunta
1. With what option we can display warnings while compile with command "gcc"?
Respuesta
-
-o
-
-Wall
-
-I
-
-print-sysroot
Pregunta 2
Pregunta
What number of classes (*.java) has project-01?
Respuesta
-
3
-
5
-
2
-
4
Pregunta 3
Pregunta
What number of source code files has ex-05 in project-01?
Respuesta
-
3
-
2
-
4
-
5
Pregunta 4
Pregunta
What number wasn’t tested in TestMainline class in prject01?
Respuesta
-
4
-
2
-
81
-
64
-
91
Pregunta 5
Pregunta
In exercises 11-13 nodes are stored?
Respuesta
-
Position and salary
-
Name and study year
-
Position and birth year
-
Name and age
Pregunta 6
Pregunta
Ex-16. what is size of matrix in given large.txt?
Respuesta
-
60
-
50
-
80
-
30
Pregunta 7
Pregunta
What is range of verify numbers for square root in proj2?
Respuesta
-
2 to 1000
-
2 to 100
-
2 to 100000
-
2 to 10000
Pregunta 8
Pregunta
What are files in C portion of proj2?
Respuesta
-
Sqr.c sqr.h unumber.c unumber.h
-
Makefile, sqr.c, unumber.c, unumber.h
-
Makefile, sqr.c, sqr.h, unumber.c
-
Makefile , sqr.c , unumber.c, squareRootTwo.text
Pregunta 9
Pregunta
Ex-10 what does UNumber structure include ?
Respuesta
-
Value
-
Range
-
Decimal point
-
Decimal power
-
Count
-
Sign
Pregunta 10
Pregunta
What number of errors has code in Exercise-03?
Respuesta
-
3
-
1
-
4
-
2
Pregunta 11
Pregunta
2. "pdsa" what does it mean? (Please select the best answer)
Respuesta
-
name of created folder in excercise 01
-
abbreviation of SDP-4 course name
-
performance, data storage and algorithms
-
special folder where all our deliverables are stored
Pregunta 12
Pregunta
What does Unix command - ls?
Respuesta
-
refers to your home directory
-
lists the contents of a directory
-
refers to the current directory
-
displays the path of the current directory
Pregunta 13
Pregunta
. On a 32bit system CLOCKS_PER_SEC equals
Respuesta
-
100000
-
1000000
-
1000000000000
-
1000000000
-
10000000
Pregunta 14
Pregunta
What should we do to remove executable and the intermediate build files?
Respuesta
-
rm *
-
make clean
-
make del
-
. make rm
Pregunta 15
Pregunta
What main benefit gives us "makefile" in doing exercises? (Please select the best answer)
Respuesta
-
. shows us more detailed information about errors
-
saves our time while we debugging program code
-
quick compile in short command - 'make'
-
enriches our compile options
Pregunta 16
Pregunta
. Project 01 ends on what number of exercises?
Respuesta
-
8
-
7
-
5
-
6
Pregunta 17
Pregunta
What does Unix command - './file'?
Respuesta
-
. refers to a directory called 'file'
-
execute first file in current directory
-
compile called 'file'
-
refers to an entity called 'file' in the current directory
Pregunta 18
Pregunta
The default name of the compiled program is
Respuesta
-
d.out
-
a.out
-
c.out
-
the same name as source file, but with .out
Pregunta 19
Pregunta
2. Ex-09. What was the number of values in data.txt?
Respuesta
-
300
-
25
-
200
-
10
-
500
Pregunta 20
Pregunta
3. What number of array's size is large enough in ex-15?
Respuesta
-
~ 1 000
-
~ 10
-
~ 1 000 000
-
~ 100
Pregunta 21
Pregunta
4. Type macros bool is contained in library:
Respuesta
-
~ stdlib.h
-
~ time.h
-
~ stdio.h
-
~ stdbool.h
Pregunta 22
Pregunta
5. What number of Exercises in Project-01?
Respuesta
-
4
-
3
-
2
-
5
Pregunta 23
Pregunta
To get result time in miliseconds (in Java program) what should we do in Ex05 with calculated time?
To get result time in miliseconds (in Java program) what should we do in Ex05?
Respuesta
-
~ / 100
-
~* 10 000
-
~ * 1 000
-
~ * 100 000
-
~ / 1 000 000
Pregunta 24
Pregunta
7. In exercise-04 we used 1E+10 to...
Respuesta
-
to put limit of numbers after point
-
establish the limit for ending the loop
-
setup the limit number of loop iterations
-
establish the maximum of delta between guess and new_guess numbers
Pregunta 25
Pregunta
8. In exercise-04 for loop we used 2nd limit for ending, and limit was what number of cycles?
Respuesta
-
1+E10
-
10
-
20
-
100
-
200
-
1000
-
1000000
Pregunta 26
Pregunta
name: "PDSA" what does it mean?
"PDSA" what does it mean? (Please select the best answer){
Respuesta
-
performance, data service and algorithms
-
performance, digital service and algorithms
-
performance, data structures and algorithms
-
performance, digital structures and algorithms
Pregunta 27
Pregunta
name: What does Unix command - mkdir ?
What does Unix command - mkdir ?{
Respuesta
-
displays the path of the current directory
-
refers to the current directory
-
lists the contents of a directory
-
creates directory
Pregunta 28
Pregunta
How to delete files in Unix terminal?
How to try to delete some files in Unix terminal?{
Respuesta
-
with command - del
-
with command - mv
-
with command - make clean
-
with command - cp
Pregunta 29
Pregunta
The default name with option "-o ex02" of the compiled program is:
The name of compiled file with option "-o ex02.out" is\:
Respuesta
-
a.out
-
ex02
-
ex02.out
-
ex02.c
Pregunta 30
Pregunta
What does "makefile" include? (2 right answers){
Respuesta
-
%50% dependencies
-
%50% targets
-
%50% text of warning messages
-
%50% descriptions
Pregunta 31
Pregunta
What should we do to remove executable, intermediate build files and all others?
What should we do to delete all files in local directory (i.e. executable and intermediate build files)?
Respuesta
-
make rm
-
rm *
-
rm clean
-
make del
Pregunta 32
Pregunta
What Unix command should we use in order to refresh modification time of file?
Exercise-03. What Unix command should we use in order to refresh modification time of file?
Respuesta
-
modify
-
make
-
touch
-
make update
Pregunta 33
Pregunta
What does in Unix command "./" the dot "." specify?
Respuesta
-
local file
-
entity of excutable file
-
current directory
-
excute only compiled files
Pregunta 34
Pregunta
In Unix path command "~/" tilde "~" specify?
Respuesta
-
root directory
-
home directory
-
current directory
-
containing directory
Pregunta 35
Pregunta
What does Unix command - "mkdir ../dom" ?
Respuesta
-
creates directory "dom" in containing directory
-
creates directory "dom" in home directory
-
creates directory "dom" in local directory
-
creates directory "dom" in current directory
Pregunta 36
Pregunta
The default name with option "-o task_01" of the compiled program is:
The name of compiled file with option "-o task_01" is
Respuesta
-
a.out
-
task_01
-
task_01.out
-
task_01.c
Pregunta 37
Pregunta
With what option we can display warnings while compile with command "gcc"?{
Respuesta
-
-o
-
-Wall
-
-I
-
-print-sysroot
Pregunta 38
Pregunta
What does file extension have source code file in C
Respuesta
-
*.o
-
*.h
-
*.c
-
*.f
Pregunta 39
Pregunta
How to try to delete something in Unix terminal?
Respuesta
-
with command - del
-
with command - mv
-
with command - mkdir
-
with command - rmdir
Pregunta 40
Pregunta
What does Unix command - '../make_file' ?
Respuesta
-
compile file with name 'make_file'
-
try to compile and show warnings
-
refers to an entity called 'make_file' in the current directory
-
runs excutable file 'make_file' in the containing directory
Pregunta 41
Pregunta
How we calculate new_guess number in our Newton's method?
Respuesta
-
new_guess \~ value / 2;
-
new_guess \~ (old_guess + value) / 2.0;
-
new_guess \~ (old_guess + value / old_guess) / 2.0;
-
new_guess \~ (old_guess + value / 2) / 2;
Pregunta 42
Pregunta
Exercise-03. With Unix command "make" we can use targets at command promt, please select them: (2 right answers)
Respuesta
-
~%50% clean
-
~%50% all
-
~%50% touch
-
~%50% makefile
Pregunta 43
Pregunta
What does in Unix command "../" dots ".." specify?
Respuesta
-
root directory
-
home directory
-
current directory
-
containing directory
Pregunta 44
Pregunta
"UPM" what does it mean in Project-01?
Respuesta
-
Universal Precision Math
-
Unlimited Precision Model
-
Universal Precision Model
-
Universal Processor Math
-
Unlimited Precision Math
Pregunta 45
Pregunta
Exercise-05. How to right look in third section of man pages?
Respuesta
-
man clock 3
-
man -3 clock
-
man ./3 clock
-
man 3 clock
Pregunta 46
Pregunta
What header file (C library) we should insert in code for using "clock" function?
Respuesta
-
time.h
-
nanoTime.h
-
clocks.h
-
clock.h
Pregunta 47
Pregunta
What was search algorithm used in exercise-8?
Respuesta
-
recursive search
-
binary search
-
insertion
-
selection
Pregunta 48
Pregunta
We have C library calc.h and calc.o, what we have to do next for using this library?
Respuesta
-
while compile just add in console command calc.h at the end
-
modify make file by adding new object in it
-
write in source code define calc.h
-
write in source code include calc.o
Pregunta 49
Pregunta
What was sort algorithm used in exercise-7?
Respuesta
-
bubble
-
insertion
-
selection
-
merge
Pregunta 50
Pregunta
For what did we use conditional compilation in exercise-8?
Respuesta
-
for calling library
-
for debugging information
-
for sorting array of doubles
-
for extra output
Pregunta 51
Pregunta
What have we learned in exercise-9 for minimizing errors in code?
Respuesta
-
using bubble sort
-
using constants
-
using libraries
-
using pointers
Pregunta 52
Pregunta
What is period of DEBUG in exercise-9?
Respuesta
-
0 - 2
-
0 - 3
-
0 - 4
-
0 - 5
Pregunta 53
Pregunta
Ex-09. Step-12: In which function is the problem?
Ex-09. Step-12: In which function is the problem with ASCENDING and DESCENDING ?
Respuesta
-
bubble_sort
-
binary_search
-
main
-
insertion_sort
Pregunta 54
Pregunta
Ex-08. For #ifdef/#endif pair is right: (Please select the best answer)
Respuesta
-
checks to see if a constant is not defined
-
checks to see if a constant is defined
-
checks to see if a CFLAG is not defined
-
checks to see if a CFLAG is defined
Pregunta 55
Pregunta
Ex-08. With what option we can define constant as a parameter to the compiler (for conditional compilation)?
Respuesta
-
gcc -Wall -I. -DDEBUG
-
gcc -Wall -I. -DEBUG
-
gcc -Wall -I. -DCFLAGS
-
gcc -Wall -I. -CFLAGS
Pregunta 56
Pregunta
Function malloc is contained in library:
Respuesta
-
stdlib.h
-
time.h
-
stdio.h
-
stdbool.h
Pregunta 57
Pregunta
Ex-10. What does UNumber structure include? (3 right answers){
Respuesta
-
sign
-
decimal power
-
value
-
range
-
decimal point
-
count
Pregunta 58
Pregunta
Ex-13. Is it right for "Memory tracing"? Memory tracking simply involves counting the number of times malloc and free are called
Respuesta
- True
- False
Pregunta 59
Pregunta
Ex-13. With what format in function printf can program display the values of pointers?
Respuesta
-
%f
-
%v
-
%s
-
%p
Pregunta 60
Pregunta
What is result of "5" + "2" in ASCII codes?
Respuesta
-
7
-
103
-
52
-
155
Pregunta 61
Pregunta
What is false for Single Linked List?
Respuesta
-
has head and tail nodes
-
has pointer for previous node
-
we can move node by node only to one direction
-
we can insert node
Pregunta 62
Pregunta
What is false for Double Linked List?
Respuesta
-
has head and tail nodes
-
has pointer for previous node
-
we can move node by node only to one direction
-
we can insert node
Pregunta 63
Pregunta
With what function we allocate memory?
Respuesta
-
givmem
-
free
-
malloc
-
alloc
Pregunta 64
Pregunta
Exercise-14. You can build Java programs at the command line using command:
Respuesta
-
make
-
gcc -Wall
-
javac
-
java
Pregunta 65
Pregunta
What is result of "8" + "7" in ASCII codes?
Respuesta
-
15
-
111
-
87
-
159
Pregunta 66
Pregunta
Exercise-14. You can run Java programs at the command line using command:
Respuesta
-
.\
-
gcc -Wall
-
javac
-
java
Pregunta 67
Pregunta
With what function we release memory?
Respuesta
-
calloc
-
free
-
malloc
-
alloc
Pregunta 68
Pregunta
What is result of "8" + "3" in ASCII codes?
Respuesta
-
11
-
107
-
83
-
159
Pregunta 69
Pregunta
What is true for Single Linked List?
Respuesta
-
has head and tail nodes
-
easy display list in any direction
-
node has two pointers
-
we can move node by node only to one direction
-
we can remove node
Pregunta 70
Pregunta
What is true for Double Linked List?
Respuesta
-
has head node and not tail node
-
has pointer for previous node
-
we can move node by node to any direction
-
every node has pointer to next node which is always tail
-
we can remove node
Pregunta 71
Pregunta
Ex-16. Conway Game of Life. Will this colony "111" of three live cells disappear on next iteration?
Respuesta
- True
- False
Pregunta 72
Pregunta
Pointer arithmetric formula for 2-dim arrays in C?
Respuesta
-
p + (num_cols * row) + col
-
p * (num_cols * row) + col
-
p + (num_cols + row) * col
Pregunta 73
Pregunta
CONWAY GAME OF LIFE. Is this rule true?
CONWAY GAME OF LIFE. Is this rule true? Any live cell with fewer than two live neighbors dies
Respuesta
- True
- False
Pregunta 74
Pregunta
CONWAY GAME OF LIFE. Is this rule true? Any live cell with two or three live neighbors dies on to the next generation
Respuesta
- True
- False
Pregunta 75
Pregunta
Ex-16. Conway Game of Life. What colony of cells (size: 3x3 written in one line like: 111 101 111) will die on next iteration?
Respuesta
-
111 111 000
-
110 110 000
-
000 101 101
-
001 100 100
Pregunta 76
Pregunta
Ex-16. Conway Game of Life. What colony of cells (size: 3x3 written in one line like: 111 101 111) will die on next iteration?
Respuesta
-
001 110 000
-
110 110 000
-
100 000 001
-
001 100 100
Pregunta 77
Pregunta
CONWAY GAME OF LIFE. Is this rule true? Any live cell with more than three live neighbors dies, as if by overcrowding
Respuesta
- True
- False
Pregunta 78
Pregunta
Ex-16. Conway Game of Life. What colony of cells will survive on next iteration?
Respuesta
-
111
-
10101
-
11011
-
101
Pregunta 79
Pregunta
Ex-16. Conway Game of Life. What colony of cells (size: 3x3 written in one line like: 111 101 111) will die on next iteration?
Respuesta
-
000 111 000
-
110 110 000
-
110 100 000
-
101 101 000
Pregunta 80
Pregunta
What is purpose of argument -s in Project-02?
Respuesta
-
specifies the number of value which we should input to sqr function
-
specifies the number of significant digits
-
specifies the name of the comparison input file
-
specifies the name of the input file with test values
Pregunta 81
Pregunta
What does Lex do?
Respuesta
-
recognizes whether an input string is an instance of a specified pattern
-
generates code for a lexical analyzer based on definitions in an input file
-
recognizes tokens in a stream of characters
-
generates definitions for a lexical analyzer based on patterns
Pregunta 82
Pregunta
What does the following regular expression match?[-+]?[[\:digit\:]]+/[[\:digit\:]]+</p>
Respuesta
-
<p>+4/5</p>
-
<p>+2/3+</p>
-
<p>-+2/6</p>
-
<p>-4/5+</p>
Pregunta 83
Pregunta
What does the following regular expression match?[-+]?[[\:digit\:]]+</p>
Respuesta
-
~<p>75</p>
-
~<p>+23a</p>
-
~<p>-26g</p>
-
~<p>?32f</p>
Pregunta 84
Pregunta
What is FSM?
Respuesta
-
Finite System Machine
-
Finite Service Machine
-
Final System Model
-
Finite State Machine
Pregunta 85
Pregunta
Which string is right for FSM with model\: ( 0 ) \~ a-z \~ ( 1 ) \~ 0-9 \~ ( 2 ) \~ @ \~ ( 3 ) \~ a-z \~ (( 4 ))
Respuesta
-
012@34
-
tt@r
-
0a12@a
-
f0@x
Pregunta 86
Pregunta
The Lex program has existed since the...
Respuesta
-
1960
-
1980
-
1970
-
1990
Pregunta 87
Pregunta
Select a regular expression that matches : 10k or 10K
Respuesta
-
~[[:digit:]]+[kK]
-
~[[:digit:]]+[kK]?
-
~[[:digit:]][kK]*
-
~[[:digit:]][k]
Pregunta 88
Pregunta
Select a regular expression that matches : Strings that contain an optional minus or plus followed by zero or more alphabetic characters
Respuesta
-
~[-+][[:alnum:]]*
-
~[-+][[:alpha:]]*
-
~[-+][[:alnum:]]+
-
~[-+]?[[:alpha:]]+
-
~[-+]?[[:alpha:]]*
Pregunta 89
Pregunta
What do the following regular expressions match [-+][[:digit:]]*?
Respuesta
-
Strings that contain a required minus or a plus followed by zero or more digits
-
Strings that contain a required minus or a plus followed by one or more digits
-
Strings that contain an optional minus or plus followed by one or more digits
-
Strings that contain an optional minus or plus followed by zero or more digits.
Pregunta 90
Pregunta
What FSM recognizes this string token? "2*2~4"
Respuesta
-
( 0 ) --- 0-9 --- ( 1 ) --- * --- ( 2 ) --- 0-9 --- ( 3 ) --- \~ --- ( 4 ) --- 0-9 --- (( 5 ))
-
( 0 ) --- 0-9 --- ( 1 ) --- a-z --- ( 2 ) --- 0-9 --- ( 3 ) --- a-z --- ( 4 ) --- 0-9 --- (( 5 ))
-
( 0 ) --- 0-9 --- ( 1 ) --- a-z --- ( 2 ) --- 0-9 --- ( 3 ) --- \~ --- ( 4 ) --- 0-9 --- (( 5 ))
-
( 0 ) --- 0-9 --- ( 1 ) --- * --- ( 2 ) --- 0-9 --- ( 3 ) --- a-z --- ( 4 ) --- 0-9 --- (( 5 ))
Pregunta 91
Pregunta
Select a regular expression that matches : Strings that contain a required minus or a plus followed by zero or more alpha-numeric characters
Respuesta
-
[-+][[:alnum:]]*
-
[-+]?[[:alpha:]]*
-
[-+][[:alnum:]]+
-
[-+]?[[:digit:]]+
-
[-+][[:alpha:]]+
Pregunta 92
Pregunta
What does the following regular expression match?[-+]?[[\:digit\:]]+</p>
Respuesta
-
<p>23</p>
-
<p>+45</p>
-
<p>26g+</p>
-
<p>?32f</p>
Pregunta 93
Pregunta
What does the following regular expression match?[-+]?[[\:alnum\:]]+/[^$]+</p>
Respuesta
-
<p>gf26/dsfeg</p>
-
<p>gf23/dsfeg$</p>
-
<p>-123g/ffef$</p>
-
<p>?123f/ffef</p>
Pregunta 94
Pregunta
9. What does the following regular expression match? [-+]?[[\:alnum\:]]+/[^$]+
Respuesta
-
<p>abs123/ffef</p>
-
<p>abs123/ffef$</p>
-
<p>-26g/dsfeg$</p>
-
<p>?32f/wrw$</p>
Pregunta 95
Pregunta
10. What does this Unix commad\: lex baseline.lex?
Respuesta
-
generate a definition file
-
run the resulting program
-
generate a source code file called lex.yy.c
-
compile the generated source file, resulting executable is a.out
Pregunta 96
Pregunta
What do the following regular expressions match "iitu[!]?" ?
Respuesta
-
Lines that contain the letter sequence i, i, t, u and probably !.
-
Lines that contain the letter sequence i, t, u, ! and ?.
-
Lines that contain the letter sequence ii, t, u, and !.
-
Lines that contain the letter sequence ii, t, u and probably !.
Pregunta 97
Pregunta
What FSM recognizes this string token? "d7@r"
Respuesta
-
( 0 ) \~ a-z \~ ( 1 ) \~ a-z \~ ( 2 ) \~ @ \~ ( 3 ) \~ a-z \~ (( 4 ))
-
( 0 ) \~ a-z \~ ( 1 ) \~ 0-9 \~ ( 2 ) \~ @ \~ ( 3 ) \~ a-z \~ ( 4 ) \~ a-z \~ (( 5 ))
-
( 0 ) \~ a-z \~ ( 1 ) \~ 0-9 \~ ( 2 ) \~ 0-9 \~ ( 3 ) \~ @ \~ ( 4 ) \~ a-z \~ (( 5 ))
-
( 0 ) \~ a-z \~ ( 1 ) \~ 0-9 \~ ( 2 ) \~ @ \~ ( 3 ) \~ a-z \~ (( 4 ))
Pregunta 98
Pregunta
For calling FSM program we need:
Respuesta
-
token file
-
definition file
-
input file
-
note file
Pregunta 99
Pregunta
In UNIX console "ls *.[ch]" command what will do?
Respuesta
-
list all files in the current directory that end with .ch
-
list all files in the current directory that end with .[ch]
-
list all files in the current directory that end with .c or .h
-
list all files in the current directory that end with .ch, .c or .h
Pregunta 100
Pregunta
What FSM recognizes this string token? "apt-7,bld#2"
Respuesta
-
( 0 ) \~ a-z \~ ( 1 ) \~ a-z \~ ( 2 ) \~ @ \~ ( 3 ) \~ a-z \~ (( 4 ))
-
( 0 ) \~ a-z \~ ( 1 ) \~ 0-9 \~ ( 2 ) \~ @ \~ ( 3 ) \~ a-z \~ (( 4 ))
-
( 0 ) \~ apt \~ ( 1 ) \~ - \~ ( 2 ) \~ 0-9 \~ ( 3 ) \~ ,bld\# \~ ( 4 ) \~ 0-9 \~ (( 5 ))
-
( 0 ) \~ a-z \~ ( 1 ) \~ - \~ ( 2 ) \~ 0-9 \~ ( 3 ) \~ , \~ ( 4 ) \~ a-z \~ ( 5 ) \~ \# \~ ( 6 ) \~ 0-9 \~ (( 7 ))
-
( 0 ) \~ apt- \~ ( 1 ) \~ 0-9 \~ ( 2 ) \~ , \~ ( 3 ) \~ bld \~ ( 4 ) \~ \#0-9 \~ (( 5 ))
Pregunta 101
Pregunta
For calling FSM program we need
Respuesta
-
token file
-
file with definitions
-
output file
-
note file
Pregunta 102
Pregunta
Ex-16. Conway Game of Life. What colony of cells will survive on next iteration?
Conway Game of Life. What colony of cells will die on next iteration?{
Respuesta
-
11100
-
10101
-
11011
-
00111
Pregunta 103
Pregunta
Ex1-4. The name of compiled file with option "-o wall2" is
Respuesta
-
a.out
-
wall2
-
wall2.out
-
wall2.o
Pregunta 104
Pregunta
Ex-22. Java tokenizer program recognizes... (2 right answers)
Respuesta
-
Unumber
-
number
-
string tokens
-
char tokens
Pregunta 105
Pregunta
Ex-23 program was enhaced to skip: (2 right answers)
Respuesta
-
octal numbers
-
comments
-
white space
-
Unknown tokens
Pregunta 106
Pregunta
Ex-25 program was enhaced to recognize: (2 right answers)
Respuesta
-
special characters
-
reserved words
-
operators
-
comments
Pregunta 107
Pregunta
In Ex-22 we don't recognize fully those tokens : (2 right answers)
Respuesta
-
number
-
UNKNOWN
-
octal
-
string
Pregunta 108
Pregunta
Character "f" represents command
Respuesta
-
hexadecimal digit
-
octal digit
-
final state
-
any digit
Pregunta 109
Pregunta
Character "h" represents command
Respuesta
-
hexadecimal digit
-
octal digit
-
final state
-
any digit
Pregunta 110
Pregunta
Character "d" represents command
Respuesta
-
hexadecimal digit
-
octal digit
-
nonzero digit
-
any digit
Pregunta 111
Pregunta
Character "z" represents command
Respuesta
-
hexadecimal digit
-
octal digit
-
nonzero digit
-
any digit
Pregunta 112
Pregunta
Character "o" represents command:
Respuesta
-
hexadecimal digit
-
octal digit
-
nonzero digit
-
any digit
Pregunta 113
Pregunta
Character "p" represents command:
Respuesta
-
specific character
-
pointer
-
final state
-
printable ascii
Pregunta 114
Pregunta
Character "c" represents command
Respuesta
-
specific character
-
pointer
-
final state
-
printable ascii
Pregunta 115
Pregunta
Character "a" represents command:
Respuesta
-
a specific character
-
an alpha character
-
an any character
-
a printable ascii
Pregunta 116
Pregunta
For those characters that are not recognized by the FSM, all transitions for the row are set to...
Respuesta
-
0
-
-1
-
f
-
*
Pregunta 117
Pregunta
Ex-25. What are words reserved? (2 right answers)
Respuesta
-
GREATER_THAN
-
AUTO
-
STATIC
-
EQUAL
Pregunta 118
Pregunta
Ex-25. What are words NOT reserved, they are operators? (2 right answers)
Respuesta
-
REGISTER
-
NOT
-
MINUS_MINUS
-
SWITCH
Pregunta 119
Pregunta
Ex-25. nonzero digit from: "0 z 1\n". Task please write your structure for printable characters (without double quotes)
Respuesta
-
1 p 1\n
-
1 p \1n
-
1 1 p\n
Pregunta 120
Pregunta
Ex-29. A naive binary search tree is...
Respuesta
-
balanced
-
full
-
general
-
complete
-
perfect
Pregunta 121
Pregunta
Ex-30. What is right for relative search time for trees with random and sorted data?(2 right answers)
Respuesta
-
as tree height decreases, search time also increases
-
search time is closely related to the height of the tree
-
as tree height increases, search time also increases
Pregunta 122
Pregunta
Ex-31. AVL tree is...
Respuesta
-
naive binary tree
-
binary search tree
-
full binary tree
-
balanced binary tree
Pregunta 123
Pregunta
ex-29: the program is missing code:
Respuesta
-
adding notes
-
getting nodes.
-
Inserting nodes
-
Deleting nodes
Pregunta 124
Pregunta
. An AVL tree is...{
Respuesta
-
a self-completing binary search tree
-
a naive binary search tree
-
a self-routed binary search tree
-
a self-balancing binary search tree
Pregunta 125
Pregunta
Ex-31. The height of an AVL tree is most
Respuesta
-
1.44*log2(n)
-
3.14*log2(n+2)-1
-
log2(n+2)-1
-
1.44*log2(n+2)-1
Pregunta 126
Pregunta
Ex-31. The height of a tree of one billion nodes will be: (Please type just one any number)
Respuesta
-
42
-
43
-
44
-
45
Pregunta 127
Pregunta
What are methods we have added in ChainHashTable.java?(2 right answers)
Respuesta
-
insert()
-
get()
-
hash()
-
del()
Pregunta 128
Pregunta
Ex-32. What are advantages have Hash table?(2 right answers)
Respuesta
-
perfomance is slower than that of a binary tree
-
perfomance is faster than that of a binary tree
-
memory allocation is smaller than a comparable binary tree node
-
memory allocation is larger than a comparable binary tree node
Pregunta 129
Pregunta
Ex-33. With what 2 values you can change setup of Experiment.java?(2 right answers)
Respuesta
-
hashCode
-
keyRadix
-
hashPrime
-
avgKey
Pregunta 130
Pregunta
Lec. Binary tree is:(2 right answers)
Respuesta
-
left tree
-
a root
-
left subtree
-
right tree
Pregunta 131
Pregunta
Lec. Binary tree's properties:(2 right answers)
Respuesta
-
average depth of left subtree
-
max of leaves
-
max of nodes
-
average depth of leaves
Pregunta 132
Pregunta
Lec. Binary Search Tree's properties: (2 right answers)
Respuesta
-
each node has more 2 children
-
left node smaller than his root node
-
right node lager than his root node
-
each node has less 2 children
Pregunta 133
Pregunta
Lec. Hash Tables:(2 right answers)
Respuesta
-
Large-scale distributed systems
-
Effective way of implementing dictionaries
-
Generalization of ordinary arrays
-
Memory-management tables in operating systems
Pregunta 134
Pregunta
Ex-37. In exercise the enhanced program has been modified: (3 right answers)
Respuesta
-
Build expression trees for Boolean expressions
-
to recognize Boolean expressions
-
evaluate boolean expressions
-
to recognize arithmetic expressions
-
build expression trees for arithmetic expressions
Pregunta 135
Pregunta
Many languages allow overloading of operators. The is true or false in java?
Respuesta
- True
- False
Pregunta 136
Pregunta
Ex-37. For example, the "+" operator does different things depending on what its operands are: (3 right answers
Respuesta
-
If the operands are doubles, a floating-point addition is performed
-
If the operands are integers, an integer addition is performed
-
If the operands are strings, a string concatenation is performed
-
if the operands are strings, a floating-point addition is performed
-
If the operands are integers, a string concatenation is performed
Pregunta 137
Pregunta
Ex-37. In exercise we can have 3 classes of operators: (3 right answers)
Respuesta
-
Arithmetic
-
relational
-
logical
-
logic
-
relation
Pregunta 138
Pregunta
Ex-34. The program prompts the user for commands, then executes the commands. Unrecognized command is
Respuesta
-
Insert
-
Quit
-
Dump
-
Set
-
Print
-
Reset
Pregunta 139
Pregunta
Ex-35. Which activity was NOT performed?
Respuesta
-
Collect data by running the program
-
Collect data by checking the program
-
Collect data by executing the program
Pregunta 140
Pregunta
Ex-30. What are varying values for variables have used?(2 right answers)
Respuesta
-
Step
-
Maxsize
-
MinSize
-
Level
Pregunta 141
Pregunta
Ex-32. What are methods we have added in ChainHashTable.java?(2 right answers)
Respuesta
-
Add()
-
hashtabletostring()
-
setIn()
-
gettable()
Pregunta 142
Pregunta
Ex-32. What are advantages have BST?(2 right answers)
Respuesta
-
Finding closest lower and greater elements is faster than a hash table
-
All operations are guaranted to work in O(login) time
-
Performance much faster that that of a hashtable()
-
Memory allocation is lower than a hash table
Pregunta 143
Pregunta
Ex-41. When the linked list is better?
Respuesta
-
The number of items is very large
-
The number of items Is small
Pregunta 144
Pregunta
Ex-41. When the tree is better?
Respuesta
-
The number of items Is small
-
The number of items is very large
Pregunta 145
Pregunta
Ex-41. What are advatanges have a double linked list and linear search?
Respuesta
-
fast search
-
small code
-
simple algorithm
-
more complex code
Pregunta 146
Pregunta
In project 05 what 2 types of algorithms are used?
Respuesta
-
BBT AWL
-
BST AVL
-
Hash Table
-
Hash Tree
Pregunta 147
Pregunta
Project 5 length?
Respuesta
-
5
-
4
-
3
-
6
Pregunta 148
Pregunta
Project 5 height
Respuesta
-
12
-
14
-
16
-
15
Pregunta 149
Pregunta
Project 5: the static analysis of the hash table should include:
Respuesta
-
The longest length chain
-
Average length of non-zero length chain
-
The shortest length chain
-
Average length of non-zero height chain
Pregunta 150
Pregunta
Ex-42. what is whatchpoint?
Respuesta
-
Changing variable
-
Creating variable
-
Writing varibale
-
Changing value
Pregunta 151
Pregunta
Project 5. for the last two solutions you will need to?
Respuesta
-
Minimal node in tree
-
Tree height
-
Avl expected tree limit
-
Average length of non-zero chains
Pregunta 152
Pregunta
Project 5 four versions:
Respuesta
-
arraylist, array, avl BST, hash table
-
arraylist, value, avl BST, hash table
-
arraylist, array, variable, hash table
Pregunta 153
Pregunta
Project 5 words?
Respuesta
-
250 000 words
-
50 000 words
-
100 000 words
-
1000 000 words
Pregunta 154
Pregunta
Project 5 found at first time:
Respuesta
-
25000
-
50000
-
100000
-
250000
Pregunta 155
Pregunta
Project 5 didn’t find at first time:
Respuesta
-
25000
-
50000
-
250000
-
100000
Pregunta 156
Pregunta
Write a regular expression that matches the writing: d23, D23 or 23).
For example for numbers: -4, 3 or +5; right regular expression is written like that:[+-]?[[:digit:]]+
Respuesta
-
[dD]?[[:digit:]]+
-
[Dd]?[[:digit:]]+
-
[Dd]?[[:digit:]]
Pregunta 157
Pregunta
Write a regular expression that matches the exponent part of a floating point
number written in scientific notation (e.g. e10 or E10). Sample for -4, 3 or +5 answer is [+-]?[[:digit:]]+{
Respuesta
-
[eE][[:digit:]]+
-
[eE][[:digits:]]+
-
[dD][[:digit:]]+
Pregunta 158
Pregunta
Write a regular expression that matches the writing number of apartment (e.g. n23 or N23).
For example for numbers: -4, 3 or +5; right regular expression is written like that:[+-]?[[:digit:]]+{
Respuesta
-
[nN][[:digit:]]+
-
[nN][[:digit:]]
-
[eE][[:digit:]]+
-
[dD][[:digit:]]+
Pregunta 159
Pregunta
Write a regular expression that matches the writing number with pi (e.g. 2pi, -33pi or +5pi).
For example for numbers: -4, 3 or +5; right regular expression is written like that:[+-]?[[:digit:]]+{
Respuesta
-
[+-]?[[:digit:]]+[[:alpha:]]+
-
[+-]?[[:digit:]]+[pi]
-
[+-]?[[:digit::]]+[pi]
Pregunta 160
Pregunta
Ex-40. Why might using a profiler on your code be useful? (2 right answers)
Respuesta
-
A profiler can be used to guide efforts to improve a program.
-
For example, measuring timing information can help guide efforts to improve performance.
-
A profiler cannot be used to guide efforts to improve a program.
Pregunta 161
Pregunta
Ex-40. In what method is the program spending most of its time when executing the List All command?{
Respuesta
-
ArrayListDictionary.listAll().
-
dictionary.dictEntry.toString()
Pregunta 162
Pregunta
Ex-40. What method is called the most times?{
Respuesta
-
ArrayListDictionary.listAll().
-
dictionary.dictEntry.toString() is called once for each entry in the dictionary.
Pregunta 163
Pregunta
Ex-40. What are some possible improvements that could be investigated for this problem (low performance)? (2 right answers)
Respuesta
-
StringBuilder or StringBuffer
-
StringBuild or StringBuffer
-
StringBuilder or StringBuff
Pregunta 164
Pregunta
Ex-41. What are examples of goals when optimizing code? (3 right answers)
Respuesta
-
The most common goals of optimization are to maximize performance (execution speed), minimize program size (memory footprint), and/or minimize memory usage (RAM).
-
The most common goals of optimization are to maximize performance (execution speed), minimize program size (memory footprint), and/or maximize memory usage (RAM).
-
The most common goals of optimization are to minimize performance (execution speed), minimize program size (memory footprint), and/or minimize memory usage (RAM).
Pregunta 165
Pregunta
Ex-41. What is the 90/10 rule or law of program optimization? Please select right examples: (2 right answers){
Respuesta
-
90% of execution time of a program is spent in 10% of the code and 90% of the time is spent developing/debugging 10% of the code.
-
10% of execution time of a program is spent in 90% of the code and 90% of the time is spent developing/debugging 10% of the code.
-
90% of execution time of a program is spent in 10% of the code and 10% of the time is spent developing/debugging 90% of the code.
Pregunta 166
Pregunta
Project 5 finish:
Respuesta
-
compare the results from data stored randomly, stored alphabetically and stored in reverse
-
do a static analysis
-
alphabetic order
-
provide an analysis of the results from running the four different solutions
-
look at search times
Pregunta 167
Pregunta
What was the error out of type range in ex-9?
Respuesta
-
101211
-
Ascending –descending
-
Num-items – 1000
-
Array[0] - 32767
Pregunta 168
Pregunta
Ex-40. What is "profiling" as used in software development? Profiling is a form of dynamic program analysis that measures things like: (3 right answers){
Respuesta
-
memory usage, instruction usage, method calls, timing information, e.g., how much time spent in particular methods
-
memory usage, instruction usage, timing information, e.g., how much time spent in particular methods
-
memory usage, instructions, method calls, timing information, e.g., how much time spent in particular methods
Pregunta 169
Pregunta
Infix: ( (4 * 2) + (5 - 2) + ( ( 6 + 4) * (1 + 1) ) )
What is postfix?
Respuesta
-
4 2 * 5 2 - + 6 4 + 1 1 + * +
-
4 2 * 5 2 - + 6 4 + 1 1 + +*
-
4 *2 5 -2 + 6 4 + 1 1 + * +
Pregunta 170
Pregunta
Infix: ( (4 * 2) + (5 - 2) + ( ( 6 + 4) * (1 + 1) ) )
What is Prefix :
Respuesta
-
+*42-52*+64+11
-
*+42-52*+64+11
-
+*42-52+*64+11
Pregunta 171
Pregunta
Infix: ((8-5)*((4+2)/3))
What is Postfix:
Respuesta
-
8 5 - 4 2 + 3 / *
-
8 5 - 4 2 + 3 */
-
8 5 +4 2 - 3 / *
Pregunta 172
Pregunta
Infix: ((8-5)*((4+2)/3))
What is Prefix :
Respuesta
-
*-85/+423
-
-*85/+423
-
*-85+/423
Pregunta 173
Pregunta
What is Infix: ((3*((7+1)/4))+(17-5))
What is Postfix:
Respuesta
-
3 7 1 + 4 / * 17 5 - +
-
3 7 1 + 4 / * 17 5 + -
-
3 7 1 + 4 * / 17 5 - +
Pregunta 174
Pregunta
What is Infix: ((3*((7+1)/4))+(17-5))
What is Prefix:
Respuesta
-
*+3/+714-175
-
+*3/+714-175
-
+*3+/714-175
Pregunta 175
Pregunta
Infix: ((3+4)*((6-2)/7))
What is Postfix:
Respuesta
-
3 4 + 6 2 - /7 *
-
3 4 + 6 2 - 7 */
-
3 4 + 6 2 - 7 / *
Pregunta 176
Pregunta
Infix: ((3+4)*((6-2)/7))
What is Prefix:
Respuesta
-
*+34/-627
-
+*34/-627
-
*+34/6-27
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.