Font size
Worksheetsgrand_test_1_02/02
Total questions: 65
Worksheet time: 3hrs 14mins
If three dice are rolled, find the number of possible outcomes in which at least one die shows 4.
91
100
64
79
A alone can finish a piece of work in 12 days and B alone can do it in 18 days. If they work together and finish it, then out of total wages of Rs.50, A will get
Rs.12
Rs.30
Rs.40
None of these
Directions: The following graph shows the performance of FANTASTIC Ltd. over the given years. Refer to the graph to answer the question that follows.
TOTAL COST (TC) = RAW MATERIAL COST + LABOUR COST + INTEREST COST
PROFIT = REVENUE (R) - TOTAL COST (TC)
SHAREHOLDERS' SATISFACTION = (Revenue - Total Cost)/Equity Base (EB)
The minimum value of profit per rupee of revenue generated occurred in
1990
1991
1992
1993
Directions: Read the following short passage and answer the question that follows.
Traditionally, decision-making by managers, that is, reasoned and step-by-step, has been considered preferable to intuitive decision-making. However, a recent study found that top managers used intuition significantly more than did most middle or lower-level managers. This confirms the alternative view that intuition is actually more effective than careful, methodical reasoning.
The conclusion above is based on which of the following assumptions?
Methodical, step-by-step reasoning is inappropriate for making many real-life management decisions.
Top managers have the ability to use either intuitive reasoning or methodical, step-by-step reasoning in making decisions.
The decisions made by middle and lower-level managers can be made as easily by using methodical reasoning as by using intuitive reasoning.
Top managers are more effective at decision-making than middle or lower-level managers.
Directions: Identify the relevant figure of speech in the following sentence.
Technology is a process of creative destruction.
Simile
Anaphora
Oxymoron
Rhetoric
What is the last digit of the number obtained by dividing 663 by 423?
2
4
6
9
If the hands of a clock coincide every 66 min (true time), then how much does the clock gain or lose every hour?
Lose 60/121 minutes
Gain 66/23 min
Gain 58/21 min
Lose 66/23 min
Directions: In the question below, four statements are given followed by four conclusions numbered I, II, III and IV. You have to take the given statements to be true even if they seem to be at variance with commonly known facts. Read all the statements carefully and then decide which of the given conclusions logically follow(s) from the given statements disregarding commonly known facts.
Statements:
Some cars are buses.
Some buses are trains.
All aeroplanes are trains.
All trucks are buses.
Conclusions:
I. Some aeroplanes are trucks.
II. Some cars are trains.
III. Some trucks are aeroplanes.
IV. No truck is train.
None follows.
Only II and IV follow.
Only Ill and IV follow.
Only I and III follow.
In each of the questions given below which one of the five answer figures on the right should come after the problem figures on the left, if the sequence were continued?
Which of the following architecture will allow ALU to take all the input operands only from CPU registers always?
1.AC- based Architecture
2.Register Based Architecture
3.Stack Based Architecture
Only 2
1 and 2 both
2 and 3 both
All 1, 2 and 3
In Ethernet Frame Format, the value of SFD is (a)
Let a Relation A have attributes {a1, a2, a3, a4} and {a1a2} as the candidate key. Then how many super keys are possible (a) ?
What is the rank of a planar graph consisting of 7 vertices and 14 edges?
(a)
A computer system uses Banker’s algorithm for deadlock avoidance. The current state of the system is shown as the table below, where P1, P2, P3, P4 and P5 are processes; and A, B, C, D are the resources.
Which of the following is/are true for the safety of the system?
System is in safe state and safe sequence is P1, P3, P4, P5, P2
System is in safe state and safe sequence is P1, P3, P4, P2, P5
System is in safe state and safe sequence is P4, P5, P3, P2, P1
System is in safe state and safe sequence is P4, P1, P3, P5, P2
Assuming an input sequence 1, 2, 3, 4, 5. Which of the following permutations cannot be obtained in the output (in the same order) using a stack, if the given sequence is pushed onto the stack in the given order?
3, 5, 4, 1, 2
3, 2, 4, 1, 5
3, 2, 5, 1, 4
2, 4, 1, 3, 5
The minimized expression for f(a, b, c, d) = ∑(1,5,6,7,11,12,13,15)may include
a’c’d
abc’
a’bc
ac
To calculate size of tag bits in main memory address for various mappings?
Cache size and main memory sizes are sufficient in direct mapping
Cache size and main memory sizes are sufficient in set associative mapping
Cache size and main memory sizes are sufficient in fully associative mapping
Number of blocks in cache and Number of blocks in main memory are sufficient in fully associative mapping
In Pure Aloha, the maximum throughput is (a)
If a Relation have 5 attributes i.e. R (A, B, C, D, E) then maximum number of candidate keys are (a) .
What is/are CORRECT Statement about Cycle Graph?
A Cycle Graph is 2-edge colorable or 2-vertex colorable, if and only if it has an even number of vertices.
Correct answer
A Cycle Graph is 1-edge colorable or 1-vertex colorable, if and only if it has an odd number of vertices.
In a Cycle Graph, Degree of each vertex in a graph is two.
The degree of a Cycle graph is 3 times the number of vertices.
(a)
Which of the following statements is/are correct about semaphores?
Semaphore can be accessed only through wait() and signal() functions
Some semaphores can have a value 2
Semaphores are machine-dependent
Synchronization solution using semaphore can lead to have deadlock
Consider a full binary tree T which has all nodes with either 0 child or 2 children. The tree T has 36 leaf nodes. Total number of nodes in this tree is (a) ?
The output of following logic circuit is
(a)
Consider a hard disk with 10 platters with 2 recording surfaces each. Surfaces are numbered starting from 0. The disk is having 20000 cylinders (0-1999) and each track contains 128 sectors (0-127). Data storage capacity of in each sector is 1KiloBytes. Data are organized cylinder-wise and addressing format is <cylinder no., surface no., sector no.>. A file is stored in the disk and the starting disk location of the file is <x,y,z> and last sector location for the file is <2056, 13, 39>. The value of x is_______, if the file is stored on 43689 sectors in a contiguous manner on?
2038
2039
2040
2041
In Ethernet, the length of entire Ethernet frame cannot be larger than (a)
Which statement is TRUE about PROJECTION operator of relation algebra?
The Project operation removes duplicate tuples.
The Project operation is not commutative, that is :
πAttribute List 1(πAttribute List2(R)) != πAttribute List 2 (πAttribute List1(R))
The following expression is valid only if Attribute List 2 is a subset of Attribute List
πAttribute List 1(πAttribute List2(R))
The cardinality (number of tuples) of resulting relation from a Project operation is:
1 <= πA(R) <= |R|
How to check if a directed graph is eulerian?
All vertices with nonzero degree belong to a single strongly connected component.
In degree is equal to the out degree for every vertex.
Both
None
Consider the following process scenario:
All the times are given in microseconds. The given processes are executed using preemptive priority-based scheduling, here the lower number denotes higher priority. The average waiting time of the processes is (a) microseconds?
Consider the following singly linked list of integers:
The output after the following program execution on given linked-list is (a) ?
struct node{
int data;
struct node * link; };
void main(){
struct node *p;
p =start → link → link;
p → link= p → link→ link→ link;
start → link = p;
printf(“%d”, start → link → link → data);
}
The number of set bits in 2’s complement of binary code of gray code 10111001 is
(a)
Consider a sequence of 1000 instructions which are executed on a 5 stage pipeline: Instruction fetch (IF), Instruction decode (ID), Operand Fetch (OF), Execution (EX) and Write Back the result (WB). Each stage takes one cycle for each instruction except EX stage. In EX stage all instructions at least take 1 cycle but few instructions take some extra cycles also. In EX stage 350 instructions take 3 extra clock cycles each, 400 instructions take 2 extra clock cycle each and remaining instructions do not take any extra cycle. The pipeline has a clock rate of 0.2GHz (assuming G = 109). The total time taken to execute the given sequence of instructions in the above pipeline is (a) nanoseconds?
UDP perform:
Multiplexing
De-multiplexing
Both
None
Division operator A÷B can be applied if and only if:
1.Attributes of B is proper subset of Attributes of A.
2.The relation returned by division operator will have attributes = (All attributes of A – All Attributes of B)
3.The relation returned by division operator will return those tuples from relation A
which are associated to every B’s tuple.
Number of correct statements are (a)
Vertex & edges both cannot be repeated in _______
NOTE : except starting and ending vertex
Walk
Trail
Path
Cycle
A paged virtual memory environment has page fault rate p. The memory access time without page fault is 150 nanoseconds and the memory access time with page fault is 5500 nanoseconds. If the effective memory access time is 551.25 nanoseconds then the page fault rate p is (a) %?
Consider the following recursive function written in C-programming language:
int fun(int n){
if (n < 3)
return 1;
else
return fun(n-1) – fun(n-3) + 2;
}
The value returned by the function is it is called for fun (5) (a) ?
(a)
A computer supports only 3 address instructions with length 32-bits each. The instruction format has an op-code and 3 memory address fields. There are 129 distinct instructions supported by the system. If the memory used in the system is word addressable with word size of 32 bits. The maximum size memory supported by system is (a) Kbytes (K =210)?
1
Correct answer
FTP makes use of control connection for sending control information like
User identification,
Password,
Commands to retrieve and store files
Actual file
Which statement is/are correct if both sides are partial participation?
In M: N cardinality ration, Separate table for each entity as well as relationship is required.
In 1: N cardinality ratio, we merge the relationship on N-side using foreign key referencing 1-side.
In 1:1 cardinality ratio, we merge the relationship and one entity into 1 table using foreign key and 1 table for other entity.
All
Which defines the diameter of graph?
Number of edges contained in the graph.
Maximum distance between the pair of vertices.
The minimum among all the maximum distances between a vertex to all other vertices
It consists of all the vertices whose eccentricity is minimum.
A single level directory on a system uses starting 8 blocks to store the directory entries for the file system. The disk has total 512 blocks each of size 2Kbyes. The maximum size of any file can be _____ Kbytes?
504 Kbytes
512 Kbytes
1008 Kbytes
1024 Kbytes
Consider a left skewed binary tree T with n nodes. A left skewed binary tree has all non-leaf nodes with only left child. Minimum how many nodes to be inserted in this tree to convert this tree into 2-ary tree?
Note: A 2-ary tree is a binary tree in which each node has either o child or 2-children.
0
n
n-1
1
Consider IEEE-754 single precision floating point representation which uses 32-bits to represent a number. The number in IEEE-754 single precision floating point representation is specified as:
Number of bits used for Sign, Exponent and Mantissa are 1, 8 and 23 respectively. Which of the following options does not represent a value less than 1?
S= 0, E=00000000, M=10101000000000000000000
S= 0, E=01111110, M=11111000000000000000000
S= 0, E=01000011, M=00111000000000000000000
S= 0, E=10000101, M=00001000000000000000000
Which statement is/are correct if one side is total participation and one side is partial?
M: N Merge the relationship on total participation side.
1: N Merge the relationship on total participation side.
1:1 merge the two entities involved and the relationship into 1 table.
All
The number of onto functions (surjective functions) from set X = {a, b, c, d} to set Y = {1, 2, 3} is (a)
When a running thread goes from CPU to execute any IO operation?
Only that thread gets blocked but not entire process
Entire process gets blocked
Entire process gets terminated
Entire process gets blocked or only the thread gets blocked, is dependent on type of running thread
Consider the following C-language code segment?
#include <stdio.h>
void main(){
int n =5, count=0;
while(n){
count+=n&0;
n<<=1;
}
printf(“%d”, count);
}
The value printed by the execution of above program is (a) ?
A fair coin is tossed till a head appear for the first time. The probability that the number of required tosses is odd is ______.
1/3
1/6
5/6
2/3
Consider following quaternary tree T which has nodes with maximum 4 children.
The tree is implemented using linked representation, with the structure of each node as follows:
struct QtreeNode{
char data;
struct QtreeNode *child1;
struct QtreeNode *child2;
struct QtreeNode *child3;
struct QtreeNode *child4;
};
Here the child 1 to 4 are taken from left to right, which means child1 is leftmost child for each node and child4 is rightmost one. The following traversal function is called for root of the above given tree.
void travers (struct QtreeNode *t) {
if(t){
travers(t -> child1);
travers(t -> child2);
travers(t -> child3);
printf(“%c ”, t-> data);
travers(t -> child4);
}
}
The output printed by the traversal function is?
b c f r s t h u g d a j k l i e
b c f r s t u h g d j k l i e a
b c d a f g r s t u h j k l i e
b c f g r s t h u d a j k l i e
Consider a device operating on 8MBPS rate and transferring the data to memory using cycle stealing mode of DMA. If it takes 250 nanoseconds to transfer 16 bytes data to memory when it is ready or prepared. Then percentage of time CPU is blocked due to DMA is (a) (correct upto 1 decimal places)?
Which of the following number conversion is correct?
(32)8 = (36)7
(FEC6)16 = ( 177308 )8
(30)8 = (26)7
(FEA6)16 = ( 177206)8
Which of the following statements is false?
(A)The Halting Problem of Turing machines is undecidable
(B)Determining whether a context-free grammar is ambiguous is undecidable
(C)Given two arbitrary context-free grammars G1 and G2 it is undecidable whether L(G1)=L(G2)
(D)Given two regular grammars G1 and G2 it is undecidable whether L(G1)=L(G2)
(E)Given Turing machine prints a specific letter is decidable
(F)Given a Turing machine computes the products of two numbers is decidable.
Number of correct statements are (a)
(a)
Which one of the following is not decidable?
Given a Turing machine M, a string s and an integer k, M accepts s within k steps
Equivalence of two given Turing machines
Language accepted by a given finite state machine is not empty
Language generated by a context free grammar is non-empty
Let G be a connected undirected weighted graph.
Consider the following two statements.
S1: There exists a minimum weight edge in G which is present in every minimum spanning tree of G.
S2: If every edge in G has distinct weight, then every minimum cost spanning tree (T) has a minimum weight edge of G as one of the edge.
Which one of the following options is correct?
Both S1 and S2 are true
S1 is true and S2 is false
S1 is false and S2 is true
Both S1 and S2 are false
Consider the following languages over the alphabet ∑={a,b,c}.
1. L1={anbncm|m,n≥0}
2. L2={ambncn|m,n≥0}.
3. L1 ∪L2
4. L1 ∩L2
Number of statements which are context-free languages are (a)
The recurrence relation that arises in relation with the Time complexity of binary search is:
(A) T(n)=2T(n/2)+k, k is a constant
(B) T(n)=T(n/2)+k, k is a constant
(C) T(n)=T(n-1)+K, k is a constant
(D) T(n)=T(n/2)+kn, k is a constant
(E) T(n)=T(n/2)+lognk, k is a constant
Number of in-correct recurrence relations for the binary search is —---
(a)
Which of the following problems are undecidable?
Membership problem in context-free languages.
Whether a given context-free language is regular.
Whether a finite state automation halts on all inputs.
Membership problem for type 0 languages.
Consider the grammar defined by the following production rules, with two operators ∗ and +
S→T∗P
T→U | T∗U
P→Q+P | Q
Q→id
U→id
Which one of the following is TRUE?
+ is left associative, while ∗ is right associative
+ is right associative, while ∗ is left associative
Both + and ∗ are right associative
Both + and ∗ are left associative
Consider the language L given by the regular expression (a+b)*b(a+b)(a+b) over the alphabet {a,b}. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting L is (a)
Consider the context-free grammars over the alphabet {a,b,c} given below. S and T are non-terminals.
G1:S→aSb∣T,T→cT∣ϵ
G2:S→bSa∣T,T→cT∣ϵ
The language L(G1)∩L(G2) is
Finite
Not finite but regular
Context-Free but not regular
Recursive but not context-free
A alone can finish a piece of work in 12 days and B alone can do it in 18 days. If they work together and finish it, then out of total wages of Rs.50, A will get
Rs.12
Rs.30
Rs.40
None of these
