Question 31
Question 32
Suppose that f : R→R is a continuous function on the interval [−3,3] and a differentiable function in the interval (−3,3) such that for every x in the interval, f′(x)≤2. If f(−3)=7, then f(3) is at most __________ .
Question 33
Question 34
Question 35
Input sequence : 00100011000011100 Output sequence : 00000001000001100A Mealy Machine is a state machine where both the next state and the output are functions of the present state and the current input. The above mentioned circuit can be designed as a two-state Mealy machine. The states in the Mealy machine can be represented using Boolean values 0 and 1. We denote the current state, the next state, the next incoming bit, and the output bit of the Mealy machine by the variables s,t,b and y respectively. Assume the initial state of the Mealy machine is 0. What are the Boolean expressions corresponding to t and y in terms of s and b?
Question 36
Question 37
emp(empId, name, gender, salary, deptId)Consider the following SQL query:
select deptId, count(*) from emp where gender = “female” and salary > (select avg(salary)from emp) group by deptId;The above query gives, for each department in the company, the number of female employees whose salary is greater than the average salary of
Question 38
R2(Y),R1(X),R3(Z),R1(Y)W1(X),R2(Z),W2(Y),R3(X),W3(Z)Consider the statements P and Q below:
Question 39
Question 40
Consider the following ANSI C program:
#include < stdio.h >
#include < stdlib.h >
struct Node{
int value;
struct Node *next;};
int main( ) {
struct Node *boxE, *head, *boxN; int index=0;
boxE=head= (struct Node *) malloc(sizeof(struct Node));
head → value = index;
for (index =1; index<=3; index++){
boxN = (struct Node *) malloc (sizeof(struct Node));
boxE → next = boxN;
boxN → value = index;
boxE = boxN; }
for (index=0; index<=3; index++) {
printf(“Value at index %d is %d\\n”, index, head → value);
head = head → next;
printf(“Value at index %d is %d\\n”, index+1, head → value); } }
Which one of the following statements below is correct about the program?
There are 65 questions to complete.