Worksheets1-100 Жоғары деңгейлі тілдерде программалау (ағылшын тілінде)
Total questions: 100
Worksheet time: 50mins
Name
Class
Date
1.
Requirements for identifiers:
a)
Identifiers must not match any keywords.
b)
“$$$” It must start with symbols.
c)
Must match the keywords.
d)
Identifiers have no restrictions.
e)
“_” It is better not to start with a symbol.
2.
Stages of Programming Development:
a)
The Birth of Machine Language Programming.
b)
The Emergence of Functions.
c)
The Emergence of Objects.
d)
The Emergence of Semantic Programming.
e)
The Emergence of High-Level Programming.
3.
Module in a Programming Language:
a)
Composed of data and the functions that manipulate them.
b)
A functionally incomplete part of a program.
c)
Composed of data.
d)
Composed of objects.
e)
Composed of models.
4.
Works with current extended characters (wchar_t).The class used for this is:
a)
Wistream.
b)
Tream.
c)
Fstream.
d)
Sstream.
e)
Ssstream.
5.
Description of the Derived Class:
a)
No symbol is placed after the identifier name.
b)
It must match the keywords.
c)
There are no restrictions on the class identifier.
d)
There are no restrictions on class members.
e)
The ” ::” symbol is used to refer to inherited functions.
6.
Python object:
a)
Function
b)
Operator
c)
Type
d)
Variable
e)
Identifier
7.
>> operation:
a)
Reads data entered from the keyboard.
b)
Less than symbol.
c)
Greater than symbol.
d)
Shift operation by one position.
e)
Displays data on the screen according to the variable type.
8.
Negation operation:
a)
-.
b)
//.
c)
\.
d)
=.
e)
%.
9.
Bitwise operations:
a)
&.
b)
_.
c)
/.
d)
*.
e)
+.
10.
Object А and object b belong to the same class С.The following expression evaluates to «true»:
a)
dir(a)==dir(b)
b)
isinctance(type(b), dir(a))
c)
issubclass(b, C)
d)
dir(a) is dir(b)
e)
dir(a) in dir(b)
11.
«math» predefined objects in the header file:
a)
sin()
b)
factorial()
c)
abc()
d)
Continue()
e)
break()
12.
istream::get() function's purpose:
a)
Inserts a character into vectors.
b)
Does not match keywords.
c)
Reads external variables.
d)
The Get() function does not return a reference to the istream stream.
e)
The state of the Istream stream is checked.
13.
ostream stream:
a)
Sends characters to a file,main memory,or another computer.
b)
Input stream.
c)
Converts a sequence of characters into values of different types.
d)
Receives characters from main memory or another computer.
e)
Abstract capabilities of the operating system.
14.
istream stream:
a)
Input stream.
b)
Sends characters to a file, console, or another computer.
c)
Abstract capabilities of the operating system.
d)
Operating system.
e)
Output stream.
15.
For reading a file:
a)
The file must be opened.
b)
The file must be deleted.
c)
A new file must be created.
d)
Objects must be written to the file.
e)
Files must be copied to the buffer.
16.
To write to a file:
a)
The file must be named.
b)
The file must be opened.
c)
Characters must be read.
d)
The file name must be changed.
e)
The file name must be known.
17.
Operations that determine the stream state:
a)
Good().
b)
Void main().
c)
Cout().
d)
Iostream().
e)
Istream().
18.
istream specify the function for reading in the class:
a)
Get().
b)
Flush().
c)
Seerg(pos).
d)
Put(c).
e)
Teug().
19.
Description of an array:
a)
a=[3,2,1]
b)
Float a(10)
c)
Ios_base[]
d)
Ios_base()
e)
Cout “scientific”1234.456789”/n’
20.
Notation of an array element:
a)
A[10]
b)
A(10)
c)
Ios_base[]
d)
Students [{0}]-
e)
Ios_base()
21.
Array description:
a)
Indexing starts from 0.
b)
Does not match keywords.
c)
There are no restrictions on identifiers.
d)
The Get() function does not return a reference to the istream stream.
e)
Checks the state of the Istream stream.
22.
Array identifier:
a)
A value cannot be assigned to an array identifier.
b)
Input stream.
c)
Converts a sequence of characters into values of different types.
d)
Receives characters from main memory or other components.
e)
Abstract capabilities of the operating system.
23.
Description of special arguments of the main function in arrays:
a)
Int main (int arge.char*argv[]) {//…
b)
Int main (arge.char*argv[]) {//…
c)
Main (int arge.char*argv[]) {}///;
d)
Main (int arge.char**argv[]) {//…
e)
Main (int arge.char*argv[]) {//…
24.
Functions used to convert an array of ASCII characters to int, long, and double types:
a)
Int().
b)
Long().
c)
Double().
d)
Argv().
e)Atoi().
25.
a)24
b)31
c)27
d)28
e)7
26.
Arithmetic operations applied to array elements:
a)
+.
b)
= =.
c)
<.
d)
*.
e)
/.
27.
ceil() function:
a)
Located in the math header file.
b)
Located in the Strlib.h header file.
c)
Adds characters and counts the terminating 0 in the character array.
d)
Counts the numbers in the array.
e)
Determines the length of the array index.
28.
stremp(s1, s2) the result returned by the function:
a)
Positive number.
b)
Reference.
c)
Reference to S1.
d)
001.
e)
#1.
29.
In Python, the following operations are performed in a function:
a)
Defining a function.
b)
Importing a library.
c)
The function has no members.
d)
Replacing a function.
e)
Comparing a function with another function.
30.
Description of the function name:
a)
Void print(int).
b)
Float a (10).
c)
Void ios_base[].
d)
Copying a function to another function.
e)
Calling a function.
31.
Function prototype:
a)
Int h(int).
b)
Int_(char).
c)
G(2).
d)
G(3).
e)
G(double).
32.
Features of using a pointer in a function:
a)
First, the function address must be assigned to the pointer.
b)
The pointer does not indicate the function’s address.
c)
It is not assigned to a pointer variable.
d)
Arguments are specified after the function name.
e)
The function name is given with the argument list.
33.
To make a function not return a value:
a)
The Void keyword is written.
b)
The main keyword means “returns nothing.”
c)
The main keyword is written.
d)
The return statement is not written at the end of the function.
e)
Use the main keyword instead of a given value.
34.
Calling an old-style function:
a)
Old_style().
b)
Old_style[].
c)
Old_style[12, 13, 14].
d)
Old_style ≥ (12, 13, 14, 15, 16).
e)
Old_style = (12, 14).
35.
Trigonometric function in Python:
a)
sin()
b)
pow()
c)
exp()
d)
frexp()
e)
fabs()
36.
Function for calculating logarithm in Python:
a)
log()
b)
ln1p()
c)
ln()
d)
lnd10()
e)
ld()
37.
If a function returns a value, exiting the function is done using return:
a)
Expression.
b)
Computation.
c)
Operation.
d)
Operator.
e)
Stream.
38.
If a function returns a value, exiting the function is done using return:
a)
Expression.
b)
Parameter.
c)
Computation.
d)
Operation.
e)
Operator.
39.
It is possible to overload a function:
a)
By the type of the function’s argument.
b)
Using the «||» operator.
c)
By returning a stream.
d)
By using the «::» operator for computation.
e)
Using the return operator.
40.
It is not possible to overload a function:
a)
If parameters are differently specified with the const modifier.
b)
By the type of the function’s argument.
c)
By returning a stream.
d)
By the number of function arguments.
e)
Through computation.
41.
Belongs to dynamic data structures:
a)
Singly linked lists.
b)
+,*,/ operators.
c)
Abstract lists.
d)
Alphabetical lists.
e)
Files.
42.
Example of a dynamic data structure:
a)
Stack.
b)
Function.
c)
Comparison operators.
d)
Queue.
e)
Stream.
43.
Does not belong to dynamic data structures:
a)
Function.
b)
Deque.
c)
Stack.
d)
Circular lists.
e)
Binary trees.
44.
Description of a dynamic data structure:
a)
The structure has no name.
b)
A name must be given to the structure.
c)
The size of the structure is limited.
d)
Memory is not allocated during program execution.
e)
Memory is allocated during program execution.
45.
Feature of a dynamic data structure:
a)
The size of the structure can change during program execution.
b)
The size of the structure does not change during program execution.
c)
A name must be assigned to the structure.
d)
The size of the structure is limited.
e)
The number of structure elements is limited.
46.
Operations performed inside the body of a recursive function:
a)
{Р operators}.
b)
Р {operators}.
c)
-, --, ++ operators.
d)
{ } Р; operators.
e)
>>, <<, || operators.
47.
Using types of data structures to create a recursive algorithm:
a)
Extensive.
b)
Various.
c)
Algorithmic.
d)
Semantic.
e)
Machine.
48.
Commands used to organize a recursive call:
a)
Write to the stack.
b)
Write to the function.
c)
Write to a file.
d)
Read from the function.
e)
Write to a file, read from the function.
49.
Components of efficient functions for algorithm implementation in software:
a)
RAM resources in the code area.
b)
V(D constant RAM resources.
c)
Vехе software system.
d)
G() constant memory resources in the services area.
e)
V() constant memory resources in the code area.
50.
NPR subclasses of the classification:
a)
NPRV.
b)
NPR.
c)
PIPR.
d)
ExPR.
e)
PIPR, ExPR.
51.
Programs implemented using recursion:
a)
Algorithm for finding the square root.
b)
Creating an alphabet.
c)
Programming using ||, **, --, ++ .
d)
G() constant memory resources in the services area.nt>“”, ‘’.
e)
Creating recursion.
52.
The following problems can serve as examples of recursive algorithms:
a)
Factorial.
b)
Algorithm to find the larger of two numbers.
c)
Algorithm for entering and outputting an array.
d)
Algorithm for calculating a logarithm.
e)
Finding the sum of two numbers.
53.
Types of program testing:
a)
Testing of modules and systems.
b)
Final testing.
c)
Program testing
d)
Compute testing.
e)
Parper testing.
54.
Module testing:
a)
ISO standard specification.
b)
Retesting the module.
c)
Algorithmic testing.
d)
Result is an integer.
e)
Making corrections to the program after testing.
55.
Errors during compilation:
a)
Syntax errors.
b)
Errors found using a graphical editor.
c)
Errors in file inclusion.
d)
Errors found by triggers.
e)
Errors found using libraries.
56.
Errors during linked editing:
a)
Errors found using the linker.
b)
Syntax errors.
c)
Type-related errors.
d)
Errors found by the computer.
e)
Errors found using libraries.
57.
Main causes leading to errors:
a)
Insufficient specification.
b)
File name.
c)
Creating a new file.
d)
Objects.
e)
Errors found while copying files to the buffer.
58.
Serves as the source of errors:
a)
Undeclared input data.
b)
Opening a file.
c)
Reading characters.
d)
Changing the file name.
e)
File name.
59.
Syntax error line:
a)
Int s1 = area(7).
b)
Int s5 = area(7).
c)
Int s2 = area(7).
d)
Int s3 = area(7).
e)
Int s4 = area(7).
60.
Description of working with Exception:
a)
Does not execute the return operator.
b)
Uses the cout operator.
c)
Does not execute the iostream operator.
d)
Uses the istream operator.
e)
Uses the ostream operator.
61.
Operators that work with Exception:
a)
Catch.
b)
True.
c)
Wc.cbWndExtra.
d)
NULL.
e)
UNREFERENCE.
62.
Errors related to type ranges:
a)
Off-by-obe error.
b)
Undeclared input data.
c)
Logical errors.
d)
Undeclared library.
e)
Obe error.
63.
Types of exceptions generated by the Vector class in the standard library:
a)
Out_of_range.
b)
Runtime_error, out_of_size.
c)
Out_of_size, out, runtime_error.
d)
Out_of_size.
e)
Out.
64.
Restoring the program:
a)
Compiling the program.
b)
Turning off the system unit.
c)
Defining the program.
d)
Establishing a connection.
e)
Executing the program.
65.
Stages of program development:
a)
Analysis.
b)
Conclusion.
c)
Modularization.
d)
Updating.
e)
Testing.
66.
Types of lexemes:
a)
Floating-point literals.
b)
Quotation marks.
c)
Function.
d)
Operations.
e)
Flowcharts.
67.
A lexeme is:
a)
Number.
b)
Module.
c)
Algorithm.
d)
Program.
e)
Machine.
68.
Lexeme classes include:
a)
Identifiers.
b)
Link editor.
c)
Syntax.
d)
Module.
e)
Compiler.
69.
Lexeme classes include:
a)
String literals.
b)
Link editor.
c)
Syntax.
d)
Module.
e)
Compiler.
70.
Levels of abstraction for simple systems in object-oriented design:
a)
Application view of the system.
b)
File description.
c)
Class description.
d)
Dynamic view of the system.
e)
System view.
71.
Design purpose:
a)
Modeling the system according to the level of detail.
b)
Modeling the system according to the object-oriented level.
c)
Modeling the system according to the machine level.
d)
Modeling the system according to the machine-code level.
e)
Modeling the system according to the object-oriented and class level.
72.
Stages of program creation:
a)
Testing.
b)
Program selection.
c)
Modularity.
d)
Validation.
e)
Verification.
73.
Stages of program creation:
a)
Documentation.
b)
Objectification.
c)
Creating the object space.
d)
Encapsulation.
e)
Analysis of module hierarchy.
74.
Purpose of using templates in program design:
a)
Generalization of programming.
b)
Generalization of undeclared input data.
c)
Eliminating logical errors.
d)
Eliminating unexpected states.
e)
Eliminating unexpected states and logical errors.
75.
Verification is closely related to:
a)
Testing.
b)
Validation.
c)
Branching.
d)
Repetition.
e)
Delivery.
76.
Belongs to the validation process:
a)
Qualification of project documentation.
b)
Qualification of the program.
c)
Qualification of testing.
d)
Qualification of linking.
e)
Qualification of checking.
77.
Belongs to the operation of a simple interpreter:
a)
Reading an instruction.
b)
Defining a module.
c)
Reading an algorithm.
d)
Analyzing the program.
e)
Checking machine code.
78.
Types of compilation:
a)
Batch.
b)
Interactive.
c)
Syntax-based.
d)
Reverse.
e)
Test.
79.
Function of linking (linker):
a)
Stores in different files to increase reliability.
b)
Opens the file to increase reliability.
c)
Syntax-directed analysis.
d)
Determines file names.
e)
Semantic-directed analysis.
80.
Stages performed in the process of program recovery:
a)
Translating the program’s source text.
b)
Entering the source text into the program.
c)
Modifying the program’s source text.
d)
Executing the program to detect semantic errors.
e)
Deleting the program.
81.
The compilation process consists of the following stages:
a)
Lexical and semantic analysis.
b)
Sequencing and definition.
c)
Arrangement and importing.
d)
Identification.
e)
Constant handling.
82.
Compilation structure includes:
a)
Lexical analysis.
b)
Input data analysis.
c)
Logical analysis.
d)
Unexpected state analysis.
e)
Obe_error analysis.
83.
Compilation stages:
a)
Optimization.
b)
Program execution.
c)
Structured programming by levels.
d)
Structural analysis.
e)
Structured programming.
84.
Software testing:
a)
Software investigation process.
b)
Exiting the program.
c)
Defining the program.
d)
Establishing a connection.
e)
Alpha testing.
85.
Program linking (linker):
a)
Executable (load) module.
b)
Formation of listing and object module.
c)
Creation of symbol table.
d)
Expansion of macros.
e)
Code and data in object files remain unchanged.
86.
Tasks solved during translation stages:
a)
Creation of symbol table.
b)
Preventing a load file with .exe extension as a result.
c)
Modifying code and data in object files.
d)
Executable (load) module.
e)
Preventing a load file with .cpp extension as a result.
87.
Translation based on text structure:
a)
Syntax term is used.
b)
Interface term is used.
c)
Windows OS function library is used.
d)
Informational application is used.
e)
Application term is used.
88.
Syntax of a language:
a)
Consists of a set of rules for constructing text.
b)
Consists of a set of rules for integrating language constructs and sentences.
c)
Determines the meaning of a sentence.
d)
Processes information in a sentence.
e)
Translates text into a language understandable by the computer.
89.
The syntax of a language is:
a)
A set of rules for integrating language constructs and sentences.
b)
A set of rules for constructing text.
c)
Determines the correct structure of a sentence and its components.
d)
Processes information in a sentence.
e)
Translates text into a language understandable by the computer.
90.
Requirements for implementing a compiler:
a)
Completeness and convenience of the language standard.
b)
Formality.
c)
Modularity.
d)
Capacity.
e)
Efficiency.
91.
Main functions of a compiler for formal languages:
a)
Reading the source program’s language.
b)
16 bits
c)
Generating batch types.
d)
8 bits
e)
32 bits
92.
Main phases of a compiler:
a)
Lexical analysis.
b)
Syntax analysis.
c)
Result analysis.
d)
Initial analysis.
e)
Program analysis.
93.
Main phases of a compiler:
a)
Preparing for code generation.
b)
Preparing for iteration generation.
c)
Generating iteration.
d)
Graphical generation.
e)
Semantic pass.
94.
Code generation is:
a)
Producing the final code of the translation.
b)
Reading the source program’s language.
c)
Generating the resulting program in the given language.
d)
Code generation.
e)
Translational pass.
95.
Types of optimization:
a)
Machine-independent.
b)
Code generation.
c)
Machine-dependent.
d)
Formal-dependent.
e)
Formal-independent.
96.
Global optimization:
a)
Performed on the program graph.
b)
Controls the user interface.
c)
Functions as an operating system.
d)
Is a standard windowed-oriented interface.
e)
Compatible with the Windows system.
97.
Analysis phases during compilation:
a)
Linear analysis.
b)
Syntax analysis.
c)
Result analysis.
d)
Initial analysis.
e)
System analysis.
98.
Hierarchical structure of a program is expressed using recursive rules. Rule for defining an expression:
a)
Any identifier is considered an expression.
b)
Rule for processing macros.
c)
Rule for including files.
d)
Rules of “intelligent” processors.
e)
Any function is considered an expression.
99.
Functions that can be performed using preprocessors:
a)
Processing macros.
b)
Converting any function into an expression.
c)
Converting any module into an expression.
d)
Converting any number into an expression.
e)
If expression1 and expression2 are expressions, then convert the value of expression1 into an expression.
100.
Translation phases:
a)
Semantic analysis.
b)
Compiler analysis.
c)
Lexical analysis.
d)
Syntax analysis.
e)
Syntactic analysis.
100 %
