Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
A given set of processes can be implemented by using only parbegin parend statement if the precedence graph of these processes is ______ | Precedence Graph | 134 |
Let f x y z bar x bar y x xz be a switching function Which one of the following is valid bar y x is a prime implicant of f xz is a minterm of f xz is an implicant of f y is a prime implicant of f | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
Let f x y z bar x bar y x xz be a switching function Which one of the following is valid bar y x is a prime implicant of f xz is a minterm of f xz is an implicant of f y is a prime implicant of f | Prime Implicants | 135 |
Let f x y z bar x bar y x xz be a switching function Which one of the following is valid bar y x is a prime implicant of f xz is a minterm of f xz is an implicant of f y is a prime implicant of f | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
Let f x y z bar x bar y x xz be a switching function Which one of the following is valid bar y x is a prime implicant of f xz is a minterm of f xz is an implicant of f y is a prime implicant of f | Prime Implicants | 135 |
Which are the essential prime implicants of the following Boolean function f a b c a c ac b c a c and ac a c and b c a c only ac and bc | Prime Implicants | 135 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
A priority queue Q is used to implement a stack that stores characters PUSH C is implemented as INSERT Q C K where K is an appropriate integer key chosen by the implementation POP is implemented as DELETEMIN Q For a sequence of operations the keys chosen are in non increasing order non decreasing order strictly increasing order strictly decreasing order | Priority Queue | 136 |
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non preemptive scheduler a uni programmed operating system | Process | 138 |
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non preemptive scheduler a uni programmed operating system | Process | 138 |
The process state transition diagram of an operating system is as given below Which of the following must be FALSE about the above operating system It is a multiprogrammed operating system It uses preemptive scheduling It uses non preemptive scheduling It is a multi user operating system | Process | 138 |
The process state transition diagram of an operating system is as given below Which of the following must be FALSE about the above operating system It is a multiprogrammed operating system It uses preemptive scheduling It uses non preemptive scheduling It is a multi user operating system | Process | 138 |
Which combination of the following features will suffice to characterize an OS as a multi programmed OS More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I O another program is immediately scheduled for execution If the execution of a program terminates another program is immediately scheduled for execution a a and b a and c a b and c | Process | 138 |
Which combination of the following features will suffice to characterize an OS as a multi programmed OS More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I O another program is immediately scheduled for execution If the execution of a program terminates another program is immediately scheduled for execution a a and b a and c a b and c | Process | 138 |
Which combination of the following features will suffice to characterize an OS as a multi programmed OS More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I O another program is immediately scheduled for execution If the execution of a program terminates another program is immediately scheduled for execution a a and b a and c a b and c | Process | 138 |
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non preemptive scheduler a uni programmed operating system | Process | 138 |
Which combination of the following features will suffice to characterize an OS as a multi programmed OS More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I O another program is immediately scheduled for execution If the execution of a program terminates another program is immediately scheduled for execution a a and b a and c a b and c | Process | 138 |
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non preemptive scheduler a uni programmed operating system | Process | 138 |
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non preemptive scheduler a uni programmed operating system | Process | 138 |
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non preemptive scheduler a uni programmed operating system | Process | 138 |
Consider the following set of processes with the arrival times and the CPU burst times gives in milliseconds Process Arrival Time Burst Time P1 P2 P3 P4 0 1 2 4 5 3 3 1 What is the average turnaround time for these processes with the preemptive shortest remaining processing time first SRPT algorithm 5 50 5 75 6 00 6 25 | Process Schedule | 139 |
Four jobs to be executed on a single processor system arrive at time 0 in the order A B C D Their burst CPU time requirements are 4 1 8 1 time units respectively The completion time of A under round robin scheduling with time slice of one time unit is 10 4 8 9 | Process Schedule | 139 |
When the result of a computation depends on the speed of the processes involved there is said to be cycle stealing race condition a time lock a deadlock | Process Synchronization | 140 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if then else forward go to arbitrary go to non recursive procedure call recursive procedure function call repeat loop which constructs will you not include in a programming language such that it should be possible to program the terminates i e halting function in the same programming language ii iii iv v vii viii vi vii viii iii vii viii | Programming Constructs | 141 |
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2 Group 1 Group 2 P Functional Q Logic R Object oriented S Imperative 1 Common based procedural 2 Imperative abstract data types 3 Side effect free declarative expression evaluations 4 Declarative clausal representation theorem proving P 2 Q 3 R 4 S 1 P 4 Q 3 R 2 S 1 P 3 Q 4 R 1 S 2 P 3 Q 4 R 2 S 1 | Programming Paradigms | 142 |
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2 Group 1 Group 2 P Functional Q Logic R Object oriented S Imperative 1 Common based procedural 2 Imperative abstract data types 3 Side effect free declarative expression evaluations 4 Declarative clausal representation theorem proving P 2 Q 3 R 4 S 1 P 4 Q 3 R 2 S 1 P 3 Q 4 R 1 S 2 P 3 Q 4 R 2 S 1 | Programming Paradigms | 142 |
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2 Group 1 Group 2 P Functional Q Logic R Object oriented S Imperative 1 Common based procedural 2 Imperative abstract data types 3 Side effect free declarative expression evaluations 4 Declarative clausal representation theorem proving P 2 Q 3 R 4 S 1 P 4 Q 3 R 2 S 1 P 3 Q 4 R 1 S 2 P 3 Q 4 R 2 S 1 | Programming Paradigms | 142 |
The goal of structured programming is to have well indented programs be able to infer the flow of control from the compiled code be able to infer the flow of control from the program text avoid the use of GOTO statements | Programming Paradigms | 142 |
The goal of structured programming is to have well indented programs be able to infer the flow of control from the compiled code be able to infer the flow of control from the program text avoid the use of GOTO statements | Programming Paradigms | 142 |
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2 Group 1 Group 2 P Functional Q Logic R Object oriented S Imperative 1 Common based procedural 2 Imperative abstract data types 3 Side effect free declarative expression evaluations 4 Declarative clausal representation theorem proving P 2 Q 3 R 4 S 1 P 4 Q 3 R 2 S 1 P 3 Q 4 R 1 S 2 P 3 Q 4 R 2 S 1 | Programming Paradigms | 142 |
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2 Group 1 Group 2 P Functional Q Logic R Object oriented S Imperative 1 Common based procedural 2 Imperative abstract data types 3 Side effect free declarative expression evaluations 4 Declarative clausal representation theorem proving P 2 Q 3 R 4 S 1 P 4 Q 3 R 2 S 1 P 3 Q 4 R 1 S 2 P 3 Q 4 R 2 S 1 | Programming Paradigms | 142 |
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2 Group 1 Group 2 P Functional Q Logic R Object oriented S Imperative 1 Common based procedural 2 Imperative abstract data types 3 Side effect free declarative expression evaluations 4 Declarative clausal representation theorem proving P 2 Q 3 R 4 S 1 P 4 Q 3 R 2 S 1 P 3 Q 4 R 1 S 2 P 3 Q 4 R 2 S 1 | Programming Paradigms | 142 |
The goal of structured programming is to have well indented programs be able to infer the flow of control from the compiled code be able to infer the flow of control from the program text avoid the use of GOTO statements | Programming Paradigms | 142 |
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2 Group 1 Group 2 P Functional Q Logic R Object oriented S Imperative 1 Common based procedural 2 Imperative abstract data types 3 Side effect free declarative expression evaluations 4 Declarative clausal representation theorem proving P 2 Q 3 R 4 S 1 P 4 Q 3 R 2 S 1 P 3 Q 4 R 1 S 2 P 3 Q 4 R 2 S 1 | Programming Paradigms | 142 |
The goal of structured programming is to have well indented programs be able to infer the flow of control from the compiled code be able to infer the flow of control from the program text avoid the use of GOTO statements | Programming Paradigms | 142 |
The goal of structured programming is to have well indented programs be able to infer the flow of control from the compiled code be able to infer the flow of control from the program text avoid the use of GOTO statements | Programming Paradigms | 142 |
The goal of structured programming is to have well indented programs be able to infer the flow of control from the compiled code be able to infer the flow of control from the program text avoid the use of GOTO statements | Programming Paradigms | 142 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
In a process the number of cycles to failure decreases exponentially with an increase in load At a load of 80 units it takes 100 cycles for failure When the load is halved it takes 10000 ext cycles for failure The load for which the failure will happen in 5000 ext cycles is _____________ 40 00 46 02 60 01 92 02 | Proportions | 143 |
If X then Y unless Z is represented by which of the following formulas in prepositional logic eg is negation land is conjunction and rightarrow is implication X land eg Z rightarrow Y X land Y rightarrow eg Z X rightarrow Y land eg Z X rightarrow Y land eg Z | Propositional Logic | 144 |
What is the converse of the following assertion I stay only if you go I stay if you go If I stay then you go If you do not go then I do not stay If I do not stay then you go | Propositional Logic | 144 |
Choose the correct option to fill 1 and 2 so that the program below prints an input string in reverse order Assume that the input string is terminated by a new line character void reverse void int c if 1 reverse 2 main printf Enter text printf reverse printf 1 is getchar u2019 setminus n u2019 2 is getchar c 1 is c getchar u2019 setminus n u2019 2 is getchar c 1 is c u2019 setminus n u2019 2 is putchar c 1 is c getchar u2019 setminus n u2019 2 is putchar c | Pseudo Code | 145 |
Choose the correct option to fill 1 and 2 so that the program below prints an input string in reverse order Assume that the input string is terminated by a new line character void reverse void int c if 1 reverse 2 main printf Enter text printf reverse printf 1 is getchar u2019 setminus n u2019 2 is getchar c 1 is c getchar u2019 setminus n u2019 2 is getchar c 1 is c u2019 setminus n u2019 2 is putchar c 1 is c getchar u2019 setminus n u2019 2 is putchar c | Pseudo Code | 145 |
Choose the correct option to fill 1 and 2 so that the program below prints an input string in reverse order Assume that the input string is terminated by a new line character void reverse void int c if 1 reverse 2 main printf Enter text printf reverse printf 1 is getchar u2019 setminus n u2019 2 is getchar c 1 is c getchar u2019 setminus n u2019 2 is getchar c 1 is c u2019 setminus n u2019 2 is putchar c 1 is c getchar u2019 setminus n u2019 2 is putchar c | Pseudo Code | 145 |
Choose the correct option to fill 1 and 2 so that the program below prints an input string in reverse order Assume that the input string is terminated by a new line character void reverse void int c if 1 reverse 2 main printf Enter text printf reverse printf 1 is getchar u2019 setminus n u2019 2 is getchar c 1 is c getchar u2019 setminus n u2019 2 is getchar c 1 is c u2019 setminus n u2019 2 is putchar c 1 is c getchar u2019 setminus n u2019 2 is putchar c | Pseudo Code | 145 |
Choose the correct option to fill 1 and 2 so that the program below prints an input string in reverse order Assume that the input string is terminated by a new line character void reverse void int c if 1 reverse 2 main printf Enter text printf reverse printf 1 is getchar u2019 setminus n u2019 2 is getchar c 1 is c getchar u2019 setminus n u2019 2 is getchar c 1 is c u2019 setminus n u2019 2 is putchar c 1 is c getchar u2019 setminus n u2019 2 is putchar c | Pseudo Code | 145 |
Choose the correct option to fill 1 and 2 so that the program below prints an input string in reverse order Assume that the input string is terminated by a new line character void reverse void int c if 1 reverse 2 main printf Enter text printf reverse printf 1 is getchar u2019 setminus n u2019 2 is getchar c 1 is c getchar u2019 setminus n u2019 2 is getchar c 1 is c u2019 setminus n u2019 2 is putchar c 1 is c getchar u2019 setminus n u2019 2 is putchar c | Pseudo Code | 145 |
Subsets and Splits