Final Control Test PDF

Final control test 1. How to create a structure using the STRUCT keyword. A. Writing B. Unification C. Matrix D. Vector 2. A keyword used to create a structure in C++ A. struct B. structure C. record D. object 3. What is a data structure? A. it is a set of information element...

Final control test 1. How to create a structure using the STRUCT keyword. A. Writing B. Unification C. Matrix D. Vector 2. A keyword used to create a structure in C++ A. struct B. structure C. record D. object 3. What is a data structure? A. it is a set of information elements and relationships between them B. this is a set of data elements C. it is the act of relationships between elements D. it is a set of information elements and relational relations between them 4. Which keyword indicates that an integer variable can only accept positive values? A. unsigned B. positive C. external D. signed 5. What are the four main operations performed on a data structure A. create, delete, select (permit), update B. create, delete, expand, update C. create, select (authorize), expand, update D. create, delete, expand, select (permission) 6. The data structure is at the meaningful (mathematical) stage... A. The processing of a concrete object, their characteristics and relationships are studied B. data display in computer memory is studied C. the development of the algorithm for the given students is studied D. the process of creating a program is explored 7. The data structure is in a logical step... A. the development of the algorithm for the given students is studied. B. data display in computer memory is studied C. The processing of a concrete object, their characteristics and relationships are studied D. the process of creating a program is explored 8. The data structure is in the physical phase... A. data display in computer memory is studied B. The processing of a concrete object, their characteristics and relationships are studied C. the development of the algorithm for the given students is studied D. the process of creating a program is explored 9. A set of non-repeating elements of the same type A. Collection B. Array C. Writing D. Table 10. An array of elements of the same type A. Array B. Writing C. Table D. Collection 11. What structure is created from different types of data? A. Writing B. Array C. Collection D. Table 12. An orderly structure consisting of different types of data fields A. Table B. Array C. Writing D. Collection 13. How can the data structure be represented mathematically? A. S={D,R} B. G={V,E} C. A={D(1.n)} D. B={K,L,R} 14. In C++, show the option that a pointer is properly declared A. int*x B. int&x C. int x D. int[x] 15. Specify the keyword to dynamically allocate memory A. new B. create C. make D. value 16. Specify the keyword to free dynamic memory A. delete B. clear C. free D. cls 17. Show the action with the highest priority A. () B. / C. + D. * 18. Simple and basic structure sets with the same memory size during program execution are called... A. Static data structure B. Dynamic data structure C. A semi-static data structure D. Recursive data structure 19.... is a set of signs or signs that express (classify) an object, process, event or reality A. Information B. Data C. Object 20. The list is… A. this is a class that supports quick insertion and removal of elements of the container. B. this is a static persistent array regardless of whether any action is performed on the container. C. it is a struct class that is open only on one side of sequential containers. D. a dynamic array that supports removal. 21. What type of service is used in a stack structure? A. LIFO B. FIFO C. FLEET D. LILO 22. What type of service is used in the queue structure? A. FIFO B. LIFO C. FLEET D. LILO 23. STL How the function to add a new element to the stack is defined A. Push B. Pop C. Top D. Add 24. How to define the function to delete the top element of the STL stack A. Pop B. Push C. Top D. Delete 25. How to define the function to read the top element of the STL stack A. Top B. Pop C. Push D. Front 26. During the execution of the program, the memory size is determined statically, and the sets of structures used through the descriptor-pointer are called... A. A semi-static data structure B. Static data structure C. Dynamic data structure D. Recursive data structure 27. A constant is a sequence of optional characters enclosed in binary parentheses A. Lined B. Int C. Float D. Char 28. How to declare a stack using the standard template library in C++ A. stack S; B. queue S; C. deque S; D. list S; 29. How to declare a queue using the standard template library in C++ A. queue S; B. stack S; C. deque S; D. list S; 30....- exponent is the only non-arithmetic constant. A. NULL B. LST C. PTR D. KEY 31. How to declare a deck using the standard template library in C++ A. deque S; B. queue S; C. stack S; D. int S; 32. A stack is... A. is a linear data structure and input data. and the release is done by one side of it B. such a structure that it expands as elements are added and accepts elements from only one side C. is a linear data structure, and data input and output is bidirectional D. is a linear data structure, and data input and output is done only in the middle of it 33. The queu is... A. such a structure that it expands as elements are added and accepts elements from only one side. B. is a linear data structure, and data input and output is performed on one side of it C. is a linear data structure, and data input and output is bidirectional D. is a linear data structure, and data input and output is done only in the middle of it 34. The deck is... A. is a linear data structure, and data input and output is bidirectional B. such a structure that it expands as elements are added and accepts elements from only one side C. is a linear data structure, and data input and output is performed on one side of it D. is a linear data structure, and data input and output is done only in the middle of it 35. What keyword is used to specify a null link (empty address). A. NULL B. NaN C. ERROR D. EMP 36. How many pointers are used in a linked list A. 1 B. 2 C. 3 D. 4 37. How many pointers are used in a doubly linked list? A. 2 B. 1 C. 3 D. 4 38. How to declare a list using the standard template library in C++ A. list S; B. queue S; C. deque S; D. stack S; 39. Why is the Next pointer used in linked lists? struct List{int Data; List*Next; }; A. To display the next item B. To display the previous item C. To display the beginning of the list D. To show the end of the list 40. Why are Next and Prev pointers used in doubly linked lists? struct List { int Data; List*Next,*Prev;}; A. To show next and previous elements B. To display only the preceding and following elements C. To display the beginning of the list D. To show the end of the list 41. A list of elements can be lists of how the structure is named A. Dictionary B. A tree C. Count D. List 42.... is to identify an object by referring to this object. A. Recursion B. Algorithm C. Program D. Structure 43. A data structure whose constituent elements have similar elements is called... A. Recursive data structure B. Dynamic data structure C. A semi-static data structure D. Static data structure 44. Who invented the apparatus of recursive functions? A. A Church B. B Mandelbrot C. A Landis D. W Welson 45. What are the steps that solve the recursion problem? A. Recursive triad B. Recursive algorithm C. Recursive relation D. A recursive object 46. What are the stages of a recursive triad? A. parameterization, recursion base and decomposition B. identification, call, change C. easy, medium, difficult D. addition, subtraction, multiplication 47. At which stage of the recursive triad, the parameters for classifying the problem condition and solving it are determined. A. parameterization B. recursion base C. decomposition D. call 48. At which stage of the recursive triad is determined the trivial case in which the solution of the problem is clear, that is, in this case the function does not need to refer to itself. A. recursion base B. decomposition C. parameterization D. call 49. At which stage of the recursive triad the general situation is represented by the relatively simple changed parameter part through problems. A. decomposition B. recursion base C. parameterization D. call 50. There is no reference to such an element in the tree structure, which is considered... a node. A. root B. branch (intermediate) C. leaf D. terminal 51. If there are no references to other elements in a tree structure, it is considered a... node. A. leaf B. intermediate C. root D. terminal 52. When is a tree considered balanced? A. if the height difference of its left and right part trees is not more than 1 B. if the width of its left and right trees does not differ C. if its left and right trees have the same number of leaves D. If its intermediate nodes are even-valued 53. What is a non-linear data structure? A. Tree, graph B. Stack, Deck, Queue C. Record, Table D. Graph, Vector 54. The height of the tree is... A. number of tree steps B. number of nodes C. number of spacer elements D. the number of leaves 55. A tree level is a... A. The maximum value of the number of relations of a node belonging to the tree B. The minimum value of the number of relations of a node belonging to the tree C. Number of tree stages D. Number of nodes 56. A tree with minimum height A. HEAP TREE B. BINARY SEARCH TREE C. Red Black Tree D. 2-3 TREE 57. Show the result of a correct (top-down) scan operation for a binary tree B /\ AS A. BAC B. ACB C. ABC D. CAB 58. What is a dynamic data structure? A. is a data structure whose number, arrangement, and relationship of elements dynamically change during program execution based on this pattern. B. is a data structure whose location and relationship are dynamically immutable during program execution based on this pattern. C. is a set of relations that show the relationship between the elements (data) that make up the structure. D. the number of elements in the process of creating a structure and a set of relationships that show the relationship between them. 59. What is the constructor function of the class object? A. Create an object of the given class B. Delete an object of the given class C. Limiting the reference of the object of the given class D. Protecting an object of a given class 60. What is the Destructor function of class (class)-object? A. Delete an object of the given class B. Protecting an object of a given class C. Create an object of the given class D. Determining the length of an object of a given class 61. What does the word deck mean? A. A two-way input and output queue is considered B. It is a one-stop queue C. is a queue with only one edge D. only a queue to enter from one side and exit from the other 62. What is an algorithm? A. A certain sequence of actions to solve a problem B. A certain sequence of categories C. Sequence of keys D. Action must have a clear meaning 63. What is recursion? A. The function body tells the function to call itself B. The loop execution operator is told C. The condition is told to the check operator D. The category detection algorithm is told 64. Text extension of LIFO queue type? A. Last In First Out B. Left In First Out C. Last In First On D. Left In First On 65. Text extension of FIFO queue type? A. First In First Out B. First In First On C. Fast In First Out D. Fast In Fast Out 66. Binary Search Algorithm... A. The sequence is based on dividing by two, if it is large it takes the array between the end and the middle, if it is small it takes the array between the beginning and the middle, the process repeats until the array is equal to the element or until there are no more elements in the array. B. n - 1 times are compared to the keys pairwise, going from bottom to top in the array. C. This algorithm compares each element in the array one by one with the searched element. D. This algorithm is recursive and sorts on average N*log2N comparisons. 67. What is a linked list? A. In a structure, if elements are connected to the element after it B. In a structure, elements are linked to the preceding and succeeding element C. In a structure, elements are linked to their predecessors D. In a structure, elements are connected to at least two preceding elements 68. What is a doubly linked list? A. while each element is linked to the element before it and the element after it B. while each element is linked to the element before it C. while each element is linked to the element after it D. if each element is connected to one element after it 69. How can the data structure be represented mathematically? A. S={D,R} B. G={V,E} C. A={D(N..1)} D. BT={K,L,R} 70. What is the name of the tree, if its output level does not exceed two. A. Binary B. Ternary C. Tetrad D. Multi-layered 71. How many and which view operations are defined in the search tree A. Three (straight, inverted, symmetrical) B. Two (width and depth) C. Two (width and length) D. Three (straight, inverted, reflected) 72. The length of the tree is... A. number of nodes B. number of tree steps C. number of spacer elements D. the number of leaves 73. Output a sequence of tree nodes in any order A. The act of seeing B. Tree length C. Tree height D. Tree width 74. What does hash mean? A. Confusion, mixture B. node C. the key D. value 75.... is a data structure in the form of an associative array whose elements are key-value pairs. Find the sentence that matches the ten points. A. A hash table B. hash-key C. hash function D. rehash 76. What is sorting? A. It is the process of arranging the elements of a given set in some order (increasing and decreasing). B. It is a list of elements matching the given set C. Collections Place all elements together D. Arrange all elements of the collection in ascending order 77. What is the List of Edges in a Graph? A. edges is a linear list of pairs of adjacent nodes B. Sorting by loading of arcs C. A list variable D. Select the edges(arcs) incident to a given node 78. Sorting –...? A. it is the process of arranging the elements of a given set in some order B. it is the only arrangement of the elements of a given set in ascending order C. it is just a decreasing arrangement of the elements of a given set D. there is no correct answer 79. Show the result of the reverse (bottom-up) scan operation for a binary tree B /\ AS A. ACB B. BAC C. ABC D. CAB 80. Show the result of a symmetric (left-to-ten) scan operation for a binary tree B /\ AS A. ABC B. ACB C. BAC D. CAB 81. What is the name of the tree, if its exit level does not exceed two A. Binary B. Ternary C. Tetrad D. Multi-layered 82. A non-linear hierarchically linked data structure is a … A. A tree B. Graph C. Dictionary D. List 83. If the number of elements is 100, then what is the height of the tree with the minimum height? A. 7 B. 8 C. 9 D. 10 84. If a tree with minimum height is 10, then what is the maximum number of elements? A. 1023 B. 1024 C. 2047 D. 2048 85. If the number of elements is 10, then what is the height of the tree with the minimum height? A. 4 B. 1 C. 3 D. 2 86. A nonlinear multi-link dynamic structure that reflects the properties and relationships of complex objects. A. Graph B. Dictionary C. A tree D. List 87. How can the structure of a graph be represented mathematically? A. G={V,E} B. G={D,R} C. G={D(1,n)} D. G={K,L,R} 88. If edges are used to describe the relationships of a graph, then the graph is called... A. Indirected B. Directed C. Mix D. Has weight 89. If arcs are used to describe the relations of a graph, then the graph is called... A. Directed B. Indirected C. Mix D. Has weight 90. If arcs and edges are used to describe the relationships of a graph, then the graph is called... A. Mix B. Indirected C. Directed D. Has weight 91. If a weight value is assigned to the relations of a graph, then the graph is called... A. Has weight B. Indirected C. Directed D. Mix 92. What is the order of the graph? A. To the number of three B. To the number of edges C. For the number of edges and ends D. For the number of loops 93. What is the size of the graph? A. To the number of edges B. To the number of three C. For the number of edges and ends D. For the number of loops 94. The node level of the graph is A. the number of edges coming out of it is counted B. the number of nodes coming out of it is counted C. the arithmetic mean number of edges coming out of it is calculated D. the edges coming out of it are counted as the geometric mean number 95. How many and which ones represent viewing operations in the graph A. Two (width and depth) B. Two (width and length) C. Three (straight, inverted, reflected) D. Three (straight, inverted, symmetrical) 96. What container is used to view the bottom of the graph? A. stack B. queue C. the list D. deck 97. What container is used to view the graph horizontally? A. queue B. stack C. the list D. deck 98. If there is an edge in a graph whose beginning and end are connected at one node, it is called.... A. Hook B. Ring C. Road D. Degree 99. A sequence of adjacent nodes from one node to another is called... A. Road B. Ring C. Hook D. Degree 100.... is a path consisting of a node connecting the beginning and the end. A. Ring B. Road C. Hook D. Degree 101. If the degree of saturation D of the graph is greater than 0.5, then the graph... is calculated A. Saturated B. Rare C. Secondary D. Full 102. If the degree of saturation D of the graph is less than 0.5, then the graph... is calculated. A. Rare B. Saturated C. Secondary D. Full 103. If the degree of saturation D of the graph is equal to 1, then the graph... is calculated. A. Full B. Rare C. Saturated D. Secondary 104. Finding data in an array that matches the given argument A. Search B. Sorting C. Algorithmization D. Methodology 105. What is the idea of linear search? A. each element is considered sequentially B. elements are considered sequentially starting from the middle of the table C. browsing items sequentially from beginning to end and vice versa, excluding 2 items D. all nodes of the binary tree are considered 106. What is a unique key? A. if in the table there is only information whose key is equal to this key B. if the sum of two data values is equal to the key C. if the table does not have an element with such a key D. if the difference of two data values is equal to the key 107. What is the order of the sequential search algorithm? A. Linear B. Logarithmic C. Constantly D. Exponential 108. What is the order of the binary search algorithm A. Logarithmic B. Linear C. Constantly D. Exponential 109. What is the order of the hashing algorithm? A. Constantly B. Linear C. Logarithmic D. Exponential 110. Hashing is… A. A hash table is filled in the field of the function. and is searched for B. The data is looked up sequentially from the smallest address to the largest address in the RAM according to the entire table C. Gets the middle element of the given array D. A group is found from the table of indices, and the linear algorithm is increased within the appropriate bounds specified in it 111. What is the name of sorting done in RAM A. internal sorting B. complete selection C. external sorting D. sort address table 112. Which sort methods have O(N2), key comparison order? A. strictly B. binary C. improved D. logarithmic 113. The process of placing the elements of a given set in a certain order A. Sorting B. Search C. Algorithmization D. Methodology 114. A sorting method is called... if the relative position of elements with the same key does not change during the sorting process A. stable B. difficult C. typical D. Not stable (unstable) 115. Show the algorithm order of the QuickSort method A. Logarithmic B. Linear C. Quadratic D. Differential 116. Show the order of algorithms of strict methods A. Quadratic B. Cubic C. Logarithmic D. Differential 117. What criteria are used to determine the effectiveness of sorting? A. number of comparisons and permutations B. time taken to write the program C. the number and types of identifiers in use D. number of operations 118. What sorting methods are defined as strict methods? A. add directly; direct selection; direct replacement B. Quick sorting; Shella sorting; Merge Sort C. Consolidation Qualifier; direct selection; direct replacement D. Quick sorting, direct selection; direct replacement 119. What sorting methods are defined as improved methods? A. Quick sorting; Shella sorting; Merge Sort B. add directly; direct selection; direct replacement C. Consolidation Qualifier; direct selection; direct replacement D. Quick sorting, direct selection; direct replacement