tmyiYdDr

11.
2The truth table
3X Y f(X,Y)
40 0 0
50 1 0
61 0 1
71 1 1
8represents the Boolean function :
9Answer: X
102.
11Consider the following recursive C function.
12Void get (int n)
13{if (n<1) return;
14get (n-1)
15get (n-3) ;
16printf ("%d",n);
17If get(6) function is being called in main () then how many times will the get() function be invoked
18before returning to the main ( ) ?
19Answer : 25
203.
21Which of the following is shared between all of the threads in a process? Assume a kernel
22level thread implementation.
23Answer: File Descriptor/ Heap/ Stack pointer/ stack (Shared)
244.
25____________is the first schema to be designed when you are developing a DBMS
26Answer: Relation Schema / Conceptual Schema
275.
28________________ operate at the network layer, connecting two or more network segments that
29use the same or different data link layer protocols, but the same network layer protocol.
30Answer: Router
316.
32Buffer stock’ is the level of stock which is ___________
337.
34The addressing mode used in an instruction of the form ADD R1, R2 is _____.
35Answer: Absolute/Direct Addressing8.
36Which of the following is not true of virtual memory?
37Ans: It requires the use of a disk or other secondary storage.( Actually it does not
38require).
399.
40General Purpose Software which creates and manipulates database is
41Answer : DBMS
4210.
43The _____ is generally used to group hosts based on the physical network topology.
44Answer: Hub/Switch
4511.
46Identify the item that is not taken into account in computing the current ratio
4712.
48#include
49int main ()
50{
51static int a[]={10, 20, 30, 40, 50};
52static int *p[]= {a, a+3, a+4, a+1, a+2};
53int **ptr=p;
54ptr++;
55printf ("%d%d", **p, **ptr);
56}
57The output of the program is ___
58Answer: 10 4013.
59What will be the output of the following C program?
60void count(int n){
61static int d=1;
62printf("%d ", n);
63printf("%d ", d);
64d++;
65if(n>1) count(n-1);
66printf("%d ", d);
67}
68void main(){
69count(3);
70}
71Output : 3 1 2 2 1 3 4 4 4
7214.
73Which of the following are generally the inventories of a service business?
74Answer:
7515.
76The load instruction is mostly used to designate a transfer from memory to a
77processor register known as
78Answer: Accumulator
7916.
80With a single resource, deadlock occurs,
81a)
82b)
83c)
84d)
85if there are more than two processes competing for that resource
86if there are only two processes competing for that resource
87if there is a single process competing for that resource
88None of these
89Answer: Deadlock Doesnot occour with a single resource
9017.
91System catalogue is a system created database that describes18.
92______ operate at the network layer, connecting two or more network segments that use the
93same or different data link layer protocols, but the same network layer protocol.
94Answer: Router
9519.
96Which of the following is an advantage of using database systems?
97Answer: Data can be accessed by multiple programs
9820.
99User Datagram Protocol adds no additional reliability mechanisms except one which is optional.
100Identify that.
101Answer: Checksum
10221.
103Which of the following groups of workers would be classified under indirect labour?
10422.
105Mutual exclusion problem occurs between
106Two disjoint process that do not interact
107- Process sharing same resources
108- Process not sharing same resources
109- None of these
11023.
111Simplified form of the boolean expression (X + Y + XY) (X + Z) is
112Answer : X+YZ
11324.
114Consider the following program:
115int f(int *p, int n)
116{
117if (n <= 1) return 0;
118else return max ( f (p+1, n-1),p[0]-p[1]);
119}
120int main()
121{
122int a[] = {3,5,2,6,4};
123printf("%d", f(a,5));
124}
125The value printed by this program is
126Answer: 3 (i.e. 5-2=3 or the maximum difference between any two consecutive numbers
127taken from left to right)25.
128What schema defines how and where the data are organized in a physical storage?
129Answer: Physical Database Schema
13026.
131Which of the following logic expression is incorrect?
132Answer: 1 XOR 1 XOR 0 = 1 (FALSE, actually should be 0)
13327.
134The maintenance department of a manufacturing company is a/ an ____________
13528.
136For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements
137is/are TRUE ?
138I. At least three non-overlapping channels are available for transmissions.
139II. The RTS-CTS mechanism is used for collision detection.
140III.Unicast frames are ACKed.
141Answer: ! and III are true
14229.
143Use of ________ allows for some processes to be waiting on I/O while another process
144executes.
145Answer :
14630.
147To prevent any method from overriding, the method has to declared as,
148Answer: Final
14931.
150The protocol data unit (PDU) for the application layer in the Internet stack is
151(C) Message is answer.
152For Application, Presentation and Session layers, the PDU is message
153For Transport layer, PDU is segment for TCP and datagram for UDP
154For Network layer, PDU is packet
155For Datalink layer, PDU is frames
156For physical layer, PDU is stream of bits
15732.
158The E-R model was first introduced by
159Answer: Peter Chen
16033.
161Acid test ratio should normally be ______34.
162The truth table
163X Y f(X,Y)
1640 0 0
1650 1 0
1661 0 1
1671 1 1
168represents the Boolean function
169Answer: X
17035.
171______ OS pays more attention on the meeting of the time limits.
172Answer: Real Time
17336.
174Consider the following C program.
175#include
176int f1 (void) ;
177int f 2 void ;
178int x 10;
179int main ()
180{
181int x=1;
182x+=f1()+ f2()+f3()+f2() ;
183printf("%d", x);
184return 0;
185}
186int f1(){int x=25; x++; return x;}
187int f2(){static int x =50; x++;return x;}
188int f3(){x*=10; return x};
189The output of the program is_________.
190Answer: 230
19137.
192Consider the function func shown below:
193int func(int num) {
194int count = 0;
195while (num) {
196count++;
197num>>= 1;
198}
199return (count);
200}
201The value returned by func(435)is
202Answer: 9
20338.
204Budgetary control facilitates easy introduction of the _________________
20539.
206The father of relational database system is
207Answer:
208Edgar Frank "Ted" Codd40.
209The performance of cache memory is frequently measured in terms of a quantity called
210Answer: Hit Ratio
21141.
212An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available
213with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization
214A, and a quarter to Organization B, while retaining the remaining with itself. Which of the
215following is a valid allocation of address to A and B?
216(A) 245.248.136.0/21 and 245.248.128.0/22
217(B) 245.248.128.0/21 and 245.248.128.0/22
218(C) 245.248.132.0/22 and 245.248.132.0/21
219(D) 245.248.136.0/22 and 245.248.132.0/21
22042.
221Using 10's complement 72532- 3250 is
222Answer: 69282
22343.
224What is the RDBMS terminology for a row
225Answer: Tuple
22644.
227A current ratio of less than one means
228Answer: Liabilities are Greater than assets
22945.
230Consider the following C program segment.
231#include
232intmain()
233{char sl [7]="1234",*p;
234p=sl+2;
235*p='0';
236printf ("%s",sl)
237{
238What will be printed by the program?
239Answer: 1204
24046.
241The 16-bit 2?s complement representation of an integer is 1111 1111 1111 0101, its decimal
242representation is
243Answer : -1147.
244Which of the following is/are example(s) of stateful application layer protocols?
245(i)HTTP
246(ii)FTP
247(iii)TCP
248(iv)POP3
249Answer: (ii) & (iv)
25048.
251What is the software that runs a computer, including scheduling tasks, managing storage, and
252handling communication with peripherals?
253Answer: Operating System
25449.
255Budgetary control system acts as a friend, philosopher and guide to the ____________
256Management
257Share holders
258Creditors
259Employees
26050.
261Which of the following is not usually stored in a two-level page table?
26251.
263Consider the following recursive C function.
264Void get (int n)
265{if (n<1) return;
266get (n-1)
267get (n-3) ;
268printf ("%d",n);
269If get(6) function is being called in main () then how many times will the get() function be invoked
270before returning to the main ( ) ?
271Answer : 25
27252.
273A circuit that converts n inputs to 2^n outputs is called
274Answer : Decoder
27553.
276The relationship that exists within the same entity type is called as _________
277relationship.
278Answer: Recursive
27954.
280TCP manages a point-to-point and _______ connection for an application between two
281computers.
282Answer : Reliable55.
283Decoder is a
284Answer: decoder is a combinational logic circuit that converts binary information from
285the n coded inputs to a maximum of 2 n unique outputs
28656.
287What is the maximum number of IP addresses that can be assigned to hosts on a local subnet
288that uses the 255.255.255.224 subnet mask?
289Answer: 30
29057.
291The purpose of a TLB is
292Answer: A
293translation lookaside buffer (TLB) is a memory cache that stores
294recent translations of virtual memory to physical addresses for faster
295retrieval
29658.
297#include
298int main ()
299{
300static int a[]={10, 20, 30 40, 50};
301static int *p[]= {a, a+3, a+4, a+1, a+2};
302int **ptr=p;
303ptr++;
304printf ("%d%d", ptr p, **ptr);
305}
306The output of the program is ________10 40__.
30759.
308The total cost that increases when the quantity produced is increased by one unit is called
309____________
310Ans: Marginal Cost
31160.
312Normalisation of database is used to
313to reduce data redundancy and improve data integrity
31461.
315Consider the following program in C language:
316#include
317main()
318{
319int i;
320int *pi = &i;
321scanf(?%d?,pi);
322printf(?%d\n?, i+5);
323}
324It prints the value by incrementing it by 5
325Which one of the following statements is TRUE?62.
326What is the RDBMS terminology for a set of legal values that an attribute can have ?
327Answer: Domain
328Degree – Numver of columns
329Cardinality – Number of rows
33063.
331The _____ is generally used to group hosts based on the physical network topology.
332Answer : Hub/Switch
33364.
334To build a mod-19 counter the number of flip-flops required is
335Answer : 5
33665.
337Fixed budget is useless for comparison when the level of activity is ___________
33866.
339System calls:
340A system call is a way by which a program/process requests services of operating
341system (kernel). And a priviledged instructions in an instruction that can be
342performed only in kernel/supervisor mode.
34367.
344Which of the following is not an activity listed in the statement of cash flows?
34568.
346The smallest integer than can be represented by an 8-bit number in 2?s complement form is
347Answer: -128
34869.
349What is the main difference between traps and interrupts?
350Answer: Trap is a software generated interrupt.
35170.
352ATM uses a ____ packet size
353Answer : 53 Octets 5 Header + 48 Payload
35471.
355Which of the following concurrency control mechanisms insist unlocking of all read and write
356locks of transactions at the end of commit?
35772.
358Consider the following C program.
359#include
360int f1 (void) ;
361int f 2 void ;
362int x 10;
363int main ()
364{
365int x=1;x+=f1()+ f2()+f3()+f2() ;
366printf("%d", x);
367return 0;
368}
369int f1(){int x=25; x++; return x;}
370int f2(){static int x =50; x++;return x;}
371int f3(){x*=10; return x};
372The output of the program is_____230____.
37373.
374Class D in network is used for
375Answer: Multicasting
37674.
377What is the RDBMS technology for the number of attributes in a relation?
378Answer : Degree
37975.
380All factory costs are treated as _______ while all administration costs are treated as
381________
38276.
3831024 bit is equal to how many byte
384Answer : 128
38577.
386Buffering is useful because
387The buffer allows each device or process to operate without being held up by the other.
38878.
389Consider the following C code segment:
390int a, b, c = 0;
391void prtFun(void);
392main( )
393{ static int a = 1; /* Line 1 */
394prtFun( );
395a + = 1;
396prtFun( )
397printf(?\n %d %d ?, a, b);
398}
399void prtFun(void)
400{ static int a=2; /* Line 2 */
401int b=1;
402a+=++b;
403printf(?\n %d %d ?, a, b);
404}
405What output will be generated by the given code segment if:
406Line 1 is replaced by auto int a = 1;
407Line 2 is replaced by register int a = 2;
408ANSWER: (A) 3 1
4094 1
4104 2
411(B) 4 2
4126 16 1
413(C) 4 2
4146 2
4152 0
416(D) 4 2
4174 2
4182 0
41979.
420Consider the following program:
421int f(int *p, int n)
422{
423if (n <= 1) return 0;
424else return max ( f (p+1, n-1),p[0]-p[1]);
425}
426int main()
427{
428int a[] = {3,5,2,6,4};
429printf("%d", f(a,5));
430}
431The value printed by this program is
432ANSWER : 3
43380.
434_______RELATIONAL/CONCEPTUAL_____is the first schema to be designed
435when you are developing a DBMS
43681.
437Adjacent squares in a K-Map represents a
438ANSWER: A group is a loose term for the enclosure containing adjacent square.
43982.
440If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the
441service provided is for
442Answer: Higher Priority
44383.
444An area of a business which collects costs is known as __________
44584.
446What will be the output of the following program?
447#include
448using namespace std;
449class x {
450public:
451int a;
452x();
453};
454x::x() { a=10; cout<
455class b:public x {
456public:b();
457};
458b::b() { a=20; cout<
459int main ()
460{
461b temp;
462return 0;
463}
464Answer: 10 20
46585.
466An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of
467processes is ________.
468Answer: Shortest Job First
46986.
470Minterms are arranged in map in a sequence of
471Answer: Gray Code
47287.
473Which one of the following variables is not categorical?
474Answer : Age of a person
47588.
476Suppose that everyone in a group of N people wants to communicate secretly with N-1 others
477using symmetric key cryptographic system. The communication between any two persons should
478not be decodable by the others in the group. The number of keys required in the system as a
479whole to satisfy the confidentiality requirement is
480(A) 2N
481(B) N(N – 1)
482(C) N(N – 1)/2
483(D) (N – 1) 2
48489.
485The servlet life cycle has the following cycle.
4861. Servlet class is loaded.
4872. Servlet instance is created.
4883. init method is invoked.
4894. service method is invoked.
4905. destroy method is invoked.
49190.
492In the IPv4 addressing format, the number of networks allowed under Class C addresses is
493Answer: 2,097,152 (2 21 )
49491.
495What is data collection?Answer: Data collection is the process of gathering and measuring information on
496targeted variables in an established systematic fashion, which then enables one to
497answer relevant questions and evaluate outcomes.
49892.
499When a program tries to access a page that is mapped in address space but not loaded in
500physical memory, then
501Answer: Page fault occours
50293.
503The main difference between JK and RS flip-flop is that
504The main difference between a JK flip-flop and an SR flip-flop is that in the JK flip-
505flop, both inputs can be HIGH. When both the J and K inputs are HIGH, the Q
506output is toggled, which means that the output alternates between HIGH and LOW.
507Thereby the invalid condition which occurs in the SR flipflop is eliminated.
50894.
509SQl allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in
510the result of joins. Which one of the following queries always gives the same answer as the
511nested query shown below:
512select * from R where a in (select S.a from S)
513A) Select R.* from R, S where R.a=S.a
514(B) Select distinct R.* from R, S where R.a=S.a
515(C) Select R.* from R, (select distinct a from S) as S1 where R.a=S1.a
516(D) Select R.* from R, S where R.a = S.a and is unique R
51795.
518Which algorithm chooses the page that has not been used for the longest period of time
519whenever the page required to be replaced?
520Answer: Least Recently Used(LRU)
52196.
522Which of the following unit will choose to transform decimal number to binary code ?
523A. Encoder
524B. Decoder
525C. Multiplexer
526D. Counter
52797.
528Given the following schema:employees(emp-id, first-name, last-name, hire-date,dept-id,
529salary)departments(dept-id, dept-name, manager-id, location-id)
530You want to display the last names and hire dates of all latest hires in their respective
531departments in the location ID 1700. You issue the following query:SQL>SELECT last-name,
532hire-date
533FROM employees
534WHERE (dept-id, hire-date) IN
535(SELECT dept-id, MAX(hire-date)
536FROM employees JOIN departments USING(dept-id)WHERE location-id = 1700
537GROUP BY dept-id);
538What is the outcome?
539(A) It executes but does not give the correct result.
540(B) It executes and gives the correct result.
541(C) It generates an error because of pairwise comparison.
542(D) It generates an error because the GROUP BY clause cannot be used with table joins
543in a subquery
54498.
545The schedule used to measure a respondent’s opinion is ________
54699.
547The following function computes the maximum value contained in an integer array
548p[ ] of size n (n >= 1).
549int max(int *p, int n) {
550int a=0, b=n-1;
551while (__________) {
552if (p[a] <= p[b]) { a = a+1; }
553else { b = b-1; }
554}
555return p[a];
556}
557The missing loop condition is
558Answer: b!=a
559100.
560ICMP is primarily used for
561Answer: Error and diagnostics
562101.
563List of all the units of the population is called _____________
564102.
565TCP manages a point-to-point and _______ connection for an application between two
566computers
567Answer: Reliable
568103.
569The best index for exact match query is
570104.
571The embedded c program is converted by cross compiler to
572Answer: Machine Language
573105.
574How many address bits are needed to select all memory locations in the 16K × 1 RAM?
575[A]. 8
576[B]. 10
577[C]. 14
578[D]. 16106.
579Which of the following boolean expressions is not logically equivalent to all of the rest ?
580(a) wxy' + wz' + wxyz + wy'z
581(b) w(x + y' + z')
582(c) w + x + y' + z'
583(d) wx + wy' + wz'
584107.
585If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative
586mapping. Then each word of cache memory shall be_____.
587a) 11 bits
588b) 21 bits
589c) 16 bits
590d) 20 bits
591108.
592The best sample is one that is ____________
593109.
594What is the output of the following program?
595#include
596using namespace std;
597int main()
598{
599int x=20;
600if(!(!x)&&x)
601cout<<x;
602else
603{
604x=10;
605cout<<x;
606return 0;
607}}</x;
608</x;
609Answer: 20
610110.
611Assume a table Employee (Eno, Ename, Dept, Salary, Phone) with 10000 records.
612Also assume that Employee has a non-clustering index on Salary, clustering indexes on Dept
613and Phone. If there is a SQL query "SELECT Eno FROM Employee WHERE Salary/12 = 10000",
614which of the following will happen during query execution?
615Answer: Search/Selection?
616111.
617Which of the following statements is true ?
618112. Which standard TCP port is assigned for contacting SSH servers?a) port 21
619b) port 22
620c) port 23
621d) port 24
622113.
623Consider the following schema as:
624Product_Master (prod_id, prod_name, rate)
625Purchase_details (prod_id, quantity, dept_no, purchase_date).
626Choose the suitable relational algebra expressionn for Get Product_id, Product_name & quantity
627for all purchased products
628114.
629When an instruction is read from the memory, it is called
630Answer: Instruction cycle (Also called Fetch-Decode-Execute Cycle)
631115.
632______________ research deals with practical problems
633116.
634Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The
635round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The
636time taken (in msec) by the TCP connection to get back to 32 KB congestion window is
637(A) 1100 to 1300
638(B) 800 to 1000
639(C) 1400 to 1600
640(D) 1500 to 1700
641Explanation: Given that at the time of Time Out, Congestion Window Size
642is 32KB 32KB and RTT = 100ms 100ms,
643When Time Out occurs, for the next round of Slow Start,
644Threshold = size of congestion window2 size of congestion window2 ,
645Threshold = 16KB
646Suppose we have a slow start ==>> 2KB∣4KB∣8KB∣16KB 2KB∣4KB∣8KB∣16KB (As
647the threshold is reached, Additive increase
648starts) ∣18KB∣20KB∣22KB∣24KB∣26KB∣28KB∣30KB∣32KB ∣18KB∣20KB∣22KB∣24K
649B∣26KB∣28KB∣30KB∣32KB
650Here | (vertical line) is representing RTT so the total number of vertical lines
651is 11∗100ms 11∗100ms==>> 1100msec 1100msec and so this is the answer...117.
652Consider the following function written the C programming language.
653void foo (char * a ) {
654if (* a & & * a ! =' ' ){
655putchar (*a);
656}
657}
658}
659The output of the above function on input ?ABCD EFGH? Is
660Actual gate Question: Consider the following function written in the C
661programming langauge :
662void foo(char *a)
663{
664if (*a && *a != ' ')
665{
666foo(a+1);
667putchar(*a);
668}
669}
670The output of the above function on input "ABCD EFGH" is
671A. ABCD EFGH
672B. ABCD
673C. HGFE DCBA
674D. DCBA
675118.
676The minimum number of NAND gates required to implement the Boolean function.
677A + AB' + AB'C is equal to
678A. 0 (Zero)
679B. 1
680C. 4
681D. 7
682Explanation :
683A(1+B'+B'C) which is equal To A
684So No need For any NAND gate119.The 16 bit flag of 8086 microprocessor is responsible to indicate ___________
685A. the condition of result of ALU operation
686B. the condition of memory
687C. the result of addition
688D. the result of subtraction
689120. Creating a B Tree index for your database has to specify in _____.
690a. DDL
691b. SDL
692c. VDL
693d. TCL
694121.UDP has a smaller overhead then TCP, especially when the total size of the messages is
695Answer: SMALL
696122.
697A solution to the Dining Philosopher?s problem which avoids Deadlock can be:
698A. ensure that all philosophers pick up the left fork before the right fork
699B. ensure that all philosophers pick up the right fork before the left fork
700C. ensure that one particular philosopher picks up the left fork before
701the right fork, and that all other philosophers pick up the right fork
702before the left fork
703D. None of the above
704Answer: C
705123.
706Plan of study of a researcher is called the __________
707124.
708For a C program accessing X[i][j][k], the following intermediate code is generated by a compiler.
709Assume that the size of an integer is 32 bits and the size of a character is 8 bits.
710t0 = i * 1024
711t1 = j * 32
712t2 = k * 4
713t3 = t1 + t0
714t4 = t3 + t2
715t5 = X[t4]
716Which one of the following statements about the source code for the C program is CORRECT?
717A. X is declared as "int X[32] [32] [8]”.
718B. X is declared as "int X[4] [1024] [32]”.
719C. X is declared as "char X[4] [32] [8]”.
720D. X is declared as "char X[32] [16] [2]”.Answer: A
721125.Which of the following are used to generate a message digest by the network security
722protocols?
723(P) RSA (Q) SHA-1 (R) DES (S) MD5
724(A) P and R only
725(B) Q and R only
726(C) Q and S only
727(D) R and S only
728Answer :C
729Explanation:
730 RSA – It is an algorithm used to encrypt and decrypt messages.
731 SHA 1 – Secure Hash Algorithm 1, or SHA 1 is a cryptographic hash function . It
732produces a 160 bit (20 byte) hash value (message digest).
733 DES – Data Encryption Standard, or DES is a symmetric key algorithm for
734encryption of electronic data.
735
736MD5 – Message Digest 5, or MD5 is a widely used cryptographic hash function that
737produces a 128 bit hash value (message digest).
738126.The data manipulation language used in SQL is a,
739(I) Procedural DML
740(II) Non-Procedural DML
741(III) Modification DML
742(IV) Declarative DML
743Answer : Procedural and Declarative
744127.
745A variable that is presumed to cause a change in another variable is called a/an _____________
746a. categorical variable
747b. dependent variable
748c. independent variable
749d. intervening variable
750Intervening Variable: An intervening variable (sometimes called a mediating variable) is a
751hypothetical variable used to explain causal links between other variables. Intervening
752variables cannot be observed in an experiment (that's why they are hypothetical).
753128.
754The 16-bit 2?s complement representation of an integer is 1111 1111 1111 0101, its decimal
755representation is
756Answer : -11129.
757The OS of a computer may periodically collect all the free memory space to form contiguous
758block of free space. This is called
759A. Concatenation
760B. Garbage collection
761C. Collision
762D. Dynamic Memory Allocation
763130.
764public class MyRunnable implements Runnable
765{
766public void run()
767{
768// some code here
769}
770}
771which of these will create and start this thread?
772[A]. new Runnable(MyRunnable).start();
773[B]. new Thread(MyRunnable).run();
774[C]. new Thread(new MyRunnable()).start();
775[D].
776new MyRunnable().start();
777131.
778A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
779page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
780maximum size of the page table of a process is 24 megabytes, the length of the virtual address
781supported by the system is _________ bits.
782(A) 36
783(B) 32
784(C) 28
785(D) 40
786Explanation: A
787page table entry has following number of bits.
7881 (valid bit) +
7891 (dirty bit) +
7903 (permission bits) +
791x bits to store physical address space of a page.
792Value of x = (Total bits in physical address) -
793(Total bits for addressing within a page)
794Since size of a page is 8 kilobytes, total bits needed within
795a page is 13.So value of x = 32 - 13 = 19
796Putting value of x, we get size of a page table entry =
7971 + 1 + 3
798+ 19 = 24bits.
799Number of page table entries
800= (Page Table Size) / (An entry size)
801= (24 megabytes / 24 bits)
802= 2 23
803Vrtual address Size
804= (Number of page table entries) * (Page Size)
805= 2 23 * 8 kilobits
806= 2 36
807Therefore, length of virtual address space = 36
808132.
809DMA is useful for the operations
810Answer: DMA
811is useful for transferring large quantities of data between memory
812and devices. It eliminates the need for the CPU to be involved in the transfer,
813allowing the transfer to complete more quickly and the CPU to perform other
814tasks concurrently.
815133.
816Data security threats include
817A.
818Hardware failure
819B. Privacy invasion
820C. Fraudulent manipulation of data
821D. All of the above
822134.
823Open-ended questions provide primarily ______ data
824135.
825Assume a relation ACCOUNT (acno, balance, type, branch, last_accessed) with 1 million
826records. If a SQL query "SELECT balance FROM account WHERE balance>5000" would
827produce 800000 records, which one of the following is the optimized version of relational algebra
828expressions that is equivalent to the given SQL query?
829136.
830What does the code snippet given below do?
831void fun1(struct node* head)
832{
833if(head == NULL)return;
834fun1(head->next);
835printf("%d
836", head->data);
837}
838Ans: Prints all nodes of linked list in reverse order
839137.
840Given the following structure template, choose the correct syntax for accessing th
841e 5th subject marks of the 3rd student.
842struct stud
843{
844int marks[6];
845char sname[20];
846char rno[10];
847}s[10];
848Answer: s[2].marks[4]
849138.
850Which of the following transport layer protocols is used to support electronic mail?
851(A) SMTP
852(B) IP
853(C) TCP
854(D) UDP
855139.
856Three concurrent processes X, Y, and Z execute three different code segments that access and
857update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores
858a, b and c; Process Y executes the P operation on semaphores b, c and d; Process Z executes
859the P operation on semaphores c, d, and a before entering the respective code segments. After
860completing the execution of its code segment, each process invokes the V operation (i.e., signal)
861on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of
862the following represents a deadlock-free order of invoking the P operations by the processes?
863(A) X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
864(B) X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
865(C) X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
866(D) X: P(a)P(b)P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)
867140.
868Eight minterms will be used for
869A. three variables
870B. four variablesC. five variables
871D. six variables
872141.
873General Purpose Software which creates and manipulates database is
874Answer: DBMS
875142.
876Which of these is not a method of data collection?
877143.
878The number of min-terms after minimizing the following Boolean expression is _______.
879[D'+AB'+A'C+AC'D+A'C'D]'
880Answer: 1.
881The end result of this gives us only one minterm = ABCD
882hence, answer = 1
883144.
884Consider the following C code segment:
885int a, b, c = 0;
886void prtFun(void);
887main( )
888{ static int a = 1; /* Line 1 */
889prtFun( );
890a + = 1;
891prtFun( )
892printf(?\n %d %d ?, a, b);
893}
894void prtFun(void)
895{ static int a=2; /* Line 2 */
896int b=1;
897a+=++b;
898printf(?\n %d %d ?, a, b);
899}
900What output will be generated by the given code segment?
901Answer: 4
9022
9034 2
9042 0
905145.
906Consider a join (relation algebra operation) between relations r(R)and s(S) using the nested loop
907method. There are 3 buffers each of size equal to disk block size, out of which one buffer is
908reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer
909number of disk block accesses if
910(A) relation r(R) is in the outer loop.
911(B) relation s(S) is in the outer loop.
912(C) join selection factor between r(R) and s(S) is more than 0.5.
913(D) join selection factor between r(R) and s(S) is less than 0.5.Answer : A
914146.
915This topology requires multipoint connection
916Answer: BUS
917147.
918_________________ refers to the number of units to be chosen from the population
919148.
920Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at
921cylinder100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110,
922135 and 145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access,
923the request for cylinder 90 is serviced after servicing ____________ number of requests.
924(A) 1
925(B) 2
926(C) 3
927(D) 4
928149.
929Consider the following C program
930#inclue
931int main()
932int i, j, k 0;
933j=2*3/4+2.0 / 5+8 / 5;
934k-= --j;
935for (i=0; i<5; i++)
936{
937Switch (i + k)
938{
939case1:
940case 2 : printf ("\ n%d", i+k)
941case 3 : printf ("\ n%d", i+k);
942default : printf ("\n%d",i+k);
943}
944}
945Return 0:
946}
947The number of times printf statement is executed is ____ 10 _____.
948150.
9491024 bit is equal to how many byte
950Answer: 128
951151.
952Action research means __________
953152.
954In which addressing mode the operand is given explicitly in the instruction?
955Answer: Immediate Mode
956153.
957HTTP is ________ protocola) application layer
958b) transport layer
959c) network layer
960d) none of the mentioned
961154.Which of the following is NOT a superkey in a relational schema with attributes V,W,X,Y,Z
962and primary key V Y?
963(A) V X Y Z
964(B) V W X Z
965(C) V W X Y
966(D) V W X Y Z
967Explanation: Super key = Candidate Key + other attributes. But option B does not
968include Y which is a part of PK or candidate key.
969155.
970Which of the following is not a part of instruction cycle?
971Answer: stages of instruction cycle:
972a. Fetch
973b. Decode
974c. Execute
975d. Derive effective address of the instruction
976e. All of these
977156.
978A process executes the code
979fork ();
980fork ();
981fork ();
982The total number of child processes created is
983(A) 3
984(B) 4
985(C) 7
986(D) 8
987Answer (C)
988157.
989SQl allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in
990the result of joins. Which one of the following queries always gives the same answer as the
991nested query shown below:
992select * from R where a in (select S.a from S)
993158.One of the terms given below is defined as a bundle of meanings or characteristics associated with
994certain events, objects, conditions, situations, and the like
995Concept
996159.
997The HTTP response message leaves out the requested object when _____ method is used
998a) GET
999b) POST
1000c) HEAD
1001d) PUT
1002160.
1003Consider the following C
1004function.
1005int fun (int n) {
1006int x =1, k;
1007if (n ==1) return x;
1008for (k=1; k < n; ++k)
1009x = x + fun (k)* fun (n - k); return x;
1010}
1011The return value of fun (5) is ___ 51 ____
1012161.
1013__ PUBLIC KEY ____ cryptography refers to encryption methods in which both the sender and
1014receiver share the same key.
1015162.
1016After fetching the instruction from the memory, the binary code of the
1017instruction goes to
1018Answer: MBR – Memory Buffer Register
1019163.
1020The following function computes the maximum value contained in an integer array
1021p[ ] of size n (n >= 1).
1022int max(int *p, int n) {
1023int a=0, b=n-1;
1024while (__________) {
1025if (p[a] <= p[b]) { a = a+1; }
1026else { b = b-1; }
1027}
1028return p[a];
1029}
1030The missing loop condition is
1031Answer: b!=a.
1032164.
1033Research questions are crucial because they will _________
1034165.The average time required to reach a storage location in memory and obtain its contents is
1035called the
1036Answer: Access time166.
1037The relation R={A,B,C,D,E,F} with FD A,B-> C, C-> D, C->E,F holds
1038Ans: AEH, BEH, DEH
1039167.
1040The relationship that exists within the same entity type is called as
1041_____ recursive ____ relationship.
1042168.
1043Consider the following C
1044function.
1045int fun (int n) {
1046int x =1, k;
1047if (n ==1) return x;
1048for (k=1; k < n; ++k)
1049x = x + fun (k)* fun (n - k); return x;
1050}
1051The return value of fun (5) is ___ 51 ____
1052169.
1053When CPU is executing a Program that is part of the Operating System, it is said to be in
1054A. Interrupt mode
1055B. System mode
1056C. Half mode
1057D. Simplex mode
1058170.
1059Flip-flops can be constructed with two
1060Answer: NAND
1061171.
1062Using public key cryptography, X adds a digital signature σ to message M, encrypts, and sends it
1063to Y, where it is decrypted. Which one of the following sequences of keys is used for the
1064operations?
1065(A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by
1066Y’s public key
1067(B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by
1068Y’s private key
1069(C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by
1070X’s private key
1071(D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key
1072followed by X’s public key
1073172.
1074Actuary is a person who ________
1075173.
1076If a hospital has to store the description of each visit of a patient according to date what
1077attribute you will use in the patient entity type?
1078Ans: multivalued attribute174.
1079Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at
1080the same time to a computer system. Which one of the following process scheduling algorithms
1081would minimize the average waiting time in the ready queue?
1082(A) Shortest remaining time first
1083(B) Round-robin with time quantum less than the shortest CPU burst
1084(C) Uniform random
1085(D) Highest priority first with priority proportional to CPU burst length
1086Answer: (A)
1087175.
1088What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note
1089that the first parameter is passed by reference, whereas the second parameter is passed by
1090value.
1091int f (int &x, int c) {
1092c=c-1;
1093if (c-0) return 1;
1094x=x+1;
1095return f (x,c)*x;}
1096Answer: (B) 6561
1097176.
1098Decimal digit in BCD can be represented by
1099Answer: binary-coded decimal (BCD) is a class of binary encodings of decimal numbers
1100where each decimal digit is represented by a fixed number of bits, usually four or eight.
1101177.
1102Insurable interest in a life insurance contract should be present _______
1103178.
1104Error correction and error detection happens in ____ DATA LINK _______ layer.
1105179.
1106Which of the following statements regarding RBI is not correct:
1107180.
1108___ ICMP ___is used by network devices, like routers, to send error messages indicating, for
1109example, that a requested service is not available or that a host or router could not be reached.
1110Answer: Internet Control mEssaging Protocol.
1111181.
1112KDD (Knowledge Discovery in Databases) is referred to,
1113ANSWER: broad process of finding knowledge in data, and emphasizes the "high-
1114level" application of particular data mining methods
1115182.
1116Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main
1117memory consists of 256 blocks and the request for memory blocks is in the following order: 0,
1118255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155 Which one of the following memory
1119block will NOT be in cache if LRU replacement policy is used?
1120Answer: 216183.The output of the following program is
1121main()
1122{
1123int a = 5;
1124int b = 10;
1125cout << (a>b?a:b);
1126}
1127Answer: 10
1128184.
1129Design procedure of combinational circuit involves
11301.
1131Determine required number of inputs and outputs from the specifications.
11322.
1133Derive the truth table for each of the outputs based on their relationships to the
1134input.
11353.
1136Simplify the boolean expression for each output. Use Karnaugh Maps or Boolean
1137algebra.
11384.
1139Draw a logic diagram that represents the simplified Boolean expression. Verify the
1140design by analysing or simulating the circuit.
1141185.
1142The banking companies that are allowed to operate in a very limited geographical area, are
1143known as ______________
1144186.
1145_____________ DATA MODEL __________gives the concepts to describe the
1146structure of the database.
1147187.
1148In dynamic routing mechanism the route changes in response to _______
1149188.
1150Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11,92,
115110. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63,
1152moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from
11530 to 199. The total head movement (in number of cylinders) incurred while servicing these
1154requests is
1155(A) 346
1156(B) 165
1157(C) 154
1158(D) 173
1159189.
1160In design procedure input output values are assigned with
1161190.
1162The Third stage in designing a database is when we analyze our tables more closely and create
1163a _____RELATIONSHIP______ between tables.
1164191.
1165Majority of share capital in RBI is held by ____________192.
1166Mod-6 and mod-12 counters are most commonly used in
1167[A]. frequency counters
1168[B]. multiplexed displays
1169[C]. digital clocks
1170[D].
1171power consumption meters
1172193.
1173A race condition occurs when
1174A. Two concurrent activities interact to cause a processing error
1175B. two users of the DBMS are interacting with different files at the same time
1176C. both (a) and (b)
1177D. All of the above
1178E. None of the above
1179194.
1180Multiplexing is used in _______
1181a) Packet switching
1182b) Circuit switching
1183c) Data switching
1184d) None of the mentioned
1185195.
1186The minimum number of page frames that must be allocated to a running process in a virtual
1187memory environment is determined by
1188a) the instruction set architecture
1189b) page size
1190c) physical memory size
1191d) number of processes in memory
1192196.
1193Passing the request from one schema to another in DBMS architecture is called as
1194___________________
1195Answer: Mapping
1196197.
1197_______ is a set of networks sharing the same routing policy
1198Answer: Autonomous System
1199198.
1200IRDA is associated with __________
1201199.
1202Mod-6 and mod-12 counters are most commonly used inAnswer: Digital Clocks
1203200.
1204. For computers based on three - address instruction formats, each address field can be used to
1205specify which of the following:
1206S1: A memory operand
1207S2: A processor register
1208S3: An implied accumulator registers
1209(A) Either S1 or S2
1210(B) Either S2 or S3
1211(C) Only S2 and S3
1212(D) All of S1, S2 and S3
1213201.
1214Insurance companies collect a fixed amount from its customers at fixed intervals of time. What is it
1215called?
1216Answer: premium
1217202.
1218A relation schema R is said to be in 4NF if for every MVD x-->>y that holds over R
1219A ->> B is a trivial MVD
1220A is a superkey
1221203.
1222_____, also known as "port forwarding," is the transmission of data intended for use only within a
1223private, usually corporate network through a public network in such a way that the routing nodes
1224in the public network are unaware that the transmission is part of a private network.
1225Answer: Tunneling
1226204.
1227What is a trap?
1228Answer: A trap is an exception in a user process. It's caused by division by zero or invalid
1229memory access.
1230205.
1231Congestion control and quality of service is qualities of the
1232Answer: ATM ????
1233206.
1234The ____ XLAT _____ translates a byte from one code to another code
1235207.
1236In real time Operating System, which of the following is the most suitable scheduling scheme?
1237Answer: Preemptive Scheduling.
1238208.
1239Regional rural banks are:
1240209.
1241The Snapshot of a table is called as
1242Ans – View210.
1243In Binary trees nodes with no successor are called ......
1244LEAF
1245211.
1246____ TCP ___ detects loss of data errors in data, requests retransmission of lost data, rearranges
1247out-of-order data, and even helps minimize network congestion to reduce the occurrence of the
1248other problems
1249212.
1250If every node u in G adjacent to every other node v in G, A graph is said to be
1251Answer: Complete
1252213.
1253A relation R(a,b,c,d,e,f) with the FDs { a -> b,c; c -> d, e, f } satisfies ----- normal form at the most
1254where ?a? is the primary key.
1255214.
1256If a virtual memory system has 4 pages in real memory and the rest must be swapped to disk.
1257Which of the following is the hit ratio for the following page address stream. Assume memory
1258starts empty, use the FIFO algorithm
1259Answer: 31%
1260215.
1261Which category of banks is under dual control of Government and RBI?
1262216.
1263Which amongst the following refers to Absolute addressing mode
1264A. Ans - the address of the operand is inside the instruction
1265217.
1266A binary tree in which all the leaves are on the same level is called as:
1267Answer: Perfect binary tree
1268218.
1269Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The
1270round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The
1271time taken (in msec) by the TCP connection to get back to 32 KB congestion window is
12721100-1300
1273219.
1274NOP instruction introduces
1275Delay220.
1276On simple paging system with 2 24 bytes of physical memory, 256 pages of logical address space,
1277and a page size 2 10 bytes, how many bytes are in a page frame?
12782 10 bytes,
1279221.
1280Course_Info{Course_no, Sec_no, Offering_dept, Credit_hours, Course_level, Instructor_ssn,
1281Semester, Year, Days_hours, Room_no, No_of_students}.
1282The Course_Info has following functional dependencies:
1283{Course_no}{Offering_dept, Credit_hours, Course_level}
1284{Course_no, Sec_no, Semester, Year} {Days_hours, Room_no, No_of_students,
1285Instructor_ssn }
1286{Room_no, Days_hours, Semester, Year} {Instructor_ssn, Course_no, Sec_no}
1287Find the keys of the relation
1288222.
1289A bill of exchange which is drawn on a specific bank and is not payable otherwise than
1290on demand, to bearer or to order, is called ______________
1291223.
1292Which of the following are sufficient conditions for deadlock?
12931. mutual exclusion
1294The resources involved must be unshareable; otherwise, the processes would not
1295be prevented from using the resource when necessary.
12962. hold and wait or partial allocation
1297The processes must hold the resources they have already been allocated while
1298waiting for other (requested) resources. If the process had to release its resources
1299when a new resource or resources were requested, deadlock could not occur
1300because the process would not prevent others from using resources that it
1301controlled.
13023. no pre-emption
1303The processes must not have resources taken away while that resource is being
1304used. Otherwise, deadlock could not occur since the operating system could simply
1305take enough resources from running processes to enable any process to finish.
13064. resource waiting or circular wait
1307224.
1308How many 8-bit characters can be transmitted per second over a 9600 baud serial
1309communication link using asynchronous mode of transmission with one start bit, eight data bits,
1310two stop bits, and one parity bit?
1311(B) 300225.
1312Expand the acronym ‘ADB’
1313226.
1314The addressing mode used in an instruction of the form ADD X Y, is _DIRECT/ABSOLUTE____.
1315227.
1316In ORDBMS, When an object O is brought into memory, they check each oid contained
1317in O and replace oids of in-memory objects by in-memory pointers to those objects. This
1318concept refers to:
1319pointer swizzling
1320228.
1321A binary tree T has 20 leaves. The number of nodes in T having two children is
1322(A) 18
1323(B) 19
1324(C) 17
1325(D) Any number between 10 and 20
1326229.
1327What happens when you push a new node onto a stack?
1328The new node is placed at the front of the linked list
1329230.The port that is used for the generation of handshake lines in mode 1 or mode 2 is
1330a) port A
1331b) port B
1332c) port C Lower
1333d) port C Upper
1334231.
1335Consider the following transaction involving two bank account x and y.
1336read (x) ; x : = x ? 50; write (x) ; read (y); y : = y + 50 ; write (y)
1337The constraint that the sum of the accounts x and y should remain constant is that of
1338(A) Atomicity
1339(B) Consistency
1340(C) Isolation
1341(D) Durability
1342232.
1343The portion of total deposits of a commercial bank which it has to keep with RBI in the form of cash
1344reserves is termed as _______________233.
1345A receiving host has failed to receive all of the segments that it should acknowledge. What can
1346the host do to improve the reliability of this communication session?
1347Send a different source port number.
1348B. Restart the virtual circuit.
1349C. Decrease the sequence number.
1350D. Decrease the window size.
1351234.
1352A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
1353page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
1354maximum size of the page table of a process is 24 megabytes, the length of the virtual address
1355supported by the system is _________ bits.
1356(A) 36
1357(B) 32
1358(C) 28
1359(D) 40
1360235.
1361In 8257 register format, the selected channel is disabled after the terminal count condition is
1362reached when
1363a) Auto load is set
1364b) Auto load is reset
1365c) TC STOP bit is reset
1366d) TC STOP bit is set
1367236.
1368Which of the following information is not part of Process Control Block?
1369(i) Process State
1370(ii) Process Page table
1371(iii) List of Open files
1372(iv) Stack Pointer
1373None of the above
1374237.
1375The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with
1376n discs is
1377(A) T(n) = 2T(n – 2) + 2
1378(B) T(n) = 2T(n – 1) + n
1379(C) T(n) = 2T(n/2) + 1
1380(D) T(n) = 2T(n – 1) + 1238.
1381A personal account cannot be opened in _____________
1382239.
1383For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements
1384is/are TRUE ?
1385I. At least three non-overlapping channels are available for transmissions.
1386II. The RTS-CTS mechanism is used for collision detection.
1387III.Unicast frames are ACKed.
1388(A) All I, II, and III
1389(B) I and III only
1390(C) II and III only
1391(D) II only
1392240.
1393____ users work on canned transactions
1394Naïve or parametric end users
1395241.
1396X.25 Networks are _____ Packet Switched wide area network .___ networks
1397242.
1398A banking product is an example of _____________
1399243.
1400Partial Degree of multiprogramming is controlled by
1401A. CPU scheduler
1402B. context switching
1403C. long term scheduler
1404D. medium term scheduler
1405244.
1406The effective address of the following instruction is , MUL 5(R1,R2)
1407a) 5+R1+R2
1408b) 5+(R1*R2)
1409c) 5+[R1]+[R2].
1410d) 5*([R1]+[R2])
1411245.
1412Consider the following four schedules due to three transactions (indicated by the subscript) using
1413read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them
1414is conflict serializable?
1415A.
1416B.
1417C.
1418D.
1419r 1 (x) r1(x); r 2 (x) r2(x); w 1 (x) w1(x); r 3 (x) r3(x); w 2 (x) w2(x);
1420r 2 (x) r2(x); r 1 (x) r1(x); w 2 (x) w2(x); r 3 (x) r3(x); w 1 (x) w1(x);
1421r 3 (x) r3(x); r 2 (x) r2(x); r 1 (x) r1(x); w 2 (x) w2(x); w 1 (x) w1(x);
1422r 2 (x) r2(x); w 2 (x) w2(x); r 3 (x) r3(x); r 1 (x) r1(x); w 1 (x) w1(x);246.
1423If a , b , c, are three nodes connected in sequence in a singly linked list, what is
1424the statement to be added to change this into a circular linked list?
1425247.
1426A buying process starts when the buyer recognizes a ____________
1427248.
1428Which one of the following protocols is NOT used to resolve one form of address to another one?
1429A.
1430B.
1431C.
1432D.
1433DNS
1434ARP
1435DHCP
1436RARP
1437249.
1438The effective address of the following instruction is , MUL 5(R1,R2)
1439a) 5+R1+R2
1440b) 5+(R1*R2)
1441c) 5+[R1]+[R2].
1442d) 5*([R1]+[R2])
1443250.
1444Consider a schedule S1 given below;
1445R1(A); W1(A); R2(B); R2(A); R1(B); W2(A+B); W1(B); where R1 and W1 are read and write
1446operations of transaction T1 and R2 and W2 are read and write operations of transaction T2.
1447Which of the following is correct regarding schedule S1?
1448(a) S1 is a serializable schedule
1449(b) A deadlock will occur if 2PL is used
1450(c) S1 is a conflict serializable schedule
1451(d) S1 is a view serializable schedule
1452251.
1453Consider the following function written the C programming language.
1454void foo (char * a ) {
1455if (* a & & * a ! =' ' ){
1456putchar (*a);
1457}
1458}
1459}
1460The output of the above function on input ?ABCD EFGH? Is
1461Answer: DCBA
1462252.
1463When several processes access the same data concurrently and the outcome of the execution
1464depends on the particular order in which the access takes place, is calleda) dynamic condition
1465b) race condition
1466c) essential condition
1467d) critical condition
1468253.
1469State the type of multitasking supported by OS when process switched its state from 'Running' to
1470'Ready' due to scheduling act.
1471Answer: ??
1472254.
1473The instructions which copy information from one location to another either in the processor’s
1474internal register set or in the external main memory are called
1475(A) Data transfer instructions . (B) Program control instructions.
1476(C) Input-output instructions. (D)
1477Logical instructions.
1478Ans: A
1479255.
1480The degree of a leaf node is: ZERO
1481256.
1482______________ are products bought for further processing or for use in conducting a business
1483257.
1484End-to-end connectivity is provided from host-to-host in:
1485A. Network layer
1486B. Session layer
1487C. Data link layer
1488D. Transport layer
1489E. None of the above
1490258.
1491An index is clustered, if
1492(A) it is on a set of fields that form a candidate key.
1493(B) it is on a set of fields that include the primary key.
1494(C) the data records of the file are organized in the same order as the data
1495entries of the index.
1496(D) the data records of the file are organized not in the same order as the data entries of the
1497index.
1498259.
1499The protocol data unit (PDU) for the application layer in the Internet stack is
1500(A) Segment
1501(B) Datagram
1502(C) Message
1503(D) Frame
1504260.PSW is saved in stack when there is a
1505A.
1506interrupt recognized
1507C.
1508Execution of CALL instruction
1509D.
1510B. execution of RST instruction
1511All of these
1512261.
1513Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250KB,
1514where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357
1515KB, 210KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are
1516NOT allotted to any process?
1517(A) 200 KB and 300 KB
1518(B) 200 KB and 250 KB
1519(C) 250 KB and 300 KB
1520(D) 300 KB and 400 KB
1521262.
1522If actual performance exceeds the expected performance of the product, then the customer is
1523____________
1524263.
1525Creating a B Tree index for your database has to be specified in _____.
1526264.
1527The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.
1528A.
1529B.
1530C.
1531D.
1532ABFCDE
1533ADBFEC
1534ABDECF
1535ABDCEF
1536265.
1537Error detection at the data link layer is achieved by?
1538[A] Bit stuffing
1539[B] Cyclic redundancy codes
1540[C] Hamming codes
1541[D] Equalization
1542266.
1543Which of the following is not a function of a DBA?
1544A. Network Maintenance
1545B. Routine maintenance
1546C. Schema Definition
1547D. Authorization for data access267.
1548A system uses 3 page frames for storing process pages in main memory. It uses the Least
1549Recently Used (LRU) page replacement policy. Assume that all the page frames are
1550initially empty. What is the total number of page faults that will occur while processing the page
1551reference string given below?
15524, 7, 6, 1, 7, 6, 1, 2, 7, 2
1553(A) 4
1554(B) 5
1555(C) 6
1556(D) 7
1557268.
1558What is a trap?
1559Answer: A trap is an exception in a user process. It's caused by division by zero or invalid
1560memory access.
1561269.
1562What is the postfix expression for the following infix expression?
1563Infix = a+b%c>d
1564Answer: a b%c>d +
1565270.
1566The promotion “P” of marketing mix is also known as ____________
1567271.
1568Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If
1569the computer system has a one-level page table per process and each page table entry requires
157048 bits, then the size of the per-process page table is __________ megabytes.
1571(A) 384
1572(B) 48
1573(C) 192
1574(D) 96
1575272.
1576Computers use addressing mode techniques for _____________________.
1577A. giving programming versatility to the user by providing facilities as pointers to memory
1578counters for loop control
1579B. to reduce no. of bits in the field of instruction
1580C. specifying rules for modifying or interpreting address field of the instruction
1581D. All the above273.
1582Loss in signal power as light travels down the fiber is called?
1583A.
1584attenuation
1585B. propagation
1586C. scattering
1587D. interruption
1588E. None of the above
1589274.
1590Passing the request from one schema to another in DBMS architecture is called as
1591___MAPPING___
1592275.
1593A change in an individual's behaviour prompted by information and experience refers to
1594which one of the following concept?
1595276.
1596A binary tree T has 20 leaves. The number of nodes in T having two children is
1597(A) 18
1598(B) 19
1599(C) 17
1600(D) Any number between 10 and 20
1601277.
1602Computers use addressing mode techniques for _____________________.
1603A. giving programming versatility to the user by providing facilities as pointers to memory
1604counters for loop control
1605B. to reduce no. of bits in the field of instruction
1606C. specifying rules for modifying or interpreting address field of the instruction
1607D. All the above
1608278.
1609Consider the 3 process, P1, P2 and P3 shown in the table.
1610Process Arrival time Time units Required
1611P1 0 5
1612P2 1 7
1613P3 3 4
1614The completion order of the 3 processes under the policies FCFS and RR2 (round robin
1615scheduling) with CPU quantum of 2 time units are
1616(A)
1617FCFS: P1, P2, P3RR2: P1, P2, P3
1618(B)
1619FCFS: P1, P3, P2
1620RR2: P1, P3, P2
1621(C)
1622FCFS: P1, P2, P3
1623RR2: P1, P3, P2
1624(D)
1625FCFS: P1, P3, P2
1626RR2: P1, P2, P3
1627279.
1628Which of the following is NOT a superkey in a relational schema with attributes V,W,X,Y,Z and
1629primary key V Y?
1630(A) V X Y Z
1631(B) V W X Z
1632(C) V W X Y
1633(D) V W X Y Z
1634280.Which of the following is example of in-place algorithm?
1635Ans: Heap Sort , Selection Sort, Bubble Sort , insertion sort, shell sort.
1636281.
1637In OSI model dialogue control and token management are responsibilities of ?
1638Network layer
1639Session Layer
1640Transport Layer
1641None of above
1642282.
1643A person’s ________ consists of all the groups that have a direct (face-to-face) or
1644indirect influence on his/her attitudes or behaviour
1645283.
1646The promotion strategy that uses sales force to market the products is known as ______________
1647284.
1648A scheduling algorithm assigns priority proportional to the waiting time of a process. Every
1649process starts with priority zero(the lowest priority). The scheduler re-evaluates the processpriorities every T time units and decides the next process to schedule. Which one of the following
1650is TRUE if the processes have no I/O operations and all arrive at time zero?
1651(A) This algorithm is equivalent to the first-come-first-serve algorithm
1652(B) This algorithm is equivalent to the round-robin algorithm.
1653(C) This algorithm is equivalent to the shortest-job-first algorithm..
1654(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm
1655285.
1656Which protocol does Ping use?
1657Answer: ICMP – Internet Control Message Protocol
1658286.
1659Which of the following operator in SQL would produce the following result if applied between two
1660relations Employee and Department?
1661Eno EName DeptNo DName
1662111 Kumar 100 Sales
1663222 Steve 200 Finance
1664Null Null 300 Admn
1665244 Meera 400 Mktg
1666Answer: Right join.
1667287.
1668The run time of the following algorithm is
1669Procedure A(n)
1670If(n<=2) return(1)
1671Else return(A(sqrt(n))
1672A. O(n)
1673B. O(logn)
1674C. O(loglogn)
1675D. O(1)
1676288.
1677The address to the next instruction lies in
1678Answer: Program Counter
1679289.
1680Which of the following address modes calculate the effective address as
1681address part of the instruction) + (content of CPU register)
1682290.
1683Wholesaling does not include which of the following services?
1684291.
1685The process related to process control, file management, device management, information about
1686system and communication that is requested by any higher level language can be performed by
1687__________.
16881 Editors
16892 Compilers3 System Call
16904 Caching
1691292.
1692Consider a dynamic queue with two pointers: front and rear. What is the time needed to
1693insert an element in a queue of length of n?
1694Answer: O(1)
1695293.
1696What is the unique characteristic of RAID 6 ?
1697a) Distributed Parity
1698b) Striping
1699c) Two independent distributed parity
1700d) Mirroring
1701294.
1702If CurrNode pointer points to the previous node in the list and NewNode points to the newly
1703created Node, the address assignments to be done for inserting a node in the middle of a singly
1704linked list is
1705295.
1706On simple paging system with 2^24 bytes of physical memory, 256 pages of logical address
1707space, and a page size 2^10 bytes, how many bytes are in a page frame?
1708Ans:: Page frame size is 2^10 bytes.
1709296.
1710A 2 km long brodcast LAN has 10^7 bps bandwidth and uses CSMA/ CD. The signal travels
1711along the wire at 2 *10 ^8 m/s. What is the minimum packet size that can be used on this
1712network ?
1713(A) 50 bytes
1714(B) 100 bytes
1715(C) 200 bytes
1716(D) None of these
1717297.
1718The data manipulation language used in SQL is a,
1719(I) Procedural DML
1720(II) Non-Procedural DML
1721(III) Modification DML
1722(IV) Declarative DML
1723Answer: (1) and (4)
1724298.
1725The ________ is practiced most aggressively with unsought goods, goods that
1726buyers normally do not think of buying, such as insurance, encyclopedias, and funeral plots.
1727Answer: b. Selling concept
1728299.
1729A group of bits that tell the computer to perform a specific operation is known as
1730A. Instruction codeB. Micro-operation
1731C. Accumulator
1732D. Register
1733300.
1734How many 8-bit characters can be transmitted per second over a 9600 baud serial
1735communication link using asynchronous mode of transmission with one start bit, eight data bits,
1736and one parity bit ?
1737Answer: 800
1738301.
1739Deceptive pricing is also referred to as ______________
1740302.
1741The time factor when determining the efficiency of algorithm is measured by
1742a. Counting microseconds
1743b. Counting the number of key operations
1744c. Counting the number of statements
1745d. Counting the kilobytes of algorithm
1746303.
1747Consider the following pseudo code fragment:
1748printf (“Hello”);
1749if(!fork( ))
1750printf(“World”);
1751Which of the following is the output of the code fragment?
1752304.
1753Having clause in SQL occurs with
1754The HAVING clause should appear before an INTO clause; otherwise, a syntax error
1755occurs.
1756305.
1757When we use auto increment or auto decrement, which of the following is/are true
17581) In both, the address is used to retrieve the operand and then the address gets altered.
17592) In auto increment the operand is retrieved first and then the address altered.
17603) Both of them can be used on general purpose registers as well as memory locations.
1761306.
1762The address resolution protocol (ARP) is used for
1763(a) Finding the IP address from the DNS
1764(b) Finding the IP address of the default gateway
1765(c) Finding the IP address that corresponds to a MAC address
1766(d) Finding the MAC address that corresponds to an IP address
1767307.
1768One that is not type of flipflop isTypes of Flip-Flops
1769• RS flip-flop
1770• JK flip-flop
1771• D flip-flop
1772• T flip-flop
1773308.
1774If a node having two children is deleted from a BST, it is replaced by its
1775a) In-order predecessor
1776b) In-order successor
1777c) Pre-order predecessor
1778d) None
1779309.
1780_______ is the want for a specific product backed by the ability to pay
1781Next
1782314.
1783A company is in the ______________ stage of the new product development process when the
1784company develops the concept into a commercially viable physical product
1785315.
1786An organization has a class B network and wishes to form subnets for 64 departments. The
1787subnet mask would be
1788(a) 255.255.0.0
1789(b) 255.255.64.0
1790(c) 255.255.128.0
1791(d) 255.255.252.0
1792316.
1793R right outer join S on a=b gives
1794317.
1795Which of the process transition is invalid?
1796318.
1797The process in which of the following states will be in secondary memory?
1798319.
1799The number of counters that are present in the programmable timer device 8254 is
1800a) 1
1801b) 2
1802c) 3
1803d) 4
1804Explanation: There are three counters that can be used as either counters or delay
1805generators.320.
1806In a packet switching network, packets are routed from source to destination along a single path
1807having two intermediate node. If the message size is 24 bytes and each packet contains a
1808header of 3 bytes, then the optimum packet size is
1809(a) 4
1810(b) 6
1811(c) 7
1812(d) 9
1813321.
1814Why is market segmentation primarily undertaken?
1815322.
1816_______DATA MODEL________________gives the concepts to describe the
1817structure of the database.
1818323.
1819Identify the sorting technique that supports divide and conquer strategy and has (n2) complexity
1820in worst case
1821a. Bubble sort
1822b. Insertion sort
1823c. Quick sort
1824d. All of above
1825Answer: Quick Sort
1826324.
1827Station A uses 32 byte packets to transmit messages to Station B using a sliding window
1828protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bankwidth
1829on the path between aA and B is 128 kbps. What is the optimal window size that A should use ?
1830(A) 20
1831(B) 40
1832(C) 160
1833(D) 320
1834Answer (B)
1835325.
1836If a firm emphasizes it’s product’s benefits, rather than it’s product’s attributes, it is oriented towards
1837_______________
1838326.
1839Given the basic ER and relational models, which of the following is INCORRECT?
1840A. An attribute of an entity can have more than one value
1841B. An attribute of an entity can be compositeC. In a row of a relational table, an attribute can have more than one
1842value
1843D. In a row of a relational table, an attribute can have exactly one value or a
1844NULL value
1845327.
1846The searching technique that takes O (1) time to find a data is
1847Answer: Hashing
1848328.
1849If a disk has a seek time of 20ms, rotates 20 revolutions per second, has 100 words per block,
1850and each track has capacity of 300 words. Then the total time required to access one block is
1851A.25
1852B.30
1853C.40
1854D.60
1855329.
1856The data bus buffer is controlled by
1857Answer: Read/write control logic
1858330.
1859Which of the following is not a conversion function in SQL?
1860331.
1861Which behavioural science discipline contributes to Organizational Behavior 's understanding of
1862group decision-making processes?
1863332.
1864Two computers C1 and C2 are configured as follows. C1 has IP address 203. 197.2.53 and
1865netmask 255.255. 128.0. C2 has IP address 203.197.75.201 and netmask 255.255.192.0. Which
1866one of the following statements is true?
1867A. C1 and C2 both assume they are on the same network
1868B. C2 assumes C1 is on same network, but C1 assumes C2 is on a different
1869network
1870C. C1 assumes C2 is on same network, but C2 assumes C1 is on a
1871different network
1872D. C1 and C2 both assume they are on different networks.
1873333.
1874In control word register, if SC1=0 and SC0=1, then the counter selected isa) counter 0
1875b) counter 1
1876c) counter 2
1877d) none
1878334.
1879Information about a process is maintained in a _________.
18801 Stack
18812 Translation Lookaside Buffer
18823 Process Control Block
18834 Program Control Block
1884335.
1885AVL trees have a faster __________
1886A. Insertion
1887B. Deletion
1888C. Updation
1889D.
1890Retrival
1891336.
1892The time required in worst case for search operation in binary tree is
1893Answer: O(n).
1894337.
1895Which of the following is shared between all of the threads in a process? Assume a kernel level
1896thread implementation
1897Answer: File Descriptors
1898338.
1899The communication that is used by managers to assign goals, point out problems that need attention
1900and provide job instructions is called as ____________
1901339.
1902The counter starts counting only if
1903a) GATE signal is low
1904b) GATE signal is high
1905c) CLK signal is low
1906d) CLK signal is high
1907340.
1908Station A needs to send a message consisting of 9 packets to Station B using a siding window
1909(window size 3) and go-back-n error control strategy. All packets are ready and immediately
1910available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever
1911get lost), then what is the number of packets that A will transmit for sending the message to B ?
1912(A) 12
1913(B) 14(C) 16
1914(D) 18
1915341.
1916Which level of RAID refers to disk mirroring with block striping?
1917a) RAID level 1
1918b) RAID level 2
1919c) RAID level 0
1920d) RAID level 3
1921342.
1922Identify the data structure which allows deletions at both ends of the list but insertion at only one
1923end
1924a. Input-restricted deque
1925b. Output-restricted deque
1926c. Priority queues
1927d. None of above
1928343.
1929When an instruction is read from the memory, it is called
1930Answer: Instruction cycle (Also called Fetch-Decode-Execute Cycle)
1931344.
1932Experiments performed by Ivan Pavlov led to what theory?
1933345.
1934Which of the following is not true of virtual memory?
1935Ans: It requires the use of a disk or other secondary storage.( Actually it does not
1936require).
1937346.
1938In a token ring network the transmission speed is 10^7 bps and the propagation speed is 200
1939metres/ s μ . The 1-bit delay in this network is equivalent to;
1940(A) 500 metres of cable.
1941(B) 200 metres of cable.
1942(C) 20 metres of cable.
1943(D) 50 metres of cable.
1944Answer (C)
1945347.To change the access path programs are categorized under ____PHYSICAL______
1946data independence.
1947348.
1948What are the desirable properties of a transaction?
1949Atomicity.
1950Consistency.
1951Isolation.
1952Durability.
1953349.
1954Job analysis provides information used for writing _____________________
1955350.
1956A Boolean function may be transformed into Logical Diagram
1957351.
1958The average time required to reach a storage location in memory and obtain its contents
1959is called the
1960Answer: Access time
1961352.
1962The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the
1963maximum number of subnets and the maximum number of hosts in each subnet?
1964(A) 62 subnets and 262142 hosts.
1965(B) 64 subnets and 262142 hosts.
1966(C) 62 subnets and 1022 hosts.
1967(D) 64 subnets and 1024 hosts.
1968Maximum number of subnets = 2^6-2 =62.
1969Maximum number of hosts is 2^10-2 = 1022.
1970353.
1971The time required in worst case for search operation in binary tree is
1972Answer: O(n).
1973354.
1974Shift registers are used for
1975Shift registers are commonly used in converters that translate parallel data to serial
1976data, or vice-versa.
1977355.
1978In the slow start phase of TCP congesting control algorithm, the size of the congestion window
1979(A) does not increase
1980(B) increases linearly(C) increases quadratically
1981(D) increases exponentially
1982356.
1983_____________ is the process of deciding how to fill the company's most important executive
1984positions
1985357.
1986Operating System
19871. Assume that ?C? is a Counting Semaphore initialized to value ?10?. Consider the following
1988program segment:
1989P(C); V(C); P(C); P(C); P(C); V(C); V(C)
1990V(C); V(C); V(C); P(C); V(C); V(C); P(C)
1991What is the value of C?
1992C=10
1993there are 6 wait and 8 signal operation
1994wait operation reduce count by 1 and signal increase count by 1 in
1995general
1996so 10-6+8=12
1997358.
1998If a transaction T has obtained an exclusive lock on item Q, then T can
1999Answer: both read and write Q
2000359.
2001To represent hierarchical relationship between elements, which data structure is suitable?
2002a. Deque
2003b. Priority
2004c. Tree
2005d. All of above
2006360.
2007A binary search tree is generated by inserting in order the following integers 50, 15, 62, 5, 20, 58,
200891, 3, 8, 37, 60, 24. The number of nodes in the left subtree and right subtree of the root
2009respectively are
2010(a) (4, 7)
2011(b) (7, 4)
2012(c) (8, 3)
2013361.
2014Two variables will be represented by
2015362.
2016(d) (3, 8)If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum
2017number of hosts per subnet?
2018A.
2019B.
2020C.
2021D.
20221022
20231023
20242046
20252047
2026363.
2027If two relations R and S are joined, then the non matching tuples of both R and S are
2028ignored in
2029(A)
2030left outer join
2031(C) full outer join
2032(B) right outer join
2033(D) inner join
2034364.
2035Which of these does not belong to Maslow’s Hierarchy Need Theory?
2036365.
2037Mutual exclusion problem occurs between
2038-Two disjoint process that do not interact
2039- Process sharing same resources
2040- Process not sharing same resources
2041- None of these
2042366.
2043A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a
2044rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the maximum duration for
2045which the computer can transmit at the full 10Mbps?
2046(A) 1.6 seconds
2047(B) 2 seconds
2048(C) 5 seconds
2049(D) 8 seconds
2050367.
2051The FD A → B , DB→ C implies
2052368.
2053The base (or radix) of the number system such that the equation 312/20=13.1 holds is
2054(A) 3
2055(B) 4
2056(C) 5
2057(D) 6
2058369.A binary tree in which every non-leaf node has non-empty left and right subtrees is called a
2059strictly binary tree. Such a tree with 10 leaves
2060A. Cannot have more than 19 nodes
2061B. Has exactly 19 nodes
2062C.Has exactly 17 nodes
2063D.Cannot have more than 19 nodes
2064A strictly binary tree with 'n' leaves must have (2n - 1) nodes
2065370.
2066The amount of time required to read a block of data from a disk into memory is composed
2067of seek time, rotational latency, and transfer time. Rotational latency refers to ______.
2068A .
2069B.
2070C.
2071D.
2072the time its takes for the platter to make a full rotation
2073the time it takes for the read-write head to move into position over the appropriate track
2074the time it takes for the platter to rotate the correct sector under the head
2075none of the above
2076371.
2077“Doing an activity or behaviour voluntarily for its own sake, for the inherent satisfaction and pleasure
2078derived from participation” well defines:
2079372.
2080Which type of managers takes less time to make their decisions and less information in making their
2081choices?
2082373.
2083The removal of process from active contention of CPU and reintroduce them into memory later is
2084known as ____________
20851 Interrupt
20862 Swapping
20873 Signal
20884 Thread
2089374.
2090For which one of the following reason: does Internet Protocol (IP) use the time-to-live (TTL) field
2091in the IP datagram header?
2092(A) Ensure packets reach destination within that time
2093(B) Discard packets that reach later than that time
2094(C) Prevent packets from looping indefinitely
2095(D) Limit the time for which a packet gets queued in intermediate routers.
2096375.
2097Consider a relation R (A, B). If A  B is a trivial functional dependency and A is the
2098super key for R, then what is the maximum normal form R can be in?
2099376.
2100The recurrence relation that arises in relation with the complexity of binary search is
2101A. T(n)=2T( n/2 )+k, k is a constant T(n)=2T(n2)+k, k is a constant
2102B. T(n)=T( n/2 )+k, k is a constant T(n)=T(n2)+k, k is a constant
2103C. T(n)=T( n/2 )+logn T(n)=T(n2)+log⁡nD. T(n)=T( n/2 )+n
2104377.
2105A 20-bit address bus allows access to a memory of capacity
2106Answer: 1MB
21072^20 = 1048576
2108378.
2109The algorithm design technique used in the quick sort algorithm is
2110Dynamic programming
2111Backtracking
2112Divide and conquer
2113Greedy method
2114379.
2115Which of the following assertions is false about the internet Protocol (IP) ?
2116(A) It is possible for a computer to have multiple IP addresses
2117(B) IP packets from the same source to the same destination can take different routes in
2118the network
2119(C) IP ensures that a packet is discarded if it is unable to reach its destination within a
2120given number of hops
2121(D) The packet source cannot set the route of an outgoing packets; the route is
2122determined only by the routing tables in the routers on the way
2123In computer networking , source routing , also called path addressing , allows a sender of
2124a packet to partially or completely specify the route of the packet takes through the network.
2125380.
2126The technique, for sharing the time of a computer among several jobs, which switches jobs so
2127rapidly such that each job appears to have the computer to itself, is called
2128Time sharing
2129time out
2130time domain
2131FIFO
2132None of the above
2133381.
2134If the offset of the operand is stored in one of the index registers, then it is
2135Answer: indexed addressing mode
2136382.
2137Which of the following is a disadvantage of file processing system?(I) Efficiency of high level programming,
2138(II) Data Isolation
2139(III) Integrity issues
2140(IV) Storing of records as files
2141383.
2142Organizational democracy requires _____________style of management
2143384.
2144If Human voice is required to be digitized what will be the bit rate at 16 bits per sample?
2145Therefore, the bit rate can be calculated by calculating the sample rate first.
2146Sampling rate = 4000 x 2 = 8000 samples/s
2147Considering the bit rate to be 16 bits per sample,
2148The total bit rate will be = 8000 x 16 = 128,000 bps = 128 kbps .
2149Therefore, the bit rate needed to digitize human voice is 128 kbps.
2150385.
2151The operating system of a computer serves as a software interface between the user and the
2152________
2153A. hardware B. peripheral C. memory D. screen
2154386.
2155The data manipulation language used in SQL is a,
2156387.
2157Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected,
2158undirected graph. The tree T formed by the tree arcs is a data structure for computing
2159(A) the shortest path between every pair of vertices.
2160(B) the shortest path from W to every vertex in the graph.
2161(C) the shortest paths from W to only those nodes that are leaves of T.
2162(D) the longest path in the graph
2163388.
2164The common register(s) for all the four channels of 8257 are
2165a. DMA address register
2166b. terminal count registerc. mode set register and status register
2167d. none of the mentioned
2168389.
2169Which of the following requires the listener to pay reasonably close attention to the speaker?
2170390.
2171A full binary tree with n leaves contains
2172A. nn nodes
2173B. log2n nodes
2174C. 2n−1
2175D. 2n nodes
2176.
2177391.
2178Which of the following is not a function of a DBA?
2179A. Network Maintenance
2180B. Routine maintenance
2181C. Schema Definition
2182D. Authorization for data access
2183392.
2184The collection of processes on the disk that is waiting to be brought into memory for execution
2185forms the ___________
21861 Ready queue
21872 Device queue
21883 Input queue
21894 Priority queue
2190393.
2191Six channels, each with a 200 khz bandwidth are to be multiplexed together. what is the
2192minimum bandwidth requirement if each guard band is 20Khz
2193394.
2194____________ is the variable reward granted to employees as per their performance
2195395.
2196Which of the following is not a data copy/transfer instruction?
2197a)MOV
2198b) PUSHc) DAS - Decimal Adjust after Subtraction
2199d) POP
2200396.
2201The unique characteristics that a learning organization possesses is that ______________
2202397.
2203The complexity of multiplying two matrices of order m*n and n*p is
2204A. mnp
2205B. mp
2206C. mn
2207D. np
2208398.
2209Which of these multiplexing techniques is digital for combining several low -rate channels into
2210one high-rate one
2211399.
2212The part of the operating system that coordinates the activities of other program is called the
2213Answer: Control program
2214400.
2215In DMA transfers, the required signals and addresses are given by the______
2216a) Processor
2217b) Device drivers
2218c) DMA controllers
2219d) The program itself
2220Explanation: The DMA controller acts like a processor for DMA transfers and overlooks the entire
2221process.
2222401.
2223Assume a relation R with keys X, Y and Z, where X, Y, and Z are sets of one or more
2224attributes. Also assume that Y is a subset or equal to X and Z is a subset of X and Y.
2225Which of the following is true for this case?
2226402.
2227A binary tree T has 20 leaves. The number of nodes in T having two children is
2228(A) 18
2229(B) 19
2230(C) 17
2231(D) Any number between 10 and 20
2232403.
2233The minimum number of JK flip-flops required to construct a synchronous counter with the count
2234sequence (0,0, 1, 1, 2, 2, 3, 3, 0, 0,.......) is
2235Answer: 3404.
2236Assume relations R and S with the schemas R (A, B, C) and S (B, D). Which of the
2237following is equivalent to r ⋈ s?
2238ABCD
2239405.
2240Which of these is an off the job training?
2241Off-the-job training occurs when employees are taken away from their place of work
2242to be trained. Common methods of off-the-job training include: Day release (employee
2243takes time off work to attend a local college or training centre) Distance learning /
2244evening classes.
2245406.
2246What are the three phases in virtual circuit switching?
2247The three phases in virtual circuit switching are setup, data transfer, and teardown
2248407.
2249Switching the CPU to another Process requires saving state of the old process and loading new
2250process state is called as __________.
2251ANSWER: Context Switch
2252408.
2253Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250KB,
2254where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357
2255KB, 210KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are
2256NOT allotted to any process?
2257(A) 200 KB and 300 KB
2258(B) 200 KB and 250 KB
2259(C) 250 KB and 300 KB
2260(D) 300 KB and 400 KB
2261409.
2262Which of the following asymptotic notation is the worst among all?
2263a. Ο(n+9378)
2264b. Ο(n^3)
2265c. nΟ(1)
2266d. 2Ο(n)410.
2267Consider a relational table with the schema R (A, B, C). Assume that the cardinality
2268of attribute A is 10, B is 20, and C is 5. What is the maximum number of records R
2269can have without duplicate?
2270Answer : 1000
2271411.
2272Which method is used to assess an organization’s training needs?
2273Training Need Analysis
2274412.
2275A half adder is implemented with XOR and AND gates. A full adder is implemented with two half
2276adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR
2277gate. The propagation delay of an AND/OR gate is 1.2 microseconds. A 4-bit ripple-carry binary
2278adder is implemented by using four full adders. The total propagation time
2279of this 4-bit binary adder in microseconds is ____________.
2280A Ripple Carry Adder allows to add two n-bit numbers. It uses half and full adders.
2281Following diagram shows a ripple adder using full adders.
2282Let us first calculate propagation delay of a single
22831 bit full adder.
2284Propagation Delay by n bit full adder is (2n + 2)
2285gate delays.
2286[See this for formula].
2287Here n = 1, so total delay of a 1 bit full adder
2288is (2 + 2)*1.2 = 4.8 ms
2289Delay of 4 full adders is = 4 * 4.8 = 19.2 ms
2290413.
2291Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth ?
2292Transmission is in half-duplex mode. For PSK the baud rate is the same as the bandwidth,
2293which means the baud rate is 5000. But in 8-PSK the bit rate is 3 times the baud rate, so the
2294bit rate is 15,000 bps.
2295414.
2296Virtual memory is __________.
2297An illusion of extrememly large main memory
2298415.
2299Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet
2300address ?
2301Answer : 201.14.78.64At every router basically we have 3 entries in a routing table
23021. Network Id / Subnet address
23032. Subnet Mask
23043 .Interface
2305So with the help of these we can figure out where to send a packet.
2306IP address 201.14.78.65
2307subset mask 255.255.255.224
2308IP address 11111111.11111111.11111111.11100000
2309Subnet Mask 11001001.00001110.01001110.01000001
2310Subnet address 11001001.00001110.01001110.01000000
2311201 . 14 . 78 . 64
2312It is a Bitwise ANDing in above operation.
2313416.
2314Which of the following operator in SQL would produce the following result if
2315applied between two relations Employee and Department?
2316Eno EName DeptNo DName
2317111 Kumar
2318100
2319Sales
2320222 Steve
2321200
2322Finance
2323Null Null
2324300
2325Admn
2326244 400
2327Mktg
2328Meera
2329417.
2330The postfix expression of the given infix expression a+b*c+(d*e+f)*g is
2331418.The truth table
2332X Y f(X,Y)
23330 0 0
23340 1 0
23351 0 1
23361 1 1
2337represents the Boolean function
2338419.
2339Consider a disk with following specification; sector size - 512 bytes, tracks per
2340surface - 2000, sectors per track - 60, double-sided platters - 4, and average seek time
2341- 20 msec. For a 5400 rpm hard disk for one revolution, if a single track of data can be
2342transferred, then what is the transfer rate?
2343the data transfer rate is 25K/ 0.011= 2, 250Kbytes/second
2344420.
2345We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then
2346repeats. The minimum number of J-K flip-flops required to implement this counter is
2347Total 4.
2348421.
2349Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at
2350cylinder
2351100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135
2352and
2353145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request
2354for
2355cylinder 90 is serviced after servicing ____________ number of requests.
23563 Number of requests
2357422.
2358For non-negative functions, f(n) and g(n), f(n) is theta of g(n) if and only if
2359max(f(n), g(n)) = Θ(f(n) + g(n))
2360423.
2361If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the
2362transmission before division ?
2363If divisor is n bit long then we add (n-1) no of 0's in the data unit before division
2364so here divisor is 1010 hence 3 0's are added in data unit so ans will be 111111000 i.e C
2365424.The output after second iteration of the sorting technique is given below. Identify the
2366technique used 23 45 78 8 32 56
2367MERGE SORT
2368425.
2369Assume that a table CUSTOMER has 10000 records. If the block size 1024 bytes and
2370the record size is 80 bytes, how many records can be stored in each block to achieve
2371maximum performance and how many blocks are required to store the entire table?
2372Number of records in file = 16384
2373Record size = 32 bytes
2374Key Size = 6 bytes
2375Block Size on file system = 1024 bytes
2376Size of Block Pointer = 10 bytes
2377Size of a record or index Entry = 10 + 6 = 16
2378Number of blocks in first level = (Number of records in file)/
2379(Disk Block Size)
2380= (16384 * 16)/(1024)
2381= 16 * 16
2382= 256
2383In second level, there will be 256 * 16 entries.
2384Number of blocks in second level = (Number of entries) /
2385(Block Size)
2386= (256 * 16) / 1024
2387= 4
2388Answer : 256+4 = 260
2389426.
2390which type of EM waves are used for unicast communication such as cellular telephones,
2391satellite networks and wireless LANS.
2392Radio waves!
2393427.
2394_________ register keeps track of the instructions stored in program stored in memory.
2395.
2396PC (Program Counter)428.
2397How many address bits are needed to select all memory locations in the 16K × 1 RAM?
2398The size of the memory is N*M
2399where N is the address lines and M is word length
2400no of registers/memory location required is 2^N
2401Given memory capacity is 16k
2402thus 2^N=16K
24031K=1024 memory locations
2404thus16k=16*1024=16384
2405now 2^N=16384
2406After factorising 16384 by 2 we ll get N AS 14
2407SO ADDRESS LINE REGUIRED IS 14.
2408429.
24091024 bit is equal to how many byte = 128 bytes
2410430.
2411The technique, for sharing the time of a computer among several jobs, which switches jobs so
2412rapidly such that each job appears to have the computer to itself, is called
2413ANS: time sharing
2414431.
2415Consider a relation R (A, B, C, D, E) with set of functional dependencies F = {ABC,
2416CDE, BD, EA}. Which of the following is one of the candidate keys of R?
2417432.
2418A method which creates the problem of secondary clustering is
2419LINEAR PROBING
2420433.
2421In stop and wait ARQ, the sequence numbers are generated using
2422Maximum sequence number in GBN is same as window size.
2423For sequence bits = n, number of sequence numbers = 2 n and window size = 2 n - 1
2424Consider n = 3, sequence numbers will be 2 3 = 8 ( i.e. from 0 - 7 )
2425and maximum window size = 2 3 - 1 = 7 i.e window will carry frames from 0 to 6
2426which are 7 in number.
2427Now, for sender window = 5
2428number of sequence bits needed = ceil (log 2 (1+window size)) = 3So, sequence numbers generated would be 0 to 7 but window will carry
2429frames from 0 to 4 which is 5 in number (same as window size)
2430434.
2431How many ways are present in 4-way set associative cache of 16 sets?
2432Number of sets = Cache memory/(set associativity * cache block size)
2433= 256KB/(4*16 B)
2434= 4096
2435435.
2436Find the time complexity of given code snippet
2437for(int i=1;i<=n;i++)
2438for(int j=1;j<=n;j*=2)
2439Printf(“*”);
2440O(Logn) Time Complexity of a loop is considered as O(Logn) if the loop variables is
2441divided / multiplied by a constant amount.
2442436.
2443Given R = ABCDEFGH and set of functional dependencies F = {BHC, BHF,
2444EF, AD, FA, BHE, CE, FD}, which of the following is redundant set of
2445functional dependencies?
2446437.
2447Which of these is true for go-back-N protocol, if m is the size of sequence number field
2448438.
2449Mac Operating system is developed by which company
2450Apple Inc.
2451439.
2452In the running state
2453440.
2454void Function(int n)
2455{
2456int i, count =0;;
2457for(i=1; i*i<=n; i++)
2458count++;
2459}
2460The time complexity of the above code snippet is441.
2461Consider the entities customer (customer-name, customer-city,customer-street) and account(
2462account-no,balance) with following relationship
2463If depositor is a one-to-many relationship from account to customer, then this ER
2464diagram can be reduced to which of the following relational schemas?
2465442.
2466To guarantee the detection of up to s errors in all cases, the minimum Hamming distance in a
2467block code must be
2468S+1
2469443.
2470RS flip-flops are also called
2471444.
2472Consider this binary search tree:
247314
2474/ \
24752 16
2476/ \
24771 5
2478/
24794
2480Suppose we remove the root, replacing it with something from the left
2481445.
2482The 1-address instructions for a=b*c + d is
2483446.
2484A critical region is
2485447.
2486The conjunctive selection operation σ θ1 ∧ θ2 (E) is equivalent to __________
2487448.
2488Which of the following is not used for synchronization?
2489Banker’s ALgorithm
2490449.
2491What is maximum throughput for slotted ALOHA ?
24920.5/e
2493450.
2494Which of the following concurrency control mechanisms insist unlocking of all read
2495and write locks of transactions at the end of commit?
2496Answer: 2 Phase Locking
2497451.
2498While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in the
2499sequence shown, the element in the lowest level is
2500Answer: 67452.
2501The number of inputs, minterms in full adder is
2502Answer : 3,
2503453.
2504The major difference between a moore and mealy machine is that
2505The output of the moore machine depends only on the current state
2506454.
2507The process of analyzing the given relation schemas based on their functional
2508dependencies is known as
2509Normalization
2510455.
2511The main function of dispatcher is:
2512The main function of the dispatcher (the portion of the process scheduler)
2513is assigning ready process to the CPU.
2514456.
2515A complex low pass signal has a bandwidth of 100kHz. What is the minimum sampling rate for
2516this signal
2517Answer: 200000 samples ( 2 times the bandwidth)
2518457.
2519Which of the following sorting algorithms has the lowest worst-case complexity?
2520Merge Sort
2521458.
2522What is the difference between CSMA/CD and ALOHA?
2523Main difference between Aloha and CSMA is that Aloha protocol does not try to
2524detect whether the channel is free before transmitting but the CSMA protocol
2525verifies that the channel is free before transmitting data.
2526459.
2527X=1010100 and Y=1000011 using 2's complement X-Y is
2528Answer: 10001
2529460.
2530Consider ?n? processes sharing the CPU in a round robin fashion. Assume that the context
2531switch takes ?s? seconds. What must be the quantum ?q? such that the overhead of context
2532switching is minimized and at same time each process is getting guaranteed execution on the
2533CPU atleast once in every ?t? seconds?ANSWER: q<=((t-ns)/n-1)
2534461.
2535Which one of the following is the recurrence equation for the worst case time complexity of the
2536Quicksort algorithm for sorting n(≥ 2) numbers? In the recurrence equations given in the options
2537below, c is a constant.
2538T(n) = T(n – 1) + T(0) + cn
2539462.
2540What operator performs pattern matching?
2541Answer: LIKE
2542463.
2543Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?
2544Answer: 3
2545464.
2546What is the content of Stack Pointer (SP)?
2547The Stack Pointer is used to indicate where the next value to be removed from
2548the stack should be taken from.
2549465.
2550Identify the minimal key for relational scheme R(A, B, C, D, E) with functional
2551dependencies F = {A → B, B → C, AC → D}
2552466.
2553A heap memory area is used to store the
2554467.
2555If user A wants to send an encrypted message to user B. The plain text of A is encrypted with the
2556_______.
2557Answer: Public Key of User B
2558468.
2559The minimum number of JK flip-flops required to construct a synchronous counter with the count
2560sequence (0,0, 1, 1, 2, 2, 3, 3, 0, 0,??.) is
25613 flip flops
2562469.
2563For an undirected graph with n vertices and e edges, the sum of the degree of each vertex
2564isequal to
2565Answer : 2e
2566470.
2567Programs tend to make memory accesses that are in proximity of previous access this is called
2568spatial locality471.
2569________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
2570Long Term Scheduler
2571472.
2572The best normal form of relation scheme R (A, B, C, D) along with the set of functional
2573dependencies F = {AB →C, AB → D, C → A, D → B} is
2574Third Normal Form
2575473.
2576Mnemonic codes and variable names are used in
2577Assembly Language
2578474.
2579Time required to merge two sorted lists of size m and n, is
2580475.
2581What happens to destination address in the header of a packet in a datagram network ?
2582476.
2583___________ mechanism is used for converting a weak entity set into
2584strong entity set in entity-relationship diagram
2585Adding suitable attributes
2586477.
2587Which of the following disk seek algorithms would be the best choice to implement in a
2588system that services an average of 5 disk requests per second
2589478.
2590_________ register keeps track of the instructions stored in program stored in memory.
2591Program Counter
2592479.
2593Bayone-Neill-Concelman(BNC) connectors are used with which type of cables
2594Coaxial Cable
2595480.
2596Which of the following disk seek algorithms has the most variability in response time?
2597481.
2598What data structure is used for depth first traversal of a graph?
2599Stack
2600482.
2601Division operation is ideally suited to handle queries of the type:Division identify the attribute values from relation that are found
2602to be paired with all of the values from the other relation.
2603Customers who have no account in any of the branches in Delhi.
2604Customers who have an account at all branches in Delhi.
2605Customers who have an account in atleast one branch in Delhi.
2606Customers who have only joint account in any one branch in Delhi
2607483.
2608A clustering index is created when _______.
2609Foreign key ordered
2610484.
2611In TDM Data rate management is done by which of these strategies
2612A. Multilevel multiplexing
2613B. Multi-slot allocation
2614C. Pulse stuffing
2615D. all of the above
2616485.
2617Graph traversal is different from a tree traversal, because
2618486.
2619Which of the following instructions should be allowed only in Kernel Mode?
2620(a) Disable all interrupts
2621(b) Read the time-of-day clock
2622(c) Set the time-of-day clock
2623(d) Change the memory map (Answer: A, C & D)
2624487.
2625One operation that is not given by magnitude comparator
2626A. equal
2627B. lessC. greater
2628D. addition
2629488.
2630Supervisor call
2631489.
2632Re-balancing of AVL tree costs
2633490.
2634Consider a B+ tree in which the search Answer is 12 bytes long, block size is 1024 bytes,record
2635pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can
2636be accommodated in each non-leaf node of the tree is ____ .
2637Answer: 50
2638491.
2639After fetching the instruction from the memory, the binary code of the
2640instruction goes to
2641492.
2642Which of these is correct for synchronous Time Division Multiplexing
2643Data rate of link is n times faster and the unit duration is n times shorter
2644493.
2645In communication satellite, multiple repeaters are known as?
2646Transponders
2647494.
2648Table that is not a part of asynchronous analysis procedure
2649A. transition table
2650B. state table
2651C. flow table
2652D. excitation table495.
2653This Key Uniquely Identifies Each Record
2654Primary Key
2655496.
2656Paging suffer from ....................
2657Internal Fragmentation
2658497.
2659How many swaps are required to sort the given array using bubble
2660sort - { 2, 5, 1, 3, 4}
2661498.
2662Error detection at the data link layer is achieved by?
2663Cyclic Redundancy Code
2664499.
2665The O notation in asymptotic evaluation represents
2666he Big O notation defines an upper bound of an algorithm
2667500.
2668Which of the following provides interface (UI) between user and OS
2669Shell
2670501.
2671_________ register keeps track of the instructions stored in program stored in
2672memory.
2673Program Counter
2674502.
2675Which of the following is not a function of a DBA?
2676Application Creation
2677503.
2678Assume a relation R with keys X, Y and Z, where X, Y, and Z are sets of one or more attributes.
2679Also assume that Y is a subset or equal to X and Z is a subset of X and Y. Which of the following
2680is true for this case?
2681Y and Z are candidate Keys of R
2682504.
2683What is a shell ?
2684Shell is a UNIX term for the interactive user interface with an operating system505.
2685Baud means?
26861. a unit of transmission speed equal to the number of times a signal changes state per
2687second. For signals with only two possible states one baud is equivalent to one bit
2688per second.
2689506.
2690A group of bits that tell the computer to perform a specific operation is known as
2691Instruction Code
2692507.
2693Recursion uses more memory space than iteration because
2694Every Recursive call has to be stored
2695508.
2696A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order
2697traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in
2698that order. The level-order traversal of the heap after the insertion of the elements is:
2699509.
2700We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then
2701repeats. The minimum number of J-K flip-flops required to implement this counter is
2702Answer: 4
2703510.
2704You have 10 users plugged into a hub running 10Mbps half-duplex. There is a server connected
2705to the switch running 10Mbps half-duplex as well. How much bandwidth does each host have to
2706the server?
270710 Mbps
2708511.
2709A system has a resource ‘Z’ with 20 instances; each process needs 5 instances to complete its
2710execution. What is the minimum process in the system that may cause deadlock?
27115 Processes
2712512.
2713The constraint ?primary key cannot be null? is called as?
2714Not Null COnstraint
2715513.
2716In Multi-Processing Operating Systems:
2717Maximum Utilization of CPU can be achieved
2718514.
2719A circuit produces 1's complement of the input word, one application is binary subtraction. It is
2720called(A) Logic gate
2721(B) Register
2722(C) Multiplexer
2723(D) BCD converter
2724515.
2725A station in a network forwards incoming packets by placing them on its shortest output queue.
2726What routing algorithm is being used?
2727Hot Potato Routing
2728516.
2729Assume that a mergesort algorithm in the worst case takes 30 second for an input of size 64.
2730Which of the following most closely approximates the maximum input size of a problem that can
2731be solved in 6 minutes?
2732Answer: 512
2733517.
2734The cartesian product ,followed by select is equivalent to
2735Answer :Join
2736518.
2737If a , b , c, are three nodes connected in sequence in a singly linked list, what is
2738the statement to be added to change this into a circular linked list?
2739a) $$$
2740b) $$
2741c) NULL
2742d) error
2743519.
2744The Internet Control Message Protocol (ICMP)
2745520.
2746In a digital counter circuit feedback loop is introduced to
2747A:improve distortion
2748B:improve stability
2749C: reduce the number of input pulses to reset the counter
2750D:synchronous input and output pulses
2751521.
2752Consider the virtual page reference string
27531,2,3,2,4,1,3,2,4,1
2754on a demand paged virtual memory system running on a computer system that has main
2755memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the
2756number of page faults under the corresponding page replacement policy. Then
2757(A) OPTIMAL < LRU < FIFO
2758(B) OPTIMAL < FIFO < LRU
2759(C) OPTIMAL = LRU
2760(D) OPTIMAL = FIFO522.
2761A data dictionary does not provide information about
2762Answer : Size of storage disk.
2763523.
2764How many illegitimate states has synchronous mod-6 counter ?
2765A.3 (Answer)
2766B.2
2767C.1
2768D.6
2769524.
2770For the array (77 ,62,114,80,9,30,99), write the order of the elements after two passes using the
2771Radix sort
2772114, 30, 62, 77, 9, 99
2773525.
2774Which of the following technique is used for fragment?
2775one of the pieces that results when an IP gateway divides an IP datagram into
2776smaller pieces for transmission across a network that cannot handle the
2777original datagram size
2778526.
2779Which of the following RDBMS does not incorporate relational algebra
2780527.
2781Which scheduling policy is most suitable for a time-shared operating system?
2782Preemptive scheduling
2783528.
2784When you ping the loopback address, a packet is sent where?
2785Answer: Down through the layers of IP architecture and then up the layers
2786again
2787529.
2788Round robin scheduling is essentially the preemptive version of __________
2789ANSWER: FIFO
2790530.
2791A ring counter is same as
2792531.
2793Which of these is asymptotically bigger?
2794Answer: 6*2^n
2795532.
2796Which of the following is not a property of DBMS?A). INCREASE DATE REDUNDONCY.
2797B).INTERGRATION OF DATA.
2798C).IMPROVED IN SECURITY.
2799D).ACHIEVING DATA INDEPENDENCE,
2800533.
2801In the blocked state
2802the processes waiting for I/O are found
2803the process which is running is found
2804the processes waiting for the processor are found
2805the process ready to execute
2806534.
2807Which of the following devices assigns IP address to devices connected to a network that uses
2808TCP/IP?
2809DHCP Server
2810535.
2811The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42.
2812Which one of the following is the postorder traversal sequence of the same tree?
2813536.
2814A sequential circuit outputs a ONE when an even number (> 0) of one's are input; otherwise the
2815output is ZERO. The minimum number of states required is
2816Answer : 2
2817537.
2818In which category does the discrepancy between duplicate records belong?
2819538.
2820Data Structures and Algorithms:
2821In a min-heap:
2822parent nodes have values less than or equal to their children
2823539.
2824Which of the following technique is used for Time-To-Line (TTL)?
2825a technique used in best-effort delivery system to avoid endlessly
2826looping packets .
2827540.
2828A page fault occurs
2829When the page is not in the memory
2830541.
2831To build a mod-19 counter the number of flip-flops required is
28325 Flip Flops542.
2833The cartesian product ,followed by select is equivalent to
2834Answer: Join
2835543.
2836The number of clock pulses needed to shift one byte of data from input to the output of a 4-bit
2837shift register is
283816 Clock Pulses
2839544.
2840Consider the following New-order strategy for traversing a binary tree:
28411)Visit the root;
28422)Visit the right subtree using New-order;
28433)Visit the left subtree using New-order;
2844The New-order traversal of the expression tree corresponding to the reverse polish expression 3
28454 * 5 - 2 ? 6 7 * 1 + - is given by:
2846Answer : - + 1 * 7 6 ^ 2 - 5 * 4 3
2847545.
2848Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format.
2849The main program is loaded into memory & is executed. This type of loading is called _________
2850Dynamic Linking
2851546.
2852You are trying to decide which type of network you will use at your office, and you want the type
2853that will provide communication and avoid collisions on the cable. Which of the following is the
2854best choice?
2855Token Ring
2856547.
2857Which of the following is not a property of DBMS?
2858548.
2859You are working with a network that has the network ID 172.16.0.0, and you require 25 subnets
2860for your company and an additional 30 for the company that will merge with you within a month.
2861Each network will contain approximately 600 nodes. What subnet mask should you assign?
2862255.255.252.0
2863549.
2864_________________ constraint is specified between two relations and is used to maintain the
2865consistency among tuples of the two relations
2866Referential Integrity
2867550.
2868If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the
2869disk queue of I/O blocks requests are 98,37,14,124,65,67.
2870Answer: 321
2871551.For non-negative functions, f(n) and g(n), f(n) is theta of g(n) if and only if
2872552.
2873The main difference between JK and RS flip-flop is that
2874553.
2875The sign magnitude representation of binary number + 1101.011 is
2876Answer: 01101.011
2877554.
2878Minimum number of moves required to solve a Tower of Hanoi puzzle is
2879Answer: 2^n - 1
2880555.
2881The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting.
2882The Statement is true
2883556.
2884Parity bit is
28851. a bit which acts as a check on a set of binary values, calculated in such a way
2886that the number of 1s in the set plus the parity bit should always be even (or
2887occasionally, should always be odd).
2888557.
2889Changing the conceptual schema without having to change the external schema is
2890called as _________________
2891Physical Data Independence
2892558.
2893The problem of thrashing is effected scientifically by _____Program Strructure.
2894559.
2895A sort which relatively passes through a list to exchange the first element with any element less
2896than it and then repeats with a new first element is called
2897quick sort
2898560.
2899Update operation will violate
2900561.
2901When an inverter is placed between both inputs of an SR flip-flop, then resulting flip-lop is
2902D Flip Flop
2903562.
2904Ethernet and Token-Ring are the two most commonly used network architectures in the world.
2905Jim has heard of the different topologies for networks and wants to choose the architecture that
2906will provide him with the most options. Which of the following would that be? Choose the most
2907correct answer.Ethernet, because it can be set up with most topologies and can use multiple transfer
2908speeds
2909563.
2910A 2 MHz signal is applied to the input of a J-K lip-lop which is operating in the 'toggle' mode. The
2911frequency of the signal at the output will be
2912Answer: 2 MHz
2913564.
2914CSMA (Carrier Sense Multiple Access) is
2915Media Access control protocol
2916565.
2917---------------------is data about data
2918Metadata
2919566.
2920Which module gives control of the CPU to the process selected by the short-term scheduler?
2921Dispatcher
2922567.
2923The searching technique that takes O (1) time to find a data is
2924Hashing
2925568.
2926The master slave JK lip-flop is effectively a combination of
2927569.
2928The mechanism that bring a page into memory only when it is needed is called _____________
2929Demand Paging
2930570.
2931The main difference between synchronous and asynchronous transmission is
2932SR and T Flip FLop
2933571.
2934Let R be the relation on the set of positive integers such that a aRb if and only if a and b are
2935distinct and have a common divisor other than 1. Which one of the following statements about R
2936is true?
2937572.
2938What technique is often used to prove the correctness of a recursive function?
2939A. Communitivity.
2940ï‚· B. Diagonalization.
2941ï‚· C. Mathematical induction.
2942ï‚· D. Matrix Multiplication.
2943573.
2944The command which undo the transaction is
2945Undo-Transaction command574.
2946Which of the following is a Non-linear data structure
2947None of the above
2948575.
2949Which directory implementation is used in most Operating System?
2950Tree Directory Structure
2951576.
2952Which of the following is not true of virtual memory?
2953Virtual memory allows more efficient use of memeory( Actually, it doesn’t)
2954577.
2955ARP (Address Resolution Protocol) is
2956578.
2957A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the
2958output bit-string after stuffing is 01111100101, then the input bit-string is
2959Answer: 0111110101
2960579.
29611. If a sequence of push(1), push(2), pop,push(1),push(2),pop,pop,pop, push(2) pop operations
2962are performed in a stack , the sequence of popped out values are
29632 2 1 1 2
2964580.
2965Changing the conceptual schema without having to change physical schema is
2966Logical Data Independence
2967581.
2968When two or more processes trying to execute a set of instructions and if the output depends on
2969the order of execution of the process, this is termed as:
2970582.
2971With a single resource, deadlock occurs,
2972583.
2973The best index for range query is
2974584.
2975A system has ‘n’ processes and each process need 2 instances of a resource. There are n+1
2976instances of resource provided. This could:
2977585.
2978How switching is performed in the internet?586.
29791. You are given pointer p that points to the last node in a circular list and another singly linked
2980list whose first node is pointed to by ‘head’ and last node is pointed to by ‘tail’ has to be
2981appended to the end of the circular list. Which of the following is correct?
2982587.
2983Which of the following is shared between all of the threads in a process? Assume a kernel
2984level thread implementation.
2985588.
2986A telephone switch is a good example of which of the following types of switches.
2987589.
2988Among the following which is not the application of a stack?
2989590.
2990Commit, Savepoint, Rollback are ________
2991TCL Commands
2992591.
2993Which of the following is shared between all of the threads in a process? Assume a kernel
2994level thread implementation.
2995592.
2996In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
2997compared with the priority of
2998Currently Running Process
2999593.
3000The performance of cache memory is frequently measured in terms of a quantity called
3001Hit Ratio
3002594.
3003You are given pointers to first and last nodes of a singly linked list, which of the following
3004operations are dependent on the length of the linked list?
3005Delete the last element of the list
3006595.
3007R right outer join S on a=b gives
3008596.
3009the following pairs of
3010the INCORRECT pair is
3011OSI
3012protocol
3013layer/sub-layer
3014and
3015its
3016functionality,
3017Data Link Layer and Bit synchronization
3018597.
3019Consider a system with ‘M’ CPU processors and ‘N’ processes then how many processes can be
3020present in ready, running and blocked state at maximumlets say you have n number of cpu and p number of processes
3021ready state the mininum number of processes = 0, maximum = M
3022run state the mininum number of processes = 0, maximum = M (at the run state the
3023maximum number of process cannot be p or 0 because we have cpu bound processes.
3024that is n ........p depicts number of i/o bound processes)
3025at wait state the mininum number of processes = 0, maximum = N
3026598.
3027Four jobs to be executed on a single processor system arrive at time 0 in order A, B, C, and D.
3028Their burst time requirements are 4,1,8,1 time units respectively. Find the completion of A under
3029round robin scheduling with time slice of one time unit.
30309 Units
3031599.
3032Which one of the following protocols is NOT used to resolve one form of address to another
3033one?
3034DHCP
3035600.
3036What is the software that runs a computer, including scheduling tasks, managing storage, and
3037handling communication with peripherals?
3038Operating System
3039601.
30401. If a , b , c, are three nodes connected in sequence in a singly linked list
3041struct node *temp=a;
3042while(temp!=NULL)
3043{
3044temp=temp->next; printf( “$”);
3045}
3046Assuming ‘c’ to be the last node, the output is $$$
3047602.
3048This user makes canned transaction naïve or end user
3049603.
3050For 3 page frames, the following is the reference string:
30517 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1.
3052How many page faults does the FIFO page replacement algorithm produce?
305315
3054604.
3055Buffering is useful because it allows devices and the CPU to operate asynchronously
3056605.
3057What does the code snippet given below do?
3058void fun1(struct node *head){ if(head==NULL) return;
3059fun1(head->next);
3060printf("%d",head->data);
3061}
3062Fun1() prints the given Linked List in reverse manner
3063606.
3064The transport layer protocols used for real time multimedia, file transfer, DNS and email,
3065respectively are
3066UDP, TCP, UDP and TCP
3067For real time multimedia, timely delivery is more important than correctness. –> UDP
3068For file transfer, correctness is necessary. –> TCP
3069DNS, timely delivery is more important –> UDP
3070Email again same as file transfer –> TCP
3071607.
3072This Key Uniquely Identifies Each Record
3073Primary Key
3074608.
3075What is the main difference between traps and interrupts?
3076How they are initiated
3077609.
3078Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the
3079First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K, and 426K (in
3080order)? Which algorithm makes the most efficient use of memory?
3081First-fit:
3082212k -> 500K (288 left)
3083417k -> 600k (183 left)
3084122k -> 288k (166k left)
3085426k -> nowhere big enough left! doh!
3086Best-fit:
3087212k -> 300k (88k left)
3088417k -> 500k (83k left)
3089122k -> 200k (78k left)
3090426k -> 600k (174k left)
3091Worst-fit:
3092212k -> 600k (388k left)417k -> 500k (83k left)
3093122k -> 388k (266k left)
3094426k -> nowhere big enough again!
3095the best fit algorithms uses memory most efficiently (it's also the only one that can even put all
3096the processes into memory!)
3097610.
3098Which of the following transport layer protocols is used to support electronic mail?
3099TCP(transport layer) SMTP(application layer)
3100611.
3101The following query is called as ? select * from emp where ssn in ( select dssn from dependent
3102order by age desc ) ?;
3103DML query
3104612.
3105Which of the following is termed as reverse polish notation?
3106Any postfix notation
3107613.
3108In one of the pairs of protocols given below, both the protocols can use multiple TCP
3109connections between the same client and the server. Which one is that?
3110SMTP: only one TCP connection
3111Telnet: only one TCP connection
3112HTTP: Multiple connections can be used for each resource
3113FTP: FTP uses Telnet protocol for Control info on a TCP connection and another TCP
3114connection for data exchange
3115So, answer is HTTP and FTP
3116614.
3117The term P means in semaphores
3118Wait(probheer)
3119615.
3120If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the
3121service provided is for
3122Higher priority
3123616.
3124The data type describing the types of values that can appear in each column is
3125called
3126______________________.
3127domain
3128617.
3129For the given infix expression a+b^c*(d-e) where ‘^’ denotes the EX-OR operator, the
3130corresponding prefix expression is^+ab*c-de
3131618.
3132Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following
3133statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S);
3134respectively. The above situation depicts a _________ .
3135deadlock
3136619.
3137The query to print alternate records (i.e even numbered) from a table is
3138Select * from TableName where ColumnName % 2 = 0(even number)
3139SELECT usernameFROM (SELECT ROWNUM num, usernameFROM dba_users)
3140WHERE MOD (num, 2) = 0;(even number)
3141Select * from TableName where ColumnName % 2 = 1(odd number)
3142620.
3143A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of
31448 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number
3145of bits for the TAG field is
3146Number of sets = cache size / sizeof a set
3147Size of a set = blocksize * no. of blocks in a set
3148= 8 words * 4 (4-way set-associative)
3149= 8*4*4 (since a word is 32 bits = 4 bytes)
3150= 128 bytes.
3151So, number of sets = 16 KB / (128 B) = 128
3152Now, we can divide the physical address space equally between these 128 sets. So, the number
3153of bytes each set can access
3154= 4 GB / 128
3155= 32 MB
3156= 32/4 = 8 M words = 1 M blocks. (220 blocks)
3157So, we need 20 tag bits to identify these 220 blocks.
3158621.
3159Which of the following is two way list?
3160None of the above
3161622.
3162The protocol data unit (PDU) for the application layer in the Internet stack is
3163Message623.
3164In an Ethernet local area network, which one of the following statements isTRUE?
3165The exponential
3166retransmissions
3167backoff
3168mechanism
3169reduces
3170the
3171probability
3172of
3173collision
3174on
3175624.
3176Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method.
3177There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for
3178intermediate results. Assuming size(r(R))
3179relation r(R) is in the outer loop.
3180625.
3181An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of
3182processes is ________.
3183SJF
3184626.
3185In the process state transition diagram, the transition from the READY state to the
3186RUNNING state indicates that:
3187the process in the running state can be preempted and brought back to ready state.
3188627.
31891. A circularly linked list is used to represent a Queue. A single variable p is used to access the
3190Queue. To which node should p point such that both the operations enQueue and deQueue
3191can be performed in constant time?
3192Rear node
3193628.
3194Consider the following four schedules due to three transactions (indicated by the subscript) using
3195read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is
3196conflict serializable?
3197Answer : D
3198629.
3199The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage
3200(with delay 800 picoseconds) is replaced with a functionally equivalent design involving two
3201stages with respective delays 600 and 350 picoseconds. The throughput increase of the pipeline
3202is percent
320333.33
3204630.In the IPv4 addressing format, the number of networks allowed under Class C addresses is
32052^21
3206631.
32071. If a sequence of enque(1), enque (2), deque, enque (1), enque (2), deque, deque, deque,
3208enque (2) operations are performed in a queue , the list of elements that would have been
3209processed are
3210632.
3211Which of the following is not true about segmented memory management?
3212virtual memory is used only in multi-user systems
3213633.
3214R has n tuples and S has m tuples, then the Cartesian product of R and S will
3215produce
3216___________ tuples.
3217m*n
3218634.
32191. In a circular list with 5 nodes, let ‘temp’ point to the 4 th node at present.
3220int i;
3221for(i=0;i<4;i++)
3222temp=temp->next;
3223The above code will make ‘temp’ point to
32243 rd Node
3225635.
3226What is the main difference between traps and interrupts?
3227Trap is s/w generated. Interrupt is h/w generated.
3228636.
3229IEEE 802.5 is a
3230_______________
3231Token Ring related
3232637.
3233Which one of the following fields of an IP header is NOT modified by a typical IP router?
3234Source Address
3235638.
3236Minimal super key of a relation is called _______________.
3237Candidate key
3238639.
3239For what value of c1 and c2 , the theta notation of f(n)=5n 2 +3n+2 is n 2 ?
3240640.
3241When a program tries to access a page that is mapped in address space but not loaded
3242in physical memory, then
3243Page fault occurs
3244641.The main advantage of DMA is that it
3245High transfer rates
3246642.
3247If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum
3248number of hosts per subnet?
32492046
3250643.
3251A typical hard drive has a peak throughput of about
3252600 mbps (not sure)
3253644.
3254Which algorithm chooses the page that has not been used for the longest period of time
3255whenever the page required to be replaced?
3256LRU
3257645.
3258Consider a relation R (A, B, C, D, E) with set of functional dependencies F = {A¿BC, CD¿E,
3259B¿D, E¿A}. Which of the following is one of the candidate keys of R?
3260The candidate keys are A, E, CD, and BC
32611.
3262646.
3263Consider a dynamic queue with two pointers: front and rear. What is the time needed
3264to insert an element in a queue of length of n?
3265O(1). Insert element at rear.
3266647.
3267DMA is useful for the operations
3268DMA is useful for transferring data between memory and devices if large volume of data is to be
3269transferred, or the devices have small response times. Because after setting up buffers, pointers,
3270and counters for the I/O device, the device controller transfers an entire block of data directly to
3271or from its own buffer storage to memory, with no intervention by the CPU. Only one interrupt is
3272generated per block, rather than the one interrupt per byte (or word) generated for low-speed
3273devices.
3274Alternatively, you may simply say:
3275DMA is useful for transferring large quantities of data between memory and devices. It eliminates
3276the need for the CPU to be involved in the transfer, allowing the transfer to complete more
3277quickly and the CPU to perform other tasks concurrently.
3278648.
32791. Which sorting technique uses a data structure similar to the one used in bucket hashing?
3280Bucket sort
3281649.
3282How many address bits are needed to select all memory locations in the 16K × 1 RAM?
328314
3284650.RAID is a way to:
3285RAID is the way of combining several independent and relatively small disks into a single
3286storage of a large size. The disks included into the array are called array members. The disks
3287can be combined into the array in different ways which are known as RAID levels.
3288651.
3289Assume that source S and destination D are connected through two intermediate routers labeled
3290R. Determine how many times each packet hasto visit the network layer and the data link layer
3291during a transmission from S to D.
3292Network layer – 4 times and Data link layer – 6 times
3293652.
3294__________is the description of the database
3295653.
3296Identify the correct sequence in which the following packets are transmitted on the network by
3297a host when a browser requests a webpage from a remote server, assuming that the host has
3298just been restarted.
3299DNS query, TCP SYN, HTTP GET request
3300654.
33011. On adopting shell sort technique, the output of the array (21,62,14,9,30,77,80,25) after a pass
3302with increment size =3, is
3303655.
3304Which of these would not be a good way for the OS to improve battery lifetime in a
3305laptop?
3306656.
3307Which of the following is not included in an inode in Linux?
3308File name and directory
3309657.
3310The DMA controller has _______ registers
33113
3312658.
3313Consider a relational table with the schema R (A, B, C). Assume that the cardinality of attribute A
3314is 10, B is 20, and C is 5. What is the maximum number of records R can have without duplicate?
33151000
3316659.
3317An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an
3318IPpacket of size 4404 bytes with an IP header of length 20 bytes. The values of the
3319relevant fields in the header of the third IP fragment generated by the router for this packet are
3320MF bit: 0, Datagram Length: 1444; Offset: 370
3321660.
33221. For the array , (77 ,62,114,80,9,30,99), write the order of the elements after two passesusing the Radix sort.
3323661.
3324What is the correct HTML for making a hyperlink?
3325a href = “”
3326662.
3327One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the
3328following statements best explains the need for this field?
3329It can be used to prevent packet looping
3330663.
3331Assume relations R and S with the schemas R (A, B, C) and S (B, D). Which of the following is
3332equivalent to r ¿ s?
3333664.
3334A Program Counter contains a number 825 and address part of the instruction contains the
3335number 24. The effective address in the relative address mode, when an instruction is read from
3336the memory is
3337849
3338665.
33391. Time complexity of the program to generate Fibonacci sequence is
3340T(n) = T(n-1) + T(n-2) which is exponential.
3341Or O(n)
3342666.
3343Which one of the following is NOT a part of the ACID properties of database transactions?
3344Atomicity, Consistency, Isolation, durability
3345667.
33461. While applying Quick sort technique for the array 5 4 3 8 12 6 10 1 7 9, if pivot =5, after the first
3347traversal on both sides, ‘l’ and ‘r’ will be
33485 4 3 1 12 6 10 8 7 9
3349668.
3350When process requests for a DMA transfer ,
3351process is temporarily suspended and another process gets executed.
3352669.
3353How switching is performed in the internet?
3354Packet Switching
3355670.
3356The <big> tag makes
3357the text bigger than the normal. Not supported in HTML 5
33581.
3359671.
3360If a[] is the array containing the elements to be sorted using radix sort, during the second
3361iteration in which the second Least Significant Digit is considered, row number in 2D array to
3362which an element has to be stored is given by672.
3363Which of following property returns the window object generated by a frame object
3364contentWindow
3365673.
3366Foreign key is a subset of primary key is stated in _____________ constraint
3367Foreign Key
3368674.
3369What is the unique characteristic of RAID 6 ?
3370Two independent distributed parity.
3371675.
3372A layer -4 firewall (a device that can look at all protocol headers up to the transport layer)
3373CANNOT
3374Block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00AM
3375676.
3376Which of the following address modes calculate the effective address as
3377address part of the instruction) + (content of CPU register)
3378. Indirect Address Mode
3379677.
3380A telephone switch is a good example of which of the following types of switches.
3381circuit
3382678.
3383Which component of a database is used for sorting?
3384procedure
3385679.
33861 What is the output of following JavaScript code
3387680.
3388If a , b , c, d are four nodes connected in sequence in a doubly-linked list
3389Struct node *temp=a;
3390Temp=temp->next;
3391(Temp->next)->prev=temp->prev;
3392(Temp->prev)->next=temp->next;
3393Which of the following is true?
3394B is deleted from the list
3395681.
3396The load instruction is mostly used to designate a transfer from memory to a
3397processor register known as
3398accumulator682.
3399You can refresh the web page in javascript by using ................ method.
3400Reload()
3401683.
3402The max-heap for the array ( 4, 3, 1, 5, 9, 2, 8 ) is
34039
34045
34053
34068
34074 1
34082
3409684.
3410If message in Segmentation and Reassembly (SAR) sub layer of Application Adaptation
3411Layer 3/4 has value of Segment type is 11 then it is called a
3412single segment message.
3413685.
3414Consider the following relation
3415Cinema (theater, address, capacity)
3416Which of the following options will be needed at the end of the SQL query
3417SELECT P1. address
3418FROM Cinema P1
3419Such that it always finds the addresses of theaters with maximum capacity?
3420WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)613.
3421686.
3422In Circuit Switching, resources need to be reserved during the
3423Setup phase
3424687.
3425The load instruction is mostly used to designate a transfer from memory to a processor register
3426known as____.
3427accumulator
3428688.
3429Which of the following is the correct way for writing JavaScript array?
3430var txt = new Array("arr ","kim","jim")
3431689.
3432Among the following ,which has the highest time complexity O(n 2 ) in all the three
3433cases.(Worst,average and best) and cannot be improved?
3434690.
3435Which of the following relational algebra operations do not require the participating tables to be
3436union-compatible?
3437Join
3438691.
3439In RMI Architecture which layer Intercepts method calls made by the client/redirects these calls
3440to a remote RMI service?
3441Stub and Skeleton layer692.
3442Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on
3443R.
3444It will immediately be granted
3445693.
3446A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output
3447bit-string after stuffing is 01111100101, then the input bit-string is
34480111110101
3449694.
3450For an algorithm whose step-count is 45n 3 +34n , choose the correct statement.
3451695.
3452What is the output of following JavaScript code
3453696.
3454Relations produced from an E-R model will always be
3455697.
3456How do you put a message in the browser's status bar?
3457window.status = "put your message here"
3458698.
3459Congestion control and quality of service is qualities of the
3460ATM
3461699.
3462If the associativity of a processor cache is doubled while keeping the capacity and block size
3463unchanged, which one of the following is guaranteed to be NOT affected?
3464Width of processor to main memory data bus
3465700.
3466If the element 12 has to be searched in the array (2,4,8, 9,14,16, 18), using binary
3467search, the result can be obtained within _____ comparisons.
34683
3469701.
3470A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
3471page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
3472maximum size of the page table of a process is 24 megabytes, the length of the virtual address
3473supported by the system is _________ bits.
347436
3475702.
3476Which two files are used during operation of the DBMS?
3477data dictionary and transaction log
3478703.
3479In the following pairs
3480the INCORRECT pair is
3481of
3482OSI
3483protocol
3484Data Link Layer and Bit Synchronization
3485layer/sub-layer
3486and
3487its
3488functionality,704.
3489What is the output of following JavaScript code?
3490705.
34911. For the array , (77 ,62,14,80,9,30,99) , if Quick sort technique is followed,what will be
3492the array status after placing the first pivot element in its appropriate place?
349362,14,9,30,77,80,99
3494706.
3495What is the correct JavaScript syntax to write "Hello World"
3496document. write("Hello World");
3497707.
3498The local host and the remote host are defined using IP addresses. To define the processes,
3499we need second identifiers called.........
3500UDP Addresses
3501708.
3502The number of outputs in n-input decoder is
35032^n
3504709.
3505Which two RAID types use parity for data protection?
3506RAID 4 and RAID 5
3507710.
3508Rotation method of hashing is usually combined with other hashing techniques except
3509Last character
3510711.
3511The two's complement of 101011 is
3512010101
3513712.
3514----------------------is a description of the database
3515Schema
3516713.
3517Browsers typically render text wrapped in ___________ tags as an indented paragraph.
3518<blockquote>
3519714.
3520Which one of the following protocols is NOT used to resolve one form of address to another
3521one?
3522DHCP
3523715.
35241. Among the following sorting techniques ,which has its time complexity as O(n) in thebest-case?
3525Insertion,Bubble
3526716.
3527-------involves finding the best line to fit two attributes so that one attribute is used to predict
3528another attribute.
3529Linear Regression
3530717.
3531The number of boolean functions in n-variables is
3532(2^(2^n))
3533718.
3534UDP uses........ to handle outgoing user datagrams from multiple processes on one host.
3535Multiplexing
3536719.
3537Who invented the JavaScript programming language?
3538Brendan Eich
3539720.
3540Java package is a grouping mechanism with the purpose of
3541Controlling the visibility of classes, interface and methods
3542721.
3543A heap memory area is used to store the
3544Heap memory is used for dynamic memory allocation
3545722.
3546The transport layer protocols used for real time multimedia, file transfer, DNS and email,
3547respectively are
3548(A) TCP, UDP, UDP and TCP
3549(B) UDP, TCP, TCP and UDP
3550(C) UDP, TCP, UDP and TCP
3551(D) TCP, UDP, TCP and UDP
3552Answer: (C)
3553723.
3554What is the output of following JavaScript code?
3555Output : 44
3556724.The lifetime of flash memory is ---------------------
3557Lifetime of a flash memory is long.
3558725.
3559A schema describes
3560A. Record & files
3561B. data elements
3562C. record relationships
3563D. all of the above
3564Ans Correct Answer is d
3565726.
3566What is the output of following JavaScript code
3567727.
3568The ......... protocol defines a set of messages sent over either User Datagram Protocol (UDP)
3569port53 or Transmission Control Protocol(TCP) port53.
3570A. Name space
3571B. DNS
3572C. Domain space
3573D. Zone transfer
3574Ans: B. DNS
3575728.
3576What is the multiplexer used for?
3577a) It is a type of decoder which decodes several inputs and gives one output
3578b) A multiplexer is a device which converts many signals into one
3579c) It takes one input and results into many output
3580d) None of the Mentioned
3581Ans. B
3582729.
3583Which of the following is true for the given tree?730.
3584Trigger is a
3585Trigger is a special kind of a store procedure that executes in response to certain action on the
3586table like insertion, deletion or updation of data
3587731.
3588Which of the following transport layer protocols is used to support electronic mail?
3589(A) SMTP
3590(B) IP
3591(C) TCP
3592(D) UDP
3593Answer (C)
3594E-mail uses SMTP as application layer protocol. SMTP uses TCP as transport layer
3595protocol.
3596732.
3597What will be printed as the output of the following program?
3598public class testincr
3599{
3600public static void main(String args[])
3601{
3602int i = 0;
3603i = i++ + i;
3604System.out.println(" I = " +i);
3605}
3606}
3607Output: I = 1
3608733.
3609Identify the addressing mode of the following instruction
3610Add R1, R2, R3
3611where R1, R2 are operands and R3 destination
3612Answer : Three-Address Instructions734.
3613R left outer join S on a=b gives
3614No table given
3615735.
3616What is the output of following JavaScript code
3617Output : N
3618736.
3619Foreign key is a subset of primary key is stated in -----------constraint
3620737.
3621What is the output of following JavaScript code
3622738.
3623When a network interface has a failure in its circuitry, it sends a continuous stream of frames
3624causing the Ethernet LAN to enter a Collapse state. This condition is known as __________.
3625a.Scattering
3626b.Jabbering
3627c.Blocking
3628d.Refreshing
3629Ans: b.Jabbering
3630739.
3631To prevent any method from overriding, the method has to declared as,
3632And: Method is declared with a ‘final’ keyword
3633740.
3634Which of the following addressing modes has minimum number of memory access to access the
3635operands?
3636A. Indirect
3637B. Direct
3638C. Indexed
3639D. Immediate
3640And: D.Immediate
3641741.
3642In one of the pairs of protocols given below, both the protocols can use multiple TCP
3643connections between the same client and the server. Which one is that?(A) HTTP, FTP
3644(B) HTTP, TELNET
3645(C) FTP, SMTP
3646(D) HTTP, SMTP
3647Answer: (A)
3648Explanation: HTTP may use different TCP connection for different objects of a webpage if
3649non-persistent connections are used.
3650FTP uses two TCP connections, one for data and another control.
3651TELNET and FTP can only use ONE connection at a time
3652742.
3653R left outer join S on a=b gives
3654743.
3655The ways to accessing html elements in java script
3656document.getElementById("intro");
3657getElementsByTagName("p");
3658getElementsByClassName("intro");
3659document.forms["frm1"];
3660744.
3661How many flip-flops are present in register of sixteen bits?
3662Ans: 16 Flip flops
3663745.
3664temp=root->left;
3665while(temp->right!=NULL)
3666temp=temp->right;
3667return temp;
3668The above code snippet for a BST with the address of the root node in pointer ‘root’
3669returns
3670Ans:Inorder Predecessor
3671746.
3672A subnet has been assigned a subnet mask of 255.255.255.192. What is the maximum number of hosts
3673that can belong to this subnet?
3674(A) 14
3675(B) 30
3676(C) 62
3677(D) 126Answer: (C)
3678747.
36794. What is the correct syntax for referring to an external script called " abc.js"
3680A. <script href=\" abc.js\">
3681B. <script name=\" abc.js\">
3682C. <script src=\" abc.js\">
3683D. None of the above
3684Ans: C. <script src=\" abc.js\">
3685748.
3686Which one of the following is not true?
3687749.
3688In a relational schema, each tuple is divided into fields called
3689A) Relations
3690B) Domains
3691C) Queries
3692D) All of the above
3693Ans: B) Domains
3694750.
3695If a pipeline has five stages, assuming each stage is one cycle, the earliest time to receive an
3696output from an instruction without any forwarding (not nop) is after which cycle?
3697751.
3698The term scheme means:
3699752.
3700How many phases are present in the simplest pipeline system?
3701753.
3702Identify the sorting technique that supports divide and conquer strategy and has (n2) complexity
3703in worst case
3704a. Bubble sort
3705b. Insertion sort
3706c. Quick sort
3707d. All of above
3708Ans: c. Quick sort
3709754.
3710A system of interlinked hypertext documents accessed via the Internet is known as
3711The World Wide Web (abbreviated as WWW or W3, commonly known as the web),
3712is a system of interlinked hypertext documents accessed via the Internet
3713755.
3714Value of checksum must be recalculated regardless of
3715De-fragmentationFragmentation
3716Transfer
3717Size
3718Ans: Fragmentation
3719756.
3720In Circuit Switching, resources need to be reserved during the
3721Ans: the resources need to be reserved during the setup phase
3722757.
3723The language used in application programs to request data from the DBMS is referred to as the
3724A. DML
3725B. DDL
3726C. query language
3727D. All of the above
3728E. None of the above
3729Answer: Option A
3730758.
3731A ____________ is often used if you want the user to verify or accept
3732confirm box
3733759.
3734Can any unsigned number be represented using one register in 64-bit processor
3735ANS: 2^63 – 1 numbers (Not sure).
3736760.
37371. Inorder and postorder traversal sequences of a binary tree are 45 50 55 65 70 75 80 85 90
3738and 45 55 65 50 75 90 85 80 70. What are its leaf nodes?
3739Ans: 45,55,70,85
3740761.
3741Which normal form is considered adequate for relational database design?
3742Ans: Which normal form is considered adequate for normal relational database
3743design? Explanation: A relational database table is often described as “normalized” if
3744it is in the Third Normal Form because most of the 3NF tables are free of insertion,
3745update, and deletion anomalies
37463NF
3747762.
3748In Javascript, which of the following method is used to find out the character at a position
3749in a string?
3750a) charAt()
3751b) CharacterAt()
3752c) CharPos()d) characAt()
3753ans: a
3754763.
3755If the page size is 1024 bytes, what is the page number in decimal of the following virtual address
37561110 1010010101
3757764.
3758The protocol data unit (PDU) for the application layer in the Internet stack is
3759(A) Segment
3760(B) Datagram
3761(C) Message
3762(D) Frame
3763Answer (C)
3764The Protocol Data Unit for Application layer in the Internet Stack (or TCP/IP) is called
3765Message.
3766765.
37671. The preorder traversal of the AVL tree obtained by inserting 17,7,20,10,8 is
3768766.
3769A queue data structure can be used for
3770Ans: Typical uses of queues are in simulations and operating systems.
3771Operating systems often maintain a queue of processes that are ready to execute or
3772that are waiting for a particular event to occur.
3773Computer systems must often provide a “holding area” for messages between two
3774processes, two programs, or even two systems. This holding area is usually called a
3775“buffer” and is often implemented as a queue.
3776767.
3777What is the JavaScript syntax to insert a comment that has more than one line?
3778ans: “/* ... */” can be used to insert comment > 1line
3779768.
3780Given four frames in main memory, the following is the content of the page table. Assuming
3781the frames are fetched at time instant 3, 4, 1, 2 which frame will be replaced to place the page
378246 using first in first out replacement algorithm?
378323
378434
378510
37864
3787page 46?????769.
3788In an Ethernet local area network, which one of the following statements isTRUE?
3789(A) A station stops to sense the channel once it starts transmitting a frame.
3790(B) The purpose of the jamming signal is to pad the frames that are smaller than the minimum
3791frame size.
3792(C) A station continues to transmit the packet even after the collision is detected.
3793(D) The exponential backoff mechanism reduces the probability of collision on retransmissions
3794Answer:
3795(D)
3796770.
3797The concept of locking can be used to solve the problem of
3798Deadlock
3799Lost update
3800Inconsistent
3801All of the above
3802Ans: All of the above
3803771.
3804............ is very useful in situation when data have to stored and then
3805retrieved in reverse order.
3806Ans: Stack
3807772.
3808In a E-R diagram, ellipses represent a
3809Ans : Attributes are represented by means of ellipses. Every ellipse represents one attribute
3810773.
3811What does isNaN function do in JavaScript?
3812Ans: The isNaN() function determines whether a value is an illegal number (Not-a-Number). This
3813function returns true if the value equates to NaN. Otherwise it returns false.
3814774.
3815Consider the following message M = 1010001101. The cyclic redundancy check (CRC) for this message
3816using the divisor polynomial x 5 + x 4 + x 2 + 1 is :
3817Ans: 01110
3818775.
3819The daisy chaining prioirty gives least priority to which device?
3820Ans: Slow devices such as Keyboard
3821776.
3822A binary search tree whose left subtree and right subtree differ in hight by at
3823most 1 unit is called ......
3824Ans AVL Tree
3825777.Which method is implemented in RAID 1?
3826RAID 1 consists of an exact copy (or mirror) of a set of data on two or more disks; a classic RAID
38271 mirrored pair contains two disks. This configuration offers no parity, striping, or spanning of disk
3828space across multiple disks, since the data is mirrored on all disks belonging to the array, and
3829the array can only be as big as the smallest member disk. This layout is useful when read
3830performance or reliability is more important than write performance or the resulting data storage
3831capacity.
3832778.
3833Dotted-decimal notation of 10000001 00001011 00001011 11101111 would be
3834Ans: 129 .11 .11.239
3835779.
3836Which of the following desired features are beyond the capability of relational algebra?
3837(a)
3838Aggregate computation
3839(b) Multiplication
3840(c) Finding transitive closure
3841(d) None of the above
3842Ans: All a,b,c (Aggregate Computation,Multiplication,Finding transitive closure)
3843780.
3844How do you create a new object in JavaScript?
3845Ans : There are various ways to create an object in js:
3846a)define a constructor function and then create an object by using the new keyword
3847b)Using object.create() method
3848Object.create(proto [, propertiesObject ])
3849781.
3850A processor can support a maximum memory of 4 GB, where the memory is word-addressable
3851(a word consists of two bytes). The size of the address bus of the processor is at least
3852__________ bits
3853Ans: Maximum Memory = 4GB = 232 bytes
3854Size of a word = 2 bytes
3855Therefore, Number of words = 232 / 2 = 231
3856So, we require 31 bits for the address bus of the processor.
3857782.
3858When determining the efficiency of algorithm the time factor is measured by
3859Ans: Counting the number of key operations
3860783.
3861What is the output of following JavaScript code?Ans: Quality 100
3862784.
3863What are the potential problems when a DBMS executes multiple transaction concurrently
3864Ans: Lost update problem,dirty read problem
3865785.
3866In the IPv4 addressing format, the number of networks allowed under Class C addresses
3867is
3868Ans: 2^21
3869786.
3870Which one of the following allows a user at one site to establish a connection to another site
3871and then pass keystrokes from local host to remote host?
3872Ans : Telnet
3873787.
3874RAM type is justified as
3875Ans RAM is justified as being reliable and error detecting
3876788.
3877Linked lists are best suited
3878Ans for the size of the structure and the data in the structure are constantly changing
3879789.
3880Which of the following object is the highest-level object in the browser object hierarchy?
3881Ans Javascript Window object
3882790.
3883Let R be a relation. Which of the following comments about the relation R are correct?
3884791.
3885The resources needed for communication between end systems are reserved for the
3886duration of session between end systems in
3887Ans Circuit Switching
3888792.
3889The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer
3890a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable. The
3891minimum number of times the DMA controller needs to get the control of the system bus from the
3892processor to transfer the file from the disk to main memory is
3893AnsSize of data count register of the DMA controller = 16 bits
3894Data that can be transferred in one go = 216 bytes = 64 kilobytes
3895File size to be transferred = 29154 kilobytes
3896So, number of times the DMA controller needs to get the control of the system bus from the
3897processor to transfer the file from the disk to main memory = ceil(29154/64) = 456
3898793.
3899Linked list are not suitable data structure of which one of the following problems ?
3900Ans: Binary Search(Because it will take O(n/2) time to find the middle element)
3901794.
3902What is the output of following JavaScript code?
3903Ans 2
3904795.
3905Changing the conceptual schema without having to change physical schema is
3906Ans Data Independence
3907796.
3908________ extracts the DML statements from a host language and passes to DML Compiler
3909Ans Precompiler
3910797.
3911What is the output of following JavaScript code?
3912Ans 16
3913798.
3914Which of the following is useful in implementing quick sort?
3915Ans Stacks
3916799.
3917Which of the following raid levels provides maximum usable disk space?
3918Ans Raid 0
3919800.
3920Which one of the following fields of an IP header is NOT modified by a typical IP router?
3921Ans Source Address
3922801.
3923What are the states of the Auxiliary Carry (AC) and Carry Flag (CF) after executing the following
39248085 program? MVI H, 5DH; MIV L, 6BH; MOV A, H; ADD LAns AC=1 CY 0
3925802.
3926Which of the following object represents the HTML document loaded into a browser
3927window?
3928Ans Window object
3929803.
3930What is the result of the following operation Top (Push (S, X))
3931Ans X
3932804.
3933These networking classes encapsulate the "socket" paradigm pioneered in the (BSD) Give the
3934abbreviation of BSD?
3935Ans Berkeley Software Distribution
3936805.
3937Truncate is _________ command
3938Ans DDL
3939806.
3940In a priority queue insertion and deletion takes place at
3941Ans Any Position
3942807.
3943A transaction is permanently saved in the hard disk only after giving
3944Ans COMMIT Command
3945808.
3946The performance of cache memory is frequently measured in terms of a quantity called
3947Ans Hit Ratio
3948809.
3949If message in Segmentation and Reassembly (SAR) sub layer of Application Adaptation
3950Layer 3/4 has value of Segment type is 11 then it is called a
3951Ans Single segmented Message
3952810.
3953What is the output of following JavaScript code?
3954811.
3955When does the top value of stack changes?
3956Ans Before Insertion
3957812.
3958Digital signature envelope is decrypted by using _________.
3959Ans Symmetric key
3960813.
3961What is mean by "this" keyword in javascript?Ans In JavaScript, the thing called this, is the object that "owns" the JavaScript code. The value
3962of this, when used in a function, is the object that "owns" the function. The value of this, when
3963used in an object, is the object itself. The this keyword in an object constructor does not have a
3964value.
3965814.
3966DMA is useful for the operations
3967Ans DMA is useful for transferring data between memory and devices if large volume of data is to
3968be transferred, or the devices have small response times.
3969815.
3970The data manipulation language (DML)
3971816.
3972If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the
3973maximum number of hosts per subnet?
3974Ans 2046
3975817.
3976int unknown(int n) {
3977int i, j, k = 0;
3978for (i
3979= n/2; i <= n; i++)
3980for (j = 2; j <= n; j = j * 2)
3981k = k + n/2;
3982return k;
3983}
3984818.
3985Math. round(-20.5)=?
3986Ans 21
3987819.
3988Computers use addressing mode techniques for _____________________.
3989Ans : A. giving programming versatility to the user by providing facilities as pointers to memory
3990counters for loop control
3991B. to reduce no. of bits in the field of instruction
3992C. specifying rules for modifying or interpreting address field of the instruction
3993Ans ALL ABC
3994820.
3995An advantage of the database approach is
3996Ans The advantages in the database approach are as follows:
3997are using the same database; hence, any report using the
3998information will not be inconsistent.the database occurs once only and is protected by the security measures.
3999fast by using the logic of the data structures.
4000821.
4001Which of the following is not characteristics of a relational database model
4002822.
4003The maximum number of binary trees that can be formed with three unlabeled nodes is:
40045
4005823.
4006A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32
4007Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory
4008entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit. The
4009size of the cache tag directory is
401016
4011824.
4012Which built-in method sorts the elements of an array
4013Sort()
4014825.
4015In ................... Mode, the authentication header is inserted immediately after the IP
4016header.
4017Tunnel
4018826.
4019Assume that source S and destination D are connected through two intermediate routers
4020labeled R. Determine how many times each packet hasto visit the network layer and the
4021data link layer during a transmission from S to D.
4022network layer -4 times, data link layer-6times827.
4023The minimum duration of the active low interrupt pulse for being sensed without being lost must
4024be
4025one machine cycle
4026828.
4027Microsoft SQL Server is an example for which OLAP Server?
4028Specialized SQL servers
4029829.
4030Which built-in method returns the length of the string?
4031length()
4032830.
4033Trace the output of the following code?
4034#include
4035using namespace std;
4036int main()
4037{
4038int x=15,y=27;
4039x = y++ + x++;
4040y = ++y + ++x;
4041cout<<x+y++<<++x+y;
4042return 0;
4043}</x+y++<<++x+y;
4044116,116
4045831.
4046Which of the following is not a stored procedure?
4047832.
4048Determine the output of the following code?
4049#include
4050using namespace std;
4051class one
4052{
4053int a;
4054static int b;
4055public:
4056void initialize();
4057void print();
4058static void print_S();
4059};
4060int one::b = 0;
4061void one::initialize()
4062{
4063a = 10;
4064b ++;
4065}
4066void one::print()
4067{cout<<a;
4068cout<<b;
4069}
4070void one::print_S()
4071{
4072cout<<b;
4073}
4074int main()
4075{
4076one o;
4077o.initialize();
4078o.print();
4079o.print_S();
4080return 0;
4081}
4082</b;
4083</b;
4084</a;
40851011
4086833.
4087Which of the following statements is FALSE regarding a bridge
4088Bridge reduces broadcast domain
4089834.
4090How many 8-bit characters can be transmitted per second over a 9600 baud serial
4091communication link using asynchronous mode of transmission with one start bit, eight data bits,
4092two stop bits, and one parity bit?
4093800
4094835.
4095Which of the following function of Array object calls a function for
4096each element in the array?
4097forEach()
4098836.
4099Consider the following pseudo code fragment:
4100printf (“Hello”);
4101if(!fork( ))
4102printf(“World”);
4103Which of the following is the output of the code fragment?
4104837.
4105Congestion control and quality of service is qualities of the
4106frame relay
4107838.
4108Which one of these is characteristic of RAID 5?
4109Distributed parity
4110839.A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect
4111block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and
4112the size of each disk block address is 8 Bytes. The maximum possible file size in this file system
4113in KBytes is
411435 Kbytes
4115840.
4116Dynamic web page
4117generates on demand by a program or a request from browser
4118841.
4119Identify the correct sequence in which the following packets are transmitted on the network
4120by a host when a browser requests a webpage from a remote server, assuming that the host
4121has just been restarted.
4122DNS query, TCP SYN, HTTP GET request
4123842.
4124Generally Dynamic RAM is used as main memory in a computer system as it______.
4125has higher speed
4126843.
4127Which one of the following statements is false?
4128844.
4129Which of the following is not a function of a DBA?
4130Network maintenance
4131845.
4132What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note
4133that the first parameter is passed by reference, whereas the second parameter is passed by
4134value.
4135int f (int &x, int c) {
4136c=c-1;
4137if (c-0) return 1;
4138x=x+1;
4139return f (x,c)*x;}
4140846.
4141Uniform Resource Locator (URL), is a standard for specifying any kind of information on the
4142internet
4143847.
4144Which one of the following is a cryptographic protocol used to secure HTTP connection?
4145transport layer security (TSL)
4146848.
4147If a virtual memory system has 4 pages in real memory and the rest must be swapped to disk.
4148Which of the following is the hit ratio for the following page address stream. Assume memory
4149starts empty, use the FIFO algorithm
415031%849.
4151Consider a relation R (A, B). If A ¿ B is a trivial functional dependency and A is the super key for
4152R, then what is the maximum normal form R can be in?
4153BCNF
4154850.
4155What is the unique characteristic of RAID 6 (Choose one)?
4156Two independent distributed parity
4157851.
4158An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an
4159IPpacket of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant
4160fields in the header of the third IP fragment generated by the router for this packet are
4161MF bit: 0, Datagram Length: 1444; Offset: 370
4162852.
4163What will be the values of x, m and n after the execution of the following statements?
4164int x, m, n;
4165m = 10;
4166n = 15;
4167x = ++m + n++;
416826 11 16
4169853.
4170What is the code to be used to trim whitespaces ?
4171let trimmed = (l.trim() for (l in lines));
4172854.
4173Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11,92,
417410. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63,
4175moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from
41760 to 199. The total head movement (in number of cylinders) incurred while servicing these
4177requests is
4178165
4179855.
4180What’s the output of the following code?
4181var city = new Array("delhi", "agra", "akot", "aligarh");
4182city.push('palampur');
4183document.write(city);
4184["delhi", "agra", "akot", "aligarh", "palampur"]
4185856.
4186RAID is a way to:
4187combining several independent and relatively small disks into a single storage of a large size
4188857.
4189If the offset of the operand is stored in one of the index registers, then it is
4190is indexed addressing mode
4191858.What happens when a pointer is deleted twice?
4192it can cause a trap
4193859.
4194The local host and the remote host are defined using IP addresses. To define the
4195processes, we need second identifiers called
4196port addressess
4197860.
4198Consider the following relation
4199Cinema (theater, address, capacity)
4200Which of the following options will be needed at the end of the SQL query
4201SELECT P1. address
4202FROM Cinema P1
4203Such that it always finds the addresses of theaters with maximum capacity?
4204WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)
4205861.
4206Which of the following are sufficient conditions for deadlock?
4207mutual exclusion
4208b) a process may hold allocated resources while awaiting assignment of other resources
4209c) no resource can be forcibly removed from a process holding it
4210d) all of the mentioned
4211Answer-All of the mentioned
4212862.
4213One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the
4214following statements best explains the need for this field?
4215It can be used to prevent packet looping
4216863.
4217Which of the following type casts will convert an Integer variable named amount to a Double
4218type?
4219(double) amount
4220864.
4221Assume that a table R with 1000 records is to be joined with another table S with
422210000 records. What is the maximum number of records that would result in if we
4223join R with S and the equi-join attribute of S is the primary key?
42241000
4225865.
4226UDP uses........ to handle outgoing user datagrams from multiple processes on one host.
4227multiplexing
4228866.
4229When an instruction is read from the memory, it is called
4230instruction cycle (sometimes called a fetch–decode–execute cycle)
4231867.What should be used to point to a static class member?
4232Normal pointer
4233868.
4234The ‘$’ present in the RegExp object is called a
4235metacharacter
4236869.
4237Which of the following is a disadvantage of file processing system?
4238(I) Efficiency of high level programming,
4239(II) Data Isolation
4240(III) Integrity issues
4241(IV) Storing of records as files
4242870.
4243Foreign key is a subset of primary key is stated in _____________ constraint
4244871.
4245The ......... protocol defines a set of messages sent over either User Datagram Protocol (UDP)
4246port53 or Transmission Control Protocol(TCP) port53.
4247DNS
4248872.
4249Consider the following statement containing regular expressions
4250var text = "testing: 1, 2, 3";
4251var pattern = /\d+/g;
4252In order to check if the pattern matches, the statement is
4253pattern.test(text)
4254873.
4255Which two RAID types use parity for data protection?
4256RAID 4, RAID 5
4257874.
4258Which cause a compiler error?
4259875.
4260The regular expression to match any one character, not between the brackets is
4261[^...]
4262876.
4263Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ
4264>, and sends it to Y, where it is d
4265ecrypted. Which one of the following sequences of keys is used for the operations?
4266Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key
4267followed by X’s public key877.
4268Which of the following relational algebra operations do not require the participating tables to be
4269union-compatible?
4270JOIN
4271878.
4272Which of the following scan() statements is true?
4273879.
4274A process executes the code
4275fork();
4276fork();
4277fork();
4278The total number of child process created is
42797
4280880.
4281A variable P is called pointer if
4282P contains the address of an element in DATA.
4283881.
4284Suppose that everyone in a group of N people wants to communicate secretly with N-1
4285others using symmetric key cryptographic system. The communication between any two
4286persons should not be decodable by the others in the group. The number of keys required
4287in the system as a whole to satisfy the confidentiality requirement is
4288N(N – 1)/2
4289882.
4290Which of the following statement on the view concept in SQL is invalid?
4291The definition of a view should not have GROUP BY clause in it.
4292883.
4293A 20-bit address bus allows access to a memory of capacity
42941Mb
4295884.
4296What does /[^(]* regular expression indicate ?
4297Match zero or more characters that are not open paranthesis
4298885.
4299A RAM chip has a capacity of 1024 words of 8 bits each (1K*8). The number of 2*4 decoders
4300with enable line needed to construct a 16K*6 RAM from 1K*8 RAM is
43015
4302886.
4303A layer -4 firewall (a device that can look at all protocol headers up to the transport layer)
4304CANNOTblock HTTP traffic during 9:00PM and 5:00AM
4305887.
4306The function scanf() reads
4307Multiple characters
4308888.
4309In SQL, testing whether a subquery is empty is done using
4310EXISTS
4311889.
4312What will be the result when non greedy repetition is used on the pattern /a+?b/ ?
4313Matches the letter b preceded by the fewest number of a’s possible
4314890.
4315DMA is useful for the operations
4316DMA is useful for transferring large quantities of data between memory and devices. It eliminates
4317the need for the CPU to be involved in the transfer, allowing the transfer to complete more
4318quickly and the CPU to perform other tasks concurrently
4319891.
4320main() is an example of
4321892.
4322What does the subexpression /java(script)?/ result in ?
4323It matches “java” followed by the optional “script”
4324893.
4325Which of the following is not a characteristic of a relational database model?
4326treelike structure
4327894.
4328Which type of error detection uses binary division?
4329Cyclic Redundancy Check (CRC)
4330895.
4331When a network interface has a failure in its circuitry, it sends a continuous stream of frames
4332causing the Ethernet LAN to enter a Collapse state. This condition is known as __________.
4333Jabbering
4334896.
4335An identifier in C
4336897.
4337A RAM chip has a capacity of 1024 words of 8 bits each (1K*8). The number of 2*4 decoders
4338with enable line needed to construct a 16K*6 RAM from 1K*8 RAM is
43395
4340898.
4341Given the basic ER and relational models, which of the following is INCORRECT?In a row of a relational table, an attribute can have more than one value
4342899.
4343What is the most essential purpose of parantheses in regular expressions ?
4344Define subpatterns within the complete pattern
4345900.
4346Which of the following are sufficient conditions for deadlock?
43475. mutual exclusion
4348The resources involved must be unshareable; otherwise, the processes would not
4349be prevented from using the resource when necessary.
43506. hold and wait or partial allocation
4351The processes must hold the resources they have already been allocated while
4352waiting for other (requested) resources. If the process had to release its resources
4353when a new resource or resources were requested, deadlock could not occur
4354because the process would not prevent others from using resources that it
4355controlled.
43567. no pre-emption
4357The processes must not have resources taken away while that resource is being
4358used. Otherwise, deadlock could not occur since the operating system could simply
4359take enough resources from running processes to enable any process to finish.
43608. resource waiting or circular wait
4361901.
4362The method that performs the search-and-replace operation to strings for pattern matching is
4363a) searchandreplace()
4364b) add()
4365c) edit()
4366d) replace()
4367902.
4368Which of the following is TRUE?
4369903.
4370A variable whose size is determined at compile time and cannot be changed at run time is
4371A. Static Variable
4372B. Dynamic Variable
4373C. Not a variable
4374D. None of These
4375904.
4376Value of checksum must be recalculated regardless ofa) De-fragmentation
4377b) Fragmentation
4378c) Transfer
4379d) Size
4380905.A union that has no constructor can be initialized with another union of __________ type
4381A. different
4382B. same
4383C. virtual
4384D. class
4385906.
4386Dotted-decimal notation of 10000001 00001011 00001011 11101111 would be
4387A. 193.131.27.255
4388B. 129.11.11.239
4389C. 192.168.10.9
4390D. 172.16.11.3
4391907.
4392Memory mapped displays
4393Uses ordinary memory to store the display data in character form
4394908.
4395What would be the result of the following statement in JavaScript using regular
4396expression methods ?
4397a) Returns [“123′′”456′′”789”].
4398b) Returns [“123′′,”456′′,”789”].
4399c) Returns [1,2,3,4,5,6,7,8,9].
4400d) Throws an exception
4401909.
4402Which one of the following statements if FALSE?910.
4403Consider the following code snippet. What purpose does exec() solve in the above code ?
4404var pattern = /Java/g;
4405var text = "JavaScript is more fun than Java!";
4406var result;
4407while ((result = pattern.exec(text)) != null)
4408{
4409alert("Matched '" + result[0] + "'" +" at position " + result.index +"; ne
4410xt search begins at " + pattern.lastIndex);
4411}
4412a) Returns the same kind of array whether or not the regular expression has the
4413global g flag
4414b) Returns different arrays in the different turns of iterations
4415c) All of the mentioned
4416d) None of the mentioned
4417911.
4418Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If
4419the computer system has a one-level page table per process and each page table entry requires
442048 bits, then the size of the per-process page table is __________ megabytes.
4421(A) 384
4422(B) 48
4423(C) 192
4424(D) 96
4425912.
4426Structured programming involves
4427A. decentralisation of program activity
4428B. functional modularisation
4429C. localisation of errors
4430D. All of the above
4431E. None of the above
4432913.
4433Which one of the following allows a user at one site to establish a connection to another
4434site and then pass keystrokes from local host to remote host?
4435a) HTTP
4436b) FTPc) Telnet
4437d) None of the mentioned
4438914.
4439Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are
4440two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2
4441do not have any attributes of their own. What is the minimum number of tables required to
4442represent this situation in the relational model?
4443(a) 2
4444(b) 3
4445(c) 4
4446(d) 5
4447915.
4448Which function among the following lets to register a function to be invoked once?
4449a) setTimeout()
4450b) setTotaltime()
4451c) setInterval()
4452d) none of the mentioned
4453916.
4454Select operation in SQL is equivalent to
4455(A) the selection operation in relational algebra
4456(B) the selection operation in relational algebra, except that select in SQL retains duplicates
4457(C) the projection operation in relational algebra
4458(D) the projection operation in relational algebra, except that select in SQL retains
4459duplicates
4460917.
4461By default, any real number in C is treated as
4462A. A float
4463B. A double
4464C. A long double
4465D. Depend upon memory model that you are using
4466918.
4467These networking classes encapsulate the "socket" paradigm pioneered in the (BSD) Give
4468the abbreviation of BSD?A) Berkeley Software Distribution
4469B) Berkeley Socket Distribution
4470C) Berkeley System Distribution
4471D) None of the above
4472919.
4473. For computers based on three - address instruction formats, each address field can be used to
4474specify which of the following:
4475S1: A memory operand
4476S2: A processor register
4477S3: An implied accumulator registers
4478(A) Either S1 or S2
4479(B) Either S2 or S3
4480(C) Only S2 and S3
4481(D) All of S1, S2 and S3
4482920.
4483Integer division in a C program results in
4484A. Truncation
4485B. Rounding
4486C. Underflow
4487D. None of these
4488921.
4489Which function among the following lets to register a function to be invoked repeatedly after a
4490certain time?
4491a) setTimeout()
4492b) setTotaltime()
4493c) setInterval()
4494d) none of the mentioned
4495922.
4496Grant and revoke are ....... statements
4497DCL Commands – Data Control Language
4498923.
4499The minimum number of page frames that must be allocated to a running process in a virtual
4500memory environment is determined by
4501a) the instruction set architecture
4502b) page sizec) physical memory size
4503d) number of processes in memory
4504924.
4505Which is the handler method used to invoke when uncaught JavaScript exceptions occur?
4506a) Onhalt
4507b) Onerror
4508c) Both onhalt and onerror
4509d) None of the mentioned
4510View Answer
4511925.
4512For C• Programming language
4513926.
4514The processed S/MIME along with security related data is called as ________.
4515a. public key cryptography standard.
4516b. private key cryptography standard.
4517c. S/MIME.
4518d. MIME.
4519927. .......... command can be used to modify a column in a table
4520Answer: ALTER
4521928.
4522The function f(x) = ab + a can be simplified as
4523Answer: a
4524929.
4525Consider the C function given below.
4526int f(int j)
4527{
4528static int i = 50;
4529int k;
4530if (i == j)
4531{
4532printf(?something?);
4533k = f(i);
4534return 0;
4535}
4536else return 0;
4537}
4538Which one of the following is TRUE?
4539(A) The function returns 0 for all values of j.(B) The function prints the string something for all values of j.
4540(C) The function returns 0 when j = 50.
4541(D) The function will exhaust the runtime stack or run into an infinite loop when j = 50
4542930.Which property is used to obtain browser vendor and version information?
4543a) modal
4544b) version
4545c) browser
4546d) navigator
4547931.
4548___________ Substitution is a process that accepts 48 bits from the XOR operation.
4549a. S-box.
4550b. P-box.
4551c. Expansion permutations.
4552d. Key transformation.
4553932.
4554The number of squares in K-map of n-variables is 2^n
4555933.
4556Data independence means
4557It means we change the physical storage/level without affecting the conceptual or external
4558view of the data.
4559934.
4560In ................... Mode, the authentication header is inserted immediately after the IP
4561header.
4562A) Tunnel
4563B) Transport
4564C) Authentication
4565D) Both A and B
4566935.
4567The output of combinational circuit depends on t he levels present at input
4568terminals.
4569936.
4570Which method receives the return value of setInterval() to cancel future
4571invocations?
4572a) clearInvocation()
4573b) cancelInvocation()
4574c) clearInterval()
4575d) None of the mentioned937.
4576DCL stands for DATA CONTROL LANGUAGE
4577938.
45786. Consider the below code fragment:
4579if(fork k( ) = = 0)
4580{
4581a= a+5; printf(?%d, %d \n?, a, &a);
4582}
4583else
4584{
4585a= a ? 5;
4586printf(?%d %d \n?, 0, &a);
4587}
4588Let u, v be the values printed by parent process and x, y be the values printed by child process.
4589Which one of the following is true?
4590(A) u = x + 10 and v = y
4591(B) u = x + 10 and v != y
4592(C) u + 10 = x and v = y
4593(D) u + 10 = x and v != y
4594939.
4595_________ uniquely identifies the MIME entities uniquely with reference to multiple
4596contexts.
4597a. Content description.
4598b. Content -id.
4599c. Content type.
4600d. Content transfer encoding.
4601940.
4602...................... is preferred method for enforcing data integrity
4603A) Constraints
4604B) Stored procedure
4605C) Triggers
4606D) Cursors
4607941.
4608Find the output of the following program?
4609#include
4610using namespace std;
4611typedef int * IntPtr;
4612int main()
4613{
4614IntPtr A, B, C;int D,E;
4615A = new int(3);
4616B = new int(6);
4617C = new int(9);
4618D = 10;
4619E = 20;
4620*A = *B;
4621B = &E;
4622D = (*B)++;
4623*C= (*A)++ * (*B)--;
4624E= *C++ - *B--;
4625cout<<*A<<*B<<*C<<d<<e;
4626return 0;
4627}</d<<e;
4628942.
4629The setTimeout() belongs to which object?
4630a) Element
4631b) Window
4632c) Location
4633d) None of the mentioned
4634943.
4635Which of the folloiwng is fully functional ?
4636944.
4637Which one of the following is a cryptographic protocol used to secure HTTP connection?
4638a) stream control transmission protocol (SCTP)
4639b) transport layer security (TSL)
4640c) explicit congestion notification (ECN)
4641d) resource reservation protocol
4642945.
4643The alpahbet are represented in which format inside the computer?
4644Answer: Binary/ASCII
4645946.
4646Which method receives the return value of setTimeout() to cancel future invocations?
4647a) clearTimeout()
4648b) clearInterval()
4649c) clearSchedule()
4650d) none of the mentioned
4651947.
4652Which of the following is not a binary operator in relational algebra?
4653A) Join
4654B) Semi-Join
4655C) Assignment
4656D) Project948.
4657The library function exit() causes an exit from
4658a) the loop in which it occurs
4659(b) the block is which it occurs
4660(c) the functions in which it occurs
4661(d) the progam in which it occurs
4662949.
4663Which of the following statement is correct about destructors?
4664A). A destructor has void return type.
4665B). A destructor has integer return type.
4666C). A destructor has no return type.
4667D). A destructors return type is always same as that of main().
4668950.
4669------------- is a mode of operation for a block cipher, with the characteristic that each possible
4670block of plaintext has a defined corresponding ciphertext value and vice versa.
4671Answer: Electronic Code Book
4672951.
4673What will happen if we call setTimeout() with a time of 0 ms?
4674In short, setTimeout(someFunc, 0) will run someFunc 0ms after the current executing
4675functions has finished running.
4676952.
4677Which of the following is/are not a DDL statements?
4678a) UPDATE
4679b) TRUNCATE
4680c) ALTER
4681d) None of the Mentioned
4682Explanation: Data definition language (DDL) commands enable you to perform the following
4683tasks:Create, alter, and drop schema objects.
4684953.
4685The number of bits to represent 128 sets in direct mapped cache is 7 bits
4686954.To which object does the location property belong?
4687a) Window
4688b) Position
4689c) Element
4690d) Location
4691955. Which database level is closest to the users?
4692A. External
4693B. Internal
4694C. Physical
4695D. Conceptual
4696956.
4697The interrupts are serviced using which of the following
4698Answer: Interrupt Service Routine
4699957.
4700A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no
4701repeaters. The signal speed in the cable is 2 x 10 8 m/sec. The minimum frame size for this network
4702should be
4703(A) 10000 bits
4704(B) 10000 bytes
4705(C) 5000 bits
4706(D) 5000 bytes
4707958. Java package is a grouping mechanism with the purpose of
4708Answer: encapsulate a group of classes
4709959. What is the data structure used for executing interrupt service subroutine ?
4710960.
47111. What will be printed as the output of the following program?
4712public class testincr
4713{
4714public static void main(String args[])
4715{
4716int i = 0;
4717i = i++ + i;
4718System.out.println(" I = " +i);
4719}
4720}
4721(a) I = 0
4722(b) I = 1
4723(c) I = 2
4724(d) I = 3
4725961......... data type can store unstructured data
4726A. RAW
4727B. CHAR
4728C. NUMERIC
4729D. VARCHAR
4730962.
4731What is the result of the following code snippet?
4732window.location === document.location
4733a) False
4734b) True
4735c) 0
4736d) 1
4737963.
4738What is the access point (AP) in wireless LAN?
4739a) device that allows wireless devices to connect to a wired network
4740b) wireless devices itself
4741c) both (a) and (b)
4742d) none of the mentioned
4743964.
4744Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?
4745a) CDMA
4746b) CSMA/CA – Carrier Service Multiple Access with Collision Avoidance
4747c) ALOHA
4748d) None of the mentioned
4749965.
4750The output in sequential circuit depends on which of the folloiwng?
4751Answer: Present and past inputs
4752966. A table can have only one PRIMARY KEY
4753967.
4754To prevent any method from overriding, the method has to declared as, FINAL
4755968.
4756* In which part does the form validation should occur?a) Client
4757b) Server
4758c) Both Client and Server
4759d) None of the mentioned
4760969.How to find the index of a particular string?
4761a.position()
4762b.index()
4763c.indexOf()
4764d.Noneofthementioned
4765Explanation : The indexOf() function can be used to find out the index of a particular
4766character or a string.
4767970.
4768The power consumed by full adder can be reduced by using which of the following?
4769971.
4770What is the output of the following program:
4771public class testmeth
4772{
4773static int i = 1;
4774public static void main(String args[])
4775{
4776System.out.println(i+” , “);
4777m(i);
4778System.out.println(i);
4779}
4780public void m(int i)
4781{
4782i += 2;
4783}
4784}
4785a) 1 , 3
4786b) 3 , 1
4787c) 1 , 1
4788d) 1 , 0
4789e) none of the above.
4790972.
4791-------------------module of the DBMS controls access to DBMS information that is stored
4792on disk, whether it is part of the database or the catalog
4793Answer: Data Manager Module (Higher Level Stored)
4794973.A 20 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs the "go
4795back n ARQ" scheme with n set to 10. Assuming that each frame is 100 bytes long, what is the
4796maximum data rate possible?
4797A. 5 Kbps
4798B. 10 Kbps
4799C. 15 Kbps
4800D. 20 Kbps
4801974.
4802Which of the following is the child object of the JavaScript navigator?
4803a.Navicat
4804b.Plugins
4805c.NetRight
4806d. None of the mentioned
4807Explanation : The JavaScript navigator object includes a child object called plugins.
4808975.
4809A wireless network interface controller can work in
4810a) infrastructure mode
4811b) ad-hoc mode
4812c) both (a) and (b)
4813d) none of the mentioned
4814Explanation: In infrastructure mode WNIC needs access point but in ad-hoc mode access
4815point is not required.
4816976.
4817Given the code
4818String s1 = “ VIT” ;
4819String s2 = “ VIT “ ;
4820String s3 = new String ( s1);
4821Which of the following would equate to true?
4822(A) s1 == s2
4823(B) s1 = s2
4824(C) s3 == s1
4825(D) s1.equals(s2)
4826(E) s3.equals(s1)
4827a) (A), (D) & (E)
4828b) (A), (C) & (E)
4829c) (A), (B) & (C)d) (C), (D) & (E)
4830e) (D) & (E)
4831Explanation: s1==s2 is indeed “true” since they point to the same instance of “VIT” as
4832they are “ not ” declared with the new String(“VIT”) function.
4833977.
4834The number of distinct symbols in radix-r is
4835Answer: r
4836Explanation: A number system of radix r uses a string consisting of r distinct symbols
4837to represent a value.
4838978. ---PRECOMPILER---- component of DBMS extracts DML commands from an
4839application program written in a host programming language
4840979.
4841Which one of the following event is not possible in wireless LAN.
4842a) collision detection
4843b) acknowledgement of data frames
4844c) multi-mode data transmission
4845d) none of the mentioned
4846980.
4847Which of the following are the properties of a plug-in entry?
4848a) name
4849b) filename
4850c) mimeTypes
4851d) all of the mentioned
4852Each plug-in has an entry in the array. Each entry has the following properties:
4853ï‚·
4854ï‚·
4855ï‚·
4856ï‚·
4857name – is the name of the plug-in.
4858filename – is the executable file that was loaded to install the plug-in.
4859description – is a description of the plug-in, supplied by the developer.
4860mimeTypes – is an array with one entry for each MIME type supported by the plug-in
4861981.
4862The runtime database processor of DBMS executes-----QUERY CODE------
4863982.
4864What is the sequence of major events in the life of an applet?Answer:
4865i) loading the applet
4866ii) leaving and returning to the applet’s page
4867iii) reloading the applet
4868iv)quitting the browser
4869983.
4870Can a system have multiple DMA controllers?
4871Answer: True ??
4872984.
4873Which of the following events will cause a thread to die?
4874Which of the following events will cause a thread to die?
4875ANSWER : D
4876985.
4877What is Wired Equivalent Privacy (WEP) ?
4878a) security algorithm for ethernet
4879b) security algorithm for wireless networks
4880c) security algorithm for usb communication
4881d) none of the mentioned
4882986.
4883A relation R(A,B,C,D,E,H) has the following functional dependencies
4884F= {{A→BC},{CD→E},{E→C}, {D→AEH}, {ABH→BD}, {DH→BC}}.
4885Find the Normal form of the relation
4886987.
4887What is the number of maxterms in a function of n variables?
4888Answer: The number of possible max terms posiible for n variable : 2^n
4889The number of possible min terms posiible for n variable : 2^n
4890988.What is the purpose of the mimeTypes property of a plug-in entry?a. Contains MIME properties
4891b. Contains MIME sizes
4892c. Contains MIME types
4893d. None of the mentioned
4894Answer : c
4895989. A method within a class is only accessible by classes that are defined within the same
4896package as the class of the method. Which one of the following is used to enforce such
4897restriction?
4898(a) Declare the method with the keyword public
4899(b) Declare the method with the keyword private
4900(c) Declare the method with the keyword protected
4901(d) Do not declare the method with any accessibility modifiers
4902(e) Declare the method with the keyword public and private
4903Reason: The desired accessibility is package accessibility, which is the default accessibility
4904for members that have no accessibility modifier. Package is not an accessibility modifier.
4905990.
4906How many output lines are present in an encoder with 2^n input lines?
4907ANSWER: n
4908991.
4909------DENSE-------index has an entry for every search key value (and
4910hence every record) in the data file
4911992.
4912A subset of a network that includes all the routers but contains no loops is called:
4913a) spanning tree
4914b) spider structure
4915c) spider tree
4916d) none of the mentioned
4917Answer: a
4918993.
4919AJAX has become very commonly used because
4920a) It allows pages to be interactive without further communication with the server.b) Xml is a close relative of html.
4921c) It avoids the need for javascript.
4922d) It allows page content to be updated without requiring a full page reload .
4923994.
4924If link transmits 4000 frames per second, and each slot has 8 bits,the transmission rate
4925of circuit this TDM is
4926a) 32kbps
4927b) 500bps
4928c) 500kbps
4929d) None of the mentioned
4930995.
4931Consider the following code.
4932static void nPrint(String message, int n) {
4933while (n > 0) {
4934System.out.print(message);
4935n--;
4936}
4937}
4938What is the printout of the call nPrint('a', 4)?
4939(a)
4940(b)
4941(c)
4942(d)
4943aaaaa
4944aaaa
4945aaa
4946aa
4947(e) invalid call.
4948Reason :
4949Invalid call because char 'a' cannot be passed to string message
4950996.
4951Which flip flop has the characterstic function Q(next) = input
4952997.
4953More than one transaction can apply this lock on X for reading its value but no write
4954lock can be applied on X by any other transaction. What is that lock?
4955Two-Phase Locking Techniques: Essential components
4956More than one transaction can apply share lock on X forits value but no write lock can be applied on X by any
4957other transaction.
4958998.
4959Which of the following is not a reason XML gained popularity as a data interchange format for
4960AJAX?
4961a) It has been around a while and libraries exist for many languages to work with it
4962b) It can be navigated using JavaScript DOM methods.
4963c) It is extensible, allowing it to be adapted to virtually any application.
4964d) It is concise and simple to use.
4965999.
4966The performance of cache memories is measured by
4967Answer: hit ratio
49681000.
4969Lock manager uses -----LOCK TABLE--------- to store the identify of transaction locking a data
4970item, the data item, lock mode and pointer to the next data item locked.
49711001.
4972Which one of the following allows a user at one site to establish a connection to another
4973site and then pass keystrokes from local host to remote host?
4974a) HTTP
4975b) FTP
4976c) Telnet
4977d) None of the mentioned
49781002.
4979Which method must be defined by a class implementing the java.lang.Runnable
4980interface?
4981Answer: public void run()
49821003.
4983The jQuery AJAX methods .get(), .post(), and .ajax() all require which parameter to be supplied?
4984a) method
4985b) url
4986c) data
4987d) headers
49881004.
4989If an AJAX request made using jQuery fails,
49901. the browser will automatically report the problem with an alert message.
49912.
4992an error message will be displayed in the browser window content area.3.
4993the programmer should arrange for it to be reported using the
4994jQuery .fail() method.
49954.
4996there is no way to notify the user.
49971005.
4998class X implements Runnable
4999{
5000public static void main(String args[])
5001{
5002/* Missing code? */
5003}
5004public void run() {}
5005}
5006Which of the following line of code is suitable to start a thread ?
5007A.
5008Thread t = new Thread(X);
5009B. Thread t = new Thread(X); t.start();
5010C. X run = new X(); Thread t = new Thread(run); t.start();
5011D. Thread t = new Thread(); x.run();
5012Answer: Option C
50131006.
5014-----AGGREGATE FUNCTION--------is used to summarize information
5015from multiple tuples into a single-tuple summary
50161007.In negative edge triggered flip flop, the transitions happen at
50171008.The probability that a single bit will be in error on a typical public telephone line using 4800
5018bps modem is 10 to the power -3. If no error detection mechanism is used, the residual error rate
5019for a communication line using 9-bit frames is approximately equal to
5020[A]. 0.003
5021[B]. 0.009
5022[C]. 0.991
5023[D]. 0.999
5024[E].
5025None of the above1009.
5026In ER- Relational Mapping, Binary 1:1 Relationship types are mapped to
5027----------
50281010.
5029Which method is used to call the base class methods from the subclass?
5030super
50311011.
5032Nested documents in the HTML can be done using
50331012.
5034The race condition in RS flip flop is rectified in which flip flop
5035Master Slave JK Flip Flop
50361013.
5037Frames from one LAN can be transmitted to another LAN via the device
5038Bridge
50391014.
5040A new web browser window can be opened using which method of the Window object ?
5041createtab()
5042b. Window.open()
5043c. open()
5044d. All of the mentioned
50451015.
5046Answer the following question based on the given table.
5047Package Name Class Name
5048Lab.project.util Date, Time
5049Lab.project.game Car, Puzzle
5050What will be the access modifier if a method in Date class is inherited in the Puzzle class?
50511016.
5052You are working with a network that is 172.16.0.0 and would like to support 600 hosts per
5053subnet. What subnet mask should you use?
5054255.255.252.0 (/10)
50551017.--------------contains information such as the structure of each file, the type and storage
5056format of each data item, and various constraints on the data
5057DBMS Catalog
50581018.
5059What does the command XCHG in 8085 do?
5060Exchange H and L with D and E. The contents of register H are exchanged with the
5061contents of register D, and the contents of register L are exchanged with the
5062contents of register E.
50631019.
5064Which of the following digits are known as the sub-address digits (for use by the user) of the
5065Network User Address (NUA)?
50665-7
5067[B]. 1-4
5068[C]. 8-12
5069[D]. 13-14
50701020.
5071What statement is used to execute stored procedure in Java JDBC
5072CallableStatement cstmt = null;
5073try {
5074String SQL = "{call getEmpName (?, ?)}";
5075cstmt = conn.prepareCall (SQL);
5076. . .
5077}
5078catch (SQLException e) {
5079. . .
5080}
5081finally {
5082. . .
50831021.
5084Which object serves as the global object at the top of the scope chain?
5085a) Hash
5086b) Property
5087c) Element
5088d) WindowAnswer: d
5089Explanation: The Window object serves as the global object at the top of the scope chain
5090in client-side JavaScript.
50911022.
5092If the opearand of stack operation is register, the stack contents in 8085 store which of the
5093following?
50941023.
5095Who is responsible for correlating the different perspectives of distinct users?
50961024. A modulator converts a _____ signal to a(n) _____ signal.
5097A. FSK; PSK
5098B. PSK; FSK
5099C. analog; digital
5100D. digital; analog
5101E. None of the above
51021025.
5103In 8085 subtraction is performed using which method?
5104Answer: by the 2's complement method
51051026.
5106Data Model that provides ad-hoc queries is --------------
51071027.
5108Consider following code.
5109public class Test {
5110public static void main(String[] args) {
5111System.out.println(m(2));
5112}
5113public static int m(int num) {
5114return num;
5115}
5116public static void m(int num) {
5117System.out.println(num);
5118}
5119}
5120(a) The program has a syntax error because the two methods
5121m have the same signature(b) The program has a syntax error because the second m method is
5122defined, but not invoked in the main method
5123(c) The program runs and prints 2 once
5124(d) The program runs and prints 2 twice
5125(e) The program runs and prints 2 thrice.
51261028.
5127What does the location property represent?
5128a) Current DOM object
5129b) Current URL
5130c) Both DOM object and URL
5131d) None of the mentioned
51321029.
5133Which among the following is not a property of the Location object?
5134a) protocol
5135b) host
5136c) hostee
5137d) hostname
5138Explanation: The various properties of the location object are the protocol, host,
5139hostname, port, search, and hash.
51401030.
5141What is the number of distinct symbols in base-16 ?
5142Answer: 16
51431031.
5144What is the loopback address?
5145Answer: type of IP address that is used to test the communication or transportation medium
5146on a local network card and/or for testing network applications. Special ip address 127.0.0.1
51471032.
5148A state that refers to the database when it is loaded is---- Initial Database State -----
51491033.
5150Consider the following code:
5151public class Test {
5152public static void main(String[] args) {
5153int[] x = new int[5];
5154int i;
5155for (i = 0; i < x.length; i++)
5156x[i] = i;
5157System.out.println(x[i]);}
5158}
5159(a)
5160(b)
5161(c)
5162(d)
5163(e)
5164The program displays 0 1 2 3 4
5165The program displays 4
5166The program has a runtime error because the last statement in the main
5167method causes ArrayIndexOutOfBoundsException
5168The program has syntax error because i is not defined in the last
5169statement in the main method
5170The program displays 1 2 3 4 5.
51711034.
5172How many bits are present in registers A, B, C together in 8085?
5173Answer: 24 – ( 3 x 8 )
51741035.
5175What is the return type of the hash property?
5176The hash property sets or returns the anchor part of a URL
51771036.
5178------------------ is used to describe the structure and constraints for the whole database for a
5179community of users hides the details of physical storage structures in three -schema architecture
51801037.
5181A 4 KHz noise less channel with one sample ever 125 per sec is used to transmit digital signals.
5182Differential PCM with 4 bit relative signal value is used. Then how many bits per second are
5183actually sent?
5184A. 32 Kbps
5185B. 64 Kbps
5186C. 8 Kbps
5187D. 128 Kbps.
51881038.
5189What will be the value of c at the end of execution?
5190public static void main(String args[])
5191{ int a = 10, b = 2,c=0,d=0;
5192int[] A = {1,2,3};
5193try { c=a/b;
5194try { d = a/(a-a); d= A[1]+1; }
5195catch(ArrayIndexOutOfBoundsException e){
5196System.out.println("Array - unreachable element "+e); }
5197Finally { System.out.println("Finally block inside "); } }
5198catch(Exception e)
5199{ System.out.println("Some Problem:"+e); b = 1; c = a/b; }
5200finally
5201{ System.out.println("Finally block outside“) }
5202System.out.println("after try/catch blocks");
5203System.out.println("Ans = " +c); }
5204ERROR two
52051039.
5206What does the instruction INX H perform in 8085 microprocessor?
5207Increment register pair by 1.
5208Eg: INX H (It means the location pointed by the HL pair is incremented by 1)
52091040.
5210Which is the method that removes the current document from the browsing history before loading
5211the new document?
5212a) modify()
5213b) assign()
5214c) replace()
5215d) remove()
52161041.
5217Which method is used for loading the driver in Java JDBC.
5218Answer: . Class.forName()
52191042.
5220What is the minimum number of wires required for sending data over a serial communications
5221links?
5222A. 1
5223B. 2 (answer)
5224C. 4
5225D. 6
52261043. --------EXTERNAL SCHEMA--------describes the the part of the database that a particular
5227user group is interested in and hides the rest.
52281044.
5229Which one is the first high level programming language1045.
5230The 8255 chip is an example of
52311046.
5232------------ is used to define internal schema
52331047.
5234Why is the replace() method better than the assign() method?
52351048.
5236In cyclic redundancy checking, the divisor is _____ the CRC.
5237A) The same size as
5238B) one bit less than
5239C) one bit more than
5240D) none of the above
52411049.
5242Centralized DBMS has----------
5243A centralized database (sometimes abbreviated CDB) is a database that is located,
5244stored, and maintained in a single location.
52451050.
5246What is 8254 used for?
5247The Intel 8253 and 8254 are Programmable Interval Timers (PITs), which perform
5248timing and counting functions using three 16-bit counters.
52491051.
5250An error-detecting code inserted as a field in a block of data to be transmitted is known as
5251A. Frame check sequence
5252B. Error detecting code
5253C. Checksum
5254D. flow control
5255E. None of the above
52561052.When a class extends the Thread class ,it should override ............ method of Thread class
5257to start that thread.
5258A. start()
5259B. run()
5260C. init()
5261D. go()1053.What is the purpose of the assign() method?
5262a) Only loading
5263b) Loading of window and display
5264c) Displays already present window
5265d) Unloading of window
5266The assign() method of the Location object makes the window load and display the document at
5267the URL you specify.
52681054.
5269Which two are valid constructors for Thread?
5270a.) Thread(Runnable r, String name)
5271b.) Thread()
5272c.) Thread(int priority)
5273d.) Thread(Runnable r, ThreadGroup g)
5274e.) Thread(Runnable r, int priority)
5275A. 1 and 3
5276B. 2 and 4
5277C. 1 and 2
5278D. 2 and 5
52791055.
5280Working of the WAN generally involves
5281A. telephone lines
5282B. microwaves
5283C. satellites
5284D. All of the above
52851056.
5286How many modes are present in 8255 and what are they?
52871. Bit Set/Reset mode (BSR mode).
52882. Input/Output mode (I/O mode). –
5289ï‚·
5290ï‚·
5291ï‚·
5292Mode 0 - Simple I/O
5293Mode 1 - Strobed I/O
5294Mode 2 - Strobed Bi-directional I/O
52951057.
5296The history property belongs to which object?
5297a) Element
5298b) Window
5299c) History
5300d) LocationExplanation: The history property of the Window object refers to the History object for the
5301window.
53021058.
5303An Employee entity of a company database can be a SECRETARY, TECHNICIAN or
5304MANAGER.
5305What kind of participation constraint can be used for Employee and its job types?
53061059.
5307public class MyRunnable implements Runnable
5308{
5309public void run()
5310{
5311// some code here
5312}
5313}
5314which of these will create and start this thread?
5315[A]. new Runnable(MyRunnable).start();
5316[B]. new Thread(MyRunnable).run();
5317[C]. new Thread(new MyRunnable()).start();
5318[D]. new MyRunnable().start();
53191060.
5320If you configure the TCP/IP address and other TCP/IP parameters manually, you can always
5321verify the configuration through which of the following? Select the best answer.
5322A.
5323Network Properties dialog box
5324B. Server Services dialog box
5325C. DHCPINFO command-line utility
5326D. Advanced Properties tab of TCP/ IP Info.
5327E. None of the above
53281061.
5329Which of the following is one of the fundamental features of JavaScript?
5330a) Single-threaded
5331b) Multi-threaded
5332c) Both Single-threaded and Multi-threaded
5333d) None of the mentioned
5334Explanation: One of the fundamental features of client-side JavaScript is that it is single-
5335threaded: a browser will never run two event handlers at the same time, and it will never
5336trigger a timer while an event handler is running, for example.1062.If we can determine exactly those entities that will become members of each subclass by a
5337condition then such subclasses are called------
5338predicate-defined --------
53391063.
5340Which of the following is DMA controller?
53411064.
5342Given the code
5343String s1 = ? VIT? ;
5344String s2 = ? VIT ? ;
5345String s3 = new String ( s1);
5346Which of the following would equate to true?
5347(A) s1 == s2
5348(B) s1 = s2
5349(C) s3 == s1
5350(D) s1.equals(s2)
5351(E) s3.equals(s1)
5352a) (A), (D) & (E)
5353b)
5354c)
5355d)
5356e)
5357(A), (C) & (E)
5358(A), (B) & (C)
5359(C), (D) & (E)
5360(D) & (E)
53611065.
5362The expected size of the join result divided by the maximum size is called
5363_________________.
53641066.
5365Four bits are used for packet sequence numbering in a sliding window protocol used in a
5366computer network. What is the maximum window size?
5367(a) 4
5368(b) 15
5369(c) 8
5370(d) 16.
53711067.
5372OOPs
5373Find the output of the following program?
5374#include
5375#define pow(x) (x)*(x)*(x)using namespace std;
5376int main()
5377{
5378int a=3,b=3;
5379a=pow(b++)/b++;
5380cout<<a<<b;
5381return 0;
5382}
5383Answer: 107
53841068.
5385How many gate delays are present in efficient implementation of XOR gate ?
53861069.
5387.
5388The attributes in foreign key and primary key have the same ____________.
53891070.
5390What is the output of the following program?
5391#include
5392using namespace std;
5393int main()
5394{
5395int x=20;
5396if(!(!x)&&x)
5397cout<<x;
5398else
5399{
5400x=10;
5401cout<<x;
5402return 0;
5403}}
5404Answer: 20
54051071.
5406What is the correct HTML for making a hyperlink?
5407<a href=”link”> text</a>
54081072.
5409Error control is needed at the transport layer because of potential errors occurring _____.
5410A. from transmission line noise
5411B. in routers
5412C. from out-of-sequence delivery
5413D. from packet losses.
54141073.
5415How many possible outcome values are present in boolean algebra?
5416Answer: 21074.
5417Determine the output of the following code?
5418#include
5419using namespace std;
5420void func_a(int *k)
5421{
5422*k += 20;
5423}
5424void func_b(int *x)
5425{
5426int m=*x,*n = &m;
5427*n+=10;
5428}
5429int main()
5430{
5431int var = 25,*varp=&var;
5432func_a(varp);
5433*varp += 10;
5434func_b(varp);
5435cout<<var<<*varp;
5436return 0;
5437}
5438Answer: 5555
54391075.
5440Data link layer retransmits the damaged frames in most networks. If the probability of a frame's
5441being damaged is p, what is the mean number of transmissions required to send a frame if
5442acknowledgements are never lost.
5443A. K / K - P
5444B. 1 / K - P
5445C. K / K(1 + p)
5446D. p / K + 1
54471076.
5448___ Naïve or parametric end users __ users work on canned transactions
54491077.
5450Which of the following input controls that cannot be placed using
54511078.
5452What does JSP stand for?
5453Answer: Java Server Pages
54541079.
5455tag?What will be the output of the following program?
5456#include
5457using namespace std;
5458class x {
5459public:
5460int a;
5461x();
5462};
5463x::x() { a=10; cout<
5464class b:public x {
5465public:
5466b();
5467};
5468b::b() { a=20; cout<
5469int main ()
5470{
5471b temp;
5472return 0;
5473}
5474Answer: 10 20
54751080.
5476If a hospital has to store the description of each visit of a patient according to date what
5477attribute you will use in the patient entity type?
5478Answer: Composite
54791081.
5480The SQL statement SELECT SUBSTR('123456789', INSTR('abcabcabc','b'), 4)
5481FROM EMP; prints
5482The SQL statement
5483SELECT SUBSTR('123456789', INSTR('abcabcabc', 'b'), 4) FROM DUAL;
5484A. 6789
5485B. 2345
5486C. 1234
5487D. 456789
54881082.
5489Find the output of the following program?
5490#includeusing namespace std;
5491void myFunction(int& x, int* y, int* z) {
5492static int temp=1;
5493temp += (temp + temp) - 1;
5494x += *(y++ + *z)+ temp - ++temp;
5495*y=x;
5496x=temp;
5497*z= x;
5498cout<<x<<*y<<*z<<temp;
5499}
5500int main() {
5501int i = 0;
5502int j[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
5503i=i++ - ++i;
5504myFunction(i, j, &i);
5505return 0;
5506}
5507Answer: 3-333/ 3425379433
55081083.
5509__ SELECTORS __ is used to define a special CSS style for a group of HTML elements
55101084.
5511In HTTP, which method gets the resource as specified in the URI - GET
55121085.
5513JAVA PROGRAMMING
5514Java package is a grouping mechanism with the purpose of
55151086.
5516In SQL, which command is used to issue
5517multiple CREATE TABLE, CREATE VIEW and GRANT statements in a single
5518transaction?
5519a) CREATE PACKAGE
5520b) CREATE SCHEMA
5521c) CREATE CLUSTER
5522d) All of the mentioned
55231087.
5524Which of the following is the right syntax for assertion?
5525Create assertion ‘assertion-name’ check ‘predicate’;
55261088.
5527Which of these is Server side technology?
55281089.
5529Which one of these lists contains only Java programming language keywords
5530A.
5531class, if, void, long, Int, continueB. goto, instanceof, native, finally, default, throws
5532C. try, virtual, throw, final, volatile, transient
5533D. strictfp, constant, super, implements, do
5534E. byte, break, assert, switch, include
5535Answer: Option B
55361090.
5537. __ FLASH MEMORY ________ is increasingly being used in server systems to
5538improve performance by caching frequently used data, since it provides faster access
5539than disk, with larger storage capacity than main memory.
55401091.
5541Which of these interface abstractes the output of messages from httpd?
5542a) LogMessage
5543b) LogResponse
5544c) Httpdserver
5545d) httpdResponse
55461092.
5547The C++ language is
55481093.
5549Passing the request from one schema to another in DBMS architecture is called as
5550_______ MAPPING ______
55511094.
5552Where in an HTML document is the correct place to refer to an external style sheet?
5553Answer: In the <head> section
55541095.
5555Changing the conceptual schema without having to change the external schema is called as
5556______LOGICAL INDEPENDENCE__________
55571096.
5558Which method is used to remove the first element of an Array object?
5559Answer: Shift
55601097.
5561What does the following bit of JavaScript print out?
5562var a = [1,,3,4,5];
5563console.log([a[4], a[1], a[5]]);
5564Output - 5,null,indefined
55651098.
5566Creating a B Tree index for your database has to specify in _____.a. DDL
5567b. SDL
5568c. VDL
5569d. TCL
55701099.
5571Which one of the following statements is NOT correct about HTTP cookies?
5572A. A cookie is a piece of code that has the potential to compromise the
5573security of an Internet user
5574B. A cookie gains entry to the user's work area through an HTTP header
5575C. A cookie has an expiry date and time
5576D. Cookies can be used to track the browsing pattern of a user at a particular site
55771100.
5578The following HTML attribute is used to specify the URL of the html document to be opened
5579when a hyperlink is clicked.
5580Answer: HREF
55811101.
5582HTTP is implemented over - TCP
55831102.
5584If the directive session.cookie_lifetime is set to 3600, the cookie will live until..
5585a) 3600 sec
5586b) 3600 min
5587c) 3600 hrs
5588d) the browser is restarted
55891103.
5590AJAX made popular by
5591Option
5592Option
5593Option
5594Option
5595A):Sun Micro system
5596B):Google
5597C):IBM
5598D):Microsoft
55991104.
5600How to create a Date object in JavaScript?
5601dateObjectName = new Date([parameters])
56021105.
5603Output------?
56041106.
5605Choose the correct HTML tag to make a text italicAnswer: <i></i>
56061107.
5607table {color: blue;}
5608With the above code snippet in use, what happens to a table?
5609a) The table border would be colored blue.
5610b) The table background would be colored blue.
5611c) The text inside the table would be colored blue
56121108.
5613What sever support AJAX ?
56141109.
5615What does the XMLHttpRequest object accomplish in Ajax?
5616A.It's the programming language used to develop Ajax applications
5617B.It provides a means of exchanging structured data between the Web server and
5618client.
5619C.It provides the ability to asynchronously exchange data
5620between Web browsers and a Web server.
5621D.It provides the ability to mark up and style the display of Web-page text.
56221110.
5623Which Web browser is the least optimized for Microsoft's version of AJAX?
5624SAFARI
56251111.
5626Which one of these technologies is NOT used in AJAX?
5627A. CSS
5628B. DOM
5629C. DHTML
5630D. Flash
56311112.
5632When a user views a page containing a JavaScript program, which machine actually executes
5633the script?
5634The User’s machine running the web browser
56351113.
5636A graphical HTML browser resident at a network client machine Q accesses a static HTML
5637webpage from a HTTP server S. The static HTML page has exactly one static embedded image
5638which is also at S. Assuming no caching, which one of the following is correct about the HTML
5639webpage loading (including the embedded image)?(A) Q needs to send at least 2 HTTP requests to S, each necessarily in a separate TCP
5640connection to server S
5641(B) Q needs to send at least 2 HTTP requests to S, but a single TCP connection
5642to server S is sufficient
5643(C) A single HTTP request from Q to S is sufficient, and a single TCP connection
5644between Q and S is necessary for this
5645(D) A single HTTP request from Q to S is sufficient, and this is possible without any
5646TCP connection between Q and S
56471114.
5648How does servlet differ from CGI?
5649Servlets are thread based and CGI is process based
5650Servlet is light weight.
56511115.
5652What does JSP stand for?
5653Java Server Pages
56541116.
5655Which of these is a stand alone tag?
5656<img> <br>
5657Standalone tags are used for elements which have no logical beginning or end.
5658One example of a standalone tag is the br tag,
56591117.
5660If you don’t want the frame windows to be resizeable, simply add what to the lines ?
5661noresize
56621118.
5663<a> and </a> are the tags used for ?
5664Adding links to your pag