Saturday, 26 November 2016

UGC NET Computer Science Paper II June 2011 - Part 5

41.       Which one of the items listed below is not one of the software engineering layers ?
(A) Process                   (B) Manufacturing
(C) Method                    (D) Tools
Answer: B
42.       What is the first stage in program development ?
(A) Specification and design
(B) System Analysis
(C) Testing
(D) None of the above
Answer: B
43.       By means of a data flow diagram, the analyst can detect
(A) Task duplication                (B) Unnecessary delays
(C) Task overlapping              (D) All of the above
Answer: D
44.       Which of these are the 5 generic software engineering framework activities ?
(A) Communication, planning, modelling, construction, deployment
(B) Communication, risk management, measurement, production, reviewing
(C) Analysis, designing, programming, Debugging, maintenance
(D) Analysis, planning, designing, programming, testing
Answer: A
45.       Many causes of the software crisis can be traced to mythology based on
(A) Management Myths          (B) Customer Myths
(C) Practitioner Myths             (D) All of the above
Answer: D
46.       Data warehousing refers to
(A) storing data offline at a separate site
(B) backing up data regularly
(C) is related to data mining
(D) uses tape as opposed to disk
Answer: C
47.       Virtual memory is
(A) related to virtual reality
(B) a form of ROM
(C) a form of RAM
(D) None of the above
Answer: C
48.       “M-Commerce” refers to
(A) a myth which does not exist in reality
(B) the ability of business to reach potential customers wherever they are
(C) the ability to have large capacity of memory storage dealing trade and commerce
(D) None of the above
Answer: D
49.       The principal electronic payment systems for electronic commerce is
(A) Credit Card                         (B) Digital Wallet
(C) Electronic Cheque                       (D) All of the above
Answer: D
50.    Which is the most valuable electronic commerce to the individual customer in long run ?
(A) Business to Customer                  (B) Business to Business
(C) Customer to Customer                 (D) None of the above
Answer: B

Friday, 25 November 2016

UGC NET Computer Science Paper II June 2011 - Part 4

31.       Object modules generated by assembler that contains unresolved external references are resolved for two or more object module by a/an
(A) Operating system              (B) Loader
(C) Linker                                  (D) Compiler
Answer: C
32.       A special software that is used to create a job queue is called
(A) Drive                        (B) Spooler
(C) Interpreter               (D) Linkage editor
Answer: B
33.       Which of the following permanent database that has an entry for each terminal symbol ?
(A) Literal table                         (B) Identifier table
(C) Terminal table                    (D) Source table
Answer: C
34.       In which way(s) a macroprocessor for assembly language can be implemented ?
(A) Independent two-pass processor
(B) Independent one-pass processor
(C) Expand macrocalls and substitute arguments
(D) All of the above
Answer: D
35.       Which of the following can be accessed by transfer vector approach of linking ?
(A) External data segments
(B) External subroutine
(C) Data located in other procedure
(D) All of the above
Answer: B
36.       Block or Buffer caches are used to
(A) improve disk performance
(B) handle interrupts
(C) increase the capacity of main memory
(D) speed up main memory Read operations
Answer: D
37.       A file organization component VSAM file is
(A) Relative records data set
(B) Keyed sequential data set
(C) Entry sequential data set
(D) All of the above
Answer: D
38.       A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as
(A) Semaphore                                    (B) Mutual exclusion
(C) Multiprogramming             (D) Message passing
Answer: B
39.       How many states can a process be in ?
(A) 3                   (B) 4
(C) 2                   (D) 5
Answer: D
40.    Which command allows you to view your file 24 lines at a time ?
(A) More                        (B) Cat
(C) Pg                (D) None of the above
Answer: A

Thursday, 24 November 2016

UGC NET Computer Science Paper II June 2011 - Part 3

