0 of 75 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 75 questions answered correctly
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)
In 8085 microprocessor which of the following flag(s) is (are) affected by an arithmetic operation?
In 8085 microprocessor the address bus is of ……………….. bits.
In the architecture of 8085 microprocessor match the following:
List – I
(a) Processing unit
(b) Instruction unit
(c) Storage and Interface unit
List – II
(i) Interrupt
(ii) General purpose Register
(iii) ALU
(iv) Timing and Control
Which of the following addressing mode is best suited to access elements of an array of contiguous memory locations?
Which of the following is correct statement?
Suppose a database schedule S involves transactions T1, T2, ………….,Tn. Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?
If every non-key attribute is functionally dependent on the primary key, then the relation is in ………………..
Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist.
CH → G
A → BC
B → CFH
E → A
F → EG
The relation R is ………………..
(1) in 1NF but not in 2NF
(2) in 2NF but not in 3NF
(3) in 3NF but not in BCNF
(4) in BCNF
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item X, denoted by r(X) and w(X) respectively. Which one of them is conflict serializable?
S1 : r1(X); r2(X); w1(X); r3(X); w2(X)
S2 : r2(X); r1(X); w2(X); r3(X); w1(X)
S3 : r3(X); r2(X); r1(X); w2(X); w1(X)
S4 : r2(X); w2(X); r3(X); r1(X); w1(X)
A micro-instruction format has micro-ops field which is divided into three subfields F1, F2, F3 each having seven distinct micro-operations, condition field CD for four status bits, branch field BR having four options used in conjunction with address field ADF. The address space is of 128 memory locations. The size of micro-instruction is:
Given two relations R1(A, B) and R2(C, D), the result of following query
Select distinct A, B from R1, R2
is guaranteed to be same as R1 provided one of the following condition is satisfied.
Consider a schema R(A, B, C, D) and following functional dependencies.
A → B
B → C
C → D
D → B
Then decomposition of R into R1(A, B), R2(B, C) and R3(B, D) is ………………
Which of the following is not a component of Memory tube display?
Which of the following is not true in case of Oblique Projections?
With respect to CRT, the horizontal retrace is defined as :
Find the equation of the circle x_{2}+y_{2} = 1 in terms of x’y’ coordinates, assuming that the xy coordinate system results from a scaling of 3 units in the x’ direction and 4 units in the y’ direction.
The three aspects of Quantization, programmers generally concerned with are:
The logic of pumping lemma is an example of ………………..
Heap allocation is required for languages that :
Pumping lemma for regular language is generally used for proving:
Which of the following problems is undecidable?
Finite state machine can recognize language generated by ………………..
The language L = {a ^{i} b c ^{i} | i ≥ 0} over the alphabet {a, b, c} is:
Suppose we want to download text documents at the rate of 100 pages per second. Assume that a page consists of an average of 24 lines with 80 characters in each line. What is the required bit rate of the channel?
Quadrature Amplitude Modulation means changing both:
Match the following:
List – I List – II
(a) Data link layer (i) Encryption
(b) Network layer (ii) Connection control
(c) Transport layer (iii) Routing
(d) Presentation layer (iv) Framing
The address of a class B host is to be split into subnets with a 6 – bit subnet number. What is the maximum number of subnets and maximum number of hosts in each subnet?
Which of the following statements are true?
(a) The fragmentation fields in the base header section of IPv4 have moved to the fragmentation extension header in IPv6.
(b) The authentication extension header is new in IPv6.
(c) The record route option is not implemented in IPv6.
Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf.
Which of the following is correct for the full binary tree?
You are given a sequence of n elements to sort. The input sequence consists of n/k subsequences, each containing k elements. The elements in a given subsequence are all smaller than the elements in the succeeding subsequence and larger than the elements in the preceding subsequence. Thus, all that is needed to sort the whole sequence of length n is to sort the k elements in each of the n/k subsequences.
The lower bound on the number of comparisons needed to solve this variant of the sorting problem is:
Consider the recurrence relation:
T (n) = 8T(n/2) + Cn, if n > 1
= b, if n =1
Where b and c are constants.
The order of the algorithm corresponding to above recurrence relation is:
Consider the following two sequences :
X = <B, C, D, C, A, B, C>
and Y = <C, A, D, B, C, B>
The length of longest common subsequence of X and Y is:
A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of:
An undirected graph G (V, E) contains n (n > 2) nodes named v1, v2,…,vn. Two nodes vi and vj are connected if and only if 0 < | i – j | ≤ 2. Each edge (vi, vj) is assigned a weight i+j.
The cost of the minimum spanning tree of such a graph with 10 nodes is :
An XML document that adheres to syntax rules specified by XML 1.0 specification in that it must satisfy both physical and logical structured, is called :
Which of the following statement(s) is/are TRUE regarding Java Servelets?
(a) A Java Servelet is a server-side component that runs on the web server and extends the capabilities of a server.
(b) A Servelet can use the user interface classes like AWT or Swing.
Consider the following HTML table definition :
<table border=”1″>
<tbody>
<tr>
<td colspan=”2″>Text A</td>
</tr>
<tr>
<td>Text B</td>
<td>Text C</td>
</tr>
<tr>
<td rowspan=”2″>Text D</td>
<td>Text E</td>
</tr>
<tr>
<td>Text F</td>
</tr>
</tbody>
</table>
The above HTML code would render on screen as
Which of the following statements is/are TRUE?
(a) In HTML, character entities are used to incorporate external content into a web page, such as images.
(b) Once a web server returns a cookie to a browser, the cookie will be included in all future requests from the browser to the same server.
Which of the following statements is/are TRUE regarding JAVA?
(a) Constants that cannot be changed are declared using the ‘static’ keyword.
(b) A class can only inherit one class but can implement multiple interfaces.
What is the output of the following JAVA program?
Class Test
{
public static void main (String [ ] args)
{
Test obj = new Test ( );
obj.start ( );
}
void start ( )
{
String stra=”do”;
String strb = method (stra);
System.out.print(“:” + stra + strb);
}
String method (String stra)
{
stra=stra+”good”;
System.out.print (stra);
return “good”;
}
}
Statistical software quality assurance in software engineering involves …………….
Which of the following statements is/are FALSE with respect to software testing?
S1 : White-box tests are based on specifications; better at telling whether program meets specification, better at finding errors of ommission.
S2 : Black-box tests are based on code; better for finding crashes, out of bounds errors, file not closed errors.
S3 : Alpha testing is conducted at the developer’s site by a team of highly skilled testers for software that is developed as a product to be used by many customers.
A signal processor software is expected to operate for 91.25 days after repair, and the mean software repair time is expected to be 5 minutes. Then, the availability of the software is :
Consider the method mcq ( ) :
int mcq (boolean a, boolean b, boolean c, boolean d)
{
int ans=1;
if (a) {ans = 2;}
else if (b) {ans = 3;}
else if (c) {
if (d) {ans=4;}
}
return ans ;
}
If
M1 = Number of tests to exhaustively test mcq ( );
M2 = Minimum number of tests to achieve full statement coverage for mcq ( ); and
M3 = Minimum number of tests to ahieve full branch coverage for mcq ( );
then (M1, M2, M3) = ………………..
A simple stand – alone software utility is to be developed in ’C’ programming by a team of software experts for a computer running Linux and the overall size of this software is estimated to be 20,000 lines of code. Considering (a, b) = (2.4, 1.05) as multiplicative and exponention factor for the basic COCOMO effort estimation equation and (c, d)=(2.5, 0.38) as multiplicative and exponention factor for the basic COCOMO development time estimation equation, approximately how long does the software project take to complete?
In Software Configuration Management (SCM), which of the following is a use-case supported by standard version control systems?
(a) Managing several versions or releases of a software
(b) Filing bug reports and tracking their progress
(c) Allowing team members to work in parallel
(d) Identifying when and where a regression occurred
Consider the following four processes with the arrival time and length of CPU burst given in milliseconds :
Process Arrival Time Burst Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
The average waiting time for preemptive SJF scheduling algorithm is ……………..
Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. Suppose a demand paged virtual memory system running on a computer system such that the main memory has 3 page frames. Then …………….. page replacement algorithm has minimum number of page faults.
User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads.
Which of the following statements is/are true?
(a) (i) The Many – to – one model maps many user threads to one kernel thread
(ii) The one – to – one model maps one user thread to one kernel thread
(iii) The many – to – many model maps many user threads to smaller or equal kernel
threads
(b) (i) Many – to – one model maps many kernel threads to one user thread
(ii) One – to – one model maps one kernel thread to one user thread
(iii) Many – to – many model maps many kernel threads to smaller or equal user
threads
Consider a system with five processes P0 through P4 and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T0 we have the following allocation.
If we implement Deadlock detection algorithm we claim that system is __________.
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are ………………. if the disk head is initially at 53.
The Bounded buffer problem is also known as ………………
In Artificial Intelligence (AI), which agent deals with happy and unhappy state?
If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?
Let P, Q, R and S be Propositions. Assume that the equivalences P⇔(Q∨¬Q) and Q⇔R hold. Then the truth value of the formula (P∧Q)⇒((P∧R)∨S) is always :
“If X, then Y unless Z” is represented by which of the following formulae in propositional logic?
Consider the following two well-formed formulas in prepositional logic.
F1 : P ⇒ ¬ P
F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P)
Which of the following statements is correct?
Standard planning algorithms assume environment to be ……………..
Which of the following statements is not correct?
Context free grammar is not closed under :
(1) Concatenation
(2) Complementation
(3) Kleene Star
(4) Union
Consider the flowing Languages:
L1={a ^{n+m} b ^{n} a^{m} | n,m ≥0}
L2={a ^{n+m} b ^{n+m} a^{n+m} | n,m ≥0}
Which one of the Following is correct ?
Consider the following languages :
L1={a^{m }b ^{n} | m,n ≠ 1}
L2={a ^{m }b ^{n} | m= 2n + 1 }
L3={a^{m} | m ≠ 2n+1}
Which one of the following statement is correct?
A 4×4 DFT matrix is given by :
(j2=−1)
Where values of x and y are ……….., …………. respectively.
For any binary (n, h) linear code with minimum distance (2t+1) or greater
Which of the following is a valid reason for causing degeneracy in a transportation problem? Here m is no. of rows and n is no. of columns in transportation table.
Consider the following LPP :
Max Z=15×1+10×2
Subject to the constraints
4×1+6×2 ≤ 360
3×1+0x2 ≤ 180
0x1+5×2 ≤ 200
x1, x2 ≥ 0
The solution of the LPP using Graphical solution technique is :
Consider the following LPP :
Min Z=2×1+x2+3×3
Subject to :
x1−2×2+x3 ≥ 4
2×1+x2+x3 ≤ 8
x1−x3 ≥ 0
x1, x2, x3 ≥ 0
The solution of this LPP using Dual Simplex Method is :
Consider a Takagi – Sugeno – Kang (TSK) Model consisting of rules of the form :
If x _{1} is A _{i1} and … and x _{r} is A _{ir}
THEN y =fi(x_{1 }, x2, …, xr) = bio+bi1 x_{i1} +…+bir x_{r}
assume, αi is the matching degree of rule i, then the total output of the model is given by:
Consider a single perceptron with sign activation function. The perceptron is represented by weight vector [0.4 −0.3 0.1]t and a bias θ=0. If the input vector to the perceptron is X=[0.2 0.6 0.5] then the output of the perceptron is :
The Sigmoid activation function f(t) is defined as
Consider the following statements :
(a) UNIX provides three types of permissions
* Read
* Write
* Execute
(b) UNIX provides three sets of permissions
* permission for owner
* permission for group
* permission for others
Which of the above statement/s is/are true?
Which of the following routing technique / techniques is / are used in distributed systems?
(a) Fixed Routing
(b) Virtual Routing
(c) Dynamic Routing
Match the following WINDOWS system calls and UNIX system calls with reference to process control and File manipulation.
Windows UNIX
(a) Create – process () (i) Open ()
(b) WaitForSingleObject () (ii) Close ()
(c) CreateFile () (iii) Fork ()
(d) CloseHandle () (iv) Wait ()
Find the normalization transformation that maps a window whose lower left corner is at (1, 1) and upper right corner is at (3, 5) onto a viewport that is the entire normalized device screen.
If a file consisting of 50,000 characters takes 40 seconds to send, then the data rate is ……………………