
Infinity - inkling 2k23
Authored by Infinity 2k23
Computers
University
Used 8+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
57 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following statements about red-black trees is not true?
They are self-balancing binary search trees
They maintain a balance factor of -1, 0, or 1 at each node
They have a worst-case time complexity of O(log n) for insertion, deletion, and search operations
They have a height of O(n) in the worst case
They guarantee a height of O(log n) in the worst case
2.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
How do you write a regular expression to match the following string pattern:
A string of exactly three characters, where the first and last characters are the same, and the middle character is a digit?
(a)
3.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
How do you write a regular expression to match the following string pattern:
a string that begins with a digit, ends with any word character, and has exactly five characters in total?
(a)
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Enter the output:
int main() {
char a='z';
printf("%c",(a>='a'?a:'!'));
return 0;
}
ZZ
aa
z
a
5.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
Select the output:
int main()
{
int a=10,b=20,c=0;
c = printf("%d",a)+ ++b;
printf("%d",c);
}
10
1023
1031
error
6.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
Select the output:
int main()
{
printf("%d + %d",3+2);
}
5 + garbage value
3+2
5
Error
garbage value
7.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
Select the output:
int main()
{
printf("%d %d %d","%d %d",10,20,30,40,50);
}
Hint: type garbage value as GV
(a)
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?