NIELIT STQC 2021 Quiz-8

_________ I permitted him to leave, I wouldn’t have had any problem with him being absent, _______I?

A firm hires employees at five different skill levels P, Q, R, S, T. The shares of employment at these skill levels of total employment in 2010 is given in the pie chart as shown. There were a total of 600 employees in 2010 and the total employment increased by 15% from 2010 to 2016. The total employment at skill levels P, Q and R remained unchanged during this period. If the employment at skill level S increased by 40% from 2010 to 2016, how many employees were there at skill level T in 2016?

M and N had four children P, Q, R and S. Of them, only P and R were married. They had children X and Y respectively. If Y is a legitimate child of W, which one of the following statements is necessarily FALSE?

A person divided an amount of Rs. 100,000 into two parts and invested in two different schemes. In one he got 10% profit and in the other he got 12%. If the profit percentages are interchanged with these investments he would have got Rs. 120 less. Find the ratio between his investments in the two schemes.

Which one of the following statements is true when the function is having cyclic prime implicant K-map?

Consider the following statements:

S1 : If all jobs arrive at the same p oint in time, a SJF and an SRTF scheduler will behave the same.

S2 : If all jobs arrive at the same point in time and have identical run lengths, a FIFO and a SJF scheduler will behave the same.

S3 : If all jobs have identical run lengths, a RR scheduler provides better average turnaround time than FIFO

S4 : With a MLFQ scheduler, high priority jobs have longer time-slices than low priority jobs.

Which of the following is true?

What is the worst case time complexity of inserting n² elements into an AVL Tree with n elements initially?

Consider the following non-serial schedule: S: R1(A), R3(B), W1(A), W2(A), W2(B), W3(B). Which of the following protocol allows this schedule?

Consider the following Finite State Automaton.



The minimum state automaton equivalent to the above FSA has the following number of states

The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)*(10) is ____________