dw9FsNma

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 Addressing
368.
37Which of the following is not true of virtual memory?
38Ans: It requires the use of a disk or other secondary storage.( Actually it does not
39require).
409.
41General Purpose Software which creates and manipulates database is
42Answer : DBMS
4310.
44The _____ is generally used to group hosts based on the physical network topology.
45Answer: Hub/Switch
4611.
47Identify the item that is not taken into account in computing the current ratio
4812.
49#include
50int main ()
51{
52static int a[]={10, 20, 30, 40, 50};
53static int *p[]= {a, a+3, a+4, a+1, a+2};
54int **ptr=p;
55ptr++;
56printf ("%d%d", **p, **ptr);
57}
58The output of the program is ___
59Answer: 10 40
6013.
61What will be the output of the following C program?
62void count(int n){
63static int d=1;
64printf("%d ", n);
65printf("%d ", d);
66d++;
67if(n>1) count(n-1);
68printf("%d ", d);
69}
70void main(){
71count(3);
72}
73Output : 3 1 2 2 1 3 4 4 4
7414.
75Which of the following are generally the inventories of a service business?
76Answer:
7715.
78The load instruction is mostly used to designate a transfer from memory to a
79processor register known as
80Answer: Accumulator
8116.
82With a single resource, deadlock occurs,
83a) if there are more than two processes competing for that resource
84b) if there are only two processes competing for that resource
85c) if there is a single process competing for that resource
86d) None of these
87Answer: Deadlock Doesnot occour with a single resource
8817.
89System catalogue is a system created database that describes
9018.
91______ operate at the network layer, connecting two or more network segments that use the
92same or different data link layer protocols, but the same network layer protocol.
93Answer: Router
9419.
95Which of the following is an advantage of using database systems?
96Answer: Data can be accessed by multiple programs
9720.
98User Datagram Protocol adds no additional reliability mechanisms except one which is optional.
99Identify that.
100Answer: Checksum
10121.
102Which of the following groups of workers would be classified under indirect labour?
10322.
104Mutual exclusion problem occurs between
105Two disjoint process that do not interact
106- Process sharing same resources
107- Process not sharing same resources
108- None of these
10923.
110Simplified form of the boolean expression (X + Y + XY) (X + Z) is
111Answer : X+YZ
11224.
113Consider the following program:
114int f(int *p, int n)
115{
116if (n <= 1) return 0;
117else return max ( f (p+1, n-1),p[0]-p[1]);
118}
119int main()
120{
121int a[] = {3,5,2,6,4};
122printf("%d", f(a,5));
123}
124The value printed by this program is
125Answer: 3 (i.e. 5-2=3 or the maximum difference between any two consecutive numbers
126taken from left to right)
12725.
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 ______
16234.
163The truth table
164X Y f(X,Y)
1650 0 0
1660 1 0
1671 0 1
1681 1 1
169represents the Boolean function
170Answer: X
17135.
172______ OS pays more attention on the meeting of the time limits.
173Answer: Real Time
17436.
175Consider the following C program.
176#include
177int f1 (void) ;
178int f 2 void ;
179int x 10;
180int main ()
181{
182int x=1;
183x+=f1()+ f2()+f3()+f2() ;
184printf("%d", x);
185return 0;
186}
187int f1(){int x=25; x++; return x;}
188int f2(){static int x =50; x++;return x;}
189int f3(){x*=10; return x};
190The output of the program is_________.
191Answer: 230
19237.
193Consider the function func shown below:
194int func(int num) {
195int count = 0;
196while (num) {
197count++;
198num>>= 1;
199}
200return (count);
201}
202The value returned by func(435)is
203Answer: 9
20438.
205Budgetary control facilitates easy introduction of the _________________
20639.
207The father of relational database system is
208Answer: Edgar Frank "Ted" Codd
20940.
210The performance of cache memory is frequently measured in terms of a quantity called
211Answer: Hit Ratio
21241.
213An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available
214with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization
215A, and a quarter to Organization B, while retaining the remaining with itself. Which of the
216following is a valid allocation of address to A and B?
217(A) 245.248.136.0/21 and 245.248.128.0/22
218(B) 245.248.128.0/21 and 245.248.128.0/22
219(C) 245.248.132.0/22 and 245.248.132.0/21
220(D) 245.248.136.0/22 and 245.248.132.0/21
22142.
222Using 10's complement 72532- 3250 is
223Answer: 69282
22443.
225What is the RDBMS terminology for a row
226Answer: Tuple
22744.
228A current ratio of less than one means
229Answer: Liabilities are Greater than assets
23045.
231Consider the following C program segment.
232#include
233intmain()
234{char sl [7]="1234",*p;
235p=sl+2;
236*p='0';
237printf ("%s",sl)
238{
239What will be printed by the program?
240Answer: 1204
24146.
242The 16-bit 2?s complement representation of an integer is 1111 1111 1111 0101, its decimal
243representation is
244Answer : -11
24547.
246Which of the following is/are example(s) of stateful application layer protocols?
247(i)HTTP
248(ii)FTP
249(iii)TCP
250(iv)POP3
251Answer: (ii) & (iv)
25248.
253What is the software that runs a computer, including scheduling tasks, managing storage, and
254handling communication with peripherals?
255Answer: Operating System
25649.
257Budgetary control system acts as a friend, philosopher and guide to the ____________
258Management
259Share holders
260Creditors
261Employees
26250.
263Which of the following is not usually stored in a two-level page table?
26451.
265Consider the following recursive C function.
266Void get (int n)
267{if (n<1) return;
268get (n-1)
269get (n-3) ;
270printf ("%d",n);
271If get(6) function is being called in main () then how many times will the get() function be invoked
272before returning to the main ( ) ?
273Answer : 25
27452.
275A circuit that converts n inputs to 2^n outputs is called
276Answer : Decoder
27753.
278The relationship that exists within the same entity type is called as _________
279relationship.
280Answer: Recursive
28154.
282TCP manages a point-to-point and _______ connection for an application between two
283computers.
284Answer : Reliable
28555.
286Decoder is a
287Answer: decoder is a combinational logic circuit that converts binary information from
288the n coded inputs to a maximum of 2n unique outputs
28956.
290What is the maximum number of IP addresses that can be assigned to hosts on a local subnet
291that uses the 255.255.255.224 subnet mask?
292Answer: 30
29357.
294The purpose of a TLB is
295Answer: A translation lookaside buffer (TLB) is a memory cache that stores
296recent translations of virtual memory to physical addresses for faster
297retrieval
29858.
299#include
300int main ()
301{
302static int a[]={10, 20, 30 40, 50};
303static int *p[]= {a, a+3, a+4, a+1, a+2};
304int **ptr=p;
305ptr++;
306printf ("%d%d", ptr p, **ptr);
307}
308The output of the program is ________10 40__.
30959.
310The total cost that increases when the quantity produced is increased by one unit is called
311____________
312Ans: Marginal Cost
31360.
314Normalisation of database is used to
315to reduce data redundancy and improve data integrity
31661.
317Consider the following program in C language:
318#include
319main()
320{
321int i;
322int *pi = &i;
323scanf(?%d?,pi);
324printf(?%d\n?, i+5);
325}
326It prints the value by incrementing it by 5
327Which one of the following statements is TRUE?
32862.
329What is the RDBMS terminology for a set of legal values that an attribute can have ?
330Answer: Domain
331Degree – Numver of columns
332Cardinality – Number of rows
33363.
334The _____ is generally used to group hosts based on the physical network topology.
335Answer : Hub/Switch
33664.
337To build a mod-19 counter the number of flip-flops required is
338Answer : 5
33965.
340Fixed budget is useless for comparison when the level of activity is ___________
34166.
342System calls:
343A system call is a way by which a program/process requests services of operating
344system (kernel). And a priviledged instructions in an instruction that can be
345performed only in kernel/supervisor mode.
34667.
347Which of the following is not an activity listed in the statement of cash flows?
34868.
349The smallest integer than can be represented by an 8-bit number in 2?s complement form is
350Answer: -128
35169.
352What is the main difference between traps and interrupts?
353Answer: Trap is a software generated interrupt.
35470.
355ATM uses a ____ packet size
356Answer : 53 Octets 5 Header + 48 Payload
35771.
358Which of the following concurrency control mechanisms insist unlocking of all read and write
359locks of transactions at the end of commit?
36072.
361Consider the following C program.
362#include
363int f1 (void) ;
364int f 2 void ;
365int x 10;
366int main ()
367{
368int x=1;
369x+=f1()+ f2()+f3()+f2() ;
370printf("%d", x);
371return 0;
372}
373int f1(){int x=25; x++; return x;}
374int f2(){static int x =50; x++;return x;}
375int f3(){x*=10; return x};
376The output of the program is_____230____.
37773.
378Class D in network is used for
379Answer: Multicasting
38074.
381What is the RDBMS technology for the number of attributes in a relation?
382Answer : Degree
38375.
384All factory costs are treated as _______ while all administration costs are treated as
385________
38676.
3871024 bit is equal to how many byte
388Answer : 128
38977.
390Buffering is useful because
391The buffer allows each device or process to operate without being held up by the other.
39278.
393Consider the following C code segment:
394int a, b, c = 0;
395void prtFun(void);
396main( )
397{ static int a = 1; /* Line 1 */
398prtFun( );
399a + = 1;
400prtFun( )
401printf(?\n %d %d ?, a, b);
402}
403void prtFun(void)
404{ static int a=2; /* Line 2 */
405int b=1;
406a+=++b;
407printf(?\n %d %d ?, a, b);
408}
409What output will be generated by the given code segment if:
410Line 1 is replaced by auto int a = 1;
411Line 2 is replaced by register int a = 2;
412ANSWER: (A) 3 1
4134 1
4144 2
415(B) 4 2
4166 1
4176 1
418(C) 4 2
4196 2
4202 0
421(D) 4 2
4224 2
4232 0
42479.
425Consider the following program:
426int f(int *p, int n)
427{
428if (n <= 1) return 0;
429else return max ( f (p+1, n-1),p[0]-p[1]);
430}
431int main()
432{
433int a[] = {3,5,2,6,4};
434printf("%d", f(a,5));
435}
436The value printed by this program is
437ANSWER : 3
43880.
439_______RELATIONAL/CONCEPTUAL_____is the first schema to be designed
440when you are developing a DBMS
44181.
442Adjacent squares in a K-Map represents a
443ANSWER: A group is a loose term for the enclosure containing adjacent square.
44482.
445If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the
446service provided is for
447Answer: Higher Priority
44883.
449An area of a business which collects costs is known as __________
45084.
451What will be the output of the following program?
452#include
453using namespace std;
454class x {
455public:
456int a;
457x();
458};
459x::x() { a=10; cout<
460class b:public x {
461public:
462b();
463};
464b::b() { a=20; cout<
465int main ()
466{
467b temp;
468return 0;
469}
470Answer: 10 20
47185.
472An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of
473processes is ________.
474Answer: Shortest Job First
47586.
476Minterms are arranged in map in a sequence of
477Answer: Gray Code
47887.
479Which one of the following variables is not categorical?
480Answer : Age of a person
48188.
482Suppose that everyone in a group of N people wants to communicate secretly with N-1 others
483using symmetric key cryptographic system. The communication between any two persons should
484not be decodable by the others in the group. The number of keys required in the system as a
485whole to satisfy the confidentiality requirement is
486(A) 2N
487(B) N(N – 1)
488(C) N(N – 1)/2
489(D) (N – 1)2
49089.
491The servlet life cycle has the following cycle.
4921. Servlet class is loaded.
4932. Servlet instance is created.
4943. init method is invoked.
4954. service method is invoked.
4965. destroy method is invoked.
49790.
498In the IPv4 addressing format, the number of networks allowed under Class C addresses is
499Answer: 2,097,152 (221)
50091.
501What is data collection?
502Answer: Data collection is the process of gathering and measuring information on
503targeted variables in an established systematic fashion, which then enables one to
504answer relevant questions and evaluate outcomes.
50592.
506When a program tries to access a page that is mapped in address space but not loaded in
507physical memory, then
508Answer: Page fault occours
50993.
510The main difference between JK and RS flip-flop is that
511The main difference between a JK flip-flop and an SR flip-flop is that in the JK flipflop,
512both inputs can be HIGH. When both the J and K inputs are HIGH, the Q
513output is toggled, which means that the output alternates between HIGH and LOW.
514Thereby the invalid condition which occurs in the SR flipflop is eliminated.
51594.
516SQl allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in
517the result of joins. Which one of the following queries always gives the same answer as the
518nested query shown below:
519select * from R where a in (select S.a from S)
520A) Select R.* from R, S where R.a=S.a
521(B) Select distinct R.* from R, S where R.a=S.a
522(C) Select R.* from R, (select distinct a from S) as S1 where R.a=S1.a
523(D) Select R.* from R, S where R.a = S.a and is unique R
52495.
525Which algorithm chooses the page that has not been used for the longest period of time
526whenever the page required to be replaced?
527Answer: Least Recently Used(LRU)
52896.
529Which of the following unit will choose to transform decimal number to binary code ?
530A.Encoder
531B. Decoder
532C. Multiplexer
533D.Counter
53497.
535Given the following schema:employees(emp-id, first-name, last-name, hire-date,dept-id,
536salary)departments(dept-id, dept-name, manager-id, location-id)
537You want to display the last names and hire dates of all latest hires in their respective
538departments in the location ID 1700. You issue the following query:SQL>SELECT last-name,
539hire-date
540FROM employees
541WHERE (dept-id, hire-date) IN
542(SELECT dept-id, MAX(hire-date)
543FROM employees JOIN departments USING(dept-id)
544WHERE location-id = 1700
545GROUP BY dept-id);
546What is the outcome?
547(A) It executes but does not give the correct result.
548(B) It executes and gives the correct result.
549(C) It generates an error because of pairwise comparison.
550(D) It generates an error because the GROUP BY clause cannot be used with table joins
551in a subquery
55298.
553The schedule used to measure a respondent’s opinion is ________
55499.
555The following function computes the maximum value contained in an integer array
556p[ ] of size n (n >= 1).
557int max(int *p, int n) {
558int a=0, b=n-1;
559while (__________) {
560if (p[a] <= p[b]) { a = a+1; }
561else { b = b-1; }
562}
563return p[a];
564}
565The missing loop condition is
566Answer: b!=a
567100.
568ICMP is primarily used for
569Answer: Error and diagnostics
570101.
571List of all the units of the population is called _____________
572102.
573TCP manages a point-to-point and _______ connection for an application between two
574computers
575Answer: Reliable
576103.
577The best index for exact match query is
578104.
579The embedded c program is converted by cross compiler to
580Answer: Machine Language
581105.
582How many address bits are needed to select all memory locations in the 16K × 1 RAM?
583[A]. 8
584[B]. 10
585[C]. 14
586[D]. 16
587106.
588Which of the following boolean expressions is not logically equivalent to all of the rest ?
589(a) wxy' + wz' + wxyz + wy'z
590(b) w(x + y' + z')
591(c) w + x + y' + z'
592(d) wx + wy' + wz'
593107.
594If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative
595mapping. Then each word of cache memory shall be_____.
596a) 11 bits
597b) 21 bits
598c) 16 bits
599d) 20 bits
600108.
601The best sample is one that is ____________
602109.
603What is the output of the following program?
604#include
605using namespace std;
606int main()
607{
608int x=20;
609if(!(!x)&&x)
610cout<<x;
611else
612{
613x=10;
614cout<<x;
615return 0;
616}}</x;
617</x;
618Answer: 20
619110.
620Assume a table Employee (Eno, Ename, Dept, Salary, Phone) with 10000 records.
621Also assume that Employee has a non-clustering index on Salary, clustering indexes on Dept
622and Phone. If there is a SQL query "SELECT Eno FROM Employee WHERE Salary/12 = 10000",
623which of the following will happen during query execution?
624Answer: Search/Selection?
625111.
626Which of the following statements is true ?
627112. Which standard TCP port is assigned for contacting SSH servers?
628a) port 21
629b) port 22
630c) port 23
631d) port 24
632113.
633Consider the following schema as:
634Product_Master (prod_id, prod_name, rate)
635Purchase_details (prod_id, quantity, dept_no, purchase_date).
636Choose the suitable relational algebra expressionn for Get Product_id, Product_name & quantity
637for all purchased products
638114.
639When an instruction is read from the memory, it is called
640Answer: Instruction cycle (Also called Fetch-Decode-Execute Cycle)
641115.
642______________ research deals with practical problems
643116.
644Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The
645round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The
646time taken (in msec) by the TCP connection to get back to 32 KB congestion window is
647(A) 1100 to 1300
648(B) 800 to 1000
649(C) 1400 to 1600
650(D) 1500 to 1700
651Explanation: Given that at the time of Time Out, Congestion Window Size
652is 32KB32KB and RTT = 100ms100ms,
653 When Time Out occurs, for the next round of Slow Start,
654Threshold = size of congestion window2size of congestion window2 ,
655Threshold = 16KB
656Suppose we have a slow start ==>> 2KB∣4KB∣8KB∣16KB2KB∣4KB∣8KB∣16KB (As
657the threshold is reached, Additive increase
658starts) ∣18KB∣20KB∣22KB∣24KB∣26KB∣28KB∣30KB∣32KB∣18KB∣20KB∣22KB∣24K
659B∣26KB∣28KB∣30KB∣32KB
660Here | (vertical line) is representing RTT so the total number of vertical lines
661is 11∗100ms11∗100ms==>> 1100msec1100msec and so this is the answer...
662117.
663Consider the following function written the C programming language.
664void foo (char * a ) {
665if (* a & & * a ! =' ' ){
666putchar (*a);
667}
668}
669}
670The output of the above function on input ?ABCD EFGH? Is
671Actual gate Question: Consider the following function written in the C
672programming langauge :
673void foo(char *a)
674{
675 if (*a && *a != ' ')
676 {
677 foo(a+1);
678 putchar(*a);
679 }
680}
681The output of the above function on input "ABCD EFGH" is
682A. ABCD EFGH
683B. ABCD
684C. HGFE DCBA
685D.DCBA
686118.
687The minimum number of NAND gates required to implement the Boolean function.
688A + AB' + AB'C is equal to
689A. 0 (Zero)
690B. 1
691C. 4
692D. 7
693Explanation: A(1+B'+B'C) which is equal To A
694 So No need For any NAND gate
695119.The 16 bit flag of 8086 microprocessor is responsible to indicate ___________
696A. the condition of result of ALU operation
697B. the condition of memory
698C. the result of addition
699D. the result of subtraction
700120. Creating a B Tree index for your database has to specify in _____.
701
702 a. DDL
703 b. SDL
704 c. VDL
705 d. TCL
706121.UDP has a smaller overhead then TCP, especially when the total size of the messages is
707Answer: SMALL
708122.
709A solution to the Dining Philosopher?s problem which avoids Deadlock can be:
710A. ensure that all philosophers pick up the left fork before the right fork
711B. ensure that all philosophers pick up the right fork before the left fork
712C. ensure that one particular philosopher picks up the left fork before
713the right fork, and that all other philosophers pick up the right fork
714before the left fork
715D. None of the above
716Answer: C
717123.
718Plan of study of a researcher is called the __________
719124.
720For a C program accessing X[i][j][k], the following intermediate code is generated by a compiler.
721Assume that the size of an integer is 32 bits and the size of a character is 8 bits.
722t0 = i * 1024
723t1 = j * 32
724t2 = k * 4
725t3 = t1 + t0
726t4 = t3 + t2
727t5 = X[t4]
728Which one of the following statements about the source code for the C program is CORRECT?
729A. X is declared as "int X[32] [32] [8]”.
730B. X is declared as "int X[4] [1024] [32]”.
731C. X is declared as "char X[4] [32] [8]”.
732D. X is declared as "char X[32] [16] [2]”.
733Answer: A
734125.Which of the following are used to generate a message digest by the network security
735protocols?
736(P) RSA (Q) SHA-1 (R) DES (S) MD5
737(A) P and R only
738(B) Q and R only
739(C) Q and S only
740(D) R and S only
741Answer :C
742Explanation:
743 RSA – It is an algorithm used to encrypt and decrypt messages.
744 SHA 1 – Secure Hash Algorithm 1, or SHA 1 is a cryptographic hash function. It
745produces a 160 bit (20 byte) hash value (message digest).
746 DES – Data Encryption Standard, or DES is a symmetric key algorithm for
747encryptionof electronic data.
748 MD5 – Message Digest 5, or MD5 is a widely used cryptographic hash function that
749produces a 128 bit hash value (message digest).
750126.The data manipulation language used in SQL is a,
751(I) Procedural DML
752(II) Non-Procedural DML
753(III) Modification DML
754(IV) Declarative DML
755Answer : Procedural and Declarative
756127.
757A variable that is presumed to cause a change in another variable is called a/an _____________
758a. categorical variable
759b. dependent variable
760c. independent variable
761d. intervening variable
762Intervening Variable: An intervening variable (sometimes called a mediating variable) is a
763hypothetical variable used to explain causal links between other variables. Intervening
764variables cannot be observed in an experiment (that's why they are hypothetical).
765128.
766The 16-bit 2?s complement representation of an integer is 1111 1111 1111 0101, its decimal
767representation is
768Answer : -11
769129.
770The OS of a computer may periodically collect all the free memory space to form contiguous
771block of free space. This is called
772A. Concatenation
773B. Garbage collection
774C. Collision
775D. Dynamic Memory Allocation
776130.
777public class MyRunnable implements Runnable
778{
779public void run()
780{
781// some code here
782}
783}
784which of these will create and start this thread?
785[A]. new Runnable(MyRunnable).start();
786[B]. new Thread(MyRunnable).run();
787[C]. new Thread(new MyRunnable()).start();
788[D]. new MyRunnable().start();
789131.
790A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
791page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
792maximum size of the page table of a process is 24 megabytes, the length of the virtual address
793supported by the system is _________ bits.
794(A) 36
795(B) 32
796(C) 28
797(D) 40
798Explanation: A page table entry has following number of bits.
7991 (valid bit) +
8001 (dirty bit) +
8013 (permission bits) +
802x bits to store physical address space of a page.
803Value of x = (Total bits in physical address) -
804 (Total bits for addressing within a page)
805Since size of a page is 8 kilobytes, total bits needed within
806a page is 13.
807So value of x = 32 - 13 = 19
808Putting value of x, we get size of a page table entry =
809 1 + 1 + 3 + 19 = 24bits.
810Number of page table entries
811 = (Page Table Size) / (An entry size)
812 = (24 megabytes / 24 bits)
813 = 223
814Vrtual address Size
815 = (Number of page table entries) * (Page Size)
816 = 223 * 8 kilobits
817 = 236
818Therefore, length of virtual address space = 36
819132.
820DMA is useful for the operations
821Answer: DMA is useful for transferring large quantities of data between memory
822and devices. It eliminates the need for the CPU to be involved in the transfer,
823allowing the transfer to complete more quickly and the CPU to perform other
824tasks concurrently.
825133.
826Data security threats include
827A. Hardware failure
828B. Privacy invasion
829C. Fraudulent manipulation of data
830D. All of the above
831134.
832Open-ended questions provide primarily ______ data
833135.
834Assume a relation ACCOUNT (acno, balance, type, branch, last_accessed) with 1 million
835records. If a SQL query "SELECT balance FROM account WHERE balance>5000" would
836produce 800000 records, which one of the following is the optimized version of relational algebra
837expressions that is equivalent to the given SQL query?
838136.
839What does the code snippet given below do?
840void fun1(struct node* head)
841{
842if(head == NULL)
843 return;
844 fun1(head->next);
845printf("%d ", head->data);
846}
847Ans: Prints all nodes of linked list in reverse order
848137.
849Given the following structure template, choose the correct syntax for accessing th
850e 5th subject marks of the 3rd student.
851struct stud
852{
853 int marks[6];
854 char sname[20];
855 char rno[10];
856}s[10];
857Answer: s[2].marks[4]
858138.
859Which of the following transport layer protocols is used to support electronic mail?
860(A) SMTP
861(B) IP
862(C) TCP
863(D) UDP
864139.
865Three concurrent processes X, Y, and Z execute three different code segments that access and
866update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores
867a, b and c; Process Y executes the P operation on semaphores b, c and d; Process Z executes
868the P operation on semaphores c, d, and a before entering the respective code segments. After
869completing the execution of its code segment, each process invokes the V operation (i.e., signal)
870on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of
871the following represents a deadlock-free order of invoking the P operations by the processes?
872(A) X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
873(B) X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
874(C) X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
875(D) X: P(a)P(b)P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)
876140.
877Eight minterms will be used for
878A. three variables
879B. four variables
880C. five variables
881D. six variables
882141.
883General Purpose Software which creates and manipulates database is
884Answer: DBMS
885142.
886Which of these is not a method of data collection?
887143.
888The number of min-terms after minimizing the following Boolean expression is _______.
889[D'+AB'+A'C+AC'D+A'C'D]'
890Answer: 1.
891The end result of this gives us only one minterm = ABCD
892hence, answer = 1
893144.
894Consider the following C code segment:
895int a, b, c = 0;
896void prtFun(void);
897main( )
898{ static int a = 1; /* Line 1 */
899prtFun( );
900a + = 1;
901prtFun( )
902printf(?\n %d %d ?, a, b);
903}
904void prtFun(void)
905{ static int a=2; /* Line 2 */
906int b=1;
907a+=++b;
908printf(?\n %d %d ?, a, b);
909}
910What output will be generated by the given code segment?
911Answer: 4 2
912 4 2
913 2 0
914145.
915Consider a join (relation algebra operation) between relations r(R)and s(S) using the nested loop
916method. There are 3 buffers each of size equal to disk block size, out of which one buffer is
917reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer
918number of disk block accesses if
919(A) relation r(R) is in the outer loop.
920(B) relation s(S) is in the outer loop.
921(C) join selection factor between r(R) and s(S) is more than 0.5.
922(D) join selection factor between r(R) and s(S) is less than 0.5.
923Answer : A
924146.
925This topology requires multipoint connection
926Answer: BUS
927147.
928_________________ refers to the number of units to be chosen from the population
929148.
930Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at
931cylinder100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110,
932135 and 145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access,
933the request for cylinder 90 is serviced after servicing ____________ number of requests.
934(A) 1
935(B) 2
936(C) 3
937(D) 4
938149.
939Consider the following C program
940#inclue
941int main()
942int i, j, k 0;
943j=2*3/4+2.0 / 5+8 / 5;
944k-= --j;
945for (i=0; i<5; i++)
946{
947Switch (i + k)
948{
949case1:
950case 2 : printf ("\ n%d", i+k)
951case 3 : printf ("\ n%d", i+k);
952default : printf ("\n%d",i+k);
953}
954}
955Return 0:
956}
957The number of times printf statement is executed is ____10_____.
958150.
9591024 bit is equal to how many byte
960Answer: 128
961151.
962Action research means __________
963152.
964In which addressing mode the operand is given explicitly in the instruction?
965Answer: Immediate Mode
966153.
967HTTP is ________ protocol
968a) application layer
969b) transport layer
970c) network layer
971d) none of the mentioned
972154.Which of the following is NOT a superkey in a relational schema with attributes V,W,X,Y,Z
973and primary key V Y?
974(A) V X Y Z
975(B) V W X Z
976(C) V W X Y
977(D) V W X Y Z
978Explanation: Super key = Candidate Key + other attributes. But option B does not
979include Y which is a part of PK or candidate key.
980155.
981Which of the following is not a part of instruction cycle?
982Answer: stages of instruction cycle:
983a. Fetch
984b. Decode
985c. Execute
986d. Derive effective address of the instruction
987e. All of these
988156.
989A process executes the code
990fork ();
991fork ();
992fork ();
993The total number of child processes created is
994(A) 3
995(B) 4
996(C) 7
997(D) 8
998Answer (C)
999157.
1000SQl allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in
1001the result of joins. Which one of the following queries always gives the same answer as the
1002nested query shown below:
1003select * from R where a in (select S.a from S)
1004158.
1005One of the terms given below is defined as a bundle of meanings or characteristics associated with
1006certain events, objects, conditions, situations, and the like
1007Concept
1008159.
1009The HTTP response message leaves out the requested object when _____ method is used
1010a) GET
1011b) POST
1012c) HEAD
1013d) PUT
1014160.
1015Consider the following C
1016function.
1017int fun (int n) {
1018int x =1, k;
1019if (n ==1) return x;
1020for (k=1; k < n; ++k)
1021x = x + fun (k)* fun (n - k); return x;
1022}
1023The return value of fun (5) is ___51____
1024161.
1025__PUBLIC KEY____ cryptography refers to encryption methods in which both the sender and
1026receiver share the same key.
1027162.
1028After fetching the instruction from the memory, the binary code of the
1029instruction goes to
1030Answer: MBR – Memory Buffer Register
1031163.
1032The following function computes the maximum value contained in an integer array
1033p[ ] of size n (n >= 1).
1034int max(int *p, int n) {
1035int a=0, b=n-1;
1036while (__________) {
1037if (p[a] <= p[b]) { a = a+1; }
1038else { b = b-1; }
1039}
1040return p[a];
1041}
1042The missing loop condition is
1043Answer: b!=a.
1044164.
1045Research questions are crucial because they will _________
1046165.The average time required to reach a storage location in memory and obtain its contents is
1047called the
1048Answer: Access time
1049166.
1050The relation R={A,B,C,D,E,F} with FD A,B-> C, C-> D, C->E,F holds
1051Ans: AEH, BEH, DEH
1052167.
1053The relationship that exists within the same entity type is called as
1054_____recursive____ relationship.
1055168.
1056Consider the following C
1057function.
1058int fun (int n) {
1059int x =1, k;
1060if (n ==1) return x;
1061for (k=1; k < n; ++k)
1062x = x + fun (k)* fun (n - k); return x;
1063}
1064The return value of fun (5) is ___51____
1065169.
1066When CPU is executing a Program that is part of the Operating System, it is said to be in
1067 A. Interrupt mode
1068B. System mode
1069 C. Half mode
1070 D. Simplex mode
1071170.
1072Flip-flops can be constructed with two
1073Answer: NAND
1074171.
1075Using public key cryptography, X adds a digital signature σ to message M, encrypts, and sends it
1076to Y, where it is decrypted. Which one of the following sequences of keys is used for the
1077operations?
1078(A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by
1079Y’s public key
1080(B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by
1081Y’s private key
1082(C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by
1083X’s private key
1084(D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key
1085followed by X’s public key
1086172.
1087Actuary is a person who ________
1088173.
1089If a hospital has to store the description of each visit of a patient according to date what
1090attribute you will use in the patient entity type?
1091Ans: multivalued attribute
1092174.
1093Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at
1094the same time to a computer system. Which one of the following process scheduling algorithms
1095would minimize the average waiting time in the ready queue?
1096(A) Shortest remaining time first
1097(B) Round-robin with time quantum less than the shortest CPU burst
1098(C) Uniform random
1099(D) Highest priority first with priority proportional to CPU burst length
1100Answer: (A)
1101175.
1102What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note
1103that the first parameter is passed by reference, whereas the second parameter is passed by
1104value.
1105int f (int &x, int c) {
1106c=c-1;
1107if (c-0) return 1;
1108x=x+1;
1109return f (x,c)*x;}
1110Answer: (B) 6561
1111176.
1112Decimal digit in BCD can be represented by
1113Answer: binary-coded decimal (BCD) is a class of binary encodings of decimal numbers
1114where each decimal digit is represented by a fixed number of bits, usually four or eight.
1115177.
1116Insurable interest in a life insurance contract should be present _______
1117178.
1118Error correction and error detection happens in ____DATA LINK_______ layer.
1119179.
1120Which of the following statements regarding RBI is not correct:
1121180.
1122___ICMP___is used by network devices, like routers, to send error messages indicating, for
1123example, that a requested service is not available or that a host or router could not be reached.
1124Answer: Internet Control mEssaging Protocol.
1125181.
1126KDD (Knowledge Discovery in Databases) is referred to,
1127ANSWER: broad process of finding knowledge in data, and emphasizes the "highlevel"
1128application of particular data mining methods
1129182.
1130Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main
1131memory consists of 256 blocks and the request for memory blocks is in the following order: 0,
1132255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155 Which one of the following memory
1133block will NOT be in cache if LRU replacement policy is used?
1134Answer: 216
1135183.The output of the following program is
1136main()
1137{
1138int a = 5;
1139int b = 10;
1140cout << (a>b?a:b);
1141}
1142Answer: 10
1143184.
1144Design procedure of combinational circuit involves
11451. Determine required number of inputs and outputs from the specifications.
11462. Derive the truth table for each of the outputs based on their relationships to the
1147input.
11483. Simplify the boolean expression for each output. Use Karnaugh Maps or Boolean
1149algebra.
11504. Draw a logic diagram that represents the simplified Boolean expression. Verify the
1151design by analysing or simulating the circuit.
1152185.
1153The banking companies that are allowed to operate in a very limited geographical area, are
1154known as ______________
1155186.
1156_____________DATA MODEL__________gives the concepts to describe the
1157structure of the database.
1158187.
1159In dynamic routing mechanism the route changes in response to _______
1160188.
1161Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11,92,
116210. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63,
1163moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from
11640 to 199. The total head movement (in number of cylinders) incurred while servicing these
1165requests is
1166(A) 346
1167(B) 165
1168(C) 154
1169(D) 173
1170189.
1171In design procedure input output values are assigned with
1172190.
1173The Third stage in designing a database is when we analyze our tables more closely and create
1174a _____RELATIONSHIP______ between tables.
1175191.
1176Majority of share capital in RBI is held by ____________
1177192.
1178Mod-6 and mod-12 counters are most commonly used in
1179[A]. frequency counters
1180[B]. multiplexed displays
1181[C]. digital clocks
1182[D]. power consumption meters
1183193.
1184A race condition occurs when
1185A. Two concurrent activities interact to cause a processing error
1186B. two users of the DBMS are interacting with different files at the same time
1187C. both (a) and (b)
1188D. All of the above
1189E. None of the above
1190194.
1191Multiplexing is used in _______
1192a) Packet switching
1193b) Circuit switching
1194c) Data switching
1195d) None of the mentioned
1196195.
1197The minimum number of page frames that must be allocated to a running process in a virtual
1198memory environment is determined by
1199a) the instruction set architecture
1200b) page size
1201c) physical memory size
1202d) number of processes in memory
1203196.
1204Passing the request from one schema to another in DBMS architecture is called as
1205___________________
1206Answer: Mapping
1207197.
1208_______ is a set of networks sharing the same routing policy
1209Answer: Autonomous System
1210198.
1211IRDA is associated with __________
1212199.
1213Mod-6 and mod-12 counters are most commonly used in
1214Answer: Digital Clocks
1215200.
1216. For computers based on three - address instruction formats, each address field can be used to
1217specify which of the following:
1218S1: A memory operand
1219S2: A processor register
1220S3: An implied accumulator registers
1221(A) Either S1 or S2
1222(B) Either S2 or S3
1223(C) Only S2 and S3
1224(D) All of S1, S2 and S3
1225201.
1226Insurance companies collect a fixed amount from its customers at fixed intervals of time. What is it
1227called?
1228Answer: premium
1229202.
1230A relation schema R is said to be in 4NF if for every MVD x-->>y that holds over R
1231A ->> B is a trivial MVD
1232 A is a superkey
1233203.
1234_____, also known as "port forwarding," is the transmission of data intended for use only within a
1235private, usually corporate network through a public network in such a way that the routing nodes
1236in the public network are unaware that the transmission is part of a private network.
1237Answer: Tunneling
1238204.
1239What is a trap?
1240Answer: A trap is an exception in a user process. It's caused by division by zero or invalid
1241memory access.
1242205.
1243Congestion control and quality of service is qualities of the
1244Answer: ATM ????
1245206.
1246The ____XLAT_____ translates a byte from one code to another code
1247207.
1248In real time Operating System, which of the following is the most suitable scheduling scheme?
1249Answer: Preemptive Scheduling.
1250208.
1251Regional rural banks are:
1252209.
1253The Snapshot of a table is called as
1254Ans – View
1255210.
1256In Binary trees nodes with no successor are called ......
1257LEAF
1258211.
1259____TCP___ detects loss of data errors in data, requests retransmission of lost data, rearranges
1260out-of-order data, and even helps minimize network congestion to reduce the occurrence of the
1261other problems
1262212.
1263If every node u in G adjacent to every other node v in G, A graph is said to be
1264Answer: Complete
1265213.
1266A relation R(a,b,c,d,e,f) with the FDs { a -> b,c; c -> d, e, f } satisfies ----- normal form at the most
1267where ?a? is the primary key.
1268214.
1269If a virtual memory system has 4 pages in real memory and the rest must be swapped to disk.
1270Which of the following is the hit ratio for the following page address stream. Assume memory
1271starts empty, use the FIFO algorithm
1272Answer: 31%
1273215.
1274Which category of banks is under dual control of Government and RBI?
1275216.
1276Which amongst the following refers to Absolute addressing mode
1277A. Ans - the address of the operand is inside the instruction
1278217.
1279A binary tree in which all the leaves are on the same level is called as:
1280Answer: Perfect binary tree
1281218.
1282Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The
1283round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The
1284time taken (in msec) by the TCP connection to get back to 32 KB congestion window is
12851100-1300
1286219.
1287NOP instruction introduces
1288Delay 
1289220.
1290On simple paging system with 224 bytes of physical memory, 256 pages of logical address space,
1291and a page size 210 bytes, how many bytes are in a page frame?
12922
129310 bytes,
1294
1295221.
1296Course_Info{Course_no, Sec_no, Offering_dept, Credit_hours, Course_level, Instructor_ssn,
1297Semester, Year, Days_hours, Room_no, No_of_students}.
1298The Course_Info has following functional dependencies:
1299{Course_no}{Offering_dept, Credit_hours, Course_level}
1300{Course_no, Sec_no, Semester, Year} {Days_hours, Room_no, No_of_students,
1301Instructor_ssn }
1302{Room_no, Days_hours, Semester, Year} {Instructor_ssn, Course_no, Sec_no}
1303Find the keys of the relation
1304222.
1305A bill of exchange which is drawn on a specific bank and is not payable otherwise than
1306on demand, to bearer or to order, is called ______________
1307223.
1308Which of the following are sufficient conditions for deadlock?
13091. mutual exclusion
1310The resources involved must be unshareable; otherwise, the processes would not
1311be prevented from using the resource when necessary.
13122. hold and wait or partial allocation
1313The processes must hold the resources they have already been allocated while
1314waiting for other (requested) resources. If the process had to release its resources
1315when a new resource or resources were requested, deadlock could not occur
1316because the process would not prevent others from using resources that it
1317controlled.
13183. no pre-emption
1319The processes must not have resources taken away while that resource is being
1320used. Otherwise, deadlock could not occur since the operating system could simply
1321take enough resources from running processes to enable any process to finish.
13224. resource waiting or circular wait
1323224.
1324How many 8-bit characters can be transmitted per second over a 9600 baud serial
1325communication link using asynchronous mode of transmission with one start bit, eight data bits,
1326two stop bits, and one parity bit?
1327(B) 300
1328225.
1329Expand the acronym ‘ADB’
1330226.
1331The addressing mode used in an instruction of the form ADD X Y, is _DIRECT/ABSOLUTE____.
1332227.
1333In ORDBMS, When an object O is brought into memory, they check each oid contained
1334in O and replace oids of in-memory objects by in-memory pointers to those objects. This
1335concept refers to:
1336pointer swizzling
1337228.
1338A binary tree T has 20 leaves. The number of nodes in T having two children is
1339(A) 18
1340(B) 19
1341(C) 17
1342(D) Any number between 10 and 20
1343229.
1344What happens when you push a new node onto a stack?
1345The new node is placed at the front of the linked list
1346230.The port that is used for the generation of handshake lines in mode 1 or mode 2 is
1347a) port A
1348b) port B
1349c) port C Lower
1350d) port C Upper
1351231.
1352Consider the following transaction involving two bank account x and y.
1353read (x) ; x : = x ? 50; write (x) ; read (y); y : = y + 50 ; write (y)
1354The constraint that the sum of the accounts x and y should remain constant is that of
1355(A) Atomicity
1356(B) Consistency
1357(C) Isolation
1358(D) Durability
1359232.
1360The portion of total deposits of a commercial bank which it has to keep with RBI in the form of cash
1361reserves is termed as _______________
1362233.
1363A receiving host has failed to receive all of the segments that it should acknowledge. What can
1364the host do to improve the reliability of this communication session?
1365Send a different source port number.
1366B. Restart the virtual circuit.
1367C. Decrease the sequence number.
1368D. Decrease the window size.
1369234.
1370A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
1371page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
1372maximum size of the page table of a process is 24 megabytes, the length of the virtual address
1373supported by the system is _________ bits.
1374(A) 36
1375(B) 32
1376(C) 28
1377(D) 40
1378235.
1379In 8257 register format, the selected channel is disabled after the terminal count condition is
1380reached when
1381a) Auto load is set
1382b) Auto load is reset
1383c) TC STOP bit is reset
1384d) TC STOP bit is set
1385236.
1386Which of the following information is not part of Process Control Block?
1387(i) Process State
1388(ii) Process Page table
1389(iii) List of Open files
1390(iv) Stack Pointer
1391None of the above
1392237.
1393The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with
1394n discs is
1395(A) T(n) = 2T(n – 2) + 2
1396(B) T(n) = 2T(n – 1) + n
1397(C) T(n) = 2T(n/2) + 1
1398(D) T(n) = 2T(n – 1) + 1
1399238.
1400A personal account cannot be opened in _____________
1401239.
1402For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements
1403is/are TRUE ?
1404I. At least three non-overlapping channels are available for transmissions.
1405II. The RTS-CTS mechanism is used for collision detection.
1406III.Unicast frames are ACKed.
1407(A) All I, II, and III
1408(B) I and III only
1409(C) II and III only
1410(D) II only
1411240.
1412____ users work on canned transactions
1413Naïve or parametric end users
1414241.
1415X.25 Networks are _____ Packet Switched wide area network.___ networks
1416242.
1417A banking product is an example of _____________
1418243.
1419Partial Degree of multiprogramming is controlled by
1420A. CPU scheduler
1421B. context switching
1422C. long term scheduler
1423D. medium term scheduler
1424244.
1425The effective address of the following instruction is , MUL 5(R1,R2)
1426a) 5+R1+R2
1427b) 5+(R1*R2)
1428c) 5+[R1]+[R2].
1429d) 5*([R1]+[R2])
1430245.
1431Consider the following four schedules due to three transactions (indicated by the subscript) using
1432read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them
1433is conflict serializable?
1434A. r1(x)r1(x); r2(x)r2(x); w1(x)w1(x); r3(x)r3(x); w2(x)w2(x);
1435B. r2(x)r2(x); r1(x)r1(x); w2(x)w2(x); r3(x)r3(x); w1(x)w1(x);
1436C. r3(x)r3(x); r2(x)r2(x); r1(x)r1(x); w2(x)w2(x); w1(x)w1(x);
1437D. r2(x)r2(x); w2(x)w2(x); r3(x)r3(x); r1(x)r1(x); w1(x)w1(x);
1438246.
1439If a , b , c, are three nodes connected in sequence in a singly linked list, what is
1440the statement to be added to change this into a circular linked list?
1441247.
1442A buying process starts when the buyer recognizes a ____________
1443248.
1444Which one of the following protocols is NOT used to resolve one form of address to another one?
1445A. DNS
1446B. ARP
1447C. DHCP
1448D. RARP
1449249.
1450The effective address of the following instruction is , MUL 5(R1,R2)
1451a) 5+R1+R2
1452b) 5+(R1*R2)
1453c) 5+[R1]+[R2].
1454d) 5*([R1]+[R2])
1455250.
1456Consider a schedule S1 given below;
1457R1(A); W1(A); R2(B); R2(A); R1(B); W2(A+B); W1(B); where R1 and W1 are read and write
1458operations of transaction T1 and R2 and W2 are read and write operations of transaction T2.
1459Which of the following is correct regarding schedule S1?
1460(a) S1 is a serializable schedule
1461(b) A deadlock will occur if 2PL is used
1462(c) S1 is a conflict serializable schedule
1463(d) S1 is a view serializable schedule
1464251.
1465Consider the following function written the C programming language.
1466void foo (char * a ) {
1467if (* a & & * a ! =' ' ){
1468putchar (*a);
1469}
1470}
1471}
1472The output of the above function on input ?ABCD EFGH? Is
1473Answer: DCBA
1474252.
1475When several processes access the same data concurrently and the outcome of the execution
1476depends on the particular order in which the access takes place, is called
1477a) dynamic condition
1478b) race condition
1479c) essential condition
1480d) critical condition
1481253.
1482State the type of multitasking supported by OS when process switched its state from 'Running' to
1483'Ready' due to scheduling act.
1484Answer: ??
1485254.
1486The instructions which copy information from one location to another either in the processor’s
1487internal register set or in the external main memory are called
1488(A) Data transfer instructions. (B) Program control instructions.
1489(C) Input-output instructions. (D) Logical instructions.
1490Ans: A
1491255.
1492The degree of a leaf node is: ZERO
1493256.
1494______________ are products bought for further processing or for use in conducting a business
1495257.
1496End-to-end connectivity is provided from host-to-host in:
1497A. Network layer
1498B. Session layer
1499C. Data link layer
1500D. Transport layer
1501E. None of the above
1502258.
1503An index is clustered, if
1504(A) it is on a set of fields that form a candidate key.
1505(B) it is on a set of fields that include the primary key.
1506(C) the data records of the file are organized in the same order as the data
1507entries of the index.
1508(D) the data records of the file are organized not in the same order as the data entries of the
1509index.
1510259.
1511The protocol data unit (PDU) for the application layer in the Internet stack is
1512(A) Segment
1513(B) Datagram
1514(C) Message
1515(D) Frame
1516260.
1517PSW is saved in stack when there is a
1518A. interrupt recognized B. execution of RST instruction
1519C. Execution of CALL instruction D. All of these
1520261.
1521Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250KB,
1522where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357
1523KB, 210KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are
1524NOT allotted to any process?
1525(A) 200 KB and 300 KB
1526(B) 200 KB and 250 KB
1527(C) 250 KB and 300 KB
1528(D) 300 KB and 400 KB
1529262.
1530If actual performance exceeds the expected performance of the product, then the customer is
1531____________
1532263.
1533Creating a B Tree index for your database has to be specified in _____.
1534264.
1535The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.
1536A. ABFCDE
1537B. ADBFEC
1538C. ABDECF
1539D. ABDCEF
1540265.
1541Error detection at the data link layer is achieved by?
1542[A] Bit stuffing
1543[B] Cyclic redundancy codes
1544[C] Hamming codes
1545[D] Equalization
1546266.
1547Which of the following is not a function of a DBA?
1548A. Network Maintenance
1549B. Routine maintenance
1550C. Schema Definition
1551D. Authorization for data access
1552267.
1553A system uses 3 page frames for storing process pages in main memory. It uses the Least
1554Recently Used (LRU) page replacement policy. Assume that all the page frames are
1555initially empty. What is the total number of page faults that will occur while processing the page
1556reference string given below?
15574, 7, 6, 1, 7, 6, 1, 2, 7, 2
1558(A) 4
1559(B) 5
1560(C) 6
1561(D) 7
1562268.
1563What is a trap?
1564Answer: A trap is an exception in a user process. It's caused by division by zero or invalid
1565memory access.
1566269.
1567What is the postfix expression for the following infix expression?
1568 Infix = a+b%c>d
1569Answer: a b%c>d +
1570270.
1571The promotion “P” of marketing mix is also known as ____________
1572271.
1573Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If
1574the computer system has a one-level page table per process and each page table entry requires
157548 bits, then the size of the per-process page table is __________ megabytes.
1576(A) 384
1577(B) 48
1578(C) 192
1579(D) 96
1580272.
1581Computers use addressing mode techniques for _____________________.
1582A. giving programming versatility to the user by providing facilities as pointers to memory
1583counters for loop control
1584B. to reduce no. of bits in the field of instruction
1585C. specifying rules for modifying or interpreting address field of the instruction
1586D. All the above
1587273.
1588Loss in signal power as light travels down the fiber is called?
1589A. attenuation
1590B. propagation
1591C. scattering
1592D. interruption
1593E. None of the above
1594274.
1595Passing the request from one schema to another in DBMS architecture is called as
1596___MAPPING___
1597275.
1598A change in an individual's behaviour prompted by information and experience refers to
1599which one of the following concept?
1600276.
1601A binary tree T has 20 leaves. The number of nodes in T having two children is
1602(A) 18
1603(B) 19
1604(C) 17
1605(D) Any number between 10 and 20
1606277.
1607Computers use addressing mode techniques for _____________________.
1608A. giving programming versatility to the user by providing facilities as pointers to memory
1609counters for loop control
1610B. to reduce no. of bits in the field of instruction
1611C. specifying rules for modifying or interpreting address field of the instruction
1612D. All the above
1613278.
1614Consider the 3 process, P1, P2 and P3 shown in the table.
1615Process Arrival time Time units Required
1616P1 0 5
1617P2 1 7
1618P3 3 4
1619The completion order of the 3 processes under the policies FCFS and RR2 (round robin
1620scheduling) with CPU quantum of 2 time units are
1621(A)
1622FCFS: P1, P2, P3
1623RR2: P1, P2, P3
1624(B)
1625FCFS: P1, P3, P2
1626RR2: P1, P3, P2
1627(C)
1628FCFS: P1, P2, P3
1629RR2: P1, P3, P2
1630(D)
1631FCFS: P1, P3, P2
1632RR2: P1, P2, P3
1633279.
1634Which of the following is NOT a superkey in a relational schema with attributes V,W,X,Y,Z and
1635primary key V Y?
1636(A) V X Y Z
1637(B) V W X Z
1638(C) V W X Y
1639(D) V W X Y Z
1640280.Which of the following is example of in-place algorithm?
1641Ans: Heap Sort , Selection Sort, Bubble Sort , insertion sort, shell sort.
1642281.
1643In OSI model dialogue control and token management are responsibilities of ?
1644Network layer
1645Session Layer
1646Transport Layer
1647None of above
1648282.
1649A person’s ________ consists of all the groups that have a direct (face-to-face) or
1650indirect influence on his/her attitudes or behaviour
1651283.
1652The promotion strategy that uses sales force to market the products is known as ______________
1653284.
1654A scheduling algorithm assigns priority proportional to the waiting time of a process. Every
1655process starts with priority zero(the lowest priority). The scheduler re-evaluates the process 
1656priorities every T time units and decides the next process to schedule. Which one of the following
1657is TRUE if the processes have no I/O operations and all arrive at time zero?
1658(A) This algorithm is equivalent to the first-come-first-serve algorithm
1659(B) This algorithm is equivalent to the round-robin algorithm.
1660(C) This algorithm is equivalent to the shortest-job-first algorithm..
1661(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm
1662285.
1663Which protocol does Ping use?
1664Answer: ICMP – Internet Control Message Protocol
1665286.
1666Which of the following operator in SQL would produce the following result if applied between two
1667relations Employee and Department?
1668Eno EName DeptNo DName
1669111 Kumar 100 Sales
1670222 Steve 200 Finance
1671Null Null 300 Admn
1672244 Meera 400 Mktg
1673Answer: Right join.
1674287.
1675The run time of the following algorithm is
1676Procedure A(n)
1677If(n<=2) return(1)
1678Else return(A(sqrt(n))
1679A. O(n)
1680B. O(logn)
1681C. O(loglogn)
1682D. O(1)
1683288.
1684The address to the next instruction lies in
1685Answer: Program Counter
1686289.
1687Which of the following address modes calculate the effective address as
1688address part of the instruction) + (content of CPU register)
1689290.
1690Wholesaling does not include which of the following services?
1691291.
1692The process related to process control, file management, device management, information about
1693system and communication that is requested by any higher level language can be performed by
1694__________.
16951 Editors
16962 Compilers
16973 System Call
16984 Caching
1699292.
1700Consider a dynamic queue with two pointers: front and rear. What is the time needed to
1701insert an element in a queue of length of n?
1702Answer: O(1)
1703293.
1704What is the unique characteristic of RAID 6 ?
1705a) Distributed Parity
1706b) Striping
1707c) Two independent distributed parity
1708d) Mirroring
1709294.
1710If CurrNode pointer points to the previous node in the list and NewNode points to the newly
1711created Node, the address assignments to be done for inserting a node in the middle of a singly
1712linked list is
1713295.
1714On simple paging system with 2^24 bytes of physical memory, 256 pages of logical address
1715space, and a page size 2^10 bytes, how many bytes are in a page frame?
1716Ans:: Page frame size is 2^10 bytes.
1717296.
1718A 2 km long brodcast LAN has 10^7 bps bandwidth and uses CSMA/ CD. The signal travels
1719along the wire at 2 *10 ^8 m/s. What is the minimum packet size that can be used on this
1720network ?
1721(A) 50 bytes
1722(B) 100 bytes
1723(C) 200 bytes
1724(D) None of these
1725297.
1726The data manipulation language used in SQL is a,
1727(I) Procedural DML
1728(II) Non-Procedural DML
1729(III) Modification DML
1730(IV) Declarative DML
1731Answer: (1) and (4)
1732298.
1733The ________ is practiced most aggressively with unsought goods, goods that
1734buyers normally do not think of buying, such as insurance, encyclopedias, and funeral plots.
1735Answer: b. Selling concept
1736299.
1737A group of bits that tell the computer to perform a specific operation is known as
1738A. Instruction code 
1739B. Micro-operation
1740C. Accumulator
1741D. Register
1742300.
1743How many 8-bit characters can be transmitted per second over a 9600 baud serial
1744communication link using asynchronous mode of transmission with one start bit, eight data bits,
1745and one parity bit ?
1746Answer: 800
1747301.
1748Deceptive pricing is also referred to as ______________
1749302.
1750The time factor when determining the efficiency of algorithm is measured by
1751a. Counting microseconds
1752b. Counting the number of key operations
1753c. Counting the number of statements
1754d. Counting the kilobytes of algorithm
1755303.
1756Consider the following pseudo code fragment:
1757printf (“Hello”);
1758if(!fork( ))
1759printf(“World”);
1760Which of the following is the output of the code fragment?
1761304.
1762Having clause in SQL occurs with
1763The HAVING clause should appear before an INTO clause; otherwise, a syntax error
1764occurs.
1765305.
1766When we use auto increment or auto decrement, which of the following is/are true
17671) In both, the address is used to retrieve the operand and then the address gets altered.
17682) In auto increment the operand is retrieved first and then the address altered.
17693) Both of them can be used on general purpose registers as well as memory locations.
1770306.
1771The address resolution protocol (ARP) is used for
1772(a) Finding the IP address from the DNS
1773(b) Finding the IP address of the default gateway
1774(c) Finding the IP address that corresponds to a MAC address
1775(d) Finding the MAC address that corresponds to an IP address
1776307.
1777One that is not type of flipflop is
1778Types of Flip-Flops
1779• RS flip-flop
1780• JK flip-flop
1781• D flip-flop
1782• T flip-flop
1783308.
1784If a node having two children is deleted from a BST, it is replaced by its
1785a) In-order predecessor
1786b) In-order successor
1787c) Pre-order predecessor
1788d) None
1789309.
1790_______ is the want for a specific product backed by the ability to pay
1791Next
1792314.
1793A company is in the ______________ stage of the new product development process when the
1794company develops the concept into a commercially viable physical product
1795315.
1796An organization has a class B network and wishes to form subnets for 64 departments. The
1797subnet mask would be
1798(a) 255.255.0.0
1799(b) 255.255.64.0
1800(c) 255.255.128.0
1801(d) 255.255.252.0
1802316.
1803R right outer join S on a=b gives
1804317.
1805Which of the process transition is invalid?
1806318.
1807The process in which of the following states will be in secondary memory?
1808319.
1809The number of counters that are present in the programmable timer device 8254 is
1810a) 1
1811b) 2
1812c) 3
1813d) 4
1814Explanation: There are three counters that can be used as either counters or delay
1815generators.
1816320.
1817In a packet switching network, packets are routed from source to destination along a single path
1818having two intermediate node. If the message size is 24 bytes and each packet contains a
1819header of 3 bytes, then the optimum packet size is
1820(a) 4
1821(b) 6
1822(c) 7
1823(d) 9
1824321.
1825Why is market segmentation primarily undertaken?
1826322.
1827_______DATA MODEL________________gives the concepts to describe the
1828structure of the database.
1829323.
1830Identify the sorting technique that supports divide and conquer strategy and has (n2) complexity
1831in worst case
1832a. Bubble sort
1833b. Insertion sort
1834c. Quick sort
1835d. All of above
1836Answer: Quick Sort
1837324.
1838Station A uses 32 byte packets to transmit messages to Station B using a sliding window
1839protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bankwidth
1840on the path between aA and B is 128 kbps. What is the optimal window size that A should use ?
1841(A) 20
1842(B) 40
1843(C) 160
1844(D) 320
1845Answer (B)
1846325.
1847If a firm emphasizes it’s product’s benefits, rather than it’s product’s attributes, it is oriented towards
1848_______________
1849326.
1850Given the basic ER and relational models, which of the following is INCORRECT?
1851A. An attribute of an entity can have more than one value
1852B. An attribute of an entity can be composite
1853C. In a row of a relational table, an attribute can have more than one
1854value
1855D. In a row of a relational table, an attribute can have exactly one value or a
1856NULL value
1857327.
1858The searching technique that takes O (1) time to find a data is
1859Answer: Hashing
1860328.
1861If a disk has a seek time of 20ms, rotates 20 revolutions per second, has 100 words per block,
1862and each track has capacity of 300 words. Then the total time required to access one block is
1863A.25
1864B.30
1865C.40
1866D.60
1867329.
1868The data bus buffer is controlled by
1869Answer: Read/write control logic
1870330.
1871Which of the following is not a conversion function in SQL?
1872331.
1873Which behavioural science discipline contributes to Organizational Behavior 's understanding of
1874group decision-making processes?
1875332.
1876Two computers C1 and C2 are configured as follows. C1 has IP address 203. 197.2.53 and
1877netmask 255.255. 128.0. C2 has IP address 203.197.75.201 and netmask 255.255.192.0. Which
1878one of the following statements is true?
1879A. C1 and C2 both assume they are on the same network
1880B. C2 assumes C1 is on same network, but C1 assumes C2 is on a different
1881network
1882C. C1 assumes C2 is on same network, but C2 assumes C1 is on a
1883different network
1884D. C1 and C2 both assume they are on different networks.
1885333.
1886In control word register, if SC1=0 and SC0=1, then the counter selected is
1887a) counter 0
1888b) counter 1
1889c) counter 2
1890d) none
1891334.
1892Information about a process is maintained in a _________.
18931 Stack
18942 Translation Lookaside Buffer
18953 Process Control Block
18964 Program Control Block
1897335.
1898AVL trees have a faster __________
1899A. Insertion
1900B. Deletion
1901C. Updation
1902D. Retrival
1903336.
1904The time required in worst case for search operation in binary tree is
1905Answer: O(n).
1906337.
1907Which of the following is shared between all of the threads in a process? Assume a kernel level
1908thread implementation
1909Answer: File Descriptors
1910338.
1911The communication that is used by managers to assign goals, point out problems that need attention
1912and provide job instructions is called as ____________
1913339.
1914The counter starts counting only if
1915a) GATE signal is low
1916b) GATE signal is high
1917c) CLK signal is low
1918d) CLK signal is high
1919340.
1920Station A needs to send a message consisting of 9 packets to Station B using a siding window
1921(window size 3) and go-back-n error control strategy. All packets are ready and immediately
1922available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever
1923get lost), then what is the number of packets that A will transmit for sending the message to B ?
1924(A) 12
1925(B) 14
1926(C) 16
1927(D) 18
1928341.
1929Which level of RAID refers to disk mirroring with block striping?
1930a) RAID level 1
1931b) RAID level 2
1932c) RAID level 0
1933d) RAID level 3
1934342.
1935Identify the data structure which allows deletions at both ends of the list but insertion at only one
1936end
1937a. Input-restricted deque
1938b. Output-restricted deque
1939c. Priority queues
1940d. None of above
1941343.
1942When an instruction is read from the memory, it is called
1943Answer: Instruction cycle (Also called Fetch-Decode-Execute Cycle)
1944344.
1945Experiments performed by Ivan Pavlov led to what theory?
1946345.
1947Which of the following is not true of virtual memory?
1948Ans: It requires the use of a disk or other secondary storage.( Actually it does not
1949require).
1950346.
1951In a token ring network the transmission speed is 10^7 bps and the propagation speed is 200
1952metres/ s μ . The 1-bit delay in this network is equivalent to;
1953(A) 500 metres of cable.
1954(B) 200 metres of cable.
1955(C) 20 metres of cable.
1956(D) 50 metres of cable.
1957Answer (C)
1958347.
1959To change the access path programs are categorized under ____PHYSICAL______
1960data independence.
1961348.
1962What are the desirable properties of a transaction?
1963Atomicity.
1964Consistency.
1965Isolation.
1966Durability.
1967349.
1968Job analysis provides information used for writing _____________________
1969350.
1970A Boolean function may be transformed into Logical Diagram
1971351.
1972The average time required to reach a storage location in memory and obtain its contents
1973is called the
1974Answer: Access time
1975352.
1976The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the
1977maximum number of subnets and the maximum number of hosts in each subnet?
1978(A) 62 subnets and 262142 hosts.
1979(B) 64 subnets and 262142 hosts.
1980(C) 62 subnets and 1022 hosts.
1981(D) 64 subnets and 1024 hosts.
1982Maximum number of subnets = 2^6-2 =62.
1983Maximum number of hosts is 2^10-2 = 1022.
1984353.
1985The time required in worst case for search operation in binary tree is
1986Answer: O(n).
1987354.
1988Shift registers are used for
1989Shift registers are commonly used in converters that translate parallel data to serial
1990data, or vice-versa.
1991355.
1992In the slow start phase of TCP congesting control algorithm, the size of the congestion window
1993(A) does not increase
1994(B) increases linearly
1995(C) increases quadratically
1996(D) increases exponentially
1997356.
1998_____________ is the process of deciding how to fill the company's most important executive
1999positions
2000357.
2001Operating System
20021. Assume that ?C? is a Counting Semaphore initialized to value ?10?. Consider the following
2003program segment:
2004P(C); V(C); P(C); P(C); P(C); V(C); V(C)
2005V(C); V(C); V(C); P(C); V(C); V(C); P(C)
2006What is the value of C?
2007C=10
2008there are 6 wait and 8 signal operation
2009wait operation reduce count by 1 and signal increase count by 1 in
2010general
2011so 10-6+8=12
2012358.
2013If a transaction T has obtained an exclusive lock on item Q, then T can
2014Answer: both read and write Q
2015359.
2016To represent hierarchical relationship between elements, which data structure is suitable?
2017a. Deque
2018b. Priority
2019c. Tree
2020d. All of above
2021360.
2022A binary search tree is generated by inserting in order the following integers 50, 15, 62, 5, 20, 58,
202391, 3, 8, 37, 60, 24. The number of nodes in the left subtree and right subtree of the root
2024respectively are
2025(a) (4, 7) (b) (7, 4) (c) (8, 3) (d) (3, 8)
2026361.
2027Two variables will be represented by
2028362.
2029If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum
2030number of hosts per subnet?
2031A. 1022
2032B. 1023
2033C. 2046
2034D. 2047
2035363.
2036If two relations R and S are joined, then the non matching tuples of both R and S are
2037ignored in
2038(A) left outer join (B) right outer join
2039 (C) full outer join (D) inner join
2040364.
2041Which of these does not belong to Maslow’s Hierarchy Need Theory?
2042365.
2043Mutual exclusion problem occurs between
2044-Two disjoint process that do not interact
2045- Process sharing same resources
2046- Process not sharing same resources
2047- None of these
2048366.
2049A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a
2050rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the maximum duration for
2051which the computer can transmit at the full 10Mbps?
2052(A) 1.6 seconds
2053(B) 2 seconds
2054(C) 5 seconds
2055(D) 8 seconds
2056367.
2057The FD A → B , DB→ C implies
2058368.
2059The base (or radix) of the number system such that the equation 312/20=13.1 holds is
2060(A) 3
2061(B) 4
2062(C) 5
2063(D) 6
2064369.
2065A binary tree in which every non-leaf node has non-empty left and right subtrees is called a
2066strictly binary tree. Such a tree with 10 leaves
2067A. Cannot have more than 19 nodes
2068B. Has exactly 19 nodes
2069C.Has exactly 17 nodes
2070D.Cannot have more than 19 nodes
2071A strictly binary tree with 'n' leaves must have (2n - 1) nodes
2072370.
2073The amount of time required to read a block of data from a disk into memory is composed
2074of seek time, rotational latency, and transfer time. Rotational latency refers to ______.
2075A. the time its takes for the platter to make a full rotation
2076B. the time it takes for the read-write head to move into position over the appropriate track
2077C. the time it takes for the platter to rotate the correct sector under the head
2078D. none of the above
2079371.
2080“Doing an activity or behaviour voluntarily for its own sake, for the inherent satisfaction and pleasure
2081derived from participation” well defines:
2082372.
2083Which type of managers takes less time to make their decisions and less information in making their
2084choices?
2085373.
2086The removal of process from active contention of CPU and reintroduce them into memory later is
2087known as ____________
20881 Interrupt
20892 Swapping
20903 Signal
20914 Thread
2092374.
2093For which one of the following reason: does Internet Protocol (IP) use the time-to-live (TTL) field
2094in the IP datagram header?
2095(A) Ensure packets reach destination within that time
2096(B) Discard packets that reach later than that time
2097(C) Prevent packets from looping indefinitely
2098(D) Limit the time for which a packet gets queued in intermediate routers.
2099375.
2100Consider a relation R (A, B). If A  B is a trivial functional dependency and A is the
2101super key for R, then what is the maximum normal form R can be in?
2102376.
2103The recurrence relation that arises in relation with the complexity of binary search is
2104A. T(n)=2T(n/2)+k, k is a constant T(n)=2T(n2)+k, k is a constant
2105B. T(n)=T(n/2)+k, k is a constant T(n)=T(n2)+k, k is a constant
2106C. T(n)=T(n/2)+lognT(n)=T(n2)+log⁡n
2107D. T(n)=T(n/2)+n
2108377.
2109A 20-bit address bus allows access to a memory of capacity
2110Answer: 1MB
21112^20 = 1048576
2112378.
2113The algorithm design technique used in the quick sort algorithm is
2114Dynamic programming
2115Backtracking
2116Divide and conquer
2117Greedy method
2118379.
2119Which of the following assertions is false about the internet Protocol (IP) ?
2120(A) It is possible for a computer to have multiple IP addresses
2121(B) IP packets from the same source to the same destination can take different routes in
2122the network
2123(C) IP ensures that a packet is discarded if it is unable to reach its destination within a
2124given number of hops
2125(D) The packet source cannot set the route of an outgoing packets; the route is
2126determined only by the routing tables in the routers on the way
2127In computer networking, source routing, also called path addressing, allows a sender of
2128a packet to partially or completely specify the route of the packet takes through the network.
2129380.
2130The technique, for sharing the time of a computer among several jobs, which switches jobs so
2131rapidly such that each job appears to have the computer to itself, is called
2132Time sharing
2133time out
2134time domain
2135FIFO
2136None of the above
2137381.
2138If the offset of the operand is stored in one of the index registers, then it is
2139Answer: indexed addressing mode
2140382.
2141Which of the following is a disadvantage of file processing system?
2142(I) Efficiency of high level programming,
2143(II) Data Isolation
2144(III) Integrity issues
2145(IV) Storing of records as files
2146383.
2147Organizational democracy requires _____________style of management
2148384.
2149If Human voice is required to be digitized what will be the bit rate at 16 bits per sample?
2150Therefore, the bit rate can be calculated by calculating the sample rate first.
2151Sampling rate = 4000 x 2 = 8000 samples/s
2152Considering the bit rate to be 16 bits per sample,
2153The total bit rate will be = 8000 x 16 = 128,000 bps = 128 kbps.
2154Therefore, the bit rate needed to digitize human voice is 128 kbps.
2155385.
2156The operating system of a computer serves as a software interface between the user and the
2157________
2158A. hardware B. peripheral C. memory D. screen
2159386.
2160The data manipulation language used in SQL is a,
2161387.
2162Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected,
2163undirected graph. The tree T formed by the tree arcs is a data structure for computing
2164(A) the shortest path between every pair of vertices.
2165(B) the shortest path from W to every vertex in the graph.
2166(C) the shortest paths from W to only those nodes that are leaves of T.
2167(D) the longest path in the graph
2168388.
2169The common register(s) for all the four channels of 8257 are
2170a. DMA address register
2171b. terminal count register
2172c. mode set register and status register
2173d. none of the mentioned
2174389.
2175Which of the following requires the listener to pay reasonably close attention to the speaker?
2176390.
2177 A full binary tree with n leaves contains
2178A. nn nodes
2179B. log2n nodes
2180C. 2n−1
2181D. 2n nodes
2182.
2183391.
2184Which of the following is not a function of a DBA?
2185A. Network Maintenance
2186B. Routine maintenance
2187C. Schema Definition
2188D. Authorization for data access
2189392.
2190The collection of processes on the disk that is waiting to be brought into memory for execution
2191forms the ___________
21921 Ready queue
21932 Device queue
21943 Input queue
21954 Priority queue
2196393.
2197Six channels, each with a 200 khz bandwidth are to be multiplexed together. what is the
2198minimum bandwidth requirement if each guard band is 20Khz
2199394.
2200____________ is the variable reward granted to employees as per their performance
2201395.
2202Which of the following is not a data copy/transfer instruction?
2203a)MOV
2204b) PUSH
2205c) DAS - Decimal Adjust after Subtraction
2206d) POP
2207396.
2208The unique characteristics that a learning organization possesses is that ______________
2209397.
2210The complexity of multiplying two matrices of order m*n and n*p is
2211A. mnp
2212B. mp
2213C. mn
2214D. np
2215398.
2216Which of these multiplexing techniques is digital for combining several low -rate channels into
2217one high-rate one
2218399.
2219The part of the operating system that coordinates the activities of other program is called the
2220Answer: Control program
2221400.
2222In DMA transfers, the required signals and addresses are given by the______
2223a) Processor
2224b) Device drivers
2225c) DMA controllers
2226d) The program itself
2227Explanation: The DMA controller acts like a processor for DMA transfers and overlooks the entire
2228process.
2229401.
2230Assume a relation R with keys X, Y and Z, where X, Y, and Z are sets of one or more
2231attributes. Also assume that Y is a subset or equal to X and Z is a subset of X and Y.
2232Which of the following is true for this case?
2233402.
2234A binary tree T has 20 leaves. The number of nodes in T having two children is
2235(A) 18
2236(B) 19
2237(C) 17
2238(D) Any number between 10 and 20
2239403.
2240The minimum number of JK flip-flops required to construct a synchronous counter with the count
2241sequence (0,0, 1, 1, 2, 2, 3, 3, 0, 0,…….) is
2242Answer: 3
2243404.
2244Assume relations R and S with the schemas R (A, B, C) and S (B, D). Which of the
2245following is equivalent to r ⋈ s?
2246ABCD
2247405.
2248Which of these is an off the job training?
2249Off-the-job training occurs when employees are taken away from their place of work
2250to be trained. Common methods of off-the-job training include: Day release (employee
2251takes time off work to attend a local college or training centre) Distance learning /
2252evening classes.
2253406.
2254What are the three phases in virtual circuit switching?
2255The three phases in virtual circuit switching are setup, data transfer, and teardown
2256407.
2257Switching the CPU to another Process requires saving state of the old process and loading new
2258process state is called as __________.
2259ANSWER: Context Switch
2260408.
2261Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250KB,
2262where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357
2263KB, 210KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are
2264NOT allotted to any process?
2265(A) 200 KB and 300 KB
2266(B) 200 KB and 250 KB
2267(C) 250 KB and 300 KB
2268(D) 300 KB and 400 KB
2269409.
2270Which of the following asymptotic notation is the worst among all?
2271a. Ο(n+9378)
2272b. Ο(n^3)
2273c. nΟ(1)
2274d. 2Ο(n)
2275410.
2276Consider a relational table with the schema R (A, B, C). Assume that the cardinality
2277of attribute A is 10, B is 20, and C is 5. What is the maximum number of records R
2278can have without duplicate?
2279Answer : 1000
2280411.
2281Which method is used to assess an organization’s training needs?
2282Training Need Analysis
2283412.
2284A half adder is implemented with XOR and AND gates. A full adder is implemented with two half
2285adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR
2286gate. The propagation delay of an AND/OR gate is 1.2 microseconds. A 4-bit ripple-carry binary
2287adder is implemented by using four full adders. The total propagation time
2288of this 4-bit binary adder in microseconds is ____________.
2289A Ripple Carry Adder allows to add two n-bit numbers. It uses half and full adders.
2290Following diagram shows a ripple adder using full adders.
2291Let us first calculate propagation delay of a single
22921 bit full adder.
2293Propagation Delay by n bit full adder is (2n + 2)
2294gate delays.
2295[See this for formula].
2296Here n = 1, so total delay of a 1 bit full adder
2297is (2 + 2)*1.2 = 4.8 ms
2298Delay of 4 full adders is = 4 * 4.8 = 19.2 ms
2299413.
2300Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth ?
2301Transmission is in half-duplex mode. For PSK the baud rate is the same as the bandwidth,
2302which means the baud rate is 5000. But in 8-PSK the bit rate is 3 times the baud rate, so the
2303bit rate is 15,000 bps.
2304414.
2305Virtual memory is __________.
2306An illusion of extrememly large main memory
2307415.
2308Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet
2309address ?
2310Answer : 201.14.78.64
2311At every router basically we have 3 entries in a routing table
23121. Network Id / Subnet address
23132. Subnet Mask
23143 .Interface
2315So with the help of these we can figure out where to send a packet.
2316IP address 201.14.78.65 subset mask 255.255.255.224
2317IP address 11111111.11111111.11111111.11100000
2318Subnet Mask 11001001.00001110.01001110.01000001
2319Subnet address 11001001.00001110.01001110.01000000
2320201 . 14 . 78 . 64
2321It is a Bitwise ANDing in above operation.
2322416.
2323Which of the following operator in SQL would produce the following result if
2324applied between two relations Employee and Department?
2325Eno EName DeptNo DName
2326111 Kumar 100 Sales
2327222 Steve 200 Finance
2328Null Null 300 Admn
2329244 Meera 400 Mktg
2330417.
2331The postfix expression of the given infix expression a+b*c+(d*e+f)*g is
2332418.
2333The truth table
2334X Y f(X,Y)
23350 0 0
23360 1 0
23371 0 1
23381 1 1
2339represents the Boolean function
2340419.
2341Consider a disk with following specification; sector size - 512 bytes, tracks per
2342surface - 2000, sectors per track - 60, double-sided platters - 4, and average seek time
2343- 20 msec. For a 5400 rpm hard disk for one revolution, if a single track of data can be
2344transferred, then what is the transfer rate?
2345the data transfer rate is 25K/ 0.011= 2, 250Kbytes/second
2346420.
2347We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then
2348repeats. The minimum number of J-K flip-flops required to implement this counter is
2349Total 4.
2350421.
2351Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at
2352cylinder
2353100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135
2354and
2355145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request
2356for
2357cylinder 90 is serviced after servicing ____________ number of requests.
23583 Number of requests
2359422.
2360For non-negative functions, f(n) and g(n), f(n) is theta of g(n) if and only if
2361max(f(n), g(n)) = Θ(f(n) + g(n))
2362423.
2363If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the
2364transmission before division ?
2365If divisor is n bit long then we add (n-1) no of 0's in the data unit before division
2366so here divisor is 1010 hence 3 0's are added in data unit so ans will be 111111000 i.e C
2367424.
2368The output after second iteration of the sorting technique is given below. Identify the
2369technique used 23 45 78 8 32 56
2370MERGE SORT
2371425.
2372Assume that a table CUSTOMER has 10000 records. If the block size 1024 bytes and
2373the record size is 80 bytes, how many records can be stored in each block to achieve
2374maximum performance and how many blocks are required to store the entire table?
2375Number of records in file = 16384
2376Record size = 32 bytes
2377Key Size = 6 bytes
2378Block Size on file system = 1024 bytes
2379Size of Block Pointer = 10 bytes
2380Size of a record or index Entry = 10 + 6 = 16
2381Number of blocks in first level = (Number of records in file)/
2382 (Disk Block Size)
2383 = (16384 * 16)/(1024)
2384= 16 * 16
2385= 256
2386In second level, there will be 256 * 16 entries.
2387Number of blocks in second level = (Number of entries) /
2388 (Block Size)
2389 = (256 * 16) / 1024
2390 = 4
2391Answer : 256+4 = 260
2392426.
2393which type of EM waves are used for unicast communication such as cellular telephones,
2394satellite networks and wireless LANS.
2395Radio waves!
2396427.
2397_________ register keeps track of the instructions stored in program stored in memory.
2398. PC (Program Counter)
2399428.
2400How many address bits are needed to select all memory locations in the 16K × 1 RAM?
2401The size of the memory is N*M
2402where N is the address lines and M is word length
2403no of registers/memory location required is 2^N
2404Given memory capacity is 16k
2405thus 2^N=16K
24061K=1024 memory locations
2407thus16k=16*1024=16384
2408now 2^N=16384
2409After factorising 16384 by 2 we ll get N AS 14
2410SO ADDRESS LINE REGUIRED IS 14.
2411429.
24121024 bit is equal to how many byte = 128 bytes
2413430.
2414The technique, for sharing the time of a computer among several jobs, which switches jobs so
2415rapidly such that each job appears to have the computer to itself, is called
2416ANS: time sharing
2417431.
2418Consider a relation R (A, B, C, D, E) with set of functional dependencies F = {ABC,
2419CDE, BD, EA}. Which of the following is one of the candidate keys of R?
2420432.
2421A method which creates the problem of secondary clustering is
2422LINEAR PROBING
2423433.
2424In stop and wait ARQ, the sequence numbers are generated using
2425Maximum sequence number in GBN is same as window size.
2426For sequence bits = n, number of sequence numbers = 2n and window size = 2n - 1
2427Consider n = 3, sequence numbers will be 23 = 8 ( i.e. from 0 - 7 )
2428and maximum window size = 23 - 1 = 7 i.e window will carry frames from 0 to 6
2429which are 7 in number.
2430Now, for sender window = 5
2431number of sequence bits needed = ceil (log2(1+window size)) = 3
2432So, sequence numbers generated would be 0 to 7 but window will carry
2433frames from 0 to 4 which is 5 in number (same as window size)
2434434.
2435How many ways are present in 4-way set associative cache of 16 sets?
2436Number of sets = Cache memory/(set associativity * cache block size)
2437 = 256KB/(4*16 B)
2438 = 4096
2439435.
2440Find the time complexity of given code snippet
2441for(int i=1;i<=n;i++)
2442for(int j=1;j<=n;j*=2)
2443 Printf(“*”);
2444O(Logn) Time Complexity of a loop is considered as O(Logn) if the loop variables is
2445divided / multiplied by a constant amount.
2446436.
2447Given R = ABCDEFGH and set of functional dependencies F = {BHC, BHF,
2448EF, AD, FA, BHE, CE, FD}, which of the following is redundant set of
2449functional dependencies?
2450437.
2451Which of these is true for go-back-N protocol, if m is the size of sequence number field
2452438.
2453Mac Operating system is developed by which company
2454Apple Inc.
2455439.
2456In the running state
2457440.
2458void Function(int n)
2459{
2460int i, count =0;;
2461for(i=1; i*i<=n; i++)
2462count++;
2463}
2464The time complexity of the above code snippet is
2465441.
2466Consider the entities customer (customer-name, customer-city,customer-street) and account(
2467account-no,balance) with following relationship
2468If depositor is a one-to-many relationship from account to customer, then this ER
2469diagram can be reduced to which of the following relational schemas?
2470442.
2471To guarantee the detection of up to s errors in all cases, the minimum Hamming distance in a
2472block code must be
2473S+1
2474443.
2475RS flip-flops are also called
2476444.
2477Consider this binary search tree:
2478 14
2479 / \
2480 2 16
2481 / \
2482 1 5
2483 /
2484 4
2485Suppose we remove the root, replacing it with something from the left
2486445.
2487The 1-address instructions for a=b*c + d is
2488446.
2489A critical region is
2490447.
2491The conjunctive selection operation σθ1∧θ2 (E) is equivalent to __________
2492448.
2493Which of the following is not used for synchronization?
2494Banker’s ALgorithm
2495449.
2496What is maximum throughput for slotted ALOHA ?
24970.5/e
2498450.
2499Which of the following concurrency control mechanisms insist unlocking of all read
2500and write locks of transactions at the end of commit?
2501Answer: 2 Phase Locking
2502451.
2503While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in the
2504sequence shown, the element in the lowest level is
2505Answer: 67
2506452.
2507The number of inputs, minterms in full adder is
2508Answer : 3,
2509453.
2510The major difference between a moore and mealy machine is that
2511The output of the moore machine depends only on the current state
2512454.
2513The process of analyzing the given relation schemas based on their functional
2514dependencies is known as
2515Normalization
2516455.
2517The main function of dispatcher is:
2518The main function of the dispatcher (the portion of the process scheduler)
2519is assigning ready process to the CPU.
2520456.
2521A complex low pass signal has a bandwidth of 100kHz. What is the minimum sampling rate for
2522this signal
2523Answer: 200000 samples ( 2 times the bandwidth)
2524457.
2525Which of the following sorting algorithms has the lowest worst-case complexity?
2526Merge Sort
2527458.
2528What is the difference between CSMA/CD and ALOHA?
2529Main difference between Aloha and CSMA is that Aloha protocol does not try to
2530detect whether the channel is free before transmitting but the CSMA protocol
2531verifies that the channel is free before transmitting data.
2532459.
2533X=1010100 and Y=1000011 using 2's complement X-Y is
2534Answer: 10001
2535460.
2536Consider ?n? processes sharing the CPU in a round robin fashion. Assume that the context
2537switch takes ?s? seconds. What must be the quantum ?q? such that the overhead of context
2538switching is minimized and at same time each process is getting guaranteed execution on the
2539CPU atleast once in every ?t? seconds?
2540ANSWER: q<=((t-ns)/n-1)
2541461.
2542Which one of the following is the recurrence equation for the worst case time complexity of the
2543Quicksort algorithm for sorting n(≥ 2) numbers? In the recurrence equations given in the options
2544below, c is a constant.
2545T(n) = T(n – 1) + T(0) + cn
2546462.
2547What operator performs pattern matching?
2548Answer: LIKE
2549463.
2550Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?
2551Answer: 3
2552464.
2553What is the content of Stack Pointer (SP)?
2554The Stack Pointer is used to indicate where the next value to be removed from
2555the stack should be taken from.
2556465.
2557Identify the minimal key for relational scheme R(A, B, C, D, E) with functional
2558dependencies F = {A → B, B → C, AC → D}
2559466.
2560A heap memory area is used to store the
2561467.
2562If user A wants to send an encrypted message to user B. The plain text of A is encrypted with the
2563_______.
2564Answer: Public Key of User B
2565468.
2566The minimum number of JK flip-flops required to construct a synchronous counter with the count
2567sequence (0,0, 1, 1, 2, 2, 3, 3, 0, 0,??.) is
25683 flip flops
2569469.
2570For an undirected graph with n vertices and e edges, the sum of the degree of each vertex
2571isequal to
2572Answer : 2e
2573470.
2574Programs tend to make memory accesses that are in proximity of previous access this is called
2575spatial locality
2576471.
2577________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
2578Long Term Scheduler
2579472.
2580The best normal form of relation scheme R (A, B, C, D) along with the set of functional
2581dependencies F = {AB →C, AB → D, C → A, D → B} is
2582Third Normal Form
2583473.
2584Mnemonic codes and variable names are used in
2585Assembly Language
2586474.
2587Time required to merge two sorted lists of size m and n, is
2588475.
2589What happens to destination address in the header of a packet in a datagram network ?
2590476.
2591___________ mechanism is used for converting a weak entity set into
2592strong entity set in entity-relationship diagram
2593Adding suitable attributes
2594477.
2595Which of the following disk seek algorithms would be the best choice to implement in a
2596system that services an average of 5 disk requests per second
2597478.
2598_________ register keeps track of the instructions stored in program stored in memory.
2599Program Counter
2600479.
2601Bayone-Neill-Concelman(BNC) connectors are used with which type of cables
2602Coaxial Cable
2603480.
2604Which of the following disk seek algorithms has the most variability in response time?
2605481.
2606What data structure is used for depth first traversal of a graph?
2607Stack
2608482.
2609Division operation is ideally suited to handle queries of the type:
2610Division identify the attribute values from relation that are found
2611to be paired with all of the values from the other relation.
2612Customers who have no account in any of the branches in Delhi.
2613Customers who have an account at all branches in Delhi.
2614Customers who have an account in atleast one branch in Delhi.
2615Customers who have only joint account in any one branch in Delhi
2616483.
2617A clustering index is created when _______.
2618Foreign key ordered
2619484.
2620In TDM Data rate management is done by which of these strategies
2621A. Multilevel multiplexing
2622B. Multi-slot allocation
2623C. Pulse stuffing
2624D. all of the above
2625485.
2626Graph traversal is different from a tree traversal, because
2627486.
2628Which of the following instructions should be allowed only in Kernel Mode?
2629(a) Disable all interrupts
2630(b) Read the time-of-day clock
2631(c) Set the time-of-day clock
2632(d) Change the memory map (Answer: A, C & D)
2633487.
2634One operation that is not given by magnitude comparator
2635A. equal
2636B. less
2637C. greater
2638D. addition
2639488.
2640Supervisor call
2641489.
2642Re-balancing of AVL tree costs
2643490.
2644Consider a B+ tree in which the search Answer is 12 bytes long, block size is 1024 bytes,record
2645pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can
2646be accommodated in each non-leaf node of the tree is ____ .
2647Answer: 50
2648491.
2649After fetching the instruction from the memory, the binary code of the
2650instruction goes to
2651492.
2652Which of these is correct for synchronous Time Division Multiplexing
2653Data rate of link is n times faster and the unit duration is n times shorter
2654493.
2655In communication satellite, multiple repeaters are known as?
2656Transponders
2657494.
2658Table that is not a part of asynchronous analysis procedure
2659A. transition table
2660B. state table
2661C. flow table
2662D. excitation table
2663495.
2664This Key Uniquely Identifies Each Record
2665Primary Key
2666496.
2667Paging suffer from ………………..
2668Internal Fragmentation
2669497.
2670How many swaps are required to sort the given array using bubble
2671sort - { 2, 5, 1, 3, 4}
2672498.
2673Error detection at the data link layer is achieved by?
2674Cyclic Redundancy Code
2675499.
2676The O notation in asymptotic evaluation represents
2677he Big O notation defines an upper bound of an algorithm
2678500.
2679Which of the following provides interface (UI) between user and OS
2680Shell
2681501.
2682_________ register keeps track of the instructions stored in program stored in
2683memory.
2684Program Counter
2685502.
2686Which of the following is not a function of a DBA?
2687Application Creation
2688503.
2689Assume a relation R with keys X, Y and Z, where X, Y, and Z are sets of one or more attributes.
2690Also assume that Y is a subset or equal to X and Z is a subset of X and Y. Which of the following
2691is true for this case?
2692Y and Z are candidate Keys of R
2693504.
2694What is a shell ?
2695
2696 Shell is a UNIX term for the interactive user interface with an operating system
2697
2698 
2699505.
2700Baud means?
27011. a unit of transmission speed equal to the number of times a signal changes state per
2702second. For signals with only two possible states one baud is equivalent to one bit
2703per second.
2704506.
2705A group of bits that tell the computer to perform a specific operation is known as
2706Instruction Code
2707507.
2708Recursion uses more memory space than iteration because
2709Every Recursive call has to be stored
2710508.
2711A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order
2712traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in
2713that order. The level-order traversal of the heap after the insertion of the elements is:
2714509.
2715We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then
2716repeats. The minimum number of J-K flip-flops required to implement this counter is
2717Answer: 4
2718510.
2719You have 10 users plugged into a hub running 10Mbps half-duplex. There is a server connected
2720to the switch running 10Mbps half-duplex as well. How much bandwidth does each host have to
2721the server?
272210 Mbps
2723511.
2724A system has a resource ‘Z’ with 20 instances; each process needs 5 instances to complete its
2725execution. What is the minimum process in the system that may cause deadlock?
27265 Processes
2727512.
2728The constraint ?primary key cannot be null? is called as?
2729Not Null COnstraint
2730513.
2731In Multi-Processing Operating Systems:
2732Maximum Utilization of CPU can be achieved
2733514.
2734A circuit produces 1's complement of the input word, one application is binary subtraction. It is
2735called
2736(A) Logic gate
2737(B) Register
2738(C) Multiplexer
2739(D) BCD converter
2740515.
2741A station in a network forwards incoming packets by placing them on its shortest output queue.
2742What routing algorithm is being used?
2743Hot Potato Routing
2744516.
2745Assume that a mergesort algorithm in the worst case takes 30 second for an input of size 64.
2746Which of the following most closely approximates the maximum input size of a problem that can
2747be solved in 6 minutes?
2748Answer: 512
2749517.
2750The cartesian product ,followed by select is equivalent to
2751Answer :Join
2752518.
2753If a , b , c, are three nodes connected in sequence in a singly linked list, what is
2754the statement to be added to change this into a circular linked list?
2755a) $$$
2756b) $$
2757c) NULL
2758d) error
2759519.
2760The Internet Control Message Protocol (ICMP)
2761520.
2762In a digital counter circuit feedback loop is introduced to
2763A:improve distortion
2764B:improve stability
2765C:reduce the number of input pulses to reset the counter
2766D:synchronous input and output pulses
2767521.
2768Consider the virtual page reference string
27691,2,3,2,4,1,3,2,4,1
2770on a demand paged virtual memory system running on a computer system that has main
2771memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the
2772number of page faults under the corresponding page replacement policy. Then
2773(A) OPTIMAL < LRU < FIFO
2774(B) OPTIMAL < FIFO < LRU
2775(C) OPTIMAL = LRU
2776(D) OPTIMAL = FIFO
2777522.
2778A data dictionary does not provide information about
2779Answer : Size of storage disk.
2780523.
2781How many illegitimate states has synchronous mod-6 counter ?
2782A.3 (Answer)
2783B.2
2784C.1
2785D.6
2786524.
2787For the array (77 ,62,114,80,9,30,99), write the order of the elements after two passes using the
2788Radix sort
2789114, 30, 62, 77, 9, 99
2790525.
2791Which of the following technique is used for fragment?
2792one of the pieces that results when an IP gateway divides an IP datagram into
2793smaller pieces for transmission across a network that cannot handle the
2794original datagram size
2795526.
2796Which of the following RDBMS does not incorporate relational algebra
2797527.
2798Which scheduling policy is most suitable for a time-shared operating system?
2799Preemptive scheduling
2800528.
2801When you ping the loopback address, a packet is sent where?
2802Answer: Down through the layers of IP architecture and then up the layers
2803again
2804529.
2805Round robin scheduling is essentially the preemptive version of __________
2806ANSWER: FIFO
2807530.
2808A ring counter is same as
2809531.
2810Which of these is asymptotically bigger?
2811Answer: 6*2^n
2812532.
2813Which of the following is not a property of DBMS?
2814A). INCREASE DATE REDUNDONCY.
2815B).INTERGRATION OF DATA.
2816C).IMPROVED IN SECURITY.
2817D).ACHIEVING DATA INDEPENDENCE,
2818533.
2819In the blocked state
2820the processes waiting for I/O are found
2821the process which is running is found
2822the processes waiting for the processor are found
2823the process ready to execute
2824534.
2825Which of the following devices assigns IP address to devices connected to a network that uses
2826TCP/IP?
2827DHCP Server
2828535.
2829The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42.
2830Which one of the following is the postorder traversal sequence of the same tree?
2831536.
2832A sequential circuit outputs a ONE when an even number (> 0) of one's are input; otherwise the
2833output is ZERO. The minimum number of states required is
2834Answer : 2
2835537.
2836In which category does the discrepancy between duplicate records belong?
2837538.
2838Data Structures and Algorithms:
2839In a min-heap:
2840parent nodes have values less than or equal to their children
2841539.
2842Which of the following technique is used for Time-To-Line (TTL)?
2843a technique used in best-effort delivery system to avoid endlessly
2844looping packets.
2845540.
2846A page fault occurs
2847When the page is not in the memory
2848541.
2849To build a mod-19 counter the number of flip-flops required is
28505 Flip Flops
2851542.
2852The cartesian product ,followed by select is equivalent to
2853Answer: Join
2854543.
2855The number of clock pulses needed to shift one byte of data from input to the output of a 4-bit
2856shift register is
285716 Clock Pulses
2858544.
2859Consider the following New-order strategy for traversing a binary tree:
28601)Visit the root;
28612)Visit the right subtree using New-order;
28623)Visit the left subtree using New-order;
2863The New-order traversal of the expression tree corresponding to the reverse polish expression 3
28644 * 5 - 2 ? 6 7 * 1 + - is given by:
2865Answer : - + 1 * 7 6 ^ 2 - 5 * 4 3
2866545.
2867Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format.
2868The main program is loaded into memory & is executed. This type of loading is called _________
2869Dynamic Linking
2870546.
2871You are trying to decide which type of network you will use at your office, and you want the type
2872that will provide communication and avoid collisions on the cable. Which of the following is the
2873best choice?
2874Token Ring
2875547.
2876Which of the following is not a property of DBMS?
2877548.
2878You are working with a network that has the network ID 172.16.0.0, and you require 25 subnets
2879for your company and an additional 30 for the company that will merge with you within a month.
2880Each network will contain approximately 600 nodes. What subnet mask should you assign?
2881255.255.252.0
2882549.
2883_________________ constraint is specified between two relations and is used to maintain the
2884consistency among tuples of the two relations
2885Referential Integrity
2886550.
2887If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the
2888disk queue of I/O blocks requests are 98,37,14,124,65,67.
2889Answer: 321
2890551.
2891For non-negative functions, f(n) and g(n), f(n) is theta of g(n) if and only if
2892552.
2893The main difference between JK and RS flip-flop is that
2894553.
2895The sign magnitude representation of binary number + 1101.011 is
2896Answer: 01101.011
2897554.
2898Minimum number of moves required to solve a Tower of Hanoi puzzle is
2899Answer: 2^n - 1
2900555.
2901The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting.
2902The Statement is true
2903556.
2904Parity bit is
29051. a bit which acts as a check on a set of binary values, calculated in such a way
2906that the number of 1s in the set plus the parity bit should always be even (or
2907occasionally, should always be odd).
2908557.
2909Changing the conceptual schema without having to change the external schema is
2910called as _________________
2911Physical Data Independence
2912558.
2913The problem of thrashing is effected scientifically by _____Program Strructure.
2914559.
2915A sort which relatively passes through a list to exchange the first element with any element less
2916than it and then repeats with a new first element is called
2917quick sort
2918560.
2919Update operation will violate
2920561.
2921When an inverter is placed between both inputs of an SR flip-flop, then resulting flip-lop is
2922D Flip Flop
2923562.
2924Ethernet and Token-Ring are the two most commonly used network architectures in the world.
2925Jim has heard of the different topologies for networks and wants to choose the architecture that
2926will provide him with the most options. Which of the following would that be? Choose the most
2927correct answer.
2928Ethernet, because it can be set up with most topologies and can use multiple transfer
2929speeds
2930563.
2931A 2 MHz signal is applied to the input of a J-K lip-lop which is operating in the 'toggle' mode. The
2932frequency of the signal at the output will be
2933Answer: 2 MHz
2934564.
2935CSMA (Carrier Sense Multiple Access) is
2936Media Access control protocol
2937565.
2938---------------------is data about data
2939Metadata
2940566.
2941Which module gives control of the CPU to the process selected by the short-term scheduler?
2942Dispatcher
2943567.
2944The searching technique that takes O (1) time to find a data is
2945Hashing
2946568.
2947The master slave JK lip-flop is effectively a combination of
2948569.
2949The mechanism that bring a page into memory only when it is needed is called _____________
2950Demand Paging
2951570.
2952The main difference between synchronous and asynchronous transmission is
2953SR and T Flip FLop
2954571.
2955Let R be the relation on the set of positive integers such that a aRb if and only if a and b are
2956distinct and have a common divisor other than 1. Which one of the following statements about R
2957is true?
2958572.
2959What technique is often used to prove the correctness of a recursive function?
2960A. Communitivity.
2961ï‚· B. Diagonalization.
2962ï‚· C. Mathematical induction.
2963ï‚· D. Matrix Multiplication.
2964573.
2965The command which undo the transaction is
2966Undo-Transaction command
2967574.
2968Which of the following is a Non-linear data structure
2969None of the above
2970575.
2971Which directory implementation is used in most Operating System?
2972Tree Directory Structure
2973576.
2974Which of the following is not true of virtual memory?
2975Virtual memory allows more efficient use of memeory( Actually, it doesn’t)
2976577.
2977ARP (Address Resolution Protocol) is
2978578.
2979A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the
2980output bit-string after stuffing is 01111100101, then the input bit-string is
2981Answer: 0111110101
2982579.
29831. If a sequence of push(1), push(2), pop,push(1),push(2),pop,pop,pop, push(2) pop operations
2984are performed in a stack , the sequence of popped out values are
29852 2 1 1 2
2986580.
2987Changing the conceptual schema without having to change physical schema is
2988Logical Data Independence
2989581.
2990When two or more processes trying to execute a set of instructions and if the output depends on
2991the order of execution of the process, this is termed as:
2992582.
2993With a single resource, deadlock occurs,
2994583.
2995The best index for range query is
2996584.
2997A system has ‘n’ processes and each process need 2 instances of a resource. There are n+1
2998instances of resource provided. This could:
2999585.
3000How switching is performed in the internet?
3001586.
30021. You are given pointer p that points to the last node in a circular list and another singly linked
3003list whose first node is pointed to by ‘head’ and last node is pointed to by ‘tail’ has to be
3004appended to the end of the circular list. Which of the following is correct?
3005587.
3006Which of the following is shared between all of the threads in a process? Assume a kernel
3007level thread implementation.
3008588.
3009A telephone switch is a good example of which of the following types of switches.
3010589.
3011 Among the following which is not the application of a stack?
3012590.
3013Commit, Savepoint, Rollback are ________
3014TCL Commands
3015591.
3016Which of the following is shared between all of the threads in a process? Assume a kernel
3017level thread implementation.
3018592.
3019In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
3020compared with the priority of
3021Currently Running Process
3022593.
3023The performance of cache memory is frequently measured in terms of a quantity called
3024Hit Ratio
3025594.
3026You are given pointers to first and last nodes of a singly linked list, which of the following
3027operations are dependent on the length of the linked list?
3028Delete the last element of the list
3029595.
3030R right outer join S on a=b gives
3031596.
3032the following pairs of OSI protocol layer/sub-layer and its functionality,
3033the INCORRECT pair is
3034Data Link Layer and Bit synchronization
3035597.
3036Consider a system with ‘M’ CPU processors and ‘N’ processes then how many processes can be
3037present in ready, running and blocked state at maximum
3038lets say you have n number of cpu and p number of processes
3039ready state the mininum number of processes = 0, maximum = M
3040run state the mininum number of processes = 0, maximum = M (at the run state the
3041maximum number of process cannot be p or 0 because we have cpu bound processes.
3042that is n ……..p depicts number of i/o bound processes)
3043at wait state the mininum number of processes = 0, maximum = N
3044598.
3045Four jobs to be executed on a single processor system arrive at time 0 in order A, B, C, and D.
3046Their burst time requirements are 4,1,8,1 time units respectively. Find the completion of A under
3047round robin scheduling with time slice of one time unit.
30489 Units
3049599.
3050Which one of the following protocols is NOT used to resolve one form of address to another
3051one?
3052DHCP
3053600.
3054What is the software that runs a computer, including scheduling tasks, managing storage, and
3055handling communication with peripherals?
3056Operating System
3057601.
30581. If a , b , c, are three nodes connected in sequence in a singly linked list
3059 struct node *temp=a;
3060 while(temp!=NULL) {
3061 temp=temp->next; printf( “$”); }
3062Assuming ‘c’ to be the last node, the output is $$$
3063602.
3064This user makes canned transaction naïve or end user
3065603.
3066For 3 page frames, the following is the reference string:
30677 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1.
3068How many page faults does the FIFO page replacement algorithm produce?
306915
3070604.
3071Buffering is useful because it allows devices and the CPU to operate asynchronously
3072605.
3073What does the code snippet given below do?
3074void fun1(struct node *head)
3075{ if(head==NULL) return;
3076fun1(head->next);
3077printf("%d",head->data);
3078}
3079Fun1() prints the given Linked List in reverse manner
3080606.
3081The transport layer protocols used for real time multimedia, file transfer, DNS and email,
3082respectively are
3083UDP, TCP, UDP and TCP
3084For real time multimedia, timely delivery is more important than correctness. –> UDP
3085For file transfer, correctness is necessary. –> TCP
3086DNS, timely delivery is more important –> UDP
3087Email again same as file transfer –> TCP
3088607.
3089This Key Uniquely Identifies Each Record
3090Primary Key
3091608.
3092What is the main difference between traps and interrupts?
3093How they are initiated
3094609.
3095Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the
3096First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K, and 426K (in
3097order)? Which algorithm makes the most efficient use of memory?
3098First-fit:
3099212k -> 500K (288 left)
3100417k -> 600k (183 left)
3101122k -> 288k (166k left)
3102426k -> nowhere big enough left! doh!
3103Best-fit:
3104212k -> 300k (88k left)
3105417k -> 500k (83k left)
3106122k -> 200k (78k left)
3107426k -> 600k (174k left)
3108Worst-fit:
3109212k -> 600k (388k left) 
3110417k -> 500k (83k left)
3111122k -> 388k (266k left)
3112426k -> nowhere big enough again!
3113the best fit algorithms uses memory most efficiently (it's also the only one that can even put all
3114the processes into memory!)
3115610.
3116Which of the following transport layer protocols is used to support electronic mail?
3117TCP(transport layer) SMTP(application layer)
3118611.
3119The following query is called as ? select * from emp where ssn in ( select dssn from dependent
3120order by age desc ) ?;
3121DML query
3122612.
3123Which of the following is termed as reverse polish notation?
3124Any postfix notation
3125613.
3126In one of the pairs of protocols given below, both the protocols can use multiple TCP
3127connections between the same client and the server. Which one is that?
3128SMTP: only one TCP connection
3129Telnet: only one TCP connection
3130HTTP: Multiple connections can be used for each resource
3131FTP: FTP uses Telnet protocol for Control info on a TCP connection and another TCP
3132connection for data exchange
3133So, answer is HTTP and FTP
3134614.
3135The term P means in semaphores
3136Wait(probheer)
3137615.
3138If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the
3139service provided is for
3140Higher priority
3141616.
3142The data type describing the types of values that can appear in each column is
3143called ______________________.
3144domain
3145617.
3146For the given infix expression a+b^c*(d-e) where ‘^’ denotes the EX-OR operator, the
3147 corresponding prefix expression is
3148^+ab*c-de
3149618.
3150Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following
3151statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S);
3152respectively. The above situation depicts a _________ .
3153deadlock
3154619.
3155The query to print alternate records (i.e even numbered) from a table is
3156Select * from TableName where ColumnName % 2 = 0(even number)
3157SELECT usernameFROM (SELECT ROWNUM num, usernameFROM dba_users)
3158WHERE MOD (num, 2) = 0;(even number)
3159Select * from TableName where ColumnName % 2 = 1(odd number)
3160620.
3161A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of
31628 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number
3163of bits for the TAG field is
3164Number of sets = cache size / sizeof a set
3165Size of a set = blocksize * no. of blocks in a set
3166= 8 words * 4 (4-way set-associative)
3167= 8*4*4 (since a word is 32 bits = 4 bytes)
3168= 128 bytes.
3169So, number of sets = 16 KB / (128 B) = 128
3170Now, we can divide the physical address space equally between these 128 sets. So, the number
3171of bytes each set can access
3172= 4 GB / 128
3173= 32 MB
3174= 32/4 = 8 M words = 1 M blocks. (220 blocks)
3175So, we need 20 tag bits to identify these 220 blocks.
3176621.
3177Which of the following is two way list?
3178None of the above
3179622.
3180The protocol data unit (PDU) for the application layer in the Internet stack is
3181Message
3182623.
3183In an Ethernet local area network, which one of the following statements isTRUE?
3184The exponential backoff mechanism reduces the probability of collision on
3185retransmissions
3186624.
3187Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method.
3188There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for
3189intermediate results. Assuming size(r(R))
3190relation r(R) is in the outer loop.
3191625.
3192An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of
3193processes is ________.
3194SJF
3195626.
3196In the process state transition diagram, the transition from the READY state to the
3197RUNNING state indicates that:
3198the process in the running state can be preempted and brought back to ready state.
3199627.
32001. A circularly linked list is used to represent a Queue. A single variable p is used to access the
3201Queue. To which node should p point such that both the operations enQueue and deQueue
3202can be performed in constant time?
3203Rear node
3204628.
3205Consider the following four schedules due to three transactions (indicated by the subscript) using
3206read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is
3207conflict serializable?
3208Answer : D
3209629.
3210The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage
3211(with delay 800 picoseconds) is replaced with a functionally equivalent design involving two
3212stages with respective delays 600 and 350 picoseconds. The throughput increase of the pipeline
3213is percent
321433.33
3215630.
3216In the IPv4 addressing format, the number of networks allowed under Class C addresses is
32172^21
3218631.
32191. If a sequence of enque(1), enque (2), deque, enque (1), enque (2), deque, deque, deque,
3220enque (2) operations are performed in a queue , the list of elements that would have been
3221processed are
3222632.
3223Which of the following is not true about segmented memory management?
3224virtual memory is used only in multi-user systems
3225633.
3226R has n tuples and S has m tuples, then the Cartesian product of R and S will
3227produce ___________ tuples.
3228m*n
3229634.
32301. In a circular list with 5 nodes, let ‘temp’ point to the 4th node at present.
3231int i;
3232for(i=0;i<4;i++)
3233 temp=temp->next;
3234The above code will make ‘temp’ point to
32353
3236rd Node
3237635.
3238What is the main difference between traps and interrupts?
3239Trap is s/w generated. Interrupt is h/w generated.
3240636.
3241IEEE 802.5 is a _______________
3242Token Ring related
3243637.
3244Which one of the following fields of an IP header is NOT modified by a typical IP router?
3245Source Address
3246638.
3247Minimal super key of a relation is called _______________.
3248Candidate key
3249639.
3250For what value of c1 and c2 , the theta notation of f(n)=5n2+3n+2 is n2?
3251640.
3252When a program tries to access a page that is mapped in address space but not loaded
3253in physical memory, then
3254Page fault occurs
3255641.
3256The main advantage of DMA is that it
3257High transfer rates
3258642.
3259If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum
3260number of hosts per subnet?
32612046
3262643.
3263A typical hard drive has a peak throughput of about
3264600 mbps (not sure)
3265644.
3266Which algorithm chooses the page that has not been used for the longest period of time
3267whenever the page required to be replaced?
3268LRU
3269645.
3270Consider a relation R (A, B, C, D, E) with set of functional dependencies F = {A¿BC, CD¿E,
3271B¿D, E¿A}. Which of the following is one of the candidate keys of R?
3272The candidate keys are A, E, CD, and BC
3273646.
32741. Consider a dynamic queue with two pointers: front and rear. What is the time needed
3275to insert an element in a queue of length of n?
3276O(1). Insert element at rear.
3277647.
3278DMA is useful for the operations
3279DMA is useful for transferring data between memory and devices if large volume of data is to be
3280transferred, or the devices have small response times. Because after setting up buffers, pointers,
3281and counters for the I/O device, the device controller transfers an entire block of data directly to
3282or from its own buffer storage to memory, with no intervention by the CPU. Only one interrupt is
3283generated per block, rather than the one interrupt per byte (or word) generated for low-speed
3284devices.
3285Alternatively, you may simply say:
3286DMA is useful for transferring large quantities of data between memory and devices. It eliminates
3287the need for the CPU to be involved in the transfer, allowing the transfer to complete more
3288quickly and the CPU to perform other tasks concurrently.
3289648.
32901. Which sorting technique uses a data structure similar to the one used in bucket hashing?
3291Bucket sort
3292649.
3293How many address bits are needed to select all memory locations in the 16K × 1 RAM?
329414
3295650.
3296RAID is a way to:
3297RAID is the way of combining several independent and relatively small disks into a single
3298storage of a large size. The disks included into the array are called array members. The disks
3299can be combined into the array in different ways which are known as RAID levels.
3300651.
3301Assume that source S and destination D are connected through two intermediate routers labeled
3302R. Determine how many times each packet hasto visit the network layer and the data link layer
3303during a transmission from S to D.
3304Network layer – 4 times and Data link layer – 6 times
3305652.
3306__________is the description of the database
3307653.
3308Identify the correct sequence in which the following packets are transmitted on the network by
3309a host when a browser requests a webpage from a remote server, assuming that the host has
3310just been restarted.
3311DNS query, TCP SYN, HTTP GET request
3312654.
33131. On adopting shell sort technique, the output of the array (21,62,14,9,30,77,80,25) after a pass
3314with increment size =3, is
3315655.
3316Which of these would not be a good way for the OS to improve battery lifetime in a
3317laptop?
3318656.
3319Which of the following is not included in an inode in Linux?
3320File name and directory
3321657.
3322The DMA controller has _______ registers
33233
3324658.
3325Consider a relational table with the schema R (A, B, C). Assume that the cardinality of attribute A
3326is 10, B is 20, and C is 5. What is the maximum number of records R can have without duplicate?
33271000
3328659.
3329An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an
3330IPpacket of size 4404 bytes with an IP header of length 20 bytes. The values of the
3331relevant fields in the header of the third IP fragment generated by the router for this packet are
3332MF bit: 0, Datagram Length: 1444; Offset: 370
3333660.
33341. For the array , (77 ,62,114,80,9,30,99), write the order of the elements after two passes
3335 using the Radix sort.
3336661.
3337What is the correct HTML for making a hyperlink?
3338a href = “”
3339662.
3340One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the
3341following statements best explains the need for this field?
3342It can be used to prevent packet looping
3343663.
3344Assume relations R and S with the schemas R (A, B, C) and S (B, D). Which of the following is
3345equivalent to r ¿ s?
3346664.
3347A Program Counter contains a number 825 and address part of the instruction contains the
3348number 24. The effective address in the relative address mode, when an instruction is read from
3349the memory is
3350849
3351665.
33521. Time complexity of the program to generate Fibonacci sequence is
3353T(n) = T(n-1) + T(n-2) which is exponential.
3354Or O(n)
3355666.
3356Which one of the following is NOT a part of the ACID properties of database transactions?
3357Atomicity, Consistency, Isolation, durability
3358667.
33591. While applying Quick sort technique for the array 5 4 3 8 12 6 10 1 7 9, if pivot =5, after the first
3360traversal on both sides, ‘l’ and ‘r’ will be
33615 4 3 1 12 6 10 8 7 9
3362668.
3363When process requests for a DMA transfer ,
3364process is temporarily suspended and another process gets executed.
3365669.
3366How switching is performed in the internet?
3367Packet Switching
3368670.
3369The <big> tag makes
3370the text bigger than the normal. Not supported in HTML 5
3371671.
33721. If a[] is the array containing the elements to be sorted using radix sort, during the second
3373iteration in which the second Least Significant Digit is considered, row number in 2D array to
3374which an element has to be stored is given by
3375672.
3376Which of following property returns the window object generated by a frame object
3377contentWindow
3378673.
3379Foreign key is a subset of primary key is stated in _____________ constraint
3380Foreign Key
3381674.
3382What is the unique characteristic of RAID 6 ?
3383Two independent distributed parity.
3384675.
3385A layer -4 firewall (a device that can look at all protocol headers up to the transport layer)
3386CANNOT
3387Block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00AM
3388676.
3389Which of the following address modes calculate the effective address as
3390address part of the instruction) + (content of CPU register)
3391. Indirect Address Mode
3392677.
3393A telephone switch is a good example of which of the following types of switches.
3394circuit
3395678.
3396Which component of a database is used for sorting?
3397procedure
3398679.
33991What is the output of following JavaScript code
3400680.
3401If a , b , c, d are four nodes connected in sequence in a doubly-linked list
3402 Struct node *temp=a;
3403 Temp=temp->next;
3404 (Temp->next)->prev=temp->prev;
3405 (Temp->prev)->next=temp->next; Which of the following is true?
3406B is deleted from the list
3407681.
3408The load instruction is mostly used to designate a transfer from memory to a
3409processor register known as
3410accumulator
3411682.
3412You can refresh the web page in javascript by using ................ method.
3413Reload()
3414683.
3415The max-heap for the array ( 4, 3, 1, 5, 9, 2, 8 ) is
34169
3417 5 8
34183 4 1 2
3419684.
3420If message in Segmentation and Reassembly (SAR) sub layer of Application Adaptation
3421Layer 3/4 has value of Segment type is 11 then it is called a
3422single segment message.
3423685.
3424Consider the following relation
3425Cinema (theater, address, capacity)
3426Which of the following options will be needed at the end of the SQL query
3427SELECT P1. address
3428FROM Cinema P1
3429Such that it always finds the addresses of theaters with maximum capacity?
3430WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)613.
3431686.
3432In Circuit Switching, resources need to be reserved during the
3433Setup phase
3434687.
3435The load instruction is mostly used to designate a transfer from memory to a processor register
3436known as____.
3437accumulator
3438688.
3439Which of the following is the correct way for writing JavaScript array?
3440var txt = new Array("arr ","kim","jim")
3441689.
3442Among the following ,which has the highest time complexity O(n2
3443) in all the three
3444 cases.(Worst,average and best) and cannot be improved?
3445690.
3446Which of the following relational algebra operations do not require the participating tables to be
3447union-compatible?
3448Join
3449691.
3450In RMI Architecture which layer Intercepts method calls made by the client/redirects these calls
3451to a remote RMI service?
3452Stub and Skeleton layer
3453692.
3454Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on
3455R.
3456It will immediately be granted
3457693.
3458A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output
3459bit-string after stuffing is 01111100101, then the input bit-string is
34600111110101
3461694.
3462For an algorithm whose step-count is 45n3+34n , choose the correct statement.
3463695.
3464What is the output of following JavaScript code
3465696.
3466Relations produced from an E-R model will always be
3467697.
3468How do you put a message in the browser's status bar?
3469window.status = "put your message here"
3470698.
3471Congestion control and quality of service is qualities of the
3472ATM
3473699.
3474If the associativity of a processor cache is doubled while keeping the capacity and block size
3475unchanged, which one of the following is guaranteed to be NOT affected?
3476Width of processor to main memory data bus
3477700.
3478If the element 12 has to be searched in the array (2,4,8, 9,14,16, 18), using binary
3479 search, the result can be obtained within _____ comparisons.
34803
3481701.
3482A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
3483page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
3484maximum size of the page table of a process is 24 megabytes, the length of the virtual address
3485supported by the system is _________ bits.
348636
3487702.
3488Which two files are used during operation of the DBMS?
3489data dictionary and transaction log
3490703.
3491In the following pairs of OSI protocol layer/sub-layer and its functionality,
3492the INCORRECT pair is
3493Data Link Layer and Bit Synchronization
3494704.
3495What is the output of following JavaScript code?
3496705.
34971. For the array , (77 ,62,14,80,9,30,99) , if Quick sort technique is followed,what will be
3498 the array status after placing the first pivot element in its appropriate place?
349962,14,9,30,77,80,99
3500706.
3501What is the correct JavaScript syntax to write "Hello World"
3502document. write("Hello World");
3503707.
3504The local host and the remote host are defined using IP addresses. To define the processes,
3505we need second identifiers called.........
3506UDP Addresses
3507708.
3508The number of outputs in n-input decoder is
35092^n
3510709.
3511Which two RAID types use parity for data protection?
3512RAID 4 and RAID 5
3513710.
3514Rotation method of hashing is usually combined with other hashing techniques except
3515Last character
3516711.
3517The two's complement of 101011 is
3518010101
3519712.
3520----------------------is a description of the database
3521Schema
3522713.
3523Browsers typically render text wrapped in ___________ tags as an indented paragraph.
3524<blockquote>
3525714.
3526Which one of the following protocols is NOT used to resolve one form of address to another
3527one?
3528DHCP
3529715.
35301. Among the following sorting techniques ,which has its time complexity as O(n) in the 
3531 best-case?
3532Insertion,Bubble
3533716.
3534-------involves finding the best line to fit two attributes so that one attribute is used to predict
3535another attribute.
3536Linear Regression
3537717.
3538The number of boolean functions in n-variables is
3539(2^(2^n))
3540718.
3541UDP uses........ to handle outgoing user datagrams from multiple processes on one host.
3542Multiplexing
3543719.
3544Who invented the JavaScript programming language?
3545Brendan Eich
3546720.
3547Java package is a grouping mechanism with the purpose of
3548Controlling the visibility of classes, interface and methods
3549721.
3550A heap memory area is used to store the
3551Heap memory is used for dynamic memory allocation
3552722.
3553The transport layer protocols used for real time multimedia, file transfer, DNS and email,
3554respectively are
3555(A) TCP, UDP, UDP and TCP
3556(B) UDP, TCP, TCP and UDP
3557(C) UDP, TCP, UDP and TCP
3558(D) TCP, UDP, TCP and UDP
3559Answer: (C)
3560723.
3561What is the output of following JavaScript code?
3562Output : 44
3563724.
3564The lifetime of flash memory is ---------------------
3565Lifetime of a flash memory is long.
3566725.
3567A schema describes
3568A. Record & files
3569B. data elements
3570C. record relationships
3571D. all of the above
3572Ans Correct Answer is d
3573726.
3574What is the output of following JavaScript code
3575727.
3576The ......... protocol defines a set of messages sent over either User Datagram Protocol (UDP)
3577port53 or Transmission Control Protocol(TCP) port53.
3578A. Name space
3579B. DNS
3580C. Domain space
3581D. Zone transfer
3582Ans: B. DNS
3583728.
3584What is the multiplexer used for?
3585a) It is a type of decoder which decodes several inputs and gives one output
3586b) A multiplexer is a device which converts many signals into one
3587c) It takes one input and results into many output
3588d) None of the Mentioned
3589Ans. B
3590729.
3591Which of the following is true for the given tree?
3592730.
3593Trigger is a
3594Trigger is a special kind of a store procedure that executes in response to certain action on the
3595table like insertion, deletion or updation of data
3596731.
3597Which of the following transport layer protocols is used to support electronic mail?
3598(A) SMTP
3599(B) IP
3600(C) TCP
3601(D) UDP
3602Answer (C)
3603E-mail uses SMTP as application layer protocol. SMTP uses TCP as transport layer
3604protocol.
3605732.
3606What will be printed as the output of the following program?
3607public class testincr
3608 {
3609 public static void main(String args[])
3610 {
3611 int i = 0;
3612 i = i++ + i;
3613 System.out.println(" I = " +i);
3614 }
3615 }
3616Output: I = 1
3617733.
3618Identify the addressing mode of the following instruction
3619Add R1, R2, R3
3620where R1, R2 are operands and R3 destination
3621Answer : Three-Address Instructions
3622734.
3623R left outer join S on a=b gives
3624No table given
3625735.
3626What is the output of following JavaScript code
3627Output : N
3628736.
3629Foreign key is a subset of primary key is stated in -----------constraint
3630737.
3631What is the output of following JavaScript code
3632738.
3633When a network interface has a failure in its circuitry, it sends a continuous stream of frames
3634causing the Ethernet LAN to enter a Collapse state. This condition is known as __________.
3635a.Scattering
3636b.Jabbering
3637c.Blocking
3638d.Refreshing
3639Ans: b.Jabbering
3640739.
3641To prevent any method from overriding, the method has to declared as,
3642And: Method is declared with a ‘final’ keyword
3643740.
3644Which of the following addressing modes has minimum number of memory access to access the
3645operands?
3646A. Indirect
3647B. Direct
3648C. Indexed
3649D. Immediate
3650And: D.Immediate
3651741.
3652In one of the pairs of protocols given below, both the protocols can use multiple TCP
3653connections between the same client and the server. Which one is that?
3654(A) HTTP, FTP
3655(B) HTTP, TELNET
3656(C) FTP, SMTP
3657(D) HTTP, SMTP
3658Answer: (A)
3659Explanation: HTTP may use different TCP connection for different objects of a webpage if
3660non-persistent connections are used.
3661FTP uses two TCP connections, one for data and another control.
3662TELNET and FTP can only use ONE connection at a time
3663742.
3664R left outer join S on a=b gives
3665743.
3666The ways to accessing html elements in java script
3667document.getElementById("intro");
3668getElementsByTagName("p");
3669getElementsByClassName("intro");
3670document.forms["frm1"];
3671744.
3672How many flip-flops are present in register of sixteen bits?
3673Ans: 16 Flip flops
3674745.
3675temp=root->left;
3676 while(temp->right!=NULL)
3677 temp=temp->right;
3678 return temp;
3679 The above code snippet for a BST with the address of the root node in pointer ‘root’
3680 returns
3681Ans:Inorder Predecessor
3682746.
3683A subnet has been assigned a subnet mask of 255.255.255.192. What is the maximum number of hosts
3684that can belong to this subnet?
3685(A) 14
3686(B) 30
3687(C) 62
3688(D) 126
3689Answer: (C)
3690747.
36914. What is the correct syntax for referring to an external script called " abc.js"
3692A. <script href=\" abc.js\">
3693B. <script name=\" abc.js\">
3694C. <script src=\" abc.js\">
3695D. None of the above
3696Ans: C. <script src=\" abc.js\">
3697748.
3698Which one of the following is not true?
3699749.
3700In a relational schema, each tuple is divided into fields called
3701A) Relations
3702B) Domains
3703C) Queries
3704D) All of the above
3705Ans: B) Domains
3706750.
3707If a pipeline has five stages, assuming each stage is one cycle, the earliest time to receive an
3708output from an instruction without any forwarding (not nop) is after which cycle?
3709751.
3710The term scheme means:
3711752.
3712How many phases are present in the simplest pipeline system?
3713753.
3714Identify the sorting technique that supports divide and conquer strategy and has (n2) complexity
3715in worst case
3716a. Bubble sort
3717b. Insertion sort
3718c. Quick sort
3719d. All of above
3720Ans: c. Quick sort
3721754.
3722A system of interlinked hypertext documents accessed via the Internet is known as
3723The World Wide Web (abbreviated as WWW or W3, commonly known as the web),
3724is a system of interlinked hypertext documents accessed via the Internet
3725755.
3726Value of checksum must be recalculated regardless of
3727De-fragmentation
3728Fragmentation
3729Transfer
3730Size
3731Ans: Fragmentation
3732756.
3733In Circuit Switching, resources need to be reserved during the
3734Ans: the resources need to be reserved during the setup phase
3735757.
3736The language used in application programs to request data from the DBMS is referred to as the
3737A. DML
3738B. DDL
3739C. query language
3740D. All of the above
3741E. None of the above
3742Answer: Option A
3743758.
3744A ____________ is often used if you want the user to verify or accept
3745confirm box
3746759.
3747Can any unsigned number be represented using one register in 64-bit processor
3748ANS: 2^63 – 1 numbers (Not sure).
3749760.
37501. Inorder and postorder traversal sequences of a binary tree are 45 50 55 65 70 75 80 85 90
3751and 45 55 65 50 75 90 85 80 70. What are its leaf nodes?
3752Ans: 45,55,70,85
3753761.
3754Which normal form is considered adequate for relational database design?
3755Ans: Which normal form is considered adequate for normal relational database
3756design? Explanation: A relational database table is often described as “normalized” if
3757it is in the Third Normal Form because most of the 3NF tables are free of insertion,
3758update, and deletion anomalies
37593NF
3760762.
3761In Javascript, which of the following method is used to find out the character at a position
3762in a string?
3763a) charAt()
3764b) CharacterAt()
3765c) CharPos()
3766d) characAt()
3767ans: a
3768763.
3769If the page size is 1024 bytes, what is the page number in decimal of the following virtual address
37701110 1010010101
3771764.
3772The protocol data unit (PDU) for the application layer in the Internet stack is
3773(A) Segment
3774(B) Datagram
3775(C) Message
3776(D) Frame
3777Answer (C)
3778The Protocol Data Unit for Application layer in the Internet Stack (or TCP/IP) is called
3779Message.
3780765.
37811. The preorder traversal of the AVL tree obtained by inserting 17,7,20,10,8 is
3782766.
3783A queue data structure can be used for
3784Ans: Typical uses of queues are in simulations and operating systems.
3785Operating systems often maintain a queue of processes that are ready to execute or
3786that are waiting for a particular event to occur.
3787Computer systems must often provide a “holding area” for messages between two
3788processes, two programs, or even two systems. This holding area is usually called a
3789“buffer” and is often implemented as a queue.
3790767.
3791What is the JavaScript syntax to insert a comment that has more than one line?
3792ans: “/* … */” can be used to insert comment > 1line
3793768.
3794Given four frames in main memory, the following is the content of the page table. Assuming
3795the frames are fetched at time instant 3, 4, 1, 2 which frame will be replaced to place the page
379646 using first in first out replacement algorithm?
379723
379834
379910
38004
3801page 46?????
3802769.
3803In an Ethernet local area network, which one of the following statements isTRUE?
3804(A) A station stops to sense the channel once it starts transmitting a frame.
3805(B) The purpose of the jamming signal is to pad the frames that are smaller than the minimum
3806frame size.
3807(C) A station continues to transmit the packet even after the collision is detected.
3808(D) The exponential backoff mechanism reduces the probability of collision on retransmissions
3809Answer: (D)
3810770.
3811The concept of locking can be used to solve the problem of
3812Deadlock
3813Lost update
3814Inconsistent
3815All of the above
3816Ans: All of the above
3817771.
3818………… is very useful in situation when data have to stored and then
3819retrieved in reverse order.
3820Ans: Stack
3821772.
3822In a E-R diagram, ellipses represent a
3823Ans : Attributes are represented by means of ellipses. Every ellipse represents one attribute
3824773.
3825What does isNaN function do in JavaScript?
3826Ans: The isNaN() function determines whether a value is an illegal number (Not-a-Number). This
3827function returns true if the value equates to NaN. Otherwise it returns false.
3828774.
3829Consider the following message M = 1010001101. The cyclic redundancy check (CRC) for this message
3830using the divisor polynomial x5 + x4 + x2 + 1 is :
3831Ans: 01110
3832775.
3833The daisy chaining prioirty gives least priority to which device?
3834Ans: Slow devices such as Keyboard
3835776.
3836A binary search tree whose left subtree and right subtree differ in hight by at
3837most 1 unit is called ……
3838Ans AVL Tree
3839777.
3840Which method is implemented in RAID 1?
3841RAID 1 consists of an exact copy (or mirror) of a set of data on two or more disks; a classic RAID
38421 mirrored pair contains two disks. This configuration offers no parity, striping, or spanning of disk
3843space across multiple disks, since the data is mirrored on all disks belonging to the array, and
3844the array can only be as big as the smallest member disk. This layout is useful when read
3845performance or reliability is more important than write performance or the resulting data storage
3846capacity.
3847778.
3848Dotted-decimal notation of 10000001 00001011 00001011 11101111 would be
3849Ans: 129 .11 .11.239
3850779.
3851Which of the following desired features are beyond the capability of relational algebra?
3852(a) Aggregate computation
3853(b) Multiplication
3854(c) Finding transitive closure
3855(d) None of the above
3856Ans: All a,b,c (Aggregate Computation,Multiplication,Finding transitive closure)
3857780.
3858How do you create a new object in JavaScript?
3859Ans : There are various ways to create an object in js:
3860a)define a constructor function and then create an object by using the new keyword
3861b)Using object.create() method
3862Object.create(proto [, propertiesObject ])
3863781.
3864A processor can support a maximum memory of 4 GB, where the memory is word-addressable
3865(a word consists of two bytes). The size of the address bus of the processor is at least
3866__________ bits
3867Ans: Maximum Memory = 4GB = 232 bytes
3868Size of a word = 2 bytes
3869Therefore, Number of words = 232 / 2 = 231
3870So, we require 31 bits for the address bus of the processor.
3871782.
3872When determining the efficiency of algorithm the time factor is measured by
3873Ans: Counting the number of key operations
3874783.
3875What is the output of following JavaScript code?
3876Ans: Quality 100
3877784.
3878What are the potential problems when a DBMS executes multiple transaction concurrently
3879Ans: Lost update problem,dirty read problem
3880785.
3881In the IPv4 addressing format, the number of networks allowed under Class C addresses
3882is
3883Ans: 2^21
3884786.
3885Which one of the following allows a user at one site to establish a connection to another site
3886and then pass keystrokes from local host to remote host?
3887Ans : Telnet
3888787.
3889RAM type is justified as
3890Ans RAM is justified as being reliable and error detecting
3891788.
3892Linked lists are best suited
3893Ans for the size of the structure and the data in the structure are constantly changing
3894789.
3895Which of the following object is the highest-level object in the browser object hierarchy?
3896Ans Javascript Window object
3897790.
3898Let R be a relation. Which of the following comments about the relation R are correct?
3899791.
3900The resources needed for communication between end systems are reserved for the
3901duration of session between end systems in
3902Ans Circuit Switching
3903792.
3904The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer
3905a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable. The
3906minimum number of times the DMA controller needs to get the control of the system bus from the
3907processor to transfer the file from the disk to main memory is
3908Ans 
3909Size of data count register of the DMA controller = 16 bits
3910Data that can be transferred in one go = 216 bytes = 64 kilobytes
3911File size to be transferred = 29154 kilobytes
3912So, number of times the DMA controller needs to get the control of the system bus from the
3913processor to transfer the file from the disk to main memory = ceil(29154/64) = 456
3914793.
3915Linked list are not suitable data structure of which one of the following problems ?
3916Ans: Binary Search(Because it will take O(n/2) time to find the middle element)
3917794.
3918What is the output of following JavaScript code?
3919Ans 2
3920795.
3921Changing the conceptual schema without having to change physical schema is
3922Ans Data Independence
3923796.
3924________ extracts the DML statements from a host language and passes to DML Compiler
3925Ans Precompiler
3926797.
3927What is the output of following JavaScript code?
3928Ans 16
3929798.
3930Which of the following is useful in implementing quick sort?
3931Ans Stacks
3932799.
3933Which of the following raid levels provides maximum usable disk space?
3934Ans Raid 0
3935800.
3936Which one of the following fields of an IP header is NOT modified by a typical IP router?
3937Ans Source Address
3938801.
3939What are the states of the Auxiliary Carry (AC) and Carry Flag (CF) after executing the following
39408085 program? MVI H, 5DH; MIV L, 6BH; MOV A, H; ADD L
3941Ans AC=1 CY 0
3942802.
3943Which of the following object represents the HTML document loaded into a browser
3944window?
3945Ans Window object
3946803.
3947What is the result of the following operation Top (Push (S, X))
3948Ans X
3949804.
3950These networking classes encapsulate the "socket" paradigm pioneered in the (BSD) Give the
3951abbreviation of BSD?
3952Ans Berkeley Software Distribution
3953805.
3954Truncate is _________ command
3955Ans DDL
3956806.
3957In a priority queue insertion and deletion takes place at
3958Ans Any Position
3959807.
3960A transaction is permanently saved in the hard disk only after giving
3961Ans COMMIT Command
3962808.
3963The performance of cache memory is frequently measured in terms of a quantity called
3964Ans Hit Ratio
3965809.
3966If message in Segmentation and Reassembly (SAR) sub layer of Application Adaptation
3967Layer 3/4 has value of Segment type is 11 then it is called a
3968Ans Single segmented Message
3969810.
3970What is the output of following JavaScript code?
3971811.
3972When does the top value of stack changes?
3973Ans Before Insertion
3974812.
3975Digital signature envelope is decrypted by using _________.
3976Ans Symmetric key
3977813.
3978What is mean by "this" keyword in javascript?
3979Ans In JavaScript, the thing called this, is the object that "owns" the JavaScript code. The value
3980of this, when used in a function, is the object that "owns" the function. The value of this, when
3981used in an object, is the object itself. The this keyword in an object constructor does not have a
3982value.
3983814.
3984DMA is useful for the operations
3985Ans DMA is useful for transferring data between memory and devices if large volume of data is to
3986be transferred, or the devices have small response times.
3987815.
3988The data manipulation language (DML)
3989816.
3990If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the
3991maximum number of hosts per subnet?
3992Ans 2046
3993817.
3994int unknown(int n) {
3995 int i, j, k = 0;
3996 for (i = n/2; i <= n; i++)
3997 for (j = 2; j <= n; j = j * 2)
3998 k = k + n/2;
3999 return k;
4000}
4001818.
4002Math. round(-20.5)=?
4003Ans 21
4004819.
4005Computers use addressing mode techniques for _____________________.
4006Ans : A. giving programming versatility to the user by providing facilities as pointers to memory
4007counters for loop control
4008B. to reduce no. of bits in the field of instruction
4009C. specifying rules for modifying or interpreting address field of the instruction
4010Ans ALL ABC
4011820.
4012An advantage of the database approach is
4013Ans The advantages in the database approach are as follows:
4014are using the same database; hence, any report using the
4015information will not be inconsistent.
4016the database occurs once only and is protected by the security measures.
4017fast by using the logic of the data structures.
4018821.
4019Which of the following is not characteristics of a relational database model
4020822.
4021The maximum number of binary trees that can be formed with three unlabeled nodes is:
40225
4023823.
4024A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32
4025Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory
4026entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit. The
4027size of the cache tag directory is
402816
4029824.
4030Which built-in method sorts the elements of an array
4031Sort()
4032825.
4033In ………………. Mode, the authentication header is inserted immediately after the IP
4034header.
4035Tunnel
4036826.
4037Assume that source S and destination D are connected through two intermediate routers
4038labeled R. Determine how many times each packet hasto visit the network layer and the
4039data link layer during a transmission from S to D.
4040network layer -4 times, data link layer-6times
4041827.
4042The minimum duration of the active low interrupt pulse for being sensed without being lost must
4043be
4044one machine cycle
4045828.
4046Microsoft SQL Server is an example for which OLAP Server?
4047Specialized SQL servers
4048829.
4049Which built-in method returns the length of the string?
4050length()
4051830.
4052Trace the output of the following code?
4053#include
4054using namespace std;
4055int main()
4056{
4057int x=15,y=27;
4058x = y++ + x++;
4059y = ++y + ++x;
4060cout<<x+y++<<++x+y;
4061return 0;
4062}</x+y++<<++x+y;
4063116,116
4064831.
4065Which of the following is not a stored procedure?
4066832.
4067Determine the output of the following code?
4068#include
4069using namespace std;
4070class one
4071{
4072int a;
4073static int b;
4074public:
4075void initialize();
4076void print();
4077static void print_S();
4078};
4079int one::b = 0;
4080void one::initialize()
4081{
4082a = 10;
4083b ++;
4084}
4085void one::print()
4086{
4087cout<<a;
4088cout<<b;
4089}
4090void one::print_S()
4091{
4092cout<<b;
4093}
4094int main()
4095{
4096one o;
4097o.initialize();
4098o.print();
4099o.print_S();
4100return 0;
4101}
4102</b;
4103</b;
4104</a;
41051011
4106833.
4107Which of the following statements is FALSE regarding a bridge
4108Bridge reduces broadcast domain
4109834.
4110How many 8-bit characters can be transmitted per second over a 9600 baud serial
4111communication link using asynchronous mode of transmission with one start bit, eight data bits,
4112two stop bits, and one parity bit?
4113800
4114835.
4115Which of the following function of Array object calls a function for
4116each element in the array?
4117forEach()
4118836.
4119Consider the following pseudo code fragment:
4120printf (“Hello”);
4121if(!fork( ))
4122printf(“World”);
4123Which of the following is the output of the code fragment?
4124837.
4125Congestion control and quality of service is qualities of the
4126frame relay
4127838.
4128Which one of these is characteristic of RAID 5?
4129Distributed parity
4130839.
4131A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect
4132block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and
4133the size of each disk block address is 8 Bytes. The maximum possible file size in this file system
4134in KBytes is
413535 Kbytes
4136840.
4137Dynamic web page
4138generates on demand by a program or a request from browser
4139841.
4140Identify the correct sequence in which the following packets are transmitted on the network
4141by a host when a browser requests a webpage from a remote server, assuming that the host
4142has just been restarted.
4143DNS query, TCP SYN, HTTP GET request
4144842.
4145Generally Dynamic RAM is used as main memory in a computer system as it______.
4146has higher speed
4147843.
4148Which one of the following statements is false?
4149844.
4150Which of the following is not a function of a DBA?
4151Network maintenance
4152845.
4153What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note
4154that the first parameter is passed by reference, whereas the second parameter is passed by
4155value.
4156int f (int &x, int c) {
4157c=c-1;
4158if (c-0) return 1;
4159x=x+1;
4160return f (x,c)*x;}
4161846.
4162Uniform Resource Locator (URL), is a standard for specifying any kind of information on the
4163internet
4164847.
4165Which one of the following is a cryptographic protocol used to secure HTTP connection?
4166transport layer security (TSL)
4167848.
4168If a virtual memory system has 4 pages in real memory and the rest must be swapped to disk.
4169Which of the following is the hit ratio for the following page address stream. Assume memory
4170starts empty, use the FIFO algorithm
417131%
4172849.
4173Consider a relation R (A, B). If A ¿ B is a trivial functional dependency and A is the super key for
4174R, then what is the maximum normal form R can be in?
4175BCNF
4176850.
4177What is the unique characteristic of RAID 6 (Choose one)?
4178Two independent distributed parity
4179851.
4180An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an
4181IPpacket of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant
4182fields in the header of the third IP fragment generated by the router for this packet are
4183MF bit: 0, Datagram Length: 1444; Offset: 370
4184852.
4185What will be the values of x, m and n after the execution of the following statements?
4186int x, m, n;
4187m = 10;
4188n = 15;
4189x = ++m + n++;
419026 11 16
4191853.
4192What is the code to be used to trim whitespaces ?
4193let trimmed = (l.trim() for (l in lines));
4194854.
4195Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11,92,
419610. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63,
4197moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from
41980 to 199. The total head movement (in number of cylinders) incurred while servicing these
4199requests is
4200165
4201855.
4202What’s the output of the following code?
4203var city = new Array("delhi", "agra", "akot", "aligarh");
4204city.push('palampur');
4205document.write(city);
4206["delhi", "agra", "akot", "aligarh", "palampur"]
4207856.
4208RAID is a way to:
4209combining several independent and relatively small disks into a single storage of a large size
4210857.
4211If the offset of the operand is stored in one of the index registers, then it is
4212is indexed addressing mode
4213858.
4214What happens when a pointer is deleted twice?
4215it can cause a trap
4216859.
4217The local host and the remote host are defined using IP addresses. To define the
4218processes, we need second identifiers called
4219port addressess
4220860.
4221Consider the following relation
4222Cinema (theater, address, capacity)
4223Which of the following options will be needed at the end of the SQL query
4224SELECT P1. address
4225FROM Cinema P1
4226Such that it always finds the addresses of theaters with maximum capacity?
4227WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)
4228861.
4229Which of the following are sufficient conditions for deadlock?
4230mutual exclusion
4231b) a process may hold allocated resources while awaiting assignment of other resources
4232c) no resource can be forcibly removed from a process holding it
4233d) all of the mentioned
4234Answer-All of the mentioned
4235862.
4236One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the
4237following statements best explains the need for this field?
4238It can be used to prevent packet looping
4239863.
4240Which of the following type casts will convert an Integer variable named amount to a Double
4241type?
4242(double) amount
4243864.
4244Assume that a table R with 1000 records is to be joined with another table S with
424510000 records. What is the maximum number of records that would result in if we
4246join R with S and the equi-join attribute of S is the primary key?
42471000
4248865.
4249UDP uses........ to handle outgoing user datagrams from multiple processes on one host.
4250multiplexing
4251866.
4252When an instruction is read from the memory, it is called
4253instruction cycle (sometimes called a fetch–decode–execute cycle)
4254867.
4255What should be used to point to a static class member?
4256Normal pointer
4257868.
4258The ‘$’ present in the RegExp object is called a
4259metacharacter
4260869.
4261Which of the following is a disadvantage of file processing system?
4262(I) Efficiency of high level programming,
4263(II) Data Isolation
4264(III) Integrity issues
4265(IV) Storing of records as files
4266870.
4267Foreign key is a subset of primary key is stated in _____________ constraint
4268871.
4269The ......... protocol defines a set of messages sent over either User Datagram Protocol (UDP)
4270port53 or Transmission Control Protocol(TCP) port53.
4271DNS
4272872.
4273Consider the following statement containing regular expressions
4274var text = "testing: 1, 2, 3";
4275var pattern = /\d+/g;
4276In order to check if the pattern matches, the statement is
4277pattern.test(text)
4278873.
4279Which two RAID types use parity for data protection?
4280RAID 4, RAID 5
4281874.
4282Which cause a compiler error?
4283875.
4284The regular expression to match any one character, not between the brackets is
4285[^…]
4286876.
4287Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ
4288>, and sends it to Y, where it is d
4289ecrypted. Which one of the following sequences of keys is used for the operations?
4290Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key
4291followed by X’s public key
4292877.
4293Which of the following relational algebra operations do not require the participating tables to be
4294union-compatible?
4295JOIN
4296878.
4297Which of the following scan() statements is true?
4298879.
4299A process executes the code
4300fork();
4301fork();
4302fork();
4303The total number of child process created is
43047
4305880.
4306A variable P is called pointer if
4307P contains the address of an element in DATA.
4308881.
4309Suppose that everyone in a group of N people wants to communicate secretly with N-1
4310others using symmetric key cryptographic system. The communication between any two
4311persons should not be decodable by the others in the group. The number of keys required
4312in the system as a whole to satisfy the confidentiality requirement is
4313N(N – 1)/2
4314882.
4315Which of the following statement on the view concept in SQL is invalid?
4316The definition of a view should not have GROUP BY clause in it.
4317883.
4318A 20-bit address bus allows access to a memory of capacity
43191Mb
4320884.
4321What does /[^(]* regular expression indicate ?
4322Match zero or more characters that are not open paranthesis
4323885.
4324A RAM chip has a capacity of 1024 words of 8 bits each (1K*8). The number of 2*4 decoders
4325with enable line needed to construct a 16K*6 RAM from 1K*8 RAM is
43265
4327886.
4328A layer -4 firewall (a device that can look at all protocol headers up to the transport layer)
4329CANNOT
4330block HTTP traffic during 9:00PM and 5:00AM
4331887.
4332The function scanf() reads
4333Multiple characters
4334888.
4335In SQL, testing whether a subquery is empty is done using
4336EXISTS
4337889.
4338What will be the result when non greedy repetition is used on the pattern /a+?b/ ?
4339Matches the letter b preceded by the fewest number of a’s possible
4340890.
4341DMA is useful for the operations
4342DMA is useful for transferring large quantities of data between memory and devices. It eliminates
4343the need for the CPU to be involved in the transfer, allowing the transfer to complete more
4344quickly and the CPU to perform other tasks concurrently
4345891.
4346main() is an example of
4347892.
4348What does the subexpression /java(script)?/ result in ?
4349It matches “java” followed by the optional “script”
4350893.
4351Which of the following is not a characteristic of a relational database model?
4352treelike structure
4353894.
4354Which type of error detection uses binary division?
4355Cyclic Redundancy Check (CRC)
4356895.
4357When a network interface has a failure in its circuitry, it sends a continuous stream of frames
4358causing the Ethernet LAN to enter a Collapse state. This condition is known as __________.
4359Jabbering
4360896.
4361An identifier in C
4362897.
4363A RAM chip has a capacity of 1024 words of 8 bits each (1K*8). The number of 2*4 decoders
4364with enable line needed to construct a 16K*6 RAM from 1K*8 RAM is
43655
4366898.
4367Given the basic ER and relational models, which of the following is INCORRECT?
4368In a row of a relational table, an attribute can have more than one value
4369899.
4370What is the most essential purpose of parantheses in regular expressions ?
4371Define subpatterns within the complete pattern
4372900.
4373Which of the following are sufficient conditions for deadlock?
43745. mutual exclusion
4375The resources involved must be unshareable; otherwise, the processes would not
4376be prevented from using the resource when necessary.
43776. hold and wait or partial allocation
4378The processes must hold the resources they have already been allocated while
4379waiting for other (requested) resources. If the process had to release its resources
4380when a new resource or resources were requested, deadlock could not occur
4381because the process would not prevent others from using resources that it
4382controlled.
43837. no pre-emption
4384The processes must not have resources taken away while that resource is being
4385used. Otherwise, deadlock could not occur since the operating system could simply
4386take enough resources from running processes to enable any process to finish.
43878. resource waiting or circular wait
4388901.
4389The method that performs the search-and-replace operation to strings for pattern matching is
4390a) searchandreplace()
4391b) add()
4392c) edit()
4393d) replace()
4394902.
4395Which of the following is TRUE?
4396903.
4397A variable whose size is determined at compile time and cannot be changed at run time is
4398A. Static Variable
4399B. Dynamic Variable
4400C. Not a variable
4401D. None of These
4402904.
4403Value of checksum must be recalculated regardless of
4404a) De-fragmentation
4405b) Fragmentation
4406c) Transfer
4407d) Size
4408905.A union that has no constructor can be initialized with another union of __________ type
4409A. different
4410B. same
4411C. virtual
4412D. class
4413906.
4414Dotted-decimal notation of 10000001 00001011 00001011 11101111 would be
4415A. 193.131.27.255
4416B. 129.11.11.239
4417C. 192.168.10.9
4418D. 172.16.11.3
4419907.
4420Memory mapped displays
4421Uses ordinary memory to store the display data in character form
4422908.
4423What would be the result of the following statement in JavaScript using regular
4424expression methods ?
4425a) Returns [“123″”456″”789”].
4426b) Returns [“123″,”456″,”789”].
4427c) Returns [1,2,3,4,5,6,7,8,9].
4428d) Throws an exception
4429909.
4430Which one of the following statements if FALSE?
4431910.
4432Consider the following code snippet. What purpose does exec() solve in the above code ?
4433var pattern = /Java/g;
4434 var text = "JavaScript is more fun than Java!";
4435 var result;
4436 while ((result = pattern.exec(text)) != null)
4437 {
4438 alert("Matched '" + result[0] + "'" +" at position " + result.index +"; ne
4439xt search begins at " + pattern.lastIndex);
4440 }
4441a) Returns the same kind of array whether or not the regular expression has the
4442global g flag
4443b) Returns different arrays in the different turns of iterations
4444c) All of the mentioned
4445d) None of the mentioned
4446911.
4447Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If
4448the computer system has a one-level page table per process and each page table entry requires
444948 bits, then the size of the per-process page table is __________ megabytes.
4450(A) 384
4451(B) 48
4452(C) 192
4453(D) 96
4454912.
4455Structured programming involves
4456A. decentralisation of program activity
4457B. functional modularisation
4458C. localisation of errors
4459D. All of the above
4460E. None of the above
4461913.
4462Which one of the following allows a user at one site to establish a connection to another
4463site and then pass keystrokes from local host to remote host?
4464a) HTTP
4465b) FTP
4466c) Telnet
4467d) None of the mentioned
4468914.
4469Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are
4470two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2
4471do not have any attributes of their own. What is the minimum number of tables required to
4472represent this situation in the relational model?
4473(a) 2
4474(b) 3
4475(c) 4
4476(d) 5
4477915.
4478Which function among the following lets to register a function to be invoked once?
4479a) setTimeout()
4480b) setTotaltime()
4481c) setInterval()
4482d) none of the mentioned
4483916.
4484Select operation in SQL is equivalent to
4485(A) the selection operation in relational algebra
4486(B) the selection operation in relational algebra, except that select in SQL retains duplicates
4487(C) the projection operation in relational algebra
4488(D) the projection operation in relational algebra, except that select in SQL retains
4489duplicates
4490917.
4491By default, any real number in C is treated as
4492A. A float
4493B. A double
4494C. A long double
4495D. Depend upon memory model that you are using
4496918.
4497These networking classes encapsulate the "socket" paradigm pioneered in the (BSD) Give
4498the abbreviation of BSD?
4499A) Berkeley Software Distribution
4500B) Berkeley Socket Distribution
4501C) Berkeley System Distribution
4502D) None of the above
4503919.
4504. For computers based on three - address instruction formats, each address field can be used to
4505specify which of the following:
4506S1: A memory operand
4507S2: A processor register
4508S3: An implied accumulator registers
4509(A) Either S1 or S2
4510(B) Either S2 or S3
4511(C) Only S2 and S3
4512(D) All of S1, S2 and S3
4513920.
4514Integer division in a C program results in
4515A. Truncation
4516B. Rounding
4517C. Underflow
4518D. None of these
4519921.
4520Which function among the following lets to register a function to be invoked repeatedly after a
4521certain time?
4522a) setTimeout()
4523b) setTotaltime()
4524c) setInterval()
4525d) none of the mentioned
4526922.
4527Grant and revoke are ....... statements
4528DCL Commands – Data Control Language
4529923.
4530The minimum number of page frames that must be allocated to a running process in a virtual
4531memory environment is determined by
4532a) the instruction set architecture
4533b) page size
4534c) physical memory size
4535d) number of processes in memory
4536924.
4537Which is the handler method used to invoke when uncaught JavaScript exceptions occur?
4538a) Onhalt
4539b) Onerror
4540c) Both onhalt and onerror
4541d) None of the mentioned
4542View Answer
4543925.
4544For C• Programming language
4545926.
4546The processed S/MIME along with security related data is called as ________.
4547a. public key cryptography standard.
4548b. private key cryptography standard.
4549c. S/MIME.
4550d. MIME.
4551927........... command can be used to modify a column in a table
4552Answer: ALTER
4553928.
4554The function f(x) = ab + a can be simplified as
4555Answer: a
4556929.
4557Consider the C function given below.
4558int f(int j)
4559{
4560static int i = 50;
4561int k;
4562if (i == j)
4563{
4564printf(?something?);
4565k = f(i);
4566return 0;
4567}
4568else return 0;
4569}
4570Which one of the following is TRUE?
4571(A) The function returns 0 for all values of j.
4572(B) The function prints the string something for all values of j.
4573(C) The function returns 0 when j = 50.
4574(D) The function will exhaust the runtime stack or run into an infinite loop when j = 50
4575930.Which property is used to obtain browser vendor and version information?
4576a) modal
4577b) version
4578c) browser
4579d) navigator
4580931.
4581___________ Substitution is a process that accepts 48 bits from the XOR operation.
4582a. S-box.
4583b. P-box.
4584c. Expansion permutations.
4585d. Key transformation.
4586932.
4587The number of squares in K-map of n-variables is 2^n
4588933.
4589Data independence means
4590It means we change the physical storage/level without affecting the conceptual or external
4591view of the data.
4592934.
4593In ………………. Mode, the authentication header is inserted immediately after the IP
4594header.
4595A) Tunnel
4596B) Transport
4597C) Authentication
4598D) Both A and B
4599935.
4600The output of combinational circuit depends on the levels present at input
4601terminals.
4602936.
4603Which method receives the return value of setInterval() to cancel future
4604invocations?
4605a) clearInvocation()
4606b) cancelInvocation()
4607c) clearInterval()
4608d) None of the mentioned
4609937.
4610DCL stands for DATA CONTROL LANGUAGE
4611938.
46126. Consider the below code fragment:
4613if(fork k( ) = = 0)
4614{
4615a= a+5; printf(?%d, %d \n?, a, &a);
4616}
4617else
4618{
4619a= a ? 5;
4620printf(?%d %d \n?, 0, &a);
4621}
4622Let u, v be the values printed by parent process and x, y be the values printed by child process.
4623Which one of the following is true?
4624(A) u = x + 10 and v = y
4625(B) u = x + 10 and v != y
4626(C) u + 10 = x and v = y
4627(D) u + 10 = x and v != y
4628939.
4629_________ uniquely identifies the MIME entities uniquely with reference to multiple
4630contexts.
4631a. Content description.
4632b. Content -id.
4633c. Content type.
4634d. Content transfer encoding.
4635940.
4636.………………… is preferred method for enforcing data integrity
4637A) Constraints
4638B) Stored procedure
4639C) Triggers
4640D) Cursors
4641941.
4642Find the output of the following program?
4643#include
4644using namespace std;
4645typedef int * IntPtr;
4646int main()
4647{
4648IntPtr A, B, C;
4649int D,E;
4650A = new int(3);
4651B = new int(6);
4652C = new int(9);
4653D = 10;
4654E = 20;
4655*A = *B;
4656B = &E;
4657D = (*B)++;
4658*C= (*A)++ * (*B)--;
4659E= *C++ - *B--;
4660cout<<*A<<*B<<*C<<d<<e;
4661return 0;
4662}</d<<e;
4663942.
4664The setTimeout() belongs to which object?
4665a) Element
4666b) Window
4667c) Location
4668d) None of the mentioned
4669943.
4670Which of the folloiwng is fully functional ?
4671944.
4672Which one of the following is a cryptographic protocol used to secure HTTP connection?
4673a) stream control transmission protocol (SCTP)
4674b) transport layer security (TSL)
4675c) explicit congestion notification (ECN)
4676d) resource reservation protocol
4677945.
4678The alpahbet are represented in which format inside the computer?
4679Answer: Binary/ASCII
4680946.
4681Which method receives the return value of setTimeout() to cancel future invocations?
4682a) clearTimeout()
4683b) clearInterval()
4684c) clearSchedule()
4685d) none of the mentioned
4686947.
4687Which of the following is not a binary operator in relational algebra?
4688A) Join
4689B) Semi-Join
4690C) Assignment
4691D) Project
4692948.
4693The library function exit() causes an exit from
4694a) the loop in which it occurs
4695(b) the block is which it occurs
4696(c) the functions in which it occurs
4697(d) the progam in which it occurs
4698949.
4699Which of the following statement is correct about destructors?
4700A). A destructor has void return type.
4701B). A destructor has integer return type.
4702C). A destructor has no return type.
4703D). A destructors return type is always same as that of main().
4704950.
4705------------- is a mode of operation for a block cipher, with the characteristic that each possible
4706block of plaintext has a defined corresponding ciphertext value and vice versa.
4707Answer: Electronic Code Book
4708951.
4709What will happen if we call setTimeout() with a time of 0 ms?
4710In short, setTimeout(someFunc, 0) will run someFunc 0ms after the current executing
4711functions has finished running.
4712952.
4713Which of the following is/are not a DDL statements?
4714a) UPDATE
4715b) TRUNCATE
4716c) ALTER
4717d) None of the Mentioned
4718Explanation: Data definition language (DDL) commands enable you to perform the following
4719tasks:Create, alter, and drop schema objects.
4720953.
4721The number of bits to represent 128 sets in direct mapped cache is 7 bits
4722954.
4723To which object does the location property belong?
4724a) Window
4725b) Position
4726c) Element
4727d) Location
4728955. Which database level is closest to the users?
4729A. External
4730B. Internal
4731C. Physical
4732D. Conceptual
4733956.
4734The interrupts are serviced using which of the following
4735Answer: Interrupt Service Routine
4736957.
4737A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no
4738repeaters. The signal speed in the cable is 2 x 108 m/sec. The minimum frame size for this network
4739should be
4740(A) 10000 bits
4741(B) 10000 bytes
4742(C) 5000 bits
4743(D) 5000 bytes
4744958. Java package is a grouping mechanism with the purpose of
4745Answer: encapsulate a group of classes
4746959. What is the data structure used for executing interrupt service subroutine ?
4747960.
47481. What will be printed as the output of the following program?
4749 public class testincr
4750 {
4751 public static void main(String args[])
4752 {
4753 int i = 0;
4754 i = i++ + i;
4755 System.out.println(" I = " +i);
4756 }
4757 }
4758(a) I = 0
4759(b) I = 1
4760(c) I = 2
4761(d) I = 3
4762961.
4763........ data type can store unstructured data
4764A. RAW
4765B. CHAR
4766C. NUMERIC
4767D. VARCHAR
4768962.
4769What is the result of the following code snippet?
4770window.location === document.location
4771a) False
4772b) True
4773c) 0
4774d) 1
4775963.
4776What is the access point (AP) in wireless LAN?
4777a) device that allows wireless devices to connect to a wired network
4778b) wireless devices itself
4779c) both (a) and (b)
4780d) none of the mentioned
4781964.
4782Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?
4783a) CDMA
4784b) CSMA/CA – Carrier Service Multiple Access with Collision Avoidance
4785c) ALOHA
4786d) None of the mentioned
4787965.
4788The output in sequential circuit depends on which of the folloiwng?
4789Answer: Present and past inputs
4790966.A table can have only one PRIMARY KEY
4791967.
4792To prevent any method from overriding, the method has to declared as, FINAL
4793968.
4794*
4795In which part does the form validation should occur?
4796a) Client
4797b) Server
4798c) Both Client and Server
4799d) None of the mentioned
4800969.How to find the index of a particular string?
4801a.position()
4802b.index()
4803c.indexOf()
4804d.Noneofthementioned
4805Explanation : The indexOf() function can be used to find out the index of a particular
4806character or a string.
4807970.
4808The power consumed by full adder can be reduced by using which of the following?
4809971.
4810What is the output of the following program:
4811 public class testmeth
4812 {
4813 static int i = 1;
4814 public static void main(String args[])
4815 {
4816 System.out.println(i+” , “);
4817 m(i);
4818 System.out.println(i);
4819 }
4820 public void m(int i)
4821 {
4822 i += 2;
4823 }
4824 }
4825a) 1 , 3
4826b) 3 , 1
4827c) 1 , 1
4828d) 1 , 0
4829e) none of the above.
4830972.
4831-------------------module of the DBMS controls access to DBMS information that is stored
4832on disk, whether it is part of the database or the catalog
4833Answer: Data Manager Module (Higher Level Stored)
4834973.
4835A 20 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs the "go
4836back n ARQ" scheme with n set to 10. Assuming that each frame is 100 bytes long, what is the
4837maximum data rate possible?
4838A. 5 Kbps
4839B.10 Kbps
4840C. 15 Kbps
4841D. 20 Kbps
4842974.
4843Which of the following is the child object of the JavaScript navigator?
4844a.Navicat
4845b.Plugins
4846c.NetRight
4847d. None of the mentioned
4848Explanation : The JavaScript navigator object includes a child object called plugins.
4849975.
4850A wireless network interface controller can work in
4851a) infrastructure mode
4852b) ad-hoc mode
4853c) both (a) and (b)
4854d) none of the mentioned
4855Explanation: In infrastructure mode WNIC needs access point but in ad-hoc mode access
4856point is not required.
4857976.
4858Given the code
4859 String s1 = “ VIT” ;
4860 String s2 = “ VIT “ ;
4861 String s3 = new String ( s1);
4862 Which of the following would equate to true?
4863(A) s1 == s2
4864(B) s1 = s2
4865(C) s3 == s1
4866(D) s1.equals(s2)
4867(E) s3.equals(s1)
4868a) (A), (D) & (E)
4869b) (A), (C) & (E)
4870c) (A), (B) & (C) 
4871d) (C), (D) & (E)
4872e) (D) & (E)
4873Explanation: s1==s2 is indeed “true” since they point to the same instance of “VIT” as
4874they are “not” declared with the new String(“VIT”) function.
4875977.
4876The number of distinct symbols in radix-r is
4877Answer: r
4878Explanation: A number system of radix r uses a string consisting of r distinct symbols
4879to represent a value.
4880978.---PRECOMPILER---- component of DBMS extracts DML commands from an
4881application program written in a host programming language
4882979.
4883Which one of the following event is not possible in wireless LAN.
4884a) collision detection
4885b) acknowledgement of data frames
4886c) multi-mode data transmission
4887d) none of the mentioned
4888980.
4889Which of the following are the properties of a plug-in entry?
4890a) name
4891b) filename
4892c) mimeTypes
4893d) all of the mentioned
4894Each plug-in has an entry in the array. Each entry has the following properties:
4895 name – is the name of the plug-in.
4896 filename – is the executable file that was loaded to install the plug-in.
4897 description – is a description of the plug-in, supplied by the developer.
4898 mimeTypes – is an array with one entry for each MIME type supported by the plug-in
4899981.
4900The runtime database processor of DBMS executes-----QUERY CODE------
4901982.
4902What is the sequence of major events in the life of an applet?
4903Answer:
4904i) loading the applet
4905ii) leaving and returning to the applet’s page
4906iii) reloading the applet
4907iv)quitting the browser
4908983.
4909Can a system have multiple DMA controllers?
4910Answer: True ??
4911984.
4912Which of the following events will cause a thread to die?
4913Which of the following events will cause a thread to die?
4914ANSWER : D
4915985.
4916What is Wired Equivalent Privacy (WEP) ?
4917a) security algorithm for ethernet
4918b) security algorithm for wireless networks
4919c) security algorithm for usb communication
4920d) none of the mentioned
4921986.
4922A relation R(A,B,C,D,E,H) has the following functional dependencies
4923 F= {{A→BC},{CD→E},{E→C}, {D→AEH}, {ABH→BD}, {DH→BC}}.
4924Find the Normal form of the relation
4925987.
4926What is the number of maxterms in a function of n variables?
4927Answer: The number of possible max terms posiible for n variable : 2^n
4928 The number of possible min terms posiible for n variable : 2^n
4929988.What is the purpose of the mimeTypes property of a plug-in entry?
4930a. Contains MIME properties
4931b. Contains MIME sizes
4932c. Contains MIME types
4933d. None of the mentioned
4934Answer : c
4935989.A method within a class is only accessible by classes that are defined within the same
4936package as the class of the method. Which one of the following is used to enforce such
4937restriction?
4938(a) Declare the method with the keyword public
4939(b) Declare the method with the keyword private
4940(c) Declare the method with the keyword protected
4941(d) Do not declare the method with any accessibility modifiers
4942(e) Declare the method with the keyword public and private
4943Reason: The desired accessibility is package accessibility, which is the default accessibility
4944for members that have no accessibility modifier. Package is not an accessibility modifier.
4945990.
4946How many output lines are present in an encoder with 2^n input lines?
4947ANSWER: n
4948991.
4949------DENSE-------index has an entry for every search key value (and
4950hence every record) in the data file
4951992.
4952A subset of a network that includes all the routers but contains no loops is called:
4953a) spanning tree
4954b) spider structure
4955c) spider tree
4956d) none of the mentioned
4957Answer: a
4958993.
4959AJAX has become very commonly used because
4960a) It allows pages to be interactive without further communication with the server.
4961b) Xml is a close relative of html.
4962c) It avoids the need for javascript.
4963d) It allows page content to be updated without requiring a full page reload.
4964994.
4965If link transmits 4000 frames per second, and each slot has 8 bits,the transmission rate
4966of circuit this TDM is
4967a) 32kbps
4968b) 500bps
4969c) 500kbps
4970d) None of the mentioned
4971995.
4972Consider the following code.
4973static void nPrint(String message, int n) {
4974 while (n > 0) {
4975 System.out.print(message);
4976 n--;
4977 }
4978}
4979What is the printout of the call nPrint('a', 4)?
4980(a) aaaaa
4981(b) aaaa
4982(c) aaa
4983(d) aa
4984(e) invalid call.
4985Reason : Invalid call because char 'a' cannot be passed to string message
4986996.
4987Which flip flop has the characterstic function Q(next) = input
4988997.
4989More than one transaction can apply this lock on X for reading its value but no write
4990lock can be applied on X by any other transaction. What is that lock?
4991Two-Phase Locking Techniques: Essential components
4992More than one transaction can apply share lock on X for
4993its value but no write lock can be applied on X by any
4994other transaction.
4995998.
4996Which of the following is not a reason XML gained popularity as a data interchange format for
4997AJAX?
4998a) It has been around a while and libraries exist for many languages to work with it
4999b) It can be navigated using JavaScript DOM methods.
5000c) It is extensible, allowing it to be adapted to virtually any application.
5001d) It is concise and simple to use.
5002999.
5003The performance of cache memories is measured by
5004Answer: hit ratio
50051000.
5006Lock manager uses -----LOCK TABLE--------- to store the identify of transaction locking a data
5007item, the data item, lock mode and pointer to the next data item locked.
50081001.
5009Which one of the following allows a user at one site to establish a connection to another
5010site and then pass keystrokes from local host to remote host?
5011a) HTTP
5012b) FTP
5013c) Telnet
5014d) None of the mentioned
50151002.
5016Which method must be defined by a class implementing the java.lang.Runnable
5017 interface?
5018Answer: public void run()
50191003.
5020The jQuery AJAX methods .get(), .post(), and .ajax() all require which parameter to be supplied?
5021a) method
5022b) url
5023c) data
5024d) headers
50251004.
5026If an AJAX request made using jQuery fails,
50271. the browser will automatically report the problem with an alert message.
50282. an error message will be displayed in the browser window content area.
50293. the programmer should arrange for it to be reported using the
5030jQuery .fail() method.
50314. there is no way to notify the user.
50321005.
5033class X implements Runnable
5034{
5035 public static void main(String args[])
5036 {
5037 /* Missing code? */
5038 }
5039 public void run() {}
5040}
5041Which of the following line of code is suitable to start a thread ?
5042A. Thread t = new Thread(X);
5043B. Thread t = new Thread(X); t.start();
5044C. X run = new X(); Thread t = new Thread(run); t.start();
5045D. Thread t = new Thread(); x.run();
5046Answer: Option C
50471006.
5048-----AGGREGATE FUNCTION--------is used to summarize information
5049from multiple tuples into a single-tuple summary
50501007.In negative edge triggered flip flop, the transitions happen at
50511008.The probability that a single bit will be in error on a typical public telephone line using 4800
5052bps modem is 10 to the power -3. If no error detection mechanism is used, the residual error rate
5053for a communication line using 9-bit frames is approximately equal to
5054[A]. 0.003
5055[B]. 0.009
5056[C]. 0.991
5057[D]. 0.999
5058[E]. None of the above
50591009.
5060In ER- Relational Mapping, Binary 1:1 Relationship types are mapped to
5061----------
50621010.
5063Which method is used to call the base class methods from the subclass?
5064super
50651011.
5066Nested documents in the HTML can be done using
50671012.
5068The race condition in RS flip flop is rectified in which flip flop
5069Master Slave JK Flip Flop
50701013.
5071Frames from one LAN can be transmitted to another LAN via the device
5072Bridge
50731014.
5074A new web browser window can be opened using which method of the Window object ?
5075createtab()
5076b. Window.open()
5077c. open()
5078d. All of the mentioned
50791015.
5080Answer the following question based on the given table.
5081Package Name Class Name
5082Lab.project.util Date, Time
5083Lab.project.game Car, Puzzle
5084What will be the access modifier if a method in Date class is inherited in the Puzzle class?
50851016.
5086You are working with a network that is 172.16.0.0 and would like to support 600 hosts per
5087subnet. What subnet mask should you use?
5088255.255.252.0 (/10)
50891017.
5090--------------contains information such as the structure of each file, the type and storage
5091format of each data item, and various constraints on the data
5092DBMS Catalog
50931018.
5094What does the command XCHG in 8085 do?
5095Exchange H and L with D and E. The contents of register H are exchanged with the
5096contents of register D, and the contents of register L are exchanged with the
5097contents of register E.
50981019.
5099Which of the following digits are known as the sub-address digits (for use by the user) of the
5100Network User Address (NUA)?
5101 5-7
5102[B]. 1-4
5103[C]. 8-12
5104[D]. 13-14
51051020.
5106What statement is used to execute stored procedure in Java JDBC
5107CallableStatement cstmt = null;
5108try {
5109 String SQL = "{call getEmpName (?, ?)}";
5110 cstmt = conn.prepareCall (SQL);
5111 . . .
5112}
5113catch (SQLException e) {
5114 . . .
5115}
5116finally {
5117 . . .
5118
51191021.
5120Which object serves as the global object at the top of the scope chain?
5121a) Hash
5122b) Property
5123c) Element
5124d) Window
5125Answer: d
5126Explanation: The Window object serves as the global object at the top of the scope chain
5127in client-side JavaScript.
51281022.
5129If the opearand of stack operation is register, the stack contents in 8085 store which of the
5130following?
51311023.
5132Who is responsible for correlating the different perspectives of distinct users?
51331024. A modulator converts a _____ signal to a(n) _____ signal.
5134A. FSK; PSK
5135B. PSK; FSK
5136C. analog; digital
5137D. digital; analog
5138E. None of the above
51391025.
5140In 8085 subtraction is performed using which method?
5141Answer: by the 2's complement method
51421026.
5143Data Model that provides ad-hoc queries is --------------
51441027.
5145Consider following code.
5146public class Test {
5147public static void main(String[] args) {
5148System.out.println(m(2));
5149}
5150public static int m(int num) {
5151return num;
5152}
5153public static void m(int num) {
5154System.out.println(num);
5155}
5156}
5157(a)The program has a syntax error because the two methods
5158m have the same signature
5159(b) The program has a syntax error because the second m method is
5160defined, but not invoked in the main method
5161(c) The program runs and prints 2 once
5162(d) The program runs and prints 2 twice
5163(e) The program runs and prints 2 thrice.
51641028.
5165What does the location property represent?
5166a) Current DOM object
5167b) Current URL
5168c) Both DOM object and URL
5169d) None of the mentioned
51701029.
5171Which among the following is not a property of the Location object?
5172a) protocol
5173b) host
5174c) hostee
5175d) hostname
5176Explanation: The various properties of the location object are the protocol, host,
5177hostname, port, search, and hash.
51781030.
5179What is the number of distinct symbols in base-16 ?
5180Answer: 16
51811031.
5182What is the loopback address?
5183Answer: type of IP address that is used to test the communication or transportation medium
5184on a local network card and/or for testing network applications. Special ip address 127.0.0.1
51851032.
5186A state that refers to the database when it is loaded is---- Initial Database State -----
51871033.
5188Consider the following code:
5189public class Test {
5190public static void main(String[] args) {
5191int[] x = new int[5];
5192int i;
5193for (i = 0; i < x.length; i++)
5194 x[i] = i;
5195System.out.println(x[i]);
5196}
5197}
5198(a) The program displays 0 1 2 3 4
5199(b) The program displays 4
5200(c) The program has a runtime error because the last statement in the main
5201method causes ArrayIndexOutOfBoundsException
5202(d) The program has syntax error because i is not defined in the last
5203statement in the main method
5204(e) The program displays 1 2 3 4 5.
52051034.
5206How many bits are present in registers A, B, C together in 8085?
5207Answer: 24 – ( 3 x 8 )
52081035.
5209What is the return type of the hash property?
5210The hash property sets or returns the anchor part of a URL
52111036.
5212------------------ is used to describe the structure and constraints for the whole database for a
5213community of users hides the details of physical storage structures in three -schema architecture
52141037.
5215A 4 KHz noise less channel with one sample ever 125 per sec is used to transmit digital signals.
5216Differential PCM with 4 bit relative signal value is used. Then how many bits per second are
5217actually sent?
5218A. 32 Kbps
5219B. 64 Kbps
5220C. 8 Kbps
5221D. 128 Kbps.
52221038.
5223What will be the value of c at the end of execution?
5224public static void main(String args[])
5225{ int a = 10, b = 2,c=0,d=0;
5226int[] A = {1,2,3};
5227try { c=a/b;
5228try { d = a/(a-a); d= A[1]+1; }
5229catch(ArrayIndexOutOfBoundsException e)
5230{ System.out.println("Array - unreachable element "+e); }
5231Finally { System.out.println("Finally block inside "); } }
5232catch(Exception e)
5233{ System.out.println("Some Problem:"+e); b = 1; c = a/b; }
5234finally { System.out.println("Finally block outside“) }
5235System.out.println("after try/catch blocks");
5236System.out.println("Ans = " +c); }
5237ERROR two
52381039.
5239What does the instruction INX H perform in 8085 microprocessor?
5240Increment register pair by 1.
5241Eg: INX H (It means the location pointed by the HL pair is incremented by 1)
52421040.
5243Which is the method that removes the current document from the browsing history before loading
5244the new document?
5245a) modify()
5246b) assign()
5247c) replace()
5248d) remove()
52491041.
5250Which method is used for loading the driver in Java JDBC.
5251Answer: . Class.forName()
5252
52531042.
5254What is the minimum number of wires required for sending data over a serial communications
5255links?
5256A. 1
5257B. 2 (answer)
5258C. 4
5259D. 6
52601043. --------EXTERNAL SCHEMA--------describes the the part of the database that a particular
5261user group is interested in and hides the rest.
52621044.
5263Which one is the first high level programming language
52641045.
5265The 8255 chip is an example of
52661046.
5267------------ is used to define internal schema
52681047.
5269Why is the replace() method better than the assign() method?
52701048.
5271In cyclic redundancy checking, the divisor is _____ the CRC.
5272A) The same size as
5273B) one bit less than
5274C) one bit more than
5275D) none of the above
52761049.
5277Centralized DBMS has----------
5278A centralized database (sometimes abbreviated CDB) is a database that is located,
5279stored, and maintained in a single location.
52801050.
5281What is 8254 used for?
5282The Intel 8253 and 8254 are Programmable Interval Timers (PITs), which perform
5283timing and counting functions using three 16-bit counters.
52841051.
5285An error-detecting code inserted as a field in a block of data to be transmitted is known as
5286A. Frame check sequence
5287B. Error detecting code
5288C. Checksum
5289D. flow control
5290E. None of the above
52911052.When a class extends the Thread class ,it should override ............ method of Thread class
5292to start that thread.
5293A. start()
5294B. run()
5295C. init()
5296D. go()
52971053.What is the purpose of the assign() method?
5298a) Only loading
5299b) Loading of window and display
5300c) Displays already present window
5301d) Unloading of window
5302The assign() method of the Location object makes the window load and display the document at
5303the URL you specify.
53041054.
5305Which two are valid constructors for Thread?
5306a.) Thread(Runnable r, String name)
5307b.) Thread()
5308c.) Thread(int priority)
5309d.) Thread(Runnable r, ThreadGroup g)
5310e.) Thread(Runnable r, int priority)
5311A. 1 and 3
5312B. 2 and 4
5313C. 1 and 2
5314D. 2 and 5
53151055.
5316Working of the WAN generally involves
5317A. telephone lines
5318B. microwaves
5319C. satellites
5320D. All of the above
53211056.
5322How many modes are present in 8255 and what are they?
53231. Bit Set/Reset mode (BSR mode).
53242. Input/Output mode (I/O mode). –
5325ï‚· Mode 0 - Simple I/O
5326ï‚· Mode 1 - Strobed I/O
5327ï‚· Mode 2 - Strobed Bi-directional I/O
53281057.
5329The history property belongs to which object?
5330a) Element
5331b) Window
5332c) History
5333d) Location
5334Explanation: The history property of the Window object refers to the History object for the
5335window.
53361058.
5337An Employee entity of a company database can be a SECRETARY, TECHNICIAN or
5338MANAGER.
5339What kind of participation constraint can be used for Employee and its job types?
53401059.
5341public class MyRunnable implements Runnable
5342{
5343public void run()
5344{
5345// some code here
5346}
5347}
5348which of these will create and start this thread?
5349[A]. new Runnable(MyRunnable).start();
5350[B]. new Thread(MyRunnable).run();
5351[C]. new Thread(new MyRunnable()).start();
5352[D]. new MyRunnable().start();
53531060.
5354If you configure the TCP/IP address and other TCP/IP parameters manually, you can always
5355verify the configuration through which of the following? Select the best answer.
5356A. Network Properties dialog box
5357B. Server Services dialog box
5358C. DHCPINFO command-line utility
5359D. Advanced Properties tab of TCP/ IP Info.
5360E. None of the above
53611061.
5362Which of the following is one of the fundamental features of JavaScript?
5363a) Single-threaded
5364b) Multi-threaded
5365c) Both Single-threaded and Multi-threaded
5366d) None of the mentioned
5367Explanation: One of the fundamental features of client-side JavaScript is that it is singlethreaded:
5368a browser will never run two event handlers at the same time, and it will never
5369trigger a timer while an event handler is running, for example.
53701062.If we can determine exactly those entities that will become members of each subclass by a
5371condition then such subclasses are called------ predicate-defined --------
53721063.
5373Which of the following is DMA controller?
53741064.
5375Given the code
5376String s1 = ? VIT? ;
5377String s2 = ? VIT ? ;
5378String s3 = new String ( s1);
5379Which of the following would equate to true?
5380 (A) s1 == s2
5381(B) s1 = s2
5382(C) s3 == s1
5383(D) s1.equals(s2)
5384(E) s3.equals(s1)
5385a) (A), (D) & (E)
5386b) (A), (C) & (E)
5387c) (A), (B) & (C)
5388d) (C), (D) & (E)
5389e) (D) & (E)
53901065.
5391The expected size of the join result divided by the maximum size is called
5392_________________.
53931066.
5394Four bits are used for packet sequence numbering in a sliding window protocol used in a
5395computer network. What is the maximum window size?
5396(a) 4
5397(b) 15
5398(c) 8
5399(d) 16.
54001067.
5401OOPs
5402Find the output of the following program?
5403#include
5404#define pow(x) (x)*(x)*(x)
5405using namespace std;
5406int main()
5407{
5408int a=3,b=3;
5409a=pow(b++)/b++;
5410cout<<a<<b;
5411return 0;
5412}
5413Answer: 107
54141068.
5415How many gate delays are present in efficient implementation of XOR gate ?
54161069.
5417. The attributes in foreign key and primary key have the same ____________.
54181070.
5419What is the output of the following program?
5420#include
5421using namespace std;
5422int main()
5423{
5424int x=20;
5425if(!(!x)&&x)
5426cout<<x;
5427else
5428{
5429x=10;
5430cout<<x;
5431return 0;
5432}}
5433Answer: 20
54341071.
5435What is the correct HTML for making a hyperlink?
5436<a href=”link”> text</a>
54371072.
5438Error control is needed at the transport layer because of potential errors occurring _____.
5439A. from transmission line noise
5440B. in routers
5441C. from out-of-sequence delivery
5442D. from packet losses.
54431073.
5444How many possible outcome values are present in boolean algebra?
5445Answer: 2
54461074.
5447Determine the output of the following code?
5448#include
5449using namespace std;
5450void func_a(int *k)
5451{
5452*k += 20;
5453}
5454void func_b(int *x)
5455{
5456int m=*x,*n = &m;
5457*n+=10;
5458}
5459int main()
5460{
5461int var = 25,*varp=&var;
5462func_a(varp);
5463*varp += 10;
5464func_b(varp);
5465cout<<var<<*varp;
5466return 0;
5467}
5468Answer: 5555
54691075.
5470Data link layer retransmits the damaged frames in most networks. If the probability of a frame's
5471being damaged is p, what is the mean number of transmissions required to send a frame if
5472acknowledgements are never lost.
5473A. K / K - P
5474B. 1 / K - P
5475C. K / K(1 + p)
5476D. p / K + 1
54771076.
5478___ Naïve or parametric end users __ users work on canned transactions
54791077.
5480Which of the following input controls that cannot be placed using tag?
54811078.
5482What does JSP stand for?
5483Answer: Java Server Pages
54841079.
5485What will be the output of the following program?
5486#include
5487using namespace std;
5488class x {
5489public:
5490int a;
5491x();
5492};
5493x::x() { a=10; cout<
5494class b:public x {
5495public:
5496b();
5497};
5498b::b() { a=20; cout<
5499int main ()
5500{
5501b temp;
5502return 0;
5503}
5504Answer: 10 20
55051080.
5506If a hospital has to store the description of each visit of a patient according to date what
5507attribute you will use in the patient entity type?
5508Answer: Composite
55091081.
5510The SQL statement SELECT SUBSTR('123456789', INSTR('abcabcabc','b'), 4)
5511FROM EMP; prints
5512The SQL statement
5513SELECT SUBSTR('123456789', INSTR('abcabcabc', 'b'), 4) FROM DUAL;
5514A. 6789
5515B. 2345
5516C. 1234
5517D. 456789
55181082.
5519Find the output of the following program?
5520#include
5521using namespace std;
5522void myFunction(int& x, int* y, int* z) {
5523static int temp=1;
5524temp += (temp + temp) - 1;
5525x += *(y++ + *z)+ temp - ++temp;
5526*y=x;
5527x=temp;
5528*z= x;
5529cout<<x<<*y<<*z<<temp;
5530}
5531int main() {
5532int i = 0;
5533int j[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
5534i=i++ - ++i;
5535myFunction(i, j, &i);
5536return 0;
5537}
5538Answer: 3-333/ 3425379433
55391083.
5540__SELECTORS__ is used to define a special CSS style for a group of HTML elements
55411084.
5542In HTTP, which method gets the resource as specified in the URI - GET
55431085.
5544JAVA PROGRAMMING
5545Java package is a grouping mechanism with the purpose of
55461086.
5547In SQL, which command is used to issue
5548multiple CREATE TABLE, CREATE VIEW and GRANT statements in a single
5549transaction?
5550a) CREATE PACKAGE
5551b) CREATE SCHEMA
5552c) CREATE CLUSTER
5553d) All of the mentioned
55541087.
5555Which of the following is the right syntax for assertion?
5556Create assertion ‘assertion-name’ check ‘predicate’;
55571088.
5558Which of these is Server side technology?
55591089.
5560Which one of these lists contains only Java programming language keywords
5561A. class, if, void, long, Int, continue
5562B. goto, instanceof, native, finally, default, throws
5563C. try, virtual, throw, final, volatile, transient
5564D. strictfp, constant, super, implements, do
5565E. byte, break, assert, switch, include
5566Answer: Option B
55671090.
5568. __FLASH MEMORY________ is increasingly being used in server systems to
5569improve performance by caching frequently used data, since it provides faster access
5570than disk, with larger storage capacity than main memory.
55711091.
5572Which of these interface abstractes the output of messages from httpd?
5573a) LogMessage
5574b) LogResponse
5575c) Httpdserver
5576d) httpdResponse
55771092.
5578The C++ language is
55791093.
5580Passing the request from one schema to another in DBMS architecture is called as
5581_______MAPPING______
55821094.
5583Where in an HTML document is the correct place to refer to an external style sheet?
5584Answer: In the <head> section
55851095.
5586Changing the conceptual schema without having to change the external schema is called as
5587______LOGICAL INDEPENDENCE__________
55881096.
5589Which method is used to remove the first element of an Array object?
5590Answer: Shift
55911097.
5592What does the following bit of JavaScript print out?
5593var a = [1,,3,4,5];
5594console.log([a[4], a[1], a[5]]);
5595Output - 5,null,indefined
55961098.
5597 Creating a B Tree index for your database has to specify in _____.
5598 a. DDL
5599 b. SDL
5600 c. VDL
5601 d. TCL
56021099.
5603Which one of the following statements is NOT correct about HTTP cookies?
5604A. A cookie is a piece of code that has the potential to compromise the
5605security of an Internet user
5606B. A cookie gains entry to the user's work area through an HTTP header
5607C. A cookie has an expiry date and time
5608D. Cookies can be used to track the browsing pattern of a user at a particular site
56091100.
5610The following HTML attribute is used to specify the URL of the html document to be opened
5611when a hyperlink is clicked.
5612Answer: HREF
56131101.
5614HTTP is implemented over - TCP
56151102.
5616If the directive session.cookie_lifetime is set to 3600, the cookie will live until..
5617a) 3600 sec
5618b) 3600 min
5619c) 3600 hrs
5620d) the browser is restarted
56211103.
5622AJAX made popular by
5623Option A):Sun Micro system
5624Option B):Google
5625Option C):IBM
5626Option D):Microsoft
56271104.
5628How to create a Date object in JavaScript?
5629dateObjectName = new Date([parameters])
56301105.
5631Output------?
56321106.
5633Choose the correct HTML tag to make a text italic
5634Answer: <i></i>
56351107.
5636table {color: blue;}
5637With the above code snippet in use, what happens to a table?
5638a) The table border would be colored blue.
5639b) The table background would be colored blue.
5640c) The text inside the table would be colored blue
56411108.
5642What sever support AJAX ?
56431109.
5644What does the XMLHttpRequest object accomplish in Ajax?
5645A.It's the programming language used to develop Ajax applications
5646B.It provides a means of exchanging structured data between the Web server and
5647client.
5648C.It provides the ability to asynchronously exchange data
5649between Web browsers and a Web server.
5650D.It provides the ability to mark up and style the display of Web-page text.
56511110.
5652Which Web browser is the least optimized for Microsoft's version of AJAX?
5653SAFARI
56541111.
5655Which one of these technologies is NOT used in AJAX?
5656A. CSS
5657B. DOM
5658C. DHTML
5659D. Flash
56601112.
5661When a user views a page containing a JavaScript program, which machine actually executes
5662the script?
5663The User’s machine running the web browser
56641113.
5665A graphical HTML browser resident at a network client machine Q accesses a static HTML
5666webpage from a HTTP server S. The static HTML page has exactly one static embedded image
5667which is also at S. Assuming no caching, which one of the following is correct about the HTML
5668webpage loading (including the embedded image)?
5669(A) Q needs to send at least 2 HTTP requests to S, each necessarily in a separate TCP
5670connection to server S
5671(B) Q needs to send at least 2 HTTP requests to S, but a single TCP connection
5672to server S is sufficient
5673(C) A single HTTP request from Q to S is sufficient, and a single TCP connection
5674between Q and S is necessary for this
5675(D) A single HTTP request from Q to S is sufficient, and this is possible without any
5676TCP connection between Q and S
56771114.
5678How does servlet differ from CGI?
5679Servlets are thread based and CGI is process based
5680Servlet is light weight.
56811115.
5682What does JSP stand for?
5683Java Server Pages
56841116.
5685Which of these is a stand alone tag?
5686<img> <br>
5687Standalone tags are used for elements which have no logical beginning or end.
5688One example of a standalone tag is the br tag,
56891117.
5690If you don’t want the frame windows to be resizeable, simply add what to the lines ?
5691noresize
56921118.
5693<a> and </a> are the tags used for ?
5694Adding links to your page