Computer Science- Paper II
1. Consider the circuit shown below. In a certain steady state, Y is at logical '1'. What are the possible values of A,B,C?
(A) A=0, B=0, C=1
(B) A=0, B=C=1
(C) A=1, B=C=0
(D) A=B=1, C=1
Ans: Both A & D
2. The worst case time complexity of AVL tree is better in comparison to binary search tree for
(A) Search and Insert Operations
(B) Search and Delete Operations
(C) Insert and Delete Operations
(D) Search, Insert and Delete operations
Ans: D
3. The GSM network is divided into the following three major systems:
(A) SS, BSS, OSS
(B) BSS, BSC, MSC
(C) CELL, BSC, OSS
(D) SS, CELL, MSC
Ans: A
Switching Systems(SS),
Base Station Systems(BSS),
Operation Support System(OSS)
4. The Power Set of the set {Ø}
(A) Ø
(B) { Ø, {Ø}}
(C) {0}
(D) {o, Ø,{Ø}}
Ans: B
5. If the disk
head is located initially at 32, find the number of disk moves required
with FCFS if the disk queue of I/O blocks are 98, 37, 14, 124, 65, 67.
(A) 239
(B) 310
(C) 321
(D) 325
Ans:C
6. Component Level Design is concerned with
(A) Flow Oriented Analysis
(B) Class Based Analysis
(C) Both of the above
(D) None of the above
Ans: C
7. The C Language is
(A) Context free language
(B) Context Sensitive Language
(C) Regular Language
(D) None of the above
Ans:A
8. The Mobile Application Protocol(MAP) typically runs on top of which protocol
(A) SNMP(Simple Network Management Protocol)
(B) SMTP (Simple Mail Transfer Protocol)
(C) SS7 (Signalling Systems 7)
(D) HTTP(Hyper Text Transfer Protocol)
Ans: C
9. If a packet arrive with an M-bit value is '1' and a fragmentation offset value is '0', then it is ____________ fragment.
(A) First
(B) Middle
(C) Last
(D) All of the above
Ans: A
If the M bit
is 1, that means there is atleast one more fragment(offset). Because the
offset value is 0, it is the first fragment.
10. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be
(A) 32
(B) 64
(C) 128
(D) 160
Ans: D
Starting with the 1 bit = 128 to 255 = 128 numbers
Ending with 00 = 256/4 = 64 numbers
Half of these 64 numbers start with 1, leaving 32.
Assuming starting with 1 and ending with 00 is counted only once:
128 + 32 = 160
11. In complete design, 'reducing the strength' refers to
(A) Reducing the range of values of input variables
(B) Code Optimization using cheaper machine instructions
(C) Reducing efficiency of program
(D) None of the above
Ans: B
12, In which
addressing mode, the effective address of the operand is generated by
adding a constant value to the contents of register.
(A) Absolute
(B) Indirect
(C) Immediate
(D) Index
Ans: D
13. Which of the following is true?
(A) A relation in BCNF is always in 3NF
(B) A relation in 3NF is always in BCNF.
(C) BCNF and 3NF are same
(D) A relation in BCNF is not in 3NF
Ans:A
14. Given
memory partition of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and
processes of 212 K, 417 K, 112 K and 426 K (in order), using the
first-fit algorithm, in which partition would the process requiring 426 K
be placed
(A) 500 K
(B) 200 K
(C) 300 K
(D) 600 K
Ans:D
15. What is the size of the Unicode character in Windows Operating System?
(A) 8-bits
(B) 16-bits
(C) 32-bits
(D) 64-bits
Ans:C
16. In which tree, for every node the height of its left sub-tree and right sub-tree differ almost by one?
(A) Binary Search Tree
(B) AVL Tree
(C) Threaded Binary Tree
(D) Complete Binary Tree
Ans:B
AVL Balance Condition: For every node in the tree, the heights of its sub-tree and right sub-tree at most 1.
17.The design issue of Data Link Layer in OSI Reference Model is:
(A) Framing
(B) Representation of bits
(C) Synchronization of bits
(D) Connection Control
Ans:A
18. Given the following Expressions of a grammar
E -> E*F/F+E/F
F->F-F/id
Which of the following is true?
(A) * has higher precedence than +
(B) - has highed precedence than *
(C) + and - have same precedence
(D) + has higher precedence than *
Ans:B
19.The maturity levels used to measure a process are
(A) Initial, Repeatable,Defined, Managed, Optimized
(B) Primary, Secondary,Defined, Managed, Optimized
(C) Initial, Stating,Defined, Managed, Optimized
(D) None of these
Ans:A
Use the acronym “IRDMO” to remember them.
20.The Problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using:
(A) Parity Bit
(B) Aging
(C) Compaction
(D) Timer
Ans:B
A major problem with priority scheduling is indefinite blocking or
starvation. A solution to the problem of indefinite blockage of the
low-priority process is aging. Aging is a technique of gradually
increasing the priority of processes that wait in the system for a long
period of time.
21. Which API is used to draw a circle?
(A) Circle()
(B) Ellipse()
(C) Round Rect()
(D) Pie()
Ans:B (maybe)
DrawEllipse()
22.In DML, RECONNECT command cannot be used with
(A) OPTIONAL SET
(B) FIXED SET
(C) MANDATOR SET
(D) All of the above
Ans:B
The RECONNECT command can be used with both OPTIONAL and MANDATORY sets,
but not with FIXED sets. The RECONNECT command moves a member record
from one set instance to another set instance of the same set type. It
cannot be used with FIXED sets because a member record cannot be moved
from one set instance to another under the FIXED constraint.
23. Coaxial Cables are categorized by Radio Government rating are
adapted for specialized functions. Category RG-59 with impedance 75 used
for
(A) Cable TV
(B) Ethernet
(C) Thin Ethernet
(D) Thick Ethernet
Ans:A
Category - Impedance - Use
RG-59 - 75 ohm - Cable TV
RG-58 - 50 ohm - Thin Ethernet
RG-11 - 50 ohm - Thick Ethernet
24. RAD Stands for
(A) Rapid And Design
(B) Rapid Aided Development
(C) Rapid Application Development
(D) Rapid Application Design
Ans:C
25. Suppose that someone starts a chain letter. Each
person who receives the letter
is asked to send it on to four other people. Some people do this, but
others do not send any letter. How many people have seen the letter, including
the first person, if no one receives more than one letter and if the chain
letter ends after there have been 100 peoples who read it but did not send it
out? Also find How many people send out the letter?
(A) 122 & 22
(B) 111 & 11
(C) 133 & 33
(D) 144 & 44
Ans:C
m =4
l
=100
n=?
i
=?
For 4-ary
tree,
n = I + l
n = mi+1
. . . i + l = mi+1
i+100=4i+1
99
=3i
i =33
n
=mi + l
=4*33+1
=133
26. A hash function f defined as f(key)=key mod 13, with linear probing is used to insert keys 55,58,68,91,27,145. What will be the location of 79?
(A) 1
(B) 2
(C) 3
(D) 4
Ans:
27. Which of the following is true while converting CFG to LL(I) grammar?
(A) Remove left recursion alone
(B) Factoring grammar alone
(C) Both of the above
(D) None of the above
Ans:C
To convert an
arbitrary CFG to an LL(1) grammar we must remove left recursion and left
factoring if we can’t remove these then grammar becomes ambiguous and
LL(1) parsers can’t parse it.
28. Identify the Risk factors which are associated with Electronic Payment System.
(A) Fraudulent use of Credit Cards.
(B) Sending Credit Card details over Internet
(C) Remote storage of Credit Card details
(D) All of the above
Ans:D
29. Which of
the following are two special functions that are meant for handling
exception, that occur during exception handling itself?
(A) void terminate() and void unexpected()
(B) non-void terminate() and void unexpected()
(C) void terminate() and non-void unexpected()
(D) non-void terminate() and non-void unexpected()
Ans:A
30.Which of the following memory allocation scheme suffers from external fragmentation?
(A) Segmentation
(B) Pure Demand Paging
(C) Swapping
(D) Paging
Ans:A
31. Basis path testing falls under
(A) System Testing
(B) White Box Testing
(C) Black Box Testing
(D) Unit Testing
Ans:B
32. The User
Work Area(UWA) is a set of program variables declared in the host
program to communicate the contents of individual records between
(A) DBMS & the Host record
(B) Host Program and Host Record
(C) Host Program and DBMS
(D) Host Program and Host Language
Ans:C
33. Consider the tree
Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree
(A) d & h
(B) c & k
(C) g,b,c,h,i,m
(D) c & h
Ans: D
34. The maximum number of keys stored in a B-Tree of order m and depth d is
(A) m^(d+1)-1
(B) (m^(d+1)-1)/(m-1)
(C) (m-1)(m^(d+1)-1)
(D) (m^(d-1))/(m-1)
Ans: Answer is not there in the list.
the maximum number of keys (records that can be stored in the file) in a B-tree of order = m and depth = d is m^(d - 1).
35. Which of the following is the most powerful parsing method?
(A) LL(I)
(B) Canonical LR
(C) SLR
(D) LALR
Ans:B
36. In Unix, which of the following command is used to set the task priority?
(A) init
(B) nice
(C) kill
(D) PS
Ans:B
37. AES is a
round cipher based on the Rijnidal Algorithm that uses a 128-bit block
of data. AES has three different configurations. ______ rounds with a
key size of 128 bits, ________ rounds with a key size of 192 bits and
________ rounds with a key size of 256 bits.
(A) 5,7,15
(B) 10,12,14
(C) 5,6,7
(D) 20,12,14
Ans:B
38. Match the following IC families with their basic circuits
a. TTL 1.NAND
b. ECL 2. NOR
c. CMOS 3. Inverter
a b c
(A) 1 2 3
(B) 3 2 1
(C) 2 3 1
(D) 2 1 3
Ans: A
39. Match the following with respect to C++ data types
a. User-defined type 1. Qualifier
b. Built-in Type 2. Union
c. Derived Type 3. void
d. Long Double 4. Pointer
a b c d
(A) 2 3 4 1
(B) 3 1 4 2
(C) 4 1 2 3
(D) 3 4 1 2
Ans:A
40. Given an empty stack, after performing push(1), push(2), Pop, Push(3),
push(4) and pop, what is the value at the top of the stack?
(A) 4
(B) 3
(C) 2
(D) 1
Ans: D
41. Enumeration is a process of
(A) Declaring a set of integers
(B) Sorting a list of strings
(C) Assigning a legal values possible for a variable
(D) Sequencing a list of operators
Ans:C
42.Which of the following mode declaration is used in C++ to open a file for input?
(A) ios::app
(B) ios::ios
(C) ios::file
(D) ios::in
Ans:D
43. Data Encryption Technique are particularly used for ________
(A) Protecting data in data communication system.
(B) Reduce Storage Space Requirement
(C) Enhances Data Integrity
(D) Decreases Data Integrity
Ans:A
44. Let L be a
set accepted by a non-deterministic finite automaton. The number of
states in non-deterministic finite automation is |Q|. The maximum number
of states in equivalent finite automaton that accepts L is.
(A) |Q|
(B) 2|Q|
(C) 2^(|Q|)-1
(D) 2^(|Q|)
Ans:D
45. What is the result of the following expression? (1 &2) + (3 &4)
(A) 1
(B) 3
(C) 2
(D) 0
Ans:D
(1 & 2) + (3 & 4)
=( 001 & 010) + (011 + 100)
=(0) + (0)
The bit-wise AND operator (&) compares each bit of the first
operand to the corresponding bit of the second operand. If both bits are
1, the corresponding result bit is set to 1. Otherwise, the
corresponding result bit is set to 0.
46. Back propagation is a learning technique that adjusts weights in the neural network by propagating weight changes.
(A) Forward from source to sink
(B) Backward from sink to source
(C) Forward from source to hidden
(D) Backward from since to hidden
Ans:B
47. Match the following
a. TTL 1.High Fan out
b. ECL 2. Low Propagation Delay
c. CMOS 3. High Power Dissipation
a b c
(A) 3 2 1
(B) 1 2 3
(C) 1 3 2
(D) 3 1 2
Ans: A
48. ________ is an umbrella activity that is applied throughout the software engineering process
(A) Debugging
(B) Testing
(C) Designing
(D) Software Quality Assurance
Ans: D
49. Identify the operation which is commutative but not associate
(A) OR
(B) NOR
(C) EX-OR
(D) NAND
Ans: B & D
50. Given a Relation POSITION(Posing-No, Skill), then query to retreive all distinct pairs of posting-nos requiring skill is
(A) Select p.posting-no,p.posting-no
from position p
where p.skill=p.skill
and p.posting-no<p.posting-no;
(B) Select p1.posting-no,p2.posting-no
from position p1,position p2
where p1.skill=p2.skill
(C) Select p1.posting-no,p2.posting-no
from position p1,position p2
where p1.skill=p2.skill
and p1.posting-no<p2.posting-no;
(D) Select p1.posting-no,p2.posting-no
from position p1,position p2
where p1.skill=p2.skill
and p1.posting-no=p2.posting-no;
Ans:
From myside the key is this, most probably
Best of luck..
dont forget to like and follow the blog, and also dont hesitate any query or response about any question
No comments:
Post a Comment