Q3➡|Data Logic Design Consider a logic gate circuit, with 8 input lines (D0, D1………..D7) and 3 input Lines (A0, A1, A2) specified by following operations A2=D4+D5+D6+D7 A1=D2+D3+D6+D7 A0=D1+D3+D5+D0 Where + indicates logical OR operation. This circuit is
i ➥ 3×8 multiplexer
ii ➥ Decimal to BCD Converter
iii ➥ Octal to Binary encoder
iv ➥ Priority encoder
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q11➡|Discrete Mathematics Let ({a,b}, ) be a semigroup , where a*a = b. (A) a*a = b*a (B) b*b = b Choose the most appropriate answer from the options given below:
i ➥ (A) only true
ii ➥ (B) only true
iii ➥ Both (A) and (B) true
iv ➥ Neither (A) not (B) true
Best Explanation: Answer: (iii) Explanation: Upload Soon
Q12➡|Computer Architecture In a cache memory , if address has 9 bits in Tag field and 12 bits in index field, the size of main memory and cache memory would be respectively
i ➥ 2K, 4K
ii ➥ 1024K, 2K
iii ➥ 4K, 2048K
iv ➥ 2048K, 4K
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q13➡|Compiler Design Consider the grammar S—>SbS|a. Consider the following statements: (A) Two Parse tree (B) Two left most derivation (C) Two right most derivation Which of the following is correct?
i ➥ All (A), (B) and (C) are true
ii ➥ Only (B) is true
iii ➥ Only (C) is true
iv ➥ Only (A) is true
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q20➡|DBMS Consider the following statements: Statement I: Composite attributes cannot be divided into smaller subparts. Statement II: complex attributes is formed by nesting Composite attributes and multi-valued attributes in an arbitrary way. Statement III : A derived attribute is an attribute whose value are computed from other attribute. Which of the following is correct?
i ➥ Statement I, statement II and statement III are true
ii ➥ Statement I true and statement II , statement III are false
iii ➥ Statement I, statement II true and Statement III false
iv ➥ Statement I false and statement II, statment III true
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q24➡|Operating System If an operating system does not allow a child process to exist when the parent process has been terminated, this phenomenon is called as –
i ➥ Threading
ii ➥ Cascading termination
iii ➥ Zombie termination
iv ➥ Process killing
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q29➡|Discrete Mathematics There are three boxes. First box has 2 white, 3 black and 4 red balls. Second box has 3 white, 2 Black and 2 red balls. Third box has 4 white, 1 black and 3 red balls. A box is chosen at random and 2 balls are drawn out of which 1 is white , and 1 is red. What is the probability that the balls came from first box?
i ➥ 0.237
ii ➥ 0.723
iii ➥ 0.18
iv ➥ 0.452
Best Explanation: Answer: (i) Explanation: Upload Soon
Q31➡ | Operating System For the following page reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5 the number of page faults that occur in Least Recently Used (LRU) page replacement algorithm with frame size 3 is
i ➥ 6
ii ➥ 8
iii ➥ 10
iv ➥ 12
Best Explanation: Answer: (iii) Explanation: Upload Soon
Q37➡|Computer Architecture Consider the following related to Fourth Generation Technique (4GT): (A) It controls efforts (B) It controls resources (C) It controls cost of development. Choose the correct answer from the options given below:
i ➥ (A) and (B) only
ii ➥ (B) and (C) only
iii ➥ (C) and (A) only
iv ➥ All (A), (B) and (C)
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q40➡|Data Structure How many rotations are required during the construction of an AVL tree if the following elements are to be added in the given sequence? 35, 50, 40, 25, 30, 60, 78, 20, 28
i ➥ 2 left rotation, 2 right rotation
ii ➥ 2 left rotation, 3 right rotation
iii ➥ 3 left rotation, 2 right rotation
iv ➥ 3 left rotation, 1 right rotation
Best Explanation: Answer: (iii) Explanation: Upload Soon
Q41➡|Data Structure Consider the hash table of size 11 that uses open addressing with linear probing. Let h(k) = k mod 11 be the hash function. A sequence of records with keys 43, 36, 92, 87, 11, 47, 11, 13, 14 is inserted into an initially empty hash table. The bins of which are indexed from 0 to 10. What is the index of the bin into which the last record is inserted?
i ➥ 8
ii ➥ 7
iii ➥ 10
iv ➥ 4
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q42➡|Compiler Design Consider the following statements: Statement (I) : LALR Parser is more powerful than canonical LR parser Statement (II) : SLR parser is more powerful that LALR Which of the following is correct?
i ➥ Statement (I) true and statement (II) false
ii ➥ Statement (I) false and statement (II) true
iii ➥ Both statement (I) and Statement (II) false
iv ➥ Both statement (I) and statement (II) true
Best Explanation: Answer: (iii) Explanation: Upload Soon
Q44➡|Computer Architecture Consider a memory system having address spaced at a distance of m , T = Bank cycle time and n number of banks , then the average data access time per word access in synchronous organization is
i ➥
ii ➥
iii ➥
iv ➥
Best Explanation: Answer: (i) Explanation: Upload Soon
Q45➡|Computer Architecture The total storage capacity of a floppy disk having 80 tracks and storing 128 bytes/sector is 163,840 bytes . How many sectors does this disk have ?
i ➥ 27
ii ➥ 2048
iii ➥ 4K
iv ➥ 16
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q53➡|Computer Network Consider an error free 64 kbps satellite channel used to sent 512 byte data frames I one direction with very short acknowledgements coming back the other way. What is the maximum throughput for window size of 15?
i ➥ 32 kbps
ii ➥ 48 kbps
iii ➥ 64 kbps
iv ➥ 70 kbps
Best Explanation: Answer: (iii) Explanation: Upload Soon
Q54➡|Discrete Mathematics Let ∈ = 0.0005 and let Re be the relation { (x, y) ∈ R2 : |x-y| <∈} , Re could be interpreted as the relation approximately equal Re is (A) Reflexive (B) Symmetric (C) Transitive Choose the correct answer from the option given below :
i ➥ (A) and (B) only True
ii ➥ (B) and (C) only True
iii ➥ (A) and (C) only True
iv ➥ (A), (B) and (C) True
Best Explanation: Answer: (i) Explanation: Upload Soon
Q57➡|Computer Architecture A 4-stage pipeline has the delay as 150, 120, 160 and 140 ns respectively . registers that are used between the stage have delay of 5 ns. Assuming constant locking rate , the total time required to process 1000 data items on this pipeline is
i ➥ 160.5 ns
ii ➥ 165.5 ns
iii ➥ 120.5 ns
iv ➥ 590.5 ns
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q58➡|Data Structure Consider the following graph: For the graph : the following sequences of depth first search (DFS) are given (A) abcghf (B) abfchg (C) abfhgc (D) afghbc Which of the following is correct?
i ➥ (A), (B) and (D) only
ii ➥ (A) ,(B) and (D) only
iii ➥ (B), (C) and (D) only
iv ➥ (A), (C) and (D) only
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q61➡|Computer Architecture A magnetic tape drive has transport speed of 200 inches per second and a recording density of 1600 bytes per inch. The time required to write 600000 bytes of date grouped in 100 charaters record with a blocking factor 10 is
i ➥ 2.0625 sec
ii ➥ 2.6251 sec
iii ➥ 2.0062 sec
iv ➥ 2.6150 sec
Best Explanation: Answer: (i) Explanation: Upload Soon
Q63➡|Artificial Intelligence Given below are two statements : one is labelled as assertion (A) and the other is labelled as Reason (R): Assertion (A) : p̃ Reason (R) : (r→q̃ , r→s , s→q̃ , p→q) In the light of the above statements, choose the correct answer from the options given below:
i ➥ Both (A) and (R) are true and (R) is the correct explanation of (A)
ii ➥ Both (A) and (R) are true but (R) is NOT correct explanation of (A)
iii ➥ (A) is true but (R) is false
iv ➥ (A) is false but (R) is true
Best Explanation: Answer: (i) Explanation: Upload Soon
Q66➡|Algorithm Consider the following statements of approximation algorithm : Statement (I) : Vertex-cover is a polynomial time 2-approximation algorithm Statement (II) : TSP-tour is a polynomial time 3 –approximation algorithm for travelling salesman problem with the triangle inequality. Which of the following is correct?
i ➥ Statement (I) true and Statement (II) false
ii ➥ Statement (I) and Statement (II) true
iii ➥ Statement (I) and Statement (II) true
iv ➥ Statement (I) and Statement (II) true
Best Explanation: Answer: (i) Explanation: Upload Soon
Q69➡| Given below are two statements : one is labelled as Assertion (A) and the other is labelled as Reason(R): Assertion (A) : A load and go assembler avoids the overhead of writing the object program out and reading it back in Reason (R) : This can be done with either one-pass or two pas assembler. In the light of the above statements, choose the correct answer from the options given below:
i ➥ Both (A) and (R) are true and (R) is the correct explanation of (A)
ii ➥ Both (A) and (R) are true but (R) is NOT correct explanation of (A)
iii ➥ (A) is true but (R) is false
iv ➥ (A) is false but (R) is true
Best Explanation: Answer: (i) Explanation: Upload Soon
Q70➡|Artificial Intelligence In a game playing search tree, upto which depth α-β pruning can be applied? (A) Root (0) level (B) 6 level (C) 8 level (D) Depends on utility value in a breadth order Choose the correct answer from the options given below :
i ➥ (B) and (C) only
ii ➥ (A) and (B) only
iii ➥ (A) , (B) and (C) only
iv ➥ (A) and (D) only
Best Explanation: Answer: (i) Explanation: Upload Soon
Q73➡| In reference to big data , consider the following database : (A) Memcached (B) Couch DB (C) Infinite graph Choose the most appropriate answer from the options given below:
i ➥ (A) and (B) only
ii ➥ (B) and (C) only
iii ➥ (C) and (A) only
iv ➥ (A), (B) and (C)
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q75➡|DBMS Consider the following statements : statement (I) : Conservative 2 PL is a deadlock free protocol Statement (II) : Thomas’s write rule enforces conflict serializablity Statement (III) : Timestamp ordering protocol ensures serializability based on the order of transaction timestamps. Which of the following is correct ?
i ➥ Statement (I), statement (II) true and Statement (III) false
ii ➥ Statement (I), Statement (III) true and Statement (II) false
iii ➥ Statement (I), Statement (II) false and Statement (III) true
iv ➥ Statement (I), statement (II) and Statement (III) true
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q78➡| In a database, a rule is defined as (P1 and P2) or P3? R1 (0.8) and R2 (0.3), where P1, P2, P3 are premises and R1, R2 are conclusions of rules with certainty factors (CF) 0.8 and 0.3 respectively. If any running program has produced P1, P2, P3 with CF as 0.5, 0.8, 0.2 respectively , find the CF of results on the basis of premises.
i ➥ CF(R1 = 0.8), CF(R2 = 0.3)
ii ➥ CF(R1 = 0.40), CF(R2 =0.15)
iii ➥ CF(R1 = 0.15), CF(R2 =0.35)
iv ➥ CF(R1 = 0.8), CF(R2 =0.35)
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q79➡|Data Structure Consider the traversal of a tree Preorder → ABCEIFJDGHKL Inorder → EICFJBGDKHLA Which of the following is correct post order traversal ?
i ➥ EIFJCKGLHDBA
ii ➥ FCGKLHDBUAE
iii ➥ FCGKLHDBAEIJ
iv ➥ IEJFCGKLHDBA
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q80➡|Software engineering Which Metrics are derived by normalizing quality and /or productivity measures by considering the size of the software that he been produced ?
i ➥ Function – Oriented Metrics
ii ➥ Function – Point Metrics
iii ➥ Line of code Metrics
iv ➥ Size Oriented Metrics
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q82➡|Programming A top down approach to programming calls for : Statement (I) : Working from the general to the specific Statement (II) : Postpone the minor decisions Statement (III) : A systematic approach Statement (IV) Intermediate coding of the problem Which of the following is true ?
i ➥ Statement (I) only
ii ➥ Statement (I) and Statement (II) only
iii ➥ Statement (I) , Statement (II) and Statement (III) only
iv ➥ Statement (I) , Statement (II) and Statement (IV) only
Best Explanation: Answer: (iii) Explanation: Upload Soon
Q83➡|DBMS Let R (ABCDEFGH) be a relation schema and F be the set of dependencies F = { A→ B, ABCD→E, EF→ G, EF→ H and ACDF→EG} the minimal cover of a set of functional dependencies is
i ➥ A→B, ACD→E, EF→ G, and EF→H
ii ➥ A→B, ACD→ E, EF→ G, EF→ H and ACDF → G
iii ➥ A→B, ACD→ E, EF→G, EF→H and ACDF→E
iv ➥ A→B, ABCD→E, EF→H and EF→G
Best Explanation: Answer: (i) Explanation: Upload Soon
Q85➡|TOC Consider the following statements about Context Free Language ( CFL) : Statement (I) : CFL is closed under homomorphism Statement (II) : CFL is closed under complement Which of the following is correct?
i ➥ Statement (I) is true and statement (II) is false
ii ➥ Statement (II) is true and statement (I) is false
iii ➥ Both statement (I) and statement (II) are true
iv ➥ Both statement (I) and statement (II) are false
Best Explanation: Answer: (i) Explanation: Upload Soon
Q96➡|Computer Network Based on following passage, answer the questions : A 300 km long truck operates at 1.536 mbps and is used to transmit 64 bytes frames and uses sliding window protocol. the propagation speed is 6 µ sec/km.
If only 6 bits are reserved for sequence number field , then the efficiency of the system is
i ➥ 0.587
ii ➥ 0.875
iii ➥ 0.578
iv ➥ 0.50
Best Explanation: Answer: (i) Explanation: Upload Soon
Q97➡|Computer Network Based on following passage , answer the questions : A 300 km long truck operates at 1.536 mbps and is used to transmit 64 bytes frames and uses sliding window protocol. the propagation speed is 6 μ sec/km.
The minimum number of bits required in sequence number fields of the packet is
i ➥ 6 bits
ii ➥ 7 bits
iii ➥ 5 bits
iv ➥ 4 bits
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q98➡|Computer Network Based on following passage , answer the questions : A 300 km long truck operates at 1.536 mbps and is used to transmit 64 bytes frames and uses sliding window protocol. the propagation speed is 6 µ sec/km.
The maximum achievable throughput is
i ➥ 0.768
ii ➥ 0.678
iii ➥ 0.901
iv ➥ 0.887
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q99➡|Computer Network Based on following passage , answer the questions : A 300 km long truck operates at 1.536 mbps and is used to transmit 64 bytes frames and uses sliding window protocol. the propagation speed is 6 µ sec/km.
The transmission and propagation delays are respectively
i ➥ Tt = 333.33 µ sec, Tp = 18000 µ sec
ii ➥ Tt = 300 µ sec, Tp = 15360 µ sec
iii ➥ Tt = 33.33 µ sec, Tp = 1800 µ sec
iv ➥ Tt = 1800 µ sec, Tp = 33.33 µ sec
Best Explanation: Answer: (i) Explanation: Upload Soon
Q100➡|Computer Network Based on following passage , answer the questions : A 300 km long truck operates at 1.536 mbps and is used to transmit 64 bytes frames and uses sliding window protocol. the propagation speed is 6 µ sec/km.
The Sender window size to get the maximum efficiency is
i ➥ 108
ii ➥ 109
iii ➥ 55
iv ➥ 56
Best Explanation: Answer: (ii) Explanation: Upload Soon
