Tab Scroll bars
View buttons
Cursor
Ribbons
Ruler
Commands
Status bar
Mouse pointer
Zoom slider
Title bar
File tab
1.
this displays commands for opening, saving and printing documents.
2.
this bar displays the file name and the program name. It also displays the
minimize, restore and Close buttons.
3.
these are horizontal bars near the top of the program's window that is
designed to help you quickly find the commands that you need to complete a
task.
are instructions that carry out an action when clicked. They can be selected
from the Quick Access Toolbar or the Ribbon
5.
opens a different ribbon and gives you quick access to the commonly used
commands that you need to complete a task.
this allows you to select items or to move to a specific position where you
would like to put the cursor.
7.
brings unseen parts of a document into view, located at the right side and
bottom
8.
display the margins, tab settings and indents in documents, located at the top &
left side.
9.
a flashing vertical line that indicates where the next character typed will be
inserted
10
can be found at the bottom right and it is used to zoom in and out and view
your document easier.
11
displays information about the current document. (# of pages and # of words
etc.) document easier
12.
lets you change how the document appears and are located at the bottom
right

For this assignment you have to write a c program that will take an infix expression as input and display the postfix expression of the input. after converting to the postfix expression, the program should evaluate the expression from the postfix and display the result. what should you submit? write all the code in a single file and upload the .c file. compliance with rules: ucf golden rules apply towards this assignment and submission. assignment rules mentioned in syllabus, are also applied in this submission. the ta and instructor can call any students for explaining any part of the code in order to better assess your authorship and for further clarification if needed. problem: we as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in computer's language, however, it is preferred to have the operators on the right side of the operands, ie. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix write a program that takes an "infix" expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % ( example infix expression: (7-3)/(2+2) postfix expression: 7 3 2 2 result: rubric: 1) if code does not compile in eustis server: 0. 2) checking the balance of the parenthesis: 2 points 3) incorrect postfix expression per test case: -2 points 4) correct postfix but incorrect evaluation per test case: -i points 5) handling single digit inputs: maximum 11 points 6) handling two-digit inputs: 100 percent (if pass all test cases)

Retype the statements, correcting the syntax errors. system.out.println("num: " + songnum); system.out.println(int songnum); system.out.println(songnum " songs"); note: these activities may test code with different test values. this activity will perform two tests: the first with songnum = 5, the second with songnum = 9. see how to use zybooks.

Refer to the figure and match the theorem that supports the statement.1.if chords are =, then arcs are =.if bc = de, then arc bc = arc de2.if arcs are =, then chords are =.if arc bc = arc de, then bc = de3.diameters perpen