#include <iostream> using namespace std; int main() { // your code goes here int t; cin>>t; while(t--){ int a,b; cin>>a>>b; int k=(a+b)/2; int ma=max(abs(k-a), abs(k-b)); cout<<ma<<endl; } return 0; }
Deque is NOT a container adapter. Correct Option is C. Container adapters are interfaces that provide a specific set of functionality by limiting the functionality of an existing container. When implementing container adapters, the underlying container can be specified. A stack, for example, is a coRead more
Deque is NOT a container adapter.
Correct Option is C.
Container adapters are interfaces that provide a specific set of functionality by limiting the functionality of an existing container. When implementing container adapters, the underlying container can be specified.
A stack, for example, is a container that provides Last-In, First-Out (LIFO) access. Elements are removed in the reverse order in which they were inserted, making it difficult to access elements in the middle. It is typically built on top of a deque container.
A queue, on the other hand, is a container that provides First-In, First-Out (FIFO) access. Elements are removed in the same order in which they were inserted, again making it difficult to access elements in the middle. It is also typically built on top of a deque container.
A priority_queue is a container that provides sorted-order access to elements. Elements can be inserted in any order, and the “lowest” value can be retrieved at any time. C++ STL priority queues are internally implemented using a heap structure, which is often built on top of a vector container.
The correct data structure required to convert infix notation to prefix notation is: C. Stack A stack is essential for converting infix expressions to prefix (or postfix) notation. It helps manage the operators and ensures that they are applied in the correct order according to the rules of precedenRead more
The correct data structure required to convert infix notation to prefix notation is:
C. Stack
A stack is essential for converting infix expressions to prefix (or postfix) notation. It helps manage the operators and ensures that they are applied in the correct order according to the rules of precedence and associativity. By using a stack, the conversion process becomes efficient and straightforward.
functions can return enumeration constants in c true or false
The correct answer to the question 'functions can return enumeration constants in C' is true. Option (A) is correct.
The correct answer to the question ‘functions can return enumeration constants in C’ is true.
Option (A) is correct.
See lessChef and Chefina are at positions X and Y on …
#include <iostream> using namespace std; int main() { // your code goes here int t; cin>>t; while(t--){ int a,b; cin>>a>>b; int k=(a+b)/2; int ma=max(abs(k-a), abs(k-b)); cout<<ma<<endl; } return 0; }
The value of the variable result after running the code …
Checkout below link, Answer already uploaded there. https://sikshapath.in/question/the-value-of-the-variable-result-after-running-the-code/
Checkout below link, Answer already uploaded there.
See lessThe term Robota was introduced by
The term Robota was introduced by Karel Capek. Option C is correct.
The term Robota was introduced by Karel Capek.
Option C is correct.
See lessWhich of the following is NOT a container adapter in C++?
Deque is NOT a container adapter. Correct Option is C. Container adapters are interfaces that provide a specific set of functionality by limiting the functionality of an existing container. When implementing container adapters, the underlying container can be specified. A stack, for example, is a coRead more
Deque is NOT a container adapter.
Correct Option is C.
Container adapters are interfaces that provide a specific set of functionality by limiting the functionality of an existing container. When implementing container adapters, the underlying container can be specified.
A stack, for example, is a container that provides Last-In, First-Out (LIFO) access. Elements are removed in the reverse order in which they were inserted, making it difficult to access elements in the middle. It is typically built on top of a deque container.
A queue, on the other hand, is a container that provides First-In, First-Out (FIFO) access. Elements are removed in the same order in which they were inserted, again making it difficult to access elements in the middle. It is also typically built on top of a deque container.
A priority_queue is a container that provides sorted-order access to elements. Elements can be inserted in any order, and the “lowest” value can be retrieved at any time. C++ STL priority queues are internally implemented using a heap structure, which is often built on top of a vector container.
See lessWhich data structure is required to convert the infix to …
The correct data structure required to convert infix notation to prefix notation is: C. Stack A stack is essential for converting infix expressions to prefix (or postfix) notation. It helps manage the operators and ensures that they are applied in the correct order according to the rules of precedenRead more
The correct data structure required to convert infix notation to prefix notation is:
C. Stack
A stack is essential for converting infix expressions to prefix (or postfix) notation. It helps manage the operators and ensures that they are applied in the correct order according to the rules of precedence and associativity. By using a stack, the conversion process becomes efficient and straightforward.
See less