QUESTION 23 A string can be stored in an array using ___________. strlen scanf s
ID: 3918050 • Letter: Q
Question
QUESTION 23
A string can be stored in an array using ___________.
strlen
scanf
strchar
stradd
5.00000 points
QUESTION 24
If you want a program to compare two strings, you would use the __________ function.
strcpy
CompStr
strcmp
strcat
5.00000 points
QUESTION 25
Microsoft Windows is a(n) ______________ operating system, meaning that it is exclusively controlled by Microsoft.
Proprietary
Independent
Dynamic
GUI Dependent
5.00000 points
QUESTION 26
______________ is an artificial and informal language that helps you develop algorithms.
Pseudocode
Algorithm
Fragmentation
Repetition
5.00000 points
QUESTION 27
FIFO stands for __________________.
First In, First Out
First In, Farthest Out
Farthest In, First Out
Farthest In, Farthest Out
5.00000 points
QUESTION 28
Match the term with a description.
Linked Lists
Stacks
Queues
Binary Trees
Collections of Data Items "Lined up in a row". Deletions and Insertions are made anywhere in a linked list.
Facilitate high-speed searching and sorting of data. Efficient elimination of duplicate data items, representing file-system directories and compiling expressions into machine language.
Insertions and deletions are made only at one end of the stack. Made at the top. These are important in compilers and operating systems.
Typically indicates waiting lines. Insertions are amde only at the back of a queue while deletions are made only from the front.
5.00000 points
QUESTION 29
If the printer is busy, other outputs from print spooling will not be generated and halted until released by an administrator.
True
False
C++ questions
strlen
scanf
strchar
stradd
Explanation / Answer
23)A string can be stored in an array using scanf
24)If you want a program to compare two strings, you would use the __________ function.
strcmp
25)Microsoft Windows is a(n) ______________ operating system, meaning that it is exclusively controlled by Microsoft.
Proprietary
26)Pseudocode is an artificial and informal language that helps you develop algorithms.
27)FIFO stands for __________________.
First In, First Out
28)
A Linekd lists -Collections of Data Items "Lined up in a row". Deletions and Insertions are made anywhere in a linked list.
C Stacks- Insertions and deletions are made only at one end of the stack. Made at the top. These are important in compilers and operating systems.
D Queues- Typically indicates waiting lines. Insertions are amde only at the back of a queue while deletions are made only from the front.
B Binary Trees - Facilitate high-speed searching and sorting of data. Efficient elimination of duplicate data items, representing file-system directories and compiling expressions into machine language.
29)If the printer is busy, other outputs from print spooling will not be generated and halted until released by an administrator.
True
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.