1. With what option we can display warnings while compile with command "gcc"?
-o
-Wall
-I
-print-sysroot
What number of classes (*.java) has project-01?
3
5
2
4
What number of source code files has ex-05 in project-01?
What number wasn’t tested in TestMainline class in prject01?
81
64
91
In exercises 11-13 nodes are stored?
Position and salary
Name and study year
Position and birth year
Name and age
Ex-16. what is size of matrix in given large.txt?
60
50
80
30
What is range of verify numbers for square root in proj2?
2 to 1000
2 to 100
2 to 100000
2 to 10000
What are files in C portion of proj2?
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
Ex-10 what does UNumber structure include ?
Value
Range
Decimal point
Decimal power
Count
Sign
What number of errors has code in Exercise-03?
1
2. "pdsa" what does it mean? (Please select the best answer)
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
What does Unix command - ls?
refers to your home directory
lists the contents of a directory
refers to the current directory
displays the path of the current directory
. On a 32bit system CLOCKS_PER_SEC equals
100000
1000000
1000000000000
1000000000
10000000
What should we do to remove executable and the intermediate build files?
rm *
make clean
make del
. make rm
What main benefit gives us "makefile" in doing exercises? (Please select the best answer)
. 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
. Project 01 ends on what number of exercises?
8
7
6
What does Unix command - './file'?
. 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
The default name of the compiled program is
d.out
a.out
c.out
the same name as source file, but with .out
2. Ex-09. What was the number of values in data.txt?
300
25
200
10
500
3. What number of array's size is large enough in ex-15?
~ 1 000
~ 10
~ 1 000 000
~ 100
4. Type macros bool is contained in library:
~ stdlib.h
~ time.h
~ stdio.h
~ stdbool.h
5. What number of Exercises in Project-01?
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?
~ / 100
~* 10 000
~ * 1 000
~ * 100 000
~ / 1 000 000
7. In exercise-04 we used 1E+10 to...
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
8. In exercise-04 for loop we used 2nd limit for ending, and limit was what number of cycles?
1+E10
20
100
1000
name: "PDSA" what does it mean? "PDSA" what does it mean? (Please select the best answer){
performance, data service and algorithms
performance, digital service and algorithms
performance, data structures and algorithms
performance, digital structures and algorithms
name: What does Unix command - mkdir ? What does Unix command - mkdir ?{
creates directory
How to delete files in Unix terminal? How to try to delete some files in Unix terminal?{
with command - del
with command - mv
with command - make clean
with command - cp
The default name with option "-o ex02" of the compiled program is: The name of compiled file with option "-o ex02.out" is\:
ex02
ex02.out
ex02.c
What does "makefile" include? (2 right answers){
%50% dependencies
%50% targets
%50% text of warning messages
%50% descriptions
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)?
make rm
rm clean
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?
modify
make
touch
make update
What does in Unix command "./" the dot "." specify?
local file
entity of excutable file
current directory
excute only compiled files
In Unix path command "~/" tilde "~" specify?
root directory
home directory
containing directory
What does Unix command - "mkdir ../dom" ?
creates directory "dom" in containing directory
creates directory "dom" in home directory
creates directory "dom" in local directory
creates directory "dom" in current directory
The default name with option "-o task_01" of the compiled program is: The name of compiled file with option "-o task_01" is
task_01
task_01.out
task_01.c
With what option we can display warnings while compile with command "gcc"?{
What does file extension have source code file in C
*.o
*.h
*.c
*.f
How to try to delete something in Unix terminal?
with command - mkdir
with command - rmdir
What does Unix command - '../make_file' ?
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
How we calculate new_guess number in our Newton's method?
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;
Exercise-03. With Unix command "make" we can use targets at command promt, please select them: (2 right answers)
~%50% clean
~%50% all
~%50% touch
~%50% makefile
What does in Unix command "../" dots ".." specify?
"UPM" what does it mean in Project-01?
Universal Precision Math
Unlimited Precision Model
Universal Precision Model
Universal Processor Math
Unlimited Precision Math
Exercise-05. How to right look in third section of man pages?
man clock 3
man -3 clock
man ./3 clock
man 3 clock
What header file (C library) we should insert in code for using "clock" function?
time.h
nanoTime.h
clocks.h
clock.h
What was search algorithm used in exercise-8?
recursive search
binary search
insertion
selection
We have C library calc.h and calc.o, what we have to do next for using this library?
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
What was sort algorithm used in exercise-7?
bubble
merge
For what did we use conditional compilation in exercise-8?
for calling library
for debugging information
for sorting array of doubles
for extra output
What have we learned in exercise-9 for minimizing errors in code?
using bubble sort
using constants
using libraries
using pointers
What is period of DEBUG in exercise-9?
0 - 2
0 - 3
0 - 4
0 - 5
Ex-09. Step-12: In which function is the problem? Ex-09. Step-12: In which function is the problem with ASCENDING and DESCENDING ?
bubble_sort
binary_search
main
insertion_sort
Ex-08. For #ifdef/#endif pair is right: (Please select the best answer)
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
Ex-08. With what option we can define constant as a parameter to the compiler (for conditional compilation)?
gcc -Wall -I. -DDEBUG
gcc -Wall -I. -DEBUG
gcc -Wall -I. -DCFLAGS
gcc -Wall -I. -CFLAGS
Function malloc is contained in library:
stdlib.h
stdio.h
stdbool.h
Ex-10. What does UNumber structure include? (3 right answers){
sign
decimal power
value
range
decimal point
count
Ex-13. Is it right for "Memory tracing"? Memory tracking simply involves counting the number of times malloc and free are called
Ex-13. With what format in function printf can program display the values of pointers?
%f
%v
%s
%p
What is result of "5" + "2" in ASCII codes?
103
52
155
What is false for Single Linked List?
has head and tail nodes
has pointer for previous node
we can move node by node only to one direction
we can insert node
What is false for Double Linked List?
With what function we allocate memory?
givmem
free
malloc
alloc
Exercise-14. You can build Java programs at the command line using command:
gcc -Wall
javac
java
What is result of "8" + "7" in ASCII codes?
15
111
87
159
Exercise-14. You can run Java programs at the command line using command:
.\
With what function we release memory?
calloc
What is result of "8" + "3" in ASCII codes?
11
107
83
What is true for Single Linked List?
easy display list in any direction
node has two pointers
we can remove node
What is true for Double Linked List?
has head node and not tail node
we can move node by node to any direction
every node has pointer to next node which is always tail
Ex-16. Conway Game of Life. Will this colony "111" of three live cells disappear on next iteration?
Pointer arithmetric formula for 2-dim arrays in C?
p + (num_cols * row) + col
p * (num_cols * row) + col
p + (num_cols + row) * col
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
CONWAY GAME OF LIFE. Is this rule true? Any live cell with two or three live neighbors dies on to the next generation
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?
111 111 000
110 110 000
000 101 101
001 100 100
001 110 000
100 000 001
CONWAY GAME OF LIFE. Is this rule true? Any live cell with more than three live neighbors dies, as if by overcrowding
Ex-16. Conway Game of Life. What colony of cells will survive on next iteration?
10101
11011
101
000 111 000
110 100 000
101 101 000
What is purpose of argument -s in Project-02?
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
What does Lex do?
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
What does the following regular expression match?[-+]?[[\:digit\:]]+/[[\:digit\:]]+</p>
<p>+4/5</p>
<p>+2/3+</p>
<p>-+2/6</p>
<p>-4/5+</p>
What does the following regular expression match?[-+]?[[\:digit\:]]+</p>
~<p>75</p>
~<p>+23a</p>
~<p>-26g</p>
~<p>?32f</p>
What is FSM?
Finite System Machine
Finite Service Machine
Final System Model
Finite State Machine
Which string is right for FSM with model\: ( 0 ) \~ a-z \~ ( 1 ) \~ 0-9 \~ ( 2 ) \~ @ \~ ( 3 ) \~ a-z \~ (( 4 ))
012@34
tt@r
0a12@a
f0@x
The Lex program has existed since the...
1960
1980
1970
1990
Select a regular expression that matches : 10k or 10K
~[[:digit:]]+[kK]
~[[:digit:]]+[kK]?
~[[:digit:]][kK]*
~[[:digit:]][k]
Select a regular expression that matches : Strings that contain an optional minus or plus followed by zero or more alphabetic characters
~[-+][[:alnum:]]*
~[-+][[:alpha:]]*
~[-+][[:alnum:]]+
~[-+]?[[:alpha:]]+
~[-+]?[[:alpha:]]*
What do the following regular expressions match [-+][[:digit:]]*?
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.
What FSM recognizes this string token? "2*2~4"
( 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 ))
Select a regular expression that matches : Strings that contain a required minus or a plus followed by zero or more alpha-numeric characters
[-+][[:alnum:]]*
[-+]?[[:alpha:]]*
[-+][[:alnum:]]+
[-+]?[[:digit:]]+
[-+][[:alpha:]]+
<p>23</p>
<p>+45</p>
<p>26g+</p>
<p>?32f</p>
What does the following regular expression match?[-+]?[[\:alnum\:]]+/[^$]+</p>
<p>gf26/dsfeg</p>
<p>gf23/dsfeg$</p>
<p>-123g/ffef$</p>
<p>?123f/ffef</p>
9. What does the following regular expression match? [-+]?[[\:alnum\:]]+/[^$]+
<p>abs123/ffef</p>
<p>abs123/ffef$</p>
<p>-26g/dsfeg$</p>
<p>?32f/wrw$</p>
10. What does this Unix commad\: lex baseline.lex?
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
What do the following regular expressions match "iitu[!]?" ?
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 !.
What FSM recognizes this string token? "d7@r"
( 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 ))
For calling FSM program we need:
token file
definition file
input file
note file
In UNIX console "ls *.[ch]" command what will do?
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
What FSM recognizes this string token? "apt-7,bld#2"
( 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 ))
For calling FSM program we need
file with definitions
output file
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?{
11100
00111
Ex1-4. The name of compiled file with option "-o wall2" is
wall2
wall2.out
wall2.o
Ex-22. Java tokenizer program recognizes... (2 right answers)
Unumber
number
string tokens
char tokens
Ex-23 program was enhaced to skip: (2 right answers)
octal numbers
comments
white space
Unknown tokens
Ex-25 program was enhaced to recognize: (2 right answers)
special characters
reserved words
operators
In Ex-22 we don't recognize fully those tokens : (2 right answers)
UNKNOWN
octal
string
Character "f" represents command
hexadecimal digit
octal digit
final state
any digit
Character "h" represents command
Character "d" represents command
nonzero digit
Character "z" represents command
Character "o" represents command:
Character "p" represents command:
specific character
pointer
printable ascii
Character "c" represents command
Character "a" represents command:
a specific character
an alpha character
an any character
a printable ascii
For those characters that are not recognized by the FSM, all transitions for the row are set to...
0
-1
f
*
Ex-25. What are words reserved? (2 right answers)
GREATER_THAN
AUTO
STATIC
EQUAL
Ex-25. What are words NOT reserved, they are operators? (2 right answers)
REGISTER
NOT
MINUS_MINUS
SWITCH
Ex-25. nonzero digit from: "0 z 1\n". Task please write your structure for printable characters (without double quotes)
1 p 1\n
1 p \1n
1 1 p\n
Ex-29. A naive binary search tree is...
balanced
full
general
complete
perfect
Ex-30. What is right for relative search time for trees with random and sorted data?(2 right answers)
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
Ex-31. AVL tree is...
naive binary tree
binary search tree
full binary tree
balanced binary tree
ex-29: the program is missing code:
adding notes
getting nodes.
Inserting nodes
Deleting nodes
. An AVL tree is...{
a self-completing binary search tree
a naive binary search tree
a self-routed binary search tree
a self-balancing binary search tree
Ex-31. The height of an AVL tree is most
1.44*log2(n)
3.14*log2(n+2)-1
log2(n+2)-1
1.44*log2(n+2)-1
Ex-31. The height of a tree of one billion nodes will be: (Please type just one any number)
42
43
44
45
What are methods we have added in ChainHashTable.java?(2 right answers)
insert()
get()
hash()
del()
Ex-32. What are advantages have Hash table?(2 right answers)
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
Ex-33. With what 2 values you can change setup of Experiment.java?(2 right answers)
hashCode
keyRadix
hashPrime
avgKey
Lec. Binary tree is:(2 right answers)
left tree
a root
left subtree
right tree
Lec. Binary tree's properties:(2 right answers)
average depth of left subtree
max of leaves
max of nodes
average depth of leaves
Lec. Binary Search Tree's properties: (2 right answers)
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
Lec. Hash Tables:(2 right answers)
Large-scale distributed systems
Effective way of implementing dictionaries
Generalization of ordinary arrays
Memory-management tables in operating systems
Ex-37. In exercise the enhanced program has been modified: (3 right answers)
Build expression trees for Boolean expressions
to recognize Boolean expressions
evaluate boolean expressions
to recognize arithmetic expressions
build expression trees for arithmetic expressions
Many languages allow overloading of operators. The is true or false in java?
Ex-37. For example, the "+" operator does different things depending on what its operands are: (3 right answers
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
Ex-37. In exercise we can have 3 classes of operators: (3 right answers)
Arithmetic
relational
logical
logic
relation
Ex-34. The program prompts the user for commands, then executes the commands. Unrecognized command is
Insert
Quit
Dump
Set
Print
Reset
Ex-35. Which activity was NOT performed?
Collect data by running the program
Collect data by checking the program
Collect data by executing the program
Ex-30. What are varying values for variables have used?(2 right answers)
Step
Maxsize
MinSize
Level
Ex-32. What are methods we have added in ChainHashTable.java?(2 right answers)
Add()
hashtabletostring()
setIn()
gettable()
Ex-32. What are advantages have BST?(2 right answers)
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
Ex-41. When the linked list is better?
The number of items is very large
The number of items Is small
Ex-41. When the tree is better?
Ex-41. What are advatanges have a double linked list and linear search?
fast search
small code
simple algorithm
more complex code
In project 05 what 2 types of algorithms are used?
BBT AWL
BST AVL
Hash Table
Hash Tree
Project 5 length?
Project 5 height
12
14
16
Project 5: the static analysis of the hash table should include:
The longest length chain
Average length of non-zero length chain
The shortest length chain
Average length of non-zero height chain
Ex-42. what is whatchpoint?
Changing variable
Creating variable
Writing varibale
Changing value
Project 5. for the last two solutions you will need to?
Minimal node in tree
Tree height
Avl expected tree limit
Average length of non-zero chains
Project 5 four versions:
arraylist, array, avl BST, hash table
arraylist, value, avl BST, hash table
arraylist, array, variable, hash table
Project 5 words?
250 000 words
50 000 words
100 000 words
1000 000 words
Project 5 found at first time:
25000
50000
250000
Project 5 didn’t find at first time:
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:]]+
[dD]?[[:digit:]]+
[Dd]?[[:digit:]]+
[Dd]?[[:digit:]]
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:]]+{
[eE][[:digit:]]+
[eE][[:digits:]]+
[dD][[:digit:]]+
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:]]+{
[nN][[:digit:]]+
[nN][[:digit:]]
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:]]+{
[+-]?[[:digit:]]+[[:alpha:]]+
[+-]?[[:digit:]]+[pi]
[+-]?[[:digit::]]+[pi]
Ex-40. Why might using a profiler on your code be useful? (2 right answers)
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.
Ex-40. In what method is the program spending most of its time when executing the List All command?{
ArrayListDictionary.listAll().
dictionary.dictEntry.toString()
Ex-40. What method is called the most times?{
dictionary.dictEntry.toString() is called once for each entry in the dictionary.
Ex-40. What are some possible improvements that could be investigated for this problem (low performance)? (2 right answers)
StringBuilder or StringBuffer
StringBuild or StringBuffer
StringBuilder or StringBuff
Ex-41. What are examples of goals when optimizing code? (3 right answers)
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).
Ex-41. What is the 90/10 rule or law of program optimization? Please select right examples: (2 right answers){
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.
Project 5 finish:
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
What was the error out of type range in ex-9?
101211
Ascending –descending
Num-items – 1000
Array[0] - 32767
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){
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
Infix: ( (4 * 2) + (5 - 2) + ( ( 6 + 4) * (1 + 1) ) ) What is postfix?
4 2 * 5 2 - + 6 4 + 1 1 + * +
4 2 * 5 2 - + 6 4 + 1 1 + +*
4 *2 5 -2 + 6 4 + 1 1 + * +
Infix: ( (4 * 2) + (5 - 2) + ( ( 6 + 4) * (1 + 1) ) ) What is Prefix :
+*42-52*+64+11
*+42-52*+64+11
+*42-52+*64+11
Infix: ((8-5)*((4+2)/3)) What is Postfix:
8 5 - 4 2 + 3 / *
8 5 - 4 2 + 3 */
8 5 +4 2 - 3 / *
Infix: ((8-5)*((4+2)/3)) What is Prefix :
*-85/+423
-*85/+423
*-85+/423
What is Infix: ((3*((7+1)/4))+(17-5)) What is Postfix:
3 7 1 + 4 / * 17 5 - +
3 7 1 + 4 / * 17 5 + -
3 7 1 + 4 * / 17 5 - +
What is Infix: ((3*((7+1)/4))+(17-5)) What is Prefix:
*+3/+714-175
+*3/+714-175
+*3+/714-175
Infix: ((3+4)*((6-2)/7)) What is Postfix:
3 4 + 6 2 - /7 *
3 4 + 6 2 - 7 */
3 4 + 6 2 - 7 / *
Infix: ((3+4)*((6-2)/7)) What is Prefix:
*+34/-627
+*34/-627
*+34/6-27
