Infinity - inkling 2k23

Which of the following statements about red-black trees is not true?

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)  

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)  

Enter the output:

int main() {

   char a='z';

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

    return 0;

}

Select the output:

int main()

{

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

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

    printf("%d",c);

}

Select the output:

int main()

    {

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

     }

Select the output:

int main()

   {

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

    }

Hint: type garbage value as GV

(a)  

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);

     }

(a)  

int main()

{

        int a=0;

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

             printf("B");

             a++;

         }

     }

int main()

    {

          int a=0;

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

          printf("%d",a);

    }