Infinity - inkling 2k23

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

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?

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?

Enter the output:

int main() {

   char a='z';

   printf("%c",(a>='a'?a:'!'));

    return 0;

}

• ZZ

• aa

• z

• a

Select the output:

int main()

{

    int a=10,b=20,c=0;

    c = printf("%d",a)+ ++b;

    printf("%d",c);

}

• 10

• 1023

• 1031

• error

Select the output:

int main()

    {

         printf("%d + %d",3+2);

     }

• 5 + garbage value

• 3+2

• 5

• Error

• garbage value

Select the output:

int main()

   {

         printf("%d %d %d","%d %d",10,20,30,40,50);

    }

Hint: type garbage value as GV

int main()

    {

           int a = 4>3?6>2?10>3?10:70:1>3?30:4>5?40:6>8?50:3>2?90:40:8>9?80:90;

           printf("%d",a);

     }

int main()

{

        int a=0;

        for(printf("A"); a<5; printf("C")){

             printf("B");

             a++;

         }

     }

• ABCBCBCBCBC

• ACBACBACBACBACB

• ABCABCABCABC

• ABACBABCA

int main()

    {

          int a=0;

          a = printf("Hello%d abcd",printf("Welcome%d",10));

          printf("%d",a);

    }

• Welcome10Hello9abcd11

• Welcome10Hello9 abcd11

• Welcome 10 Hello 10 abcd13

• Welcome10Hello10 abcd11