21.       The number of different trees with 8 nodes is
(A) 256               (B) 255
(C) 248              (D) None of these
Answer: C
22.       Given a binary tree whose inorder and preorder traversal are given by
Inorder  : EICFBGDJHK
Preorder : BCEIFDGHJK
The post order traversal of the above binary tree is
(A) IEFCGJKHDB        (B) IEFCJGKHDB
(C) IEFCGKJHDB       (D) IEFCGJKDBH
Answer: A
23.       The number of disk accesses performed by insertion operation in B-tree of height h is
(A) 0(1)              (B) 0(1gh)
(C) 0(h)              (D) None of these
Answer: C
24.       Consider a hash table of size m = 10000 and the hash function h(k) = ∟m(kA mod 1)'┘ for A = (√5–1)/2. The location to the key k = 123456 is
(A) 46                 (B) 47
(C) 41                 (D) 43
Answer: C
25.       When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing n elements)
(A) q(n) and q(1) respectively
(B) q(n) and q(n) respectively
(C) q(1) and q(1) respectively
(D) None of the above
Answer: C
26.       A comparison of frequency division and time division multiplexing system shows that
(A) FDM requires a lower bandwidth, but TDM has greater noise immunity.
(B) FDM has greater noise immunity and requires lower bandwidth than TDM.
(C) FDM requires channel synchronization, while TDM has greater noise immunity.
(D) FDM requires more multiplex while TDM requires band pass filter.
Answer: C
27.       If carrier modulated by a digital bit stream, has one one of the possible phase of 0, 90, 180 and 270 degrees, then modulation called
(A) BPSK          (B) QPSK
(C) QAM            (D) MSK
Answer: B
28.       Consider the following statement :
(i) The bandwidth of the A.M., wave depends on the band width of the modulating signal.
(ii) The bandwidth of the A.M., wave depends on the modulation index.
(iii) The bandwidth of the F.M, wave for all practical purpose depends on the amplitude of the carrier. Of these statements the correct statements are
(A) (i, ii)              (B) (i, iii)
(C) (ii, iii)            (D) All of the above
Answer: B
29.       A smart modem can dial, hangup and answer incoming calls automatically. Can you tell who provides the appropriate instructions to the modem for this purpose ?
(A) Communication software
(B) Error detection protocols
(C) Link access procedure (LAP)
(D) Telecommunications
Answer: A
30.    Which of the following switching techniques is most suitable for interactive traffic ?
(A) Circuit switching               (B) Message switching
(C) Packet switching               (D) All of the above
Answer: C

Wednesday, 23 November 2016

GATE Computer Science Solved Session I 2016 - Part 5

41.       Let Q denote a queue containing sixteen numbers and S be an empty stack. Head(Q) returns the element at the head of the queue Q without removing it from Q. Similarly Top(S) returns the element at the top of S without removing it from S. Consider the algorithm given below.
The maximum possible number of iterations of the while loop in the algorithm is.............
Answer: 256
42.       Consider the following context-free grammars:
G1: S→aS|B, B→b|bB
G2: S→aA|bB, A→aA|B|ε, B→bB|ε
Which one of the following pairs of languages is generated by G1 and G2, respectively?
(A) {ambn|m > 0 or n > 0} and {ambn|m > 0 and n > 0}
(B) { ambn|m > 0 and n > 0} and { ambn|m > 0 or n ≥ 0}
(C) { ambn|m ≥ 0 or n > 0} and { ambn|m > 0 and n > 0}
(D) { ambn|m ≥ 0 and n > 0} and { ambn|m > 0 or n > 0}
Answer: D
43.       Consider the transition diagram of a PDA given below with input alphabet Σ = {a, b} and stack alphabet Γ = {X, Z}. Z is the initial stack symbol. Let L denote the language accepted by the PDA.
Which one of the following is TRUE?
(A) L = {anbn|n ≥ 0} and is not accepted by any finite automata
(B) L = {an|n ≥ 0} U {anbn|n ≥ 0} and is not accepted by any deterministic PDA
(C) L is not accepted by any Turing machine that halts on every input
(D) L = {an|n ≥ 0} U {anbn|n ≥ 0} and is deterministic context-free
Answer: D
44.       Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y’ reduces to W, and Z reduces to X’ (reduction means the standard many-one reduction). Which one of the following statements is TRUE?
(A) W can be recursively enumerable and Z is recursive.
(B) W can be recursive and Z is recursively enumerable.
(C) W is not recursively enumerable and Z is recursive.
(D) W is not recursively enumerable and Z is not recursive
Answer: C
45.       The attributes of three arithmetic operators in some programming language are given below.
The value of the expression 2 - 5 + 1 - 7 * 3 in this language is ..............
Answer: 9
46.       Consider the following Syntax Directed Translation Scheme (SDTS), with non-terminals {S, A} and terminals {a, b}
S→aA    {print 1}
S→a       {print 2}
S→Sb    {print 3}
Using the above SDTS, the output printed by a bottom-up parser, for the input aab is:
(A) 1 3 2
(B) 2 2 3
(C) 2 3 1
(D) Syntax Error
Answer: C
47.       Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires 48 bits, then the size of the per-process page table is ................ megabytes.
Answer: 384
48.       Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is ..............
Answer: 346
49.       Consider a computer system with ten physical page frames. The system is provided with an access sequence a1, a2, ..., a20, a1, a2, ..., a20), where each ai is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is ..............
Answer: 1
50.    Consider the following proposed solution for the critical section problem. There are n processes: P0 ...Pn−1. In the code, function pmax returns an integer not smaller than any of its arguments. For all i, t[i] is initialized to zero.
Code for Pi:
do {
c[i]=1; t[ i ]=pmax(t[0],: ::,t[n-1])+1; c[ i ]=0;
for every j ≠ i in{0,: ::,n-1}  {
while (c[ j ]);
while (t[ j ] !=0 && t[ j ]<= t[ i ]);
}
Critical Section;
t[ i ]=0;
Remainder Section;
} while (true);

