Professional Documents
Culture Documents
A. Data Generation B. Serial-To-Parallel Conversion C. Parity Checking D. Data Selector Answer: Option D
A. Data Generation B. Serial-To-Parallel Conversion C. Parity Checking D. Data Selector Answer: Option D
Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per
usual convention) Q is the set of states, Σ is the input alphabet, Γ is stack alphabet, δ is the state
transition function, q0 is the initial state, ⊥ is the initial stack symbol, and F is the set of accepting states,
The state transition is as follows: Which one of the following sequences must follow the string 101100 so
that the overall string is accepted by the automaton?
10010
387.One application of a digital multiplexer is to facilitate:
A. data generation
B. serial-to-parallel conversion
C. parity checking
D. data selector
Answer: Option D
an excitation table shows the minimum inputs that are necessary to generate a particular next
state (in other words, to "excite" it to the next state) when the current state is known.
389.An engineer is tasked to verify a software release for a mission critical system. The plan is for
the release of software for verification to occur on a Monday, with verification complete the following
Friday. The release turns out not to be available until Thursday. The best route for the engineer is to:
unsigned num;
393.Which of the following is a legal expression in SQL?
??
Without the edge-triggering of the clock input, the circuit would continuously toggle
between its two output states when both J and K were held high (1), making it an
astable device instead of a bistable device in that circumstance
396.Which one of the following is a valid project Key Performance Indicator (KPI)?
PLANNED VALUE, ACTUAL COST, EARNED VALUE, RETURN ON INVESTMENT,
COST VARIANCE (CV) (PLANNED BUDGET VS ACTUAL BUDGET), COST
PERFORMANCE INDEX
397.Let G be the CFG, l be the number of left most derivations, r be the number of right most derivations
and P be the number of parse trees. Assume l , r and P are computed for a particular string. For a given
CFG ‘G’ and given string ‘w’, what is the relation between l , P , r ?
Answer: (B)
Explanation:
398.The combination of Sixteen adjacent squares in four variable K-map represent the function
equal to 1
399.Which of the following is a comparison operator in SQL?
A. =
B. LIKE
C. BETWEEN
#include <stdio.h>
void main()
++var;
printf("%c",var);
Compilation error
401.Calculate the person months for a project that was completed in two months with two people
403.Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the
maximum size of join is: m*n
404.Given the language L = {ab, aa, baa}, which of the following strings are in L*?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
4,2,1
#include <stdio.h>
void main()
int x=10;
x+=(x++)+(++x)+x;
printf("%d",x);
46
http://www.oeng.com/pdf/UC-FAQ.pdf
A’B
#include <stdio.h>
void main()
int a=10,b=2,x=0;
x=a+b*a+10/2*a;
80
409.The total number of pins for the IC 8255 is 40
410.Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For
example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are
also in the language. A partially completed DFA that accepts this language is shown below.
411.A B-tree of order m has maximum of _______m+1______ children
413.The IC 8237 is a direct memory access (DMA) controller
414.Definition of a language L with alphabet {a} is given as following.
What is the minimum number of states needed in DFA to recognize L?
n+1
415.#include <stdio.h>
void main()
var+=2;
var++;
418.SELECT department_id, AVG(salary) FROM employees WHERE AVG(salary) > 8000 GROUP
BY department_id
419.Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum
number of states in a non-deterministic finite automaton that accepts L?
(A) (0*10*1)*
(B) 0*(10*10*)*
(C) 0*(10*1*)*0*
(D) 0*1(10*1)*10*
Answer (B)
Option (C) is incorrect because it accept a string with single 1.
process, project
#include <stdio.h>
void main()
char var=10;
#include <stdio.h>
void main()
printf("x= %d",x);
427What is the recommended distribution of effort for a software project?
https://davidlongstreet.wordpress.com/2009/05/14/what-is-the-distribution-of-effort-of-a-software-proj
ects/
428.
429.The MC 1488 is monolithic quad line driver designed to interface data terminal equipment
431.
#include <stdio.h>
void main()
int x;
x= (printf("AA")||printf("BB"));
printf("%d",x);
printf("\n");
x= (printf("AA")&&printf("BB"));
printf("%d",x);
AA1
AABB1
433.SELECT employee_id, last_name FROM employees WHERE salary = (SELECT MIN(salary)
FROM employees GROUP BY department_id);
#include <stdio.h>
void main()
int a=3,b=2;
a=a==b==0;
printf("%d,%d",a,b);
1,2
437.The fundamental notions of software engineering does not account for ?
View Answer
Answer : d
Explanation : Software validation is an activity for software process and not the fundamental for
engineering.
440.
#include <stdio.h>
void main(){
int intVar=20,x;
x= ++intVar,intVar++,++intVar;