0 of 60 questions completed
Questions:
General instruction:
1. The clock will be set at the server. The countdown timer at the top right corner of screen will display the remaining time available for you to complete the examination. When the timer reaches zero, the examination will end by itself. You need not terminate the examination or submit your paper.
2. The Question Palette displayed on the right side of screen will show the status of each question using one of the following symbols.
(White)You have not answered the question
(Green)You have answered the question
(Orange)You have NOT answered the question, but have marked the question for review.
The Mark for Review status for a question simply indicates that you would like to look0 at that question again. If a question is answered, but marked for review, then the answer will be considered for evaluation unless the status is modified by the candidates.
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
0 of 60 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 marks, (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Which one of the following statements are not correct?
S1: 3NF decomposition is always lossless join and dependency preserving.
S2: 3NF decomposition is always lossless join but may or may not be dependency preserving.
S3: BCNF decomposition is always lossless join and dependency preserving.
S4: BCNF decomposition is always lossless join but may or may not be dependency preserving.
According to the given language, which among the following expressions does it corresponds to ?
Language L={xϵ{0,1}|x is of length 4 or less}.
Using bisection method, one root of x4−x−1 lies between 1 and 2. After second iteration the root may lie in interval:
In a cache memory if total number if sets are ‘s’, then the set offset is:
Which of the following is machine independent optimization?
A stack organized computer has which of the following instructions?
Let G be a grammar in CFG and Let W1 and W2 is element of G such that |w1| = |w2| then which of the following is true?
Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is ____________.
Find the smallest number y such that y*162(y multiplied by 162 ) is perfect cube:
A regular expression (a+b*c) is equivalent to:
Which of the following are undecidable?
P1: The language generated by some CFG contains any words of length less than some given number n.
P2: Let L1 be CFL and L2 be regular, to determine whether L1 and L2 have common elements
P3: Any given CFG is ambiguous or not.
P4: For any given CFG G, to determine whether epsilon belongs to L(G)
Consider the following four processes with their corresponding arrival time and burst time:
Process Arrival time Burst time(in ms)
P1 0.0 8
P2 0.6 6
P3 3.8 4
P4 4.4 2
What is the average turn around time (in ms) for these processes using FCFS scheduling algorithm?
Consider a non-pipelined machine with 6 stages; the lengths of each stage are 20ns, 10ns, 30ns,25ns, 40 ns and 15ns respectively. Suppose for implementing the pipelining the machine adds 5 ns of overhead to each stage for clock skew and set up. What is the speed up factor of the pipelining system(ignoring any hazard impact)?
In how many ways 8 girls and 8 boys can sit around a circular table so that no two boys sit together?
Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory?
The time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes be t2. Which of the following is TRUE?
In conservative two phase locking protocol, a transaction:
Recursive enumerable languages are not closed under _________.
Let u and v be two vectors in R2 whose Eucledian norms satisfy |u|=2|v|. What is the value α such that w=u+αv bisects the angle between u and v?
A system has three processes sharing 4 resources.If each process needs a maximum of 2 units, then deadlock
What is the meaning of regular expression ∑∗001∑∗?
Let G be a complete undirected graph on 8 vertices are labeled, then the number of distinct cycles of length 5 in G is equal to
The context free grammar S→aSb ∣ bSa ∣ϵ generates:
Consider the relational schema R(A B C D) with following functional dependency set F={A→BC,C→D}; The relation R is in
Which of the following is TRUE?
If any string of a language L can be effectively enumerated by an enumerator in a lexicographic order then language L is _______.
Which of the following is not deliverable of the structured system analysis?
If for a given Binary Search Tree (BST) the pre-order traversal is 41,23,11,31,62,50,73. Then which of the following is its post-order traversal?
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is
The collection of Turing recognizable languages are closed under:
Union
Intersection
Complement
Concatenation
Star Closure
Which of the following statement is/are false?
S1: LR(0) grammar and SLR(1) grammar are equivalent.
S2: LR(1) grammar are subset of LALR(1) grammar.
The condition for total participation of entity in a relationship is _______.
Which of the following regular expression is equal to (r1+r2)∗?
If the number of networks and number of hosts in class B are 2m,(2n−2) respectively. Then the relation between m,n is
which of the following is true?
S1: The power of a multitape turing machine is greater than the power of single tape turing machine.
S2: Every non deterministic turing machine has an equivalent deterministic turing machine
Which of the following is TRUE?
which of the following is/are features of RISC processes
(i) Large number of addressing modes.
(ii)Uniform instruction set.
The optimization phase in a compiler generally:
What is the logical translation of the following statement?
“None of my friends are perfect.”
If x is one dimensional array, then pick up the correct answer
The string 1101 does not belong to the set represented by
The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is_________
INCA(Increase register A by 1) is an example of which of the following addressing mode?
Let n is the length of string to test for membership, then the number of table entry in CYK algorithm is:
The total number of page faults for the reference string 1,2,3,4,5,6,7,8,9,10 using FIFO page replacement policy for a process, if 3 frames are allocated to it are:
When the sum of all possible two digit numbers formed from three different one digit natural numbers are divided by sum of the original three numbers, the result is:
Which of the following is/are true in the context of interpreters?
S1: Interpreters process program according to the logical flow of control through the program.
S2: Interpreter translates and executes the error-free first instruction before it goes to the second.
S3: Interpreter processing time is less compared with compiler.
S4: LISP and Prolog are interpreted languages.
Which of the following is TRUE?
Consider the relational schema R(A B C D) with following FD set F={A->CE, B->D, AE->D}, Identify the highest normal form satisfied by the relation R.
Which of the following is a correct hierarchical relationships of the following where
L1: Set of languages accepted by NFA
L2: Set of languages accepted by DFA
L3: Set of languages accepted by DPDA
L4: Set of languages accepted by NPDA
L5: Set of recursive languages
L6. Set of recursively enumerable languages?
Which machine is equally powerful in both deterministic and non deterministic form?
Let G be a simple undirected graph on n=3x vertices (x>=1) with chromatic number 3, then maximum number of edges in G is:
Which of the following is false:
Consider two matrices M1 and M2 with M1 * M2 = 0 and M1 is non singular. Then which of the following is true?
We have 10 stage pipeline, where the branch target instruction are resolved at stage 5. how many stall are there for an incorrect predict branch?
A RAM chip has 7 address lines, 8 data lines and 2 chips select lines. Then the number of memory locations is _______.
Which of the following is equivalent regular expressions?
((01)∗(10)∗)∗
(10+01)∗
(01)∗+(11)∗
(0∗+(11)∗+0∗)∗)
The relation On a set A={a,b,c,d} a binary operation * is defined as given in following table
a | acbd |
b | cbda |
c | bdac |
d | dacb |
A two-word instruction is stored in a location A. The operand part of instruction holds B. If the addressing mode is relative, the operand is available in location:
Which of the following is false?