Which one of the following is TRUE about the above solution?
(A) At most one process can be in the critical section at any time
(B) The bounded wait condition is satisfied
(C) The progress condition is satisfied
(D) It cannot cause a deadlock
Answer: A
51.    Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects {O1,...,Ok}. This is done in the following manner:
Step 1. T acquires exclusive locks to O1, ... , Ok in increasing order of their addresses. Step 2. The required operations are performed.
Step 3. All locks are released.
This protocol will
(A) guarantee serializability and deadlock-freedom
(B) guarantee neither serializability nor deadlock-freedom
(C) guarantee serializability but not deadlock-freedom
(D) guarantee deadlock-freedom but not serializability
Answer: A
52.    Consider that B wants to send a message m that is digitally signed to A. Let the pair of private and public keys for A and B be denoted by Kx- and Kx+ for x=A,B, respectively. Let Kx(m) represent the operation of encrypting m with a key Kx and H(m) represent the message digest. Which one of the following indicates the CORRECT way of sending the message m along with the digital signature to A?
Answer: B
53.    An IP datagram of size 1000 bytes arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is 100 bytes. Assume that the size of the IP header is 20 bytes.
The number of fragments that the IP datagram will be divided into for transmission is .....................
Answer: 13
54.    For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1 megabyte and the maximum output rate is 20 megabytes per second. Tokens arrive at a rate to sustain output at a rate of 10 megabytes per second. The token bucket is currently full and the machine needs to send 12 megabytes of data. The minimum time required to transmit the data is ................. seconds.
Answer: 1.1
55.    A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second). Size of an acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps. The one-way propagation delay is 100 milliseconds.
Assuming no frame is lost, the sender throughput is ................ bytes/second.
Answer: 2500

Tuesday, 22 November 2016

GATE Computer Science Solved Session I 2016 - Part 4

31.       The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable. The minimum number of times the DMA controller needs to get the control of the system bus from the processor to transfer the file from the disk to main memory is ....................
Answer: 456
Explanation:
Data count register gives the number of words the DMA can transfer in a single cycle. Here it is 16 bits.
Data that can be transferred in one go = 216 bytes = 64 kilobytes (in one cycle)
Given file size = 29154 kilobytes
So, the required answer is, ceil(29154/64) = 456
32.       The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage (with delay 800 picoseconds) is replaced with a functionally equivalent design involving two stages with respective delays 600 and 350 picoseconds. The throughput increase of the pipeline is ................ percent.
Answer: 33
Explanation:
Throughput of 1st case T1 = 1/max delay =1/800
Throughput of 2nd case T2 = 1/max delay= 1/600
The throughput increase of the pipeline    = (T2-T1)/T1
= ( (1/600) - (1/800) ) / (1/800) * 100
= 33.33%
33.       Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is:
(A) Θ(1)
(B) Θ(Log (n))
(C) Θ(√ n)
(D) Θ(n)
Answer: B
Explanation:
34.       The following function computes the maximum value contained in an integer array p[] of size n (n >= 1)
int max(int *p, int n) {
int a=0, b=n-1;
while (...............) {
if (p[a] <= p[b]) { a = a+1; }
else { b = b-1; }
}
return p[a];
}
The missing loop condition is
(A) a != n
(B) b != 0
(C) b > (a + 1)
(D) b != a
Answer: D
35.       What will be the output of the following C program?
void count(int n) {
static int d = 1;
printf("%d ", n);
printf("%d ", d);
d++;
if(n>1) count(n-1);
printf("%d ", d);
}
void main() {
count(3);
}
(A) 3 1 2 2 1 3 4 4 4
(B) 3 1 2 1 1 1 2 2 2
(C) 3 1 2 2 1 3 4
(D) 3 1 2 1 1 1 2
Answer: A
36.       What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed?
a=3;
void n(x) {x = x * a; print(x);}
void m(y) {a = 1; a = y - a; n(a); print(a);}
void main() {m(a);}
(A) 6, 2               (B) 6, 6
(C) 4, 2               (D) 4, 4
Answer: D
37.       An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element?
(A) O(1)
(B) O(d) but not O(1)
(C) O(2d) but not O(d)
(D) O(d2d) but not O(2d)
Answer: B
38.       Consider the weighted undirected graph with 4 vertices, where the weight of edge {i, j} is given by the entry Wij in the matrix W.
The largest possible integer value of x, for which at least one shortest path between some pair of vertices will contain the edge with weight x is .................
Answer: 12
39.       Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ..................
Answer: 7
40.    G = (V, E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE?
I. If e is the lightest edge of some cycle in G, then every MST of G includes e
II. If e is the heaviest edge of some cycle in G, then every MST of G excludes e
(A) I only
(B) II only
(C) both I and II
(D) neither I nor II
Answer: B

UGC NET Computer Science

Computer GK App