Hp0tTNaC

1
21.
3The truth table
4X Y f(X,Y)
50 0 0
60 1 0
71 0 1
81 1 1
9represents the Boolean function :
10Answer: X
112.
12Consider the following recursive C function.
13Void get (int n)
14{if (n<1) return;
15get (n-1)
16get (n-3) ;
17printf ("%d",n);
18If get(6) function is being called in main () then how many times will the get() function be invoked
19before returning to the main ( ) ?
20Answer : 25
213.
22Which of the following is shared between all of the threads in a process? Assume a kernel
23level thread implementation.
24Answer: File Descriptor/ Heap/ Stack pointer/ stack (Shared)
254.
26____________is the first schema to be designed when you are developing a DBMS
27Answer: Relation Schema / Conceptual Schema
285.
29________________ operate at the network layer, connecting two or more network segments that
30use the same or different data link layer protocols, but the same network layer protocol.
31Answer: Router
326.
33Buffer stock’ is the level of stock which is ___________
347.
35The addressing mode used in an instruction of the form ADD R1, R2 is _____.
36Answer: Absolute/Direct Addressing
378.
38Which of the following is not true of virtual memory?
39Ans: It requires the use of a disk or other secondary storage.( Actually it does not
40require).
419.
42General Purpose Software which creates and manipulates database is
43Answer : DBMS
4410.
45The _____ is generally used to group hosts based on the physical network topology.
46Answer: Hub/Switch
4711.
48Identify the item that is not taken into account in computing the current ratio
4912.
50#include
51int main ()
52{
53static int a[]={10, 20, 30, 40, 50};
54static int *p[]= {a, a+3, a+4, a+1, a+2};
55int **ptr=p;
56ptr++;
57printf ("%d%d", **p, **ptr);
58}
59The output of the program is ___
60Answer: 10 40
6113.
62What will be the output of the following C program?
63void count(int n){
64static int d=1;
65printf("%d ", n);
66printf("%d ", d);
67d++;
68if(n>1) count(n-1);
69printf("%d ", d);
70}
71void main(){
72count(3);
73}
74Output : 3 1 2 2 1 3 4 4 4
7514.
76Which of the following are generally the inventories of a service business?
77Answer:
7815.
79The load instruction is mostly used to designate a transfer from memory to a
80processor register known as
81Answer: Accumulator
8216.
83With a single resource, deadlock occurs,
84a) if there are more than two processes competing for that resource
85b) if there are only two processes competing for that resource
86c) if there is a single process competing for that resource
87d) None of these
88Answer: Deadlock Doesnot occour with a single resource
8917.
90System catalogue is a system created database that describes
9118.
92______ operate at the network layer, connecting two or more network segments that use the
93same or different data link layer protocols, but the same network layer protocol.
94Answer: Router
9519.
96Which of the following is an advantage of using database systems?
97Answer: Data can be accessed by multiple programs
9820.
99User Datagram Protocol adds no additional reliability mechanisms except one which is optional.
100Identify that.
101Answer: Checksum
10221.
103Which of the following groups of workers would be classified under indirect labour?
10422.
105Mutual exclusion problem occurs between
106Two disjoint process that do not interact
107- Process sharing same resources
108- Process not sharing same resources
109- None of these
11023.
111Simplified form of the boolean expression (X + Y + XY) (X + Z) is
112Answer : X+YZ
11324.
114Consider the following program:
115int f(int *p, int n)
116{
117if (n <= 1) return 0;
118else return max ( f (p+1, n-1),p[0]-p[1]);
119}
120int main()
121{
122int a[] = {3,5,2,6,4};
123printf("%d", f(a,5));
124}
125The value printed by this program is
126Answer: 3 (i.e. 5-2=3 or the maximum difference between any two consecutive numbers
127taken from left to right)
12825.
129What schema defines how and where the data are organized in a physical storage?
130Answer: Physical Database Schema
13126.
132Which of the following logic expression is incorrect?
133Answer: 1 XOR 1 XOR 0 = 1 (FALSE, actually should be 0)
13427.
135The maintenance department of a manufacturing company is a/ an ____________
13628.
137For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements
138is/are TRUE ?
139I. At least three non-overlapping channels are available for transmissions.
140II. The RTS-CTS mechanism is used for collision detection.
141III.Unicast frames are ACKed.
142Answer: ! and III are true
14329.
144Use of ________ allows for some processes to be waiting on I/O while another process
145executes.
146Answer :
14730.
148To prevent any method from overriding, the method has to declared as,
149Answer: Final
15031.
151The protocol data unit (PDU) for the application layer in the Internet stack is
152(C) Message is answer.
153For Application, Presentation and Session layers, the PDU is message
154For Transport layer, PDU is segment for TCP and datagram for UDP
155For Network layer, PDU is packet
156For Datalink layer, PDU is frames
157For physical layer, PDU is stream of bits
15832.
159The E-R model was first introduced by
160Answer: Peter Chen
16133.
162Acid test ratio should normally be ______
16334.
164The truth table
165X Y f(X,Y)
1660 0 0
1670 1 0
1681 0 1
1691 1 1
170represents the Boolean function
171Answer: X
17235.
173______ OS pays more attention on the meeting of the time limits.
174Answer: Real Time
17536.
176Consider the following C program.
177#include
178int f1 (void) ;
179int f 2 void ;
180int x 10;
181int main ()
182{
183int x=1;
184x+=f1()+ f2()+f3()+f2() ;
185printf("%d", x);
186return 0;
187}
188int f1(){int x=25; x++; return x;}
189int f2(){static int x =50; x++;return x;}
190int f3(){x*=10; return x};
191The output of the program is_________.
192Answer: 230
19337.
194Consider the function func shown below:
195int func(int num) {
196int count = 0;
197while (num) {
198count++;
199num>>= 1;
200}
201return (count);
202}
203The value returned by func(435)is
204Answer: 9
20538.
206Budgetary control facilitates easy introduction of the _________________
20739.
208The father of relational database system is
209Answer: Edgar Frank "Ted" Codd
21040.
211The performance of cache memory is frequently measured in terms of a quantity called
212Answer: Hit Ratio
21341.
214An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available
215with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization
216A, and a quarter to Organization B, while retaining the remaining with itself. Which of the
217following is a valid allocation of address to A and B?
218(A) 245.248.136.0/21 and 245.248.128.0/22
219(B) 245.248.128.0/21 and 245.248.128.0/22
220(C) 245.248.132.0/22 and 245.248.132.0/21
221(D) 245.248.136.0/22 and 245.248.132.0/21
22242.
223Using 10's complement 72532- 3250 is
224Answer: 69282
22543.
226What is the RDBMS terminology for a row
227Answer: Tuple
22844.
229A current ratio of less than one means
230Answer: Liabilities are Greater than assets
23145.
232Consider the following C program segment.
233#include
234intmain()
235{char sl [7]="1234",*p;
236p=sl+2;
237*p='0';
238printf ("%s",sl)
239{
240What will be printed by the program?
241Answer: 1204
24246.
243The 16-bit 2?s complement representation of an integer is 1111 1111 1111 0101, its decimal
244representation is
245Answer : -11
24647.
247Which of the following is/are example(s) of stateful application layer protocols?
248(i)HTTP
249(ii)FTP
250(iii)TCP
251(iv)POP3
252Answer: (ii) & (iv)
25348.
254What is the software that runs a computer, including scheduling tasks, managing storage, and
255handling communication with peripherals?
256Answer: Operating System
25749.
258Budgetary control system acts as a friend, philosopher and guide to the ____________
259Management
260Share holders
261Creditors
262Employees
26350.
264Which of the following is not usually stored in a two-level page table?
26551.
266Consider the following recursive C function.
267Void get (int n)
268{if (n<1) return;
269get (n-1)
270get (n-3) ;
271printf ("%d",n);
272If get(6) function is being called in main () then how many times will the get() function be invoked
273before returning to the main ( ) ?
274Answer : 25
27552.
276A circuit that converts n inputs to 2^n outputs is called
277Answer : Decoder
27853.
279The relationship that exists within the same entity type is called as _________
280relationship.
281Answer: Recursive
28254.
283TCP manages a point-to-point and _______ connection for an application between two
284computers.
285Answer : Reliable
28655.
287Decoder is a
288Answer: decoder is a combinational logic circuit that converts binary information from
289the n coded inputs to a maximum of 2n unique outputs
29056.
291What is the maximum number of IP addresses that can be assigned to hosts on a local subnet
292that uses the 255.255.255.224 subnet mask?
293Answer: 30
29457.
295The purpose of a TLB is
296Answer: A translation lookaside buffer (TLB) is a memory cache that stores
297recent translations of virtual memory to physical addresses for faster
298retrieval
29958.
300#include
301int main ()
302{
303static int a[]={10, 20, 30 40, 50};
304static int *p[]= {a, a+3, a+4, a+1, a+2};
305int **ptr=p;
306ptr++;
307printf ("%d%d", ptr p, **ptr);
308}
309The output of the program is ________10 40__.
31059.
311The total cost that increases when the quantity produced is increased by one unit is called
312____________
313Ans: Marginal Cost
31460.
315Normalisation of database is used to
316to reduce data redundancy and improve data integrity
31761.
318Consider the following program in C language:
319#include
320main()
321{
322int i;
323int *pi = &i;
324scanf(?%d?,pi);
325printf(?%dn?, i+5);
326}
327It prints the value by incrementing it by 5
328Which one of the following statements is TRUE?
32962.
330What is the RDBMS terminology for a set of legal values that an attribute can have ?
331Answer: Domain
332Degree – Numver of columns
333Cardinality – Number of rows
33463.
335The _____ is generally used to group hosts based on the physical network topology.
336Answer : Hub/Switch
33764.
338To build a mod-19 counter the number of flip-flops required is
339Answer : 5
34065.
341Fixed budget is useless for comparison when the level of activity is ___________
34266.
343System calls:
344A system call is a way by which a program/process requests services of operating
345system (kernel). And a priviledged instructions in an instruction that can be
346performed only in kernel/supervisor mode.
34767.
348Which of the following is not an activity listed in the statement of cash flows?
34968.
350The smallest integer than can be represented by an 8-bit number in 2?s complement form is
351Answer: -128
35269.
353What is the main difference between traps and interrupts?
354Answer: Trap is a software generated interrupt.
35570.
356ATM uses a ____ packet size
357Answer : 53 Octets 5 Header + 48 Payload
35871.
359Which of the following concurrency control mechanisms insist unlocking of all read and write
360locks of transactions at the end of commit?
36172.
362Consider the following C program.
363#include
364int f1 (void) ;
365int f 2 void ;
366int x 10;
367int main ()
368{
369int x=1;
370x+=f1()+ f2()+f3()+f2() ;
371printf("%d", x);
372return 0;
373}
374int f1(){int x=25; x++; return x;}
375int f2(){static int x =50; x++;return x;}
376int f3(){x*=10; return x};
377The output of the program is_____230____.
37873.
379Class D in network is used for
380Answer: Multicasting
38174.
382What is the RDBMS technology for the number of attributes in a relation?
383Answer : Degree
38475.
385All factory costs are treated as _______ while all administration costs are treated as
386________
38776.
3881024 bit is equal to how many byte
389Answer : 128
39077.
391Buffering is useful because
392The buffer allows each device or process to operate without being held up by the other.
39378.
394Consider the following C code segment:
395int a, b, c = 0;
396void prtFun(void);
397main( )
398{ static int a = 1; /* Line 1 */
399prtFun( );
400a + = 1;
401prtFun( )
402printf(?n %d %d ?, a, b);
403}
404void prtFun(void)
405{ static int a=2; /* Line 2 */
406int b=1;
407a+=++b;
408printf(?n %d %d ?, a, b);
409}
410What output will be generated by the given code segment if:
411Line 1 is replaced by auto int a = 1;
412Line 2 is replaced by register int a = 2;
413ANSWER: (A) 3 1
4144 1
4154 2
416(B) 4 2
4176 1
4186 1
419(C) 4 2
4206 2
4212 0
422(D) 4 2
4234 2
4242 0
42579.
426Consider the following program:
427int f(int *p, int n)
428{
429if (n <= 1) return 0;
430else return max ( f (p+1, n-1),p[0]-p[1]);
431}
432int main()
433{
434int a[] = {3,5,2,6,4};
435printf("%d", f(a,5));
436}
437The value printed by this program is
438ANSWER : 3
43980.
440_______RELATIONAL/CONCEPTUAL_____is the first schema to be designed
441when you are developing a DBMS
44281.
443Adjacent squares in a K-Map represents a
444ANSWER: A group is a loose term for the enclosure containing adjacent square.
44582.
446If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the
447service provided is for
448Answer: Higher Priority
44983.
450An area of a business which collects costs is known as __________
45184.
452What will be the output of the following program?
453#include
454using namespace std;
455class x {
456public:
457int a;
458x();
459};
460x::x() { a=10; cout<
461class b:public x {
462public:
463b();
464};
465b::b() { a=20; cout<
466int main ()
467{
468b temp;
469return 0;
470}
471Answer: 10 20
47285.
473An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of
474processes is ________.
475Answer: Shortest Job First
47686.
477Minterms are arranged in map in a sequence of
478Answer: Gray Code
47987.
480Which one of the following variables is not categorical?
481Answer : Age of a person
48288.
483Suppose that everyone in a group of N people wants to communicate secretly with N-1 others
484using symmetric key cryptographic system. The communication between any two persons should
485not be decodable by the others in the group. The number of keys required in the system as a
486whole to satisfy the confidentiality requirement is
487(A) 2N
488(B) N(N – 1)
489(C) N(N – 1)/2
490(D) (N – 1)2
49189.
492The servlet life cycle has the following cycle.
4931. Servlet class is loaded.
4942. Servlet instance is created.
4953. init method is invoked.
4964. service method is invoked.
4975. destroy method is invoked.
49890.
499In the IPv4 addressing format, the number of networks allowed under Class C addresses is
500Answer: 2,097,152 (221)
50191.
502What is data collection?
503Answer: Data collection is the process of gathering and measuring information on
504targeted variables in an established systematic fashion, which then enables one to
505answer relevant questions and evaluate outcomes.
50692.
507When a program tries to access a page that is mapped in address space but not loaded in
508physical memory, then
509Answer: Page fault occours
51093.
511The main difference between JK and RS flip-flop is that
512The main difference between a JK flip-flop and an SR flip-flop is that in the JK flipflop,
513both inputs can be HIGH. When both the J and K inputs are HIGH, the Q
514output is toggled, which means that the output alternates between HIGH and LOW.
515Thereby the invalid condition which occurs in the SR flipflop is eliminated.
51694.
517SQl allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in
518the result of joins. Which one of the following queries always gives the same answer as the
519nested query shown below:
520select * from R where a in (select S.a from S)
521A) Select R.* from R, S where R.a=S.a
522(B) Select distinct R.* from R, S where R.a=S.a
523(C) Select R.* from R, (select distinct a from S) as S1 where R.a=S1.a
524(D) Select R.* from R, S where R.a = S.a and is unique R
52595.
526Which algorithm chooses the page that has not been used for the longest period of time
527whenever the page required to be replaced?
528Answer: Least Recently Used(LRU)
52996.
530Which of the following unit will choose to transform decimal number to binary code ?
531A.Encoder
532B. Decoder
533C. Multiplexer
534D.Counter
53597.
536Given the following schema:employees(emp-id, first-name, last-name, hire-date,dept-id,
537salary)departments(dept-id, dept-name, manager-id, location-id)
538You want to display the last names and hire dates of all latest hires in their respective
539departments in the location ID 1700. You issue the following query:SQL>SELECT last-name,
540hire-date
541FROM employees
542WHERE (dept-id, hire-date) IN
543(SELECT dept-id, MAX(hire-date)
544FROM employees JOIN departments USING(dept-id)
545WHERE location-id = 1700
546GROUP BY dept-id);
547What is the outcome?
548(A) It executes but does not give the correct result.
549(B) It executes and gives the correct result.
550(C) It generates an error because of pairwise comparison.
551(D) It generates an error because the GROUP BY clause cannot be used with table joins
552in a subquery
55398.
554The schedule used to measure a respondent’s opinion is ________
55599.
556The following function computes the maximum value contained in an integer array
557p[ ] of size n (n >= 1).
558int max(int *p, int n) {
559int a=0, b=n-1;
560while (__________) {
561if (p[a] <= p[b]) { a = a+1; }
562else { b = b-1; }
563}
564return p[a];
565}
566The missing loop condition is
567Answer: b!=a
568100.
569ICMP is primarily used for
570Answer: Error and diagnostics
571101.
572List of all the units of the population is called _____________
573102.
574TCP manages a point-to-point and _______ connection for an application between two
575computers
576Answer: Reliable
577103.
578The best index for exact match query is
579104.
580The embedded c program is converted by cross compiler to
581Answer: Machine Language
582105.
583How many address bits are needed to select all memory locations in the 16K × 1 RAM?
584[A]. 8
585[B]. 10
586[C]. 14
587[D]. 16
588106.
589Which of the following boolean expressions is not logically equivalent to all of the rest ?
590(a) wxy' + wz' + wxyz + wy'z
591(b) w(x + y' + z')
592(c) w + x + y' + z'
593(d) wx + wy' + wz'
594107.
595If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative
596mapping. Then each word of cache memory shall be_____.
597a) 11 bits
598b) 21 bits
599c) 16 bits
600d) 20 bits
601108.
602The best sample is one that is ____________
603109.
604What is the output of the following program?
605#include
606using namespace std;
607int main()
608{
609int x=20;
610if(!(!x)&&x)
611cout<<x;
612else
613{
614x=10;
615cout<<x;
616return 0;
617}}</x;
618</x;
619Answer: 20
620110.
621Assume a table Employee (Eno, Ename, Dept, Salary, Phone) with 10000 records.
622Also assume that Employee has a non-clustering index on Salary, clustering indexes on Dept
623and Phone. If there is a SQL query "SELECT Eno FROM Employee WHERE Salary/12 = 10000",
624which of the following will happen during query execution?
625Answer: Search/Selection?
626111.
627Which of the following statements is true ?
628112. Which standard TCP port is assigned for contacting SSH servers?
629a) port 21
630b) port 22
631c) port 23
632d) port 24
633113.
634Consider the following schema as:
635Product_Master (prod_id, prod_name, rate)
636Purchase_details (prod_id, quantity, dept_no, purchase_date).
637Choose the suitable relational algebra expressionn for Get Product_id, Product_name & quantity
638for all purchased products
639114.
640When an instruction is read from the memory, it is called
641Answer: Instruction cycle (Also called Fetch-Decode-Execute Cycle)
642115.
643______________ research deals with practical problems
644116.
645Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The
646round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The
647time taken (in msec) by the TCP connection to get back to 32 KB congestion window is
648(A) 1100 to 1300
649(B) 800 to 1000
650(C) 1400 to 1600
651(D) 1500 to 1700
652Explanation: Given that at the time of Time Out, Congestion Window Size
653is 32KB32KB and RTT = 100ms100ms,
654 When Time Out occurs, for the next round of Slow Start,
655Threshold = size of congestion window2size of congestion window2 ,
656Threshold = 16KB
657Suppose we have a slow start ==>> 2KB∣4KB∣8KB∣16KB2KB∣4KB∣8KB∣16KB (As
658the threshold is reached, Additive increase
659starts) ∣18KB∣20KB∣22KB∣24KB∣26KB∣28KB∣30KB∣32KB∣18KB∣20KB∣22KB∣24K
660B∣26KB∣28KB∣30KB∣32KB
661Here | (vertical line) is representing RTT so the total number of vertical lines
662is 11∗100ms11∗100ms==>> 1100msec1100msec and so this is the answer...
663117.
664Consider the following function written the C programming language.
665void foo (char * a ) {
666if (* a & & * a ! =' ' ){
667putchar (*a);
668}
669}
670}
671The output of the above function on input ?ABCD EFGH? Is
672Actual gate Question: Consider the following function written in the C
673programming langauge :
674void foo(char *a)
675{
676 if (*a && *a != ' ')
677 {
678 foo(a+1);
679 putchar(*a);
680 }
681}
682The output of the above function on input "ABCD EFGH" is
683A. ABCD EFGH
684B. ABCD
685C. HGFE DCBA
686D.DCBA
687118.
688The minimum number of NAND gates required to implement the Boolean function.
689A + AB' + AB'C is equal to
690A. 0 (Zero)
691B. 1
692C. 4
693D. 7
694Explanation: A(1+B'+B'C) which is equal To A
695 So No need For any NAND gate
696119.The 16 bit flag of 8086 microprocessor is responsible to indicate ___________
697A. the condition of result of ALU operation
698B. the condition of memory
699C. the result of addition
700D. the result of subtraction
701120. Creating a B Tree index for your database has to specify in _____.
702
703 a. DDL
704 b. SDL
705 c. VDL
706 d. TCL
707121.UDP has a smaller overhead then TCP, especially when the total size of the messages is
708Answer: SMALL
709122.
710A solution to the Dining Philosopher?s problem which avoids Deadlock can be:
711A. ensure that all philosophers pick up the left fork before the right fork
712B. ensure that all philosophers pick up the right fork before the left fork
713C. ensure that one particular philosopher picks up the left fork before
714the right fork, and that all other philosophers pick up the right fork
715before the left fork
716D. None of the above
717Answer: C
718123.
719Plan of study of a researcher is called the __________
720124.
721For a C program accessing X[i][j][k], the following intermediate code is generated by a compiler.
722Assume that the size of an integer is 32 bits and the size of a character is 8 bits.
723t0 = i * 1024
724t1 = j * 32
725t2 = k * 4
726t3 = t1 + t0
727t4 = t3 + t2
728t5 = X[t4]
729Which one of the following statements about the source code for the C program is CORRECT?
730A. X is declared as "int X[32] [32] [8]”.
731B. X is declared as "int X[4] [1024] [32]”.
732C. X is declared as "char X[4] [32] [8]”.
733D. X is declared as "char X[32] [16] [2]”.
734Answer: A
735125.Which of the following are used to generate a message digest by the network security
736protocols?
737(P) RSA (Q) SHA-1 (R) DES (S) MD5
738(A) P and R only
739(B) Q and R only
740(C) Q and S only
741(D) R and S only
742Answer :C
743Explanation:
744 RSA – It is an algorithm used to encrypt and decrypt messages.
745 SHA 1 – Secure Hash Algorithm 1, or SHA 1 is a cryptographic hash function. It
746produces a 160 bit (20 byte) hash value (message digest).
747 DES – Data Encryption Standard, or DES is a symmetric key algorithm for
748encryptionof electronic data.
749 MD5 – Message Digest 5, or MD5 is a widely used cryptographic hash function that
750produces a 128 bit hash value (message digest).
751126.The data manipulation language used in SQL is a,
752(I) Procedural DML
753(II) Non-Procedural DML
754(III) Modification DML
755(IV) Declarative DML
756Answer : Procedural and Declarative
757127.
758A variable that is presumed to cause a change in another variable is called a/an _____________
759a. categorical variable
760b. dependent variable
761c. independent variable
762d. intervening variable
763Intervening Variable: An intervening variable (sometimes called a mediating variable) is a
764hypothetical variable used to explain causal links between other variables. Intervening
765variables cannot be observed in an experiment (that's why they are hypothetical).
766128.
767The 16-bit 2?s complement representation of an integer is 1111 1111 1111 0101, its decimal
768representation is
769Answer : -11
770129.
771The OS of a computer may periodically collect all the free memory space to form contiguous
772block of free space. This is called
773A. Concatenation
774B. Garbage collection
775C. Collision
776D. Dynamic Memory Allocation
777130.
778public class MyRunnable implements Runnable
779{
780public void run()
781{
782// some code here
783}
784}
785which of these will create and start this thread?
786[A]. new Runnable(MyRunnable).start();
787[B]. new Thread(MyRunnable).run();
788[C]. new Thread(new MyRunnable()).start();
789[D]. new MyRunnable().start();
790131.
791A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
792page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
793maximum size of the page table of a process is 24 megabytes, the length of the virtual address
794supported by the system is _________ bits.
795(A) 36
796(B) 32
797(C) 28
798(D) 40
799Explanation: A page table entry has following number of bits.
8001 (valid bit) +
8011 (dirty bit) +
8023 (permission bits) +
803x bits to store physical address space of a page.
804Value of x = (Total bits in physical address) -
805 (Total bits for addressing within a page)
806Since size of a page is 8 kilobytes, total bits needed within
807a page is 13.
808So value of x = 32 - 13 = 19
809Putting value of x, we get size of a page table entry =
810 1 + 1 + 3 + 19 = 24bits.
811Number of page table entries
812 = (Page Table Size) / (An entry size)
813 = (24 megabytes / 24 bits)
814 = 223
815Vrtual address Size
816 = (Number of page table entries) * (Page Size)
817 = 223 * 8 kilobits
818 = 236
819Therefore, length of virtual address space = 36
820132.
821DMA is useful for the operations
822Answer: DMA is useful for transferring large quantities of data between memory
823and devices. It eliminates the need for the CPU to be involved in the transfer,
824allowing the transfer to complete more quickly and the CPU to perform other
825tasks concurrently.
826133.
827Data security threats include
828A. Hardware failure
829B. Privacy invasion
830C. Fraudulent manipulation of data
831D. All of the above
832134.
833Open-ended questions provide primarily ______ data
834135.
835Assume a relation ACCOUNT (acno, balance, type, branch, last_accessed) with 1 million
836records. If a SQL query "SELECT balance FROM account WHERE balance>5000" would
837produce 800000 records, which one of the following is the optimized version of relational algebra
838expressions that is equivalent to the given SQL query?
839136.
840What does the code snippet given below do?
841void fun1(struct node* head)
842{
843if(head == NULL)
844 return;
845 fun1(head->next);
846printf("%d ", head->data);
847}
848Ans: Prints all nodes of linked list in reverse order
849137.
850Given the following structure template, choose the correct syntax for accessing th
851e 5th subject marks of the 3rd student.
852struct stud
853{
854 int marks[6];
855 char sname[20];
856 char rno[10];
857}s[10];
858Answer: s[2].marks[4]
859138.
860Which of the following transport layer protocols is used to support electronic mail?
861(A) SMTP
862(B) IP
863(C) TCP
864(D) UDP
865139.
866Three concurrent processes X, Y, and Z execute three different code segments that access and
867update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores
868a, b and c; Process Y executes the P operation on semaphores b, c and d; Process Z executes
869the P operation on semaphores c, d, and a before entering the respective code segments. After
870completing the execution of its code segment, each process invokes the V operation (i.e., signal)
871on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of
872the following represents a deadlock-free order of invoking the P operations by the processes?
873(A) X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
874(B) X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
875(C) X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
876(D) X: P(a)P(b)P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)
877140.
878Eight minterms will be used for
879A. three variables
880B. four variables
881C. five variables
882D. six variables
883141.
884General Purpose Software which creates and manipulates database is
885Answer: DBMS
886142.
887Which of these is not a method of data collection?
888143.
889The number of min-terms after minimizing the following Boolean expression is _______.
890[D'+AB'+A'C+AC'D+A'C'D]'
891Answer: 1.
892The end result of this gives us only one minterm = ABCD
893hence, answer = 1
894144.
895Consider the following C code segment:
896int a, b, c = 0;
897void prtFun(void);
898main( )
899{ static int a = 1; /* Line 1 */
900prtFun( );
901a + = 1;
902prtFun( )
903printf(?n %d %d ?, a, b);
904}
905void prtFun(void)
906{ static int a=2; /* Line 2 */
907int b=1;
908a+=++b;
909printf(?n %d %d ?, a, b);
910}
911What output will be generated by the given code segment?
912Answer: 4 2
913 4 2
914 2 0
915145.
916Consider a join (relation algebra operation) between relations r(R)and s(S) using the nested loop
917method. There are 3 buffers each of size equal to disk block size, out of which one buffer is
918reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer
919number of disk block accesses if
920(A) relation r(R) is in the outer loop.
921(B) relation s(S) is in the outer loop.
922(C) join selection factor between r(R) and s(S) is more than 0.5.
923(D) join selection factor between r(R) and s(S) is less than 0.5.
924Answer : A
925146.
926This topology requires multipoint connection
927Answer: BUS
928147.
929_________________ refers to the number of units to be chosen from the population
930148.
931Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at
932cylinder100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110,
933135 and 145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access,
934the request for cylinder 90 is serviced after servicing ____________ number of requests.
935(A) 1
936(B) 2
937(C) 3
938(D) 4
939149.
940Consider the following C program
941#inclue
942int main()
943int i, j, k 0;
944j=2*3/4+2.0 / 5+8 / 5;
945k-= --j;
946for (i=0; i<5; i++)
947{
948Switch (i + k)
949{
950case1:
951case 2 : printf (" n%d", i+k)
952case 3 : printf (" n%d", i+k);
953default : printf ("n%d",i+k);
954}
955}
956Return 0:
957}
958The number of times printf statement is executed is ____10_____.
959150.
9601024 bit is equal to how many byte
961Answer: 128
962151.
963Action research means __________
964152.
965In which addressing mode the operand is given explicitly in the instruction?
966Answer: Immediate Mode
967153.
968HTTP is ________ protocol
969a) application layer
970b) transport layer
971c) network layer
972d) none of the mentioned
973154.Which of the following is NOT a superkey in a relational schema with attributes V,W,X,Y,Z
974and primary key V Y?
975(A) V X Y Z
976(B) V W X Z
977(C) V W X Y
978(D) V W X Y Z
979Explanation: Super key = Candidate Key + other attributes. But option B does not
980include Y which is a part of PK or candidate key.
981155.
982Which of the following is not a part of instruction cycle?
983Answer: stages of instruction cycle:
984a. Fetch
985b. Decode
986c. Execute
987d. Derive effective address of the instruction
988e. All of these
989156.
990A process executes the code
991fork ();
992fork ();
993fork ();
994The total number of child processes created is
995(A) 3
996(B) 4
997(C) 7
998(D) 8
999Answer (C)
1000157.
1001SQl allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in
1002the result of joins. Which one of the following queries always gives the same answer as the
1003nested query shown below:
1004select * from R where a in (select S.a from S)
1005158.
1006One of the terms given below is defined as a bundle of meanings or characteristics associated with
1007certain events, objects, conditions, situations, and the like
1008Concept
1009159.
1010The HTTP response message leaves out the requested object when _____ method is used
1011a) GET
1012b) POST
1013c) HEAD
1014d) PUT
1015160.
1016Consider the following C
1017function.
1018int fun (int n) {
1019int x =1, k;
1020if (n ==1) return x;
1021for (k=1; k < n; ++k)
1022x = x + fun (k)* fun (n - k); return x;
1023}
1024The return value of fun (5) is ___51____
1025161.
1026__PUBLIC KEY____ cryptography refers to encryption methods in which both the sender and
1027receiver share the same key.
1028162.
1029After fetching the instruction from the memory, the binary code of the
1030instruction goes to
1031Answer: MBR – Memory Buffer Register
1032163.
1033The following function computes the maximum value contained in an integer array
1034p[ ] of size n (n >= 1).
1035int max(int *p, int n) {
1036int a=0, b=n-1;
1037while (__________) {
1038if (p[a] <= p[b]) { a = a+1; }
1039else { b = b-1; }
1040}
1041return p[a];
1042}
1043The missing loop condition is
1044Answer: b!=a.
1045164.
1046Research questions are crucial because they will _________
1047165.The average time required to reach a storage location in memory and obtain its contents is
1048called the
1049Answer: Access time
1050166.
1051The relation R={A,B,C,D,E,F} with FD A,B-> C, C-> D, C->E,F holds
1052Ans: AEH, BEH, DEH
1053167.
1054The relationship that exists within the same entity type is called as
1055_____recursive____ relationship.
1056168.
1057Consider the following C
1058function.
1059int fun (int n) {
1060int x =1, k;
1061if (n ==1) return x;
1062for (k=1; k < n; ++k)
1063x = x + fun (k)* fun (n - k); return x;
1064}
1065The return value of fun (5) is ___51____
1066169.
1067When CPU is executing a Program that is part of the Operating System, it is said to be in
1068 A. Interrupt mode
1069B. System mode
1070 C. Half mode
1071 D. Simplex mode
1072170.
1073Flip-flops can be constructed with two
1074Answer: NAND
1075171.
1076Using public key cryptography, X adds a digital signature σ to message M, encrypts, and sends it
1077to Y, where it is decrypted. Which one of the following sequences of keys is used for the
1078operations?
1079(A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by
1080Y’s public key
1081(B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by
1082Y’s private key
1083(C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by
1084X’s private key
1085(D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key
1086followed by X’s public key
1087172.
1088Actuary is a person who ________
1089173.
1090If a hospital has to store the description of each visit of a patient according to date what
1091attribute you will use in the patient entity type?
1092Ans: multivalued attribute
1093174.
1094Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at
1095the same time to a computer system. Which one of the following process scheduling algorithms
1096would minimize the average waiting time in the ready queue?
1097(A) Shortest remaining time first
1098(B) Round-robin with time quantum less than the shortest CPU burst
1099(C) Uniform random
1100(D) Highest priority first with priority proportional to CPU burst length
1101Answer: (A)
1102175.
1103What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note
1104that the first parameter is passed by reference, whereas the second parameter is passed by
1105value.
1106int f (int &x, int c) {
1107c=c-1;
1108if (c-0) return 1;
1109x=x+1;
1110return f (x,c)*x;}
1111Answer: (B) 6561
1112176.
1113Decimal digit in BCD can be represented by
1114Answer: binary-coded decimal (BCD) is a class of binary encodings of decimal numbers
1115where each decimal digit is represented by a fixed number of bits, usually four or eight.
1116177.
1117Insurable interest in a life insurance contract should be present _______
1118178.
1119Error correction and error detection happens in ____DATA LINK_______ layer.
1120179.
1121Which of the following statements regarding RBI is not correct:
1122180.
1123___ICMP___is used by network devices, like routers, to send error messages indicating, for
1124example, that a requested service is not available or that a host or router could not be reached.
1125Answer: Internet Control mEssaging Protocol.
1126181.
1127KDD (Knowledge Discovery in Databases) is referred to,
1128ANSWER: broad process of finding knowledge in data, and emphasizes the "highlevel"
1129application of particular data mining methods
1130182.
1131Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main
1132memory consists of 256 blocks and the request for memory blocks is in the following order: 0,
1133255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155 Which one of the following memory
1134block will NOT be in cache if LRU replacement policy is used?
1135Answer: 216
1136183.The output of the following program is
1137main()
1138{
1139int a = 5;
1140int b = 10;
1141cout << (a>b?a:b);
1142}
1143Answer: 10
1144184.
1145Design procedure of combinational circuit involves
11461. Determine required number of inputs and outputs from the specifications.
11472. Derive the truth table for each of the outputs based on their relationships to the
1148input.
11493. Simplify the boolean expression for each output. Use Karnaugh Maps or Boolean
1150algebra.
11514. Draw a logic diagram that represents the simplified Boolean expression. Verify the
1152design by analysing or simulating the circuit.
1153185.
1154The banking companies that are allowed to operate in a very limited geographical area, are
1155known as ______________
1156186.
1157_____________DATA MODEL__________gives the concepts to describe the
1158structure of the database.
1159187.
1160In dynamic routing mechanism the route changes in response to _______
1161188.
1162Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11,92,
116310. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63,
1164moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from
11650 to 199. The total head movement (in number of cylinders) incurred while servicing these
1166requests is
1167(A) 346
1168(B) 165
1169(C) 154
1170(D) 173
1171189.
1172In design procedure input output values are assigned with
1173190.
1174The Third stage in designing a database is when we analyze our tables more closely and create
1175a _____RELATIONSHIP______ between tables.
1176191.
1177Majority of share capital in RBI is held by ____________
1178192.
1179Mod-6 and mod-12 counters are most commonly used in
1180[A]. frequency counters
1181[B]. multiplexed displays
1182[C]. digital clocks
1183[D]. power consumption meters
1184193.
1185A race condition occurs when
1186A. Two concurrent activities interact to cause a processing error
1187B. two users of the DBMS are interacting with different files at the same time
1188C. both (a) and (b)
1189D. All of the above
1190E. None of the above
1191194.
1192Multiplexing is used in _______
1193a) Packet switching
1194b) Circuit switching
1195c) Data switching
1196d) None of the mentioned
1197195.
1198The minimum number of page frames that must be allocated to a running process in a virtual
1199memory environment is determined by
1200a) the instruction set architecture
1201b) page size
1202c) physical memory size
1203d) number of processes in memory
1204196.
1205Passing the request from one schema to another in DBMS architecture is called as
1206___________________
1207Answer: Mapping
1208197.
1209_______ is a set of networks sharing the same routing policy
1210Answer: Autonomous System
1211198.
1212IRDA is associated with __________
1213199.
1214Mod-6 and mod-12 counters are most commonly used in
1215Answer: Digital Clocks
1216200.
1217. For computers based on three - address instruction formats, each address field can be used to
1218specify which of the following:
1219S1: A memory operand
1220S2: A processor register
1221S3: An implied accumulator registers
1222(A) Either S1 or S2
1223(B) Either S2 or S3
1224(C) Only S2 and S3
1225(D) All of S1, S2 and S3
1226201.
1227Insurance companies collect a fixed amount from its customers at fixed intervals of time. What is it
1228called?
1229Answer: premium
1230202.
1231A relation schema R is said to be in 4NF if for every MVD x-->>y that holds over R
1232A ->> B is a trivial MVD
1233 A is a superkey
1234203.
1235_____, also known as "port forwarding," is the transmission of data intended for use only within a
1236private, usually corporate network through a public network in such a way that the routing nodes
1237in the public network are unaware that the transmission is part of a private network.
1238Answer: Tunneling
1239204.
1240What is a trap?
1241Answer: A trap is an exception in a user process. It's caused by division by zero or invalid
1242memory access.
1243205.
1244Congestion control and quality of service is qualities of the
1245Answer: ATM ????
1246206.
1247The ____XLAT_____ translates a byte from one code to another code
1248207.
1249In real time Operating System, which of the following is the most suitable scheduling scheme?
1250Answer: Preemptive Scheduling.
1251208.
1252Regional rural banks are:
1253209.
1254The Snapshot of a table is called as
1255Ans – View
1256210.
1257In Binary trees nodes with no successor are called ......
1258LEAF
1259211.
1260____TCP___ detects loss of data errors in data, requests retransmission of lost data, rearranges
1261out-of-order data, and even helps minimize network congestion to reduce the occurrence of the
1262other problems
1263212.
1264If every node u in G adjacent to every other node v in G, A graph is said to be
1265Answer: Complete
1266213.
1267A relation R(a,b,c,d,e,f) with the FDs { a -> b,c; c -> d, e, f } satisfies ----- normal form at the most
1268where ?a? is the primary key.
1269214.
1270If a virtual memory system has 4 pages in real memory and the rest must be swapped to disk.
1271Which of the following is the hit ratio for the following page address stream. Assume memory
1272starts empty, use the FIFO algorithm
1273Answer: 31%
1274215.
1275Which category of banks is under dual control of Government and RBI?
1276216.
1277Which amongst the following refers to Absolute addressing mode
1278A. Ans - the address of the operand is inside the instruction
1279217.
1280A binary tree in which all the leaves are on the same level is called as:
1281Answer: Perfect binary tree
1282218.
1283Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The
1284round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The
1285time taken (in msec) by the TCP connection to get back to 32 KB congestion window is
12861100-1300
1287219.
1288NOP instruction introduces
1289Delay 
1290220.
1291On simple paging system with 224 bytes of physical memory, 256 pages of logical address space,
1292and a page size 210 bytes, how many bytes are in a page frame?
12932
129410 bytes,
1295
1296221.
1297Course_Info{Course_no, Sec_no, Offering_dept, Credit_hours, Course_level, Instructor_ssn,
1298Semester, Year, Days_hours, Room_no, No_of_students}.
1299The Course_Info has following functional dependencies:
1300{Course_no}{Offering_dept, Credit_hours, Course_level}
1301{Course_no, Sec_no, Semester, Year} {Days_hours, Room_no, No_of_students,
1302Instructor_ssn }
1303{Room_no, Days_hours, Semester, Year} {Instructor_ssn, Course_no, Sec_no}
1304Find the keys of the relation
1305222.
1306A bill of exchange which is drawn on a specific bank and is not payable otherwise than
1307on demand, to bearer or to order, is called ______________
1308223.
1309Which of the following are sufficient conditions for deadlock?
13101. mutual exclusion
1311The resources involved must be unshareable; otherwise, the processes would not
1312be prevented from using the resource when necessary.
13132. hold and wait or partial allocation
1314The processes must hold the resources they have already been allocated while
1315waiting for other (requested) resources. If the process had to release its resources
1316when a new resource or resources were requested, deadlock could not occur
1317because the process would not prevent others from using resources that it
1318controlled.
13193. no pre-emption
1320The processes must not have resources taken away while that resource is being
1321used. Otherwise, deadlock could not occur since the operating system could simply
1322take enough resources from running processes to enable any process to finish.
13234. resource waiting or circular wait
1324224.
1325How many 8-bit characters can be transmitted per second over a 9600 baud serial
1326communication link using asynchronous mode of transmission with one start bit, eight data bits,
1327two stop bits, and one parity bit?
1328(B) 300
1329225.
1330Expand the acronym ‘ADB’
1331226.
1332The addressing mode used in an instruction of the form ADD X Y, is _DIRECT/ABSOLUTE____.
1333227.
1334In ORDBMS, When an object O is brought into memory, they check each oid contained
1335in O and replace oids of in-memory objects by in-memory pointers to those objects. This
1336concept refers to:
1337pointer swizzling
1338228.
1339A binary tree T has 20 leaves. The number of nodes in T having two children is
1340(A) 18
1341(B) 19
1342(C) 17
1343(D) Any number between 10 and 20
1344229.
1345What happens when you push a new node onto a stack?
1346The new node is placed at the front of the linked list
1347230.The port that is used for the generation of handshake lines in mode 1 or mode 2 is
1348a) port A
1349b) port B
1350c) port C Lower
1351d) port C Upper
1352231.
1353Consider the following transaction involving two bank account x and y.
1354read (x) ; x : = x ? 50; write (x) ; read (y); y : = y + 50 ; write (y)
1355The constraint that the sum of the accounts x and y should remain constant is that of
1356(A) Atomicity
1357(B) Consistency
1358(C) Isolation
1359(D) Durability
1360232.
1361The portion of total deposits of a commercial bank which it has to keep with RBI in the form of cash
1362reserves is termed as _______________
1363233.
1364A receiving host has failed to receive all of the segments that it should acknowledge. What can
1365the host do to improve the reliability of this communication session?
1366Send a different source port number.
1367B. Restart the virtual circuit.
1368C. Decrease the sequence number.
1369D. Decrease the window size.
1370234.
1371A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
1372page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
1373maximum size of the page table of a process is 24 megabytes, the length of the virtual address
1374supported by the system is _________ bits.
1375(A) 36
1376(B) 32
1377(C) 28
1378(D) 40
1379235.
1380In 8257 register format, the selected channel is disabled after the terminal count condition is
1381reached when
1382a) Auto load is set
1383b) Auto load is reset
1384c) TC STOP bit is reset
1385d) TC STOP bit is set
1386236.
1387Which of the following information is not part of Process Control Block?
1388(i) Process State
1389(ii) Process Page table
1390(iii) List of Open files
1391(iv) Stack Pointer
1392None of the above
1393237.
1394The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with
1395n discs is
1396(A) T(n) = 2T(n – 2) + 2
1397(B) T(n) = 2T(n – 1) + n
1398(C) T(n) = 2T(n/2) + 1
1399(D) T(n) = 2T(n – 1) + 1
1400238.
1401A personal account cannot be opened in _____________
1402239.
1403For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements
1404is/are TRUE ?
1405I. At least three non-overlapping channels are available for transmissions.
1406II. The RTS-CTS mechanism is used for collision detection.
1407III.Unicast frames are ACKed.
1408(A) All I, II, and III
1409(B) I and III only
1410(C) II and III only
1411(D) II only
1412240.
1413____ users work on canned transactions
1414Naïve or parametric end users
1415241.
1416X.25 Networks are _____ Packet Switched wide area network.___ networks
1417242.
1418A banking product is an example of _____________
1419243.
1420Partial Degree of multiprogramming is controlled by
1421A. CPU scheduler
1422B. context switching
1423C. long term scheduler
1424D. medium term scheduler
1425244.
1426The effective address of the following instruction is , MUL 5(R1,R2)
1427a) 5+R1+R2
1428b) 5+(R1*R2)
1429c) 5+[R1]+[R2].
1430d) 5*([R1]+[R2])
1431245.
1432Consider the following four schedules due to three transactions (indicated by the subscript) using
1433read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them
1434is conflict serializable?
1435A. r1(x)r1(x); r2(x)r2(x); w1(x)w1(x); r3(x)r3(x); w2(x)w2(x);
1436B. r2(x)r2(x); r1(x)r1(x); w2(x)w2(x); r3(x)r3(x); w1(x)w1(x);
1437C. r3(x)r3(x); r2(x)r2(x); r1(x)r1(x); w2(x)w2(x); w1(x)w1(x);
1438D. r2(x)r2(x); w2(x)w2(x); r3(x)r3(x); r1(x)r1(x); w1(x)w1(x);
1439246.
1440If a , b , c, are three nodes connected in sequence in a singly linked list, what is
1441the statement to be added to change this into a circular linked list?
1442247.
1443A buying process starts when the buyer recognizes a ____________
1444248.
1445Which one of the following protocols is NOT used to resolve one form of address to another one?
1446A. DNS
1447B. ARP
1448C. DHCP
1449D. RARP
1450249.
1451The effective address of the following instruction is , MUL 5(R1,R2)
1452a) 5+R1+R2
1453b) 5+(R1*R2)
1454c) 5+[R1]+[R2].
1455d) 5*([R1]+[R2])
1456250.
1457Consider a schedule S1 given below;
1458R1(A); W1(A); R2(B); R2(A); R1(B); W2(A+B); W1(B); where R1 and W1 are read and write
1459operations of transaction T1 and R2 and W2 are read and write operations of transaction T2.
1460Which of the following is correct regarding schedule S1?
1461(a) S1 is a serializable schedule
1462(b) A deadlock will occur if 2PL is used
1463(c) S1 is a conflict serializable schedule
1464(d) S1 is a view serializable schedule
1465251.
1466Consider the following function written the C programming language.
1467void foo (char * a ) {
1468if (* a & & * a ! =' ' ){
1469putchar (*a);
1470}
1471}
1472}
1473The output of the above function on input ?ABCD EFGH? Is
1474Answer: DCBA
1475252.
1476When several processes access the same data concurrently and the outcome of the execution
1477depends on the particular order in which the access takes place, is called
1478a) dynamic condition
1479b) race condition
1480c) essential condition
1481d) critical condition
1482253.
1483State the type of multitasking supported by OS when process switched its state from 'Running' to
1484'Ready' due to scheduling act.
1485Answer: ??
1486254.
1487The instructions which copy information from one location to another either in the processor’s
1488internal register set or in the external main memory are called
1489(A) Data transfer instructions. (B) Program control instructions.
1490(C) Input-output instructions. (D) Logical instructions.
1491Ans: A
1492255.
1493The degree of a leaf node is: ZERO
1494256.
1495______________ are products bought for further processing or for use in conducting a business
1496257.
1497End-to-end connectivity is provided from host-to-host in:
1498A. Network layer
1499B. Session layer
1500C. Data link layer
1501D. Transport layer
1502E. None of the above
1503258.
1504An index is clustered, if
1505(A) it is on a set of fields that form a candidate key.
1506(B) it is on a set of fields that include the primary key.
1507(C) the data records of the file are organized in the same order as the data
1508entries of the index.
1509(D) the data records of the file are organized not in the same order as the data entries of the
1510index.
1511259.
1512The protocol data unit (PDU) for the application layer in the Internet stack is
1513(A) Segment
1514(B) Datagram
1515(C) Message
1516(D) Frame
1517260.
1518PSW is saved in stack when there is a
1519A. interrupt recognized B. execution of RST instruction
1520C. Execution of CALL instruction D. All of these
1521261.
1522Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250KB,
1523where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357
1524KB, 210KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are
1525NOT allotted to any process?
1526(A) 200 KB and 300 KB
1527(B) 200 KB and 250 KB
1528(C) 250 KB and 300 KB
1529(D) 300 KB and 400 KB
1530262.
1531If actual performance exceeds the expected performance of the product, then the customer is
1532____________
1533263.
1534Creating a B Tree index for your database has to be specified in _____.
1535264.
1536The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.
1537A. ABFCDE
1538B. ADBFEC
1539C. ABDECF
1540D. ABDCEF
1541265.
1542Error detection at the data link layer is achieved by?
1543[A] Bit stuffing
1544[B] Cyclic redundancy codes
1545[C] Hamming codes
1546[D] Equalization
1547266.
1548Which of the following is not a function of a DBA?
1549A. Network Maintenance
1550B. Routine maintenance
1551C. Schema Definition
1552D. Authorization for data access
1553267.
1554A system uses 3 page frames for storing process pages in main memory. It uses the Least
1555Recently Used (LRU) page replacement policy. Assume that all the page frames are
1556initially empty. What is the total number of page faults that will occur while processing the page
1557reference string given below?
15584, 7, 6, 1, 7, 6, 1, 2, 7, 2
1559(A) 4
1560(B) 5
1561(C) 6
1562(D) 7
1563268.
1564What is a trap?
1565Answer: A trap is an exception in a user process. It's caused by division by zero or invalid
1566memory access.
1567269.
1568What is the postfix expression for the following infix expression?
1569 Infix = a+b%c>d
1570Answer: a b%c>d +
1571270.
1572The promotion “P” of marketing mix is also known as ____________
1573271.
1574Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If
1575the computer system has a one-level page table per process and each page table entry requires
157648 bits, then the size of the per-process page table is __________ megabytes.
1577(A) 384
1578(B) 48
1579(C) 192
1580(D) 96
1581272.
1582Computers use addressing mode techniques for _____________________.
1583A. giving programming versatility to the user by providing facilities as pointers to memory
1584counters for loop control
1585B. to reduce no. of bits in the field of instruction
1586C. specifying rules for modifying or interpreting address field of the instruction
1587D. All the above
1588273.
1589Loss in signal power as light travels down the fiber is called?
1590A. attenuation
1591B. propagation
1592C. scattering
1593D. interruption
1594E. None of the above
1595274.
1596Passing the request from one schema to another in DBMS architecture is called as
1597___MAPPING___
1598275.
1599A change in an individual's behaviour prompted by information and experience refers to
1600which one of the following concept?
1601276.
1602A binary tree T has 20 leaves. The number of nodes in T having two children is
1603(A) 18
1604(B) 19
1605(C) 17
1606(D) Any number between 10 and 20
1607277.
1608Computers use addressing mode techniques for _____________________.
1609A. giving programming versatility to the user by providing facilities as pointers to memory
1610counters for loop control
1611B. to reduce no. of bits in the field of instruction
1612C. specifying rules for modifying or interpreting address field of the instruction
1613D. All the above
1614278.
1615Consider the 3 process, P1, P2 and P3 shown in the table.
1616Process Arrival time Time units Required
1617P1 0 5
1618P2 1 7
1619P3 3 4
1620The completion order of the 3 processes under the policies FCFS and RR2 (round robin
1621scheduling) with CPU quantum of 2 time units are
1622(A)
1623FCFS: P1, P2, P3
1624RR2: P1, P2, P3
1625(B)
1626FCFS: P1, P3, P2
1627RR2: P1, P3, P2
1628(C)
1629FCFS: P1, P2, P3
1630RR2: P1, P3, P2
1631(D)
1632FCFS: P1, P3, P2
1633RR2: P1, P2, P3
1634279.
1635Which of the following is NOT a superkey in a relational schema with attributes V,W,X,Y,Z and
1636primary key V Y?
1637(A) V X Y Z
1638(B) V W X Z
1639(C) V W X Y
1640(D) V W X Y Z
1641280.Which of the following is example of in-place algorithm?
1642Ans: Heap Sort , Selection Sort, Bubble Sort , insertion sort, shell sort.
1643281.
1644In OSI model dialogue control and token management are responsibilities of ?
1645Network layer
1646Session Layer
1647Transport Layer
1648None of above
1649282.
1650A person’s ________ consists of all the groups that have a direct (face-to-face) or
1651indirect influence on his/her attitudes or behaviour
1652283.
1653The promotion strategy that uses sales force to market the products is known as ______________
1654284.
1655A scheduling algorithm assigns priority proportional to the waiting time of a process. Every
1656process starts with priority zero(the lowest priority). The scheduler re-evaluates the process 
1657priorities every T time units and decides the next process to schedule. Which one of the following
1658is TRUE if the processes have no I/O operations and all arrive at time zero?
1659(A) This algorithm is equivalent to the first-come-first-serve algorithm
1660(B) This algorithm is equivalent to the round-robin algorithm.
1661(C) This algorithm is equivalent to the shortest-job-first algorithm..
1662(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm
1663285.
1664Which protocol does Ping use?
1665Answer: ICMP – Internet Control Message Protocol
1666286.
1667Which of the following operator in SQL would produce the following result if applied between two
1668relations Employee and Department?
1669Eno EName DeptNo DName
1670111 Kumar 100 Sales
1671222 Steve 200 Finance
1672Null Null 300 Admn
1673244 Meera 400 Mktg
1674Answer: Right join.
1675287.
1676The run time of the following algorithm is
1677Procedure A(n)
1678If(n<=2) return(1)
1679Else return(A(sqrt(n))
1680A. O(n)
1681B. O(logn)
1682C. O(loglogn)
1683D. O(1)
1684288.
1685The address to the next instruction lies in
1686Answer: Program Counter
1687289.
1688Which of the following address modes calculate the effective address as
1689address part of the instruction) + (content of CPU register)
1690290.
1691Wholesaling does not include which of the following services?
1692291.
1693The process related to process control, file management, device management, information about
1694system and communication that is requested by any higher level language can be performed by
1695__________.
16961 Editors
16972 Compilers
16983 System Call
16994 Caching
1700292.
1701Consider a dynamic queue with two pointers: front and rear. What is the time needed to
1702insert an element in a queue of length of n?
1703Answer: O(1)
1704293.
1705What is the unique characteristic of RAID 6 ?
1706a) Distributed Parity
1707b) Striping
1708c) Two independent distributed parity
1709d) Mirroring
1710294.
1711If CurrNode pointer points to the previous node in the list and NewNode points to the newly
1712created Node, the address assignments to be done for inserting a node in the middle of a singly
1713linked list is
1714295.
1715On simple paging system with 2^24 bytes of physical memory, 256 pages of logical address
1716space, and a page size 2^10 bytes, how many bytes are in a page frame?
1717Ans:: Page frame size is 2^10 bytes.
1718296.
1719A 2 km long brodcast LAN has 10^7 bps bandwidth and uses CSMA/ CD. The signal travels
1720along the wire at 2 *10 ^8 m/s. What is the minimum packet size that can be used on this
1721network ?
1722(A) 50 bytes
1723(B) 100 bytes
1724(C) 200 bytes
1725(D) None of these
1726297.
1727The data manipulation language used in SQL is a,
1728(I) Procedural DML
1729(II) Non-Procedural DML
1730(III) Modification DML
1731(IV) Declarative DML
1732Answer: (1) and (4)
1733298.
1734The ________ is practiced most aggressively with unsought goods, goods that
1735buyers normally do not think of buying, such as insurance, encyclopedias, and funeral plots.
1736Answer: b. Selling concept
1737299.
1738A group of bits that tell the computer to perform a specific operation is known as
1739A. Instruction code 
1740B. Micro-operation
1741C. Accumulator
1742D. Register
1743300.
1744How many 8-bit characters can be transmitted per second over a 9600 baud serial
1745communication link using asynchronous mode of transmission with one start bit, eight data bits,
1746and one parity bit ?
1747Answer: 800
1748301.
1749Deceptive pricing is also referred to as ______________
1750302.
1751The time factor when determining the efficiency of algorithm is measured by
1752a. Counting microseconds
1753b. Counting the number of key operations
1754c. Counting the number of statements
1755d. Counting the kilobytes of algorithm
1756303.
1757Consider the following pseudo code fragment:
1758printf (“Hello”);
1759if(!fork( ))
1760printf(“World”);
1761Which of the following is the output of the code fragment?
1762304.
1763Having clause in SQL occurs with
1764The HAVING clause should appear before an INTO clause; otherwise, a syntax error
1765occurs.
1766305.
1767When we use auto increment or auto decrement, which of the following is/are true
17681) In both, the address is used to retrieve the operand and then the address gets altered.
17692) In auto increment the operand is retrieved first and then the address altered.
17703) Both of them can be used on general purpose registers as well as memory locations.
1771306.
1772The address resolution protocol (ARP) is used for
1773(a) Finding the IP address from the DNS
1774(b) Finding the IP address of the default gateway
1775(c) Finding the IP address that corresponds to a MAC address
1776(d) Finding the MAC address that corresponds to an IP address
1777307.
1778One that is not type of flipflop is
1779Types of Flip-Flops
1780• RS flip-flop
1781• JK flip-flop
1782• D flip-flop
1783• T flip-flop
1784308.
1785If a node having two children is deleted from a BST, it is replaced by its
1786a) In-order predecessor
1787b) In-order successor
1788c) Pre-order predecessor
1789d) None
1790309.
1791_______ is the want for a specific product backed by the ability to pay
1792Next
1793314.
1794A company is in the ______________ stage of the new product development process when the
1795company develops the concept into a commercially viable physical product
1796315.
1797An organization has a class B network and wishes to form subnets for 64 departments. The
1798subnet mask would be
1799(a) 255.255.0.0
1800(b) 255.255.64.0
1801(c) 255.255.128.0
1802(d) 255.255.252.0
1803316.
1804R right outer join S on a=b gives
1805317.
1806Which of the process transition is invalid?
1807318.
1808The process in which of the following states will be in secondary memory?
1809319.
1810The number of counters that are present in the programmable timer device 8254 is
1811a) 1
1812b) 2
1813c) 3
1814d) 4
1815Explanation: There are three counters that can be used as either counters or delay
1816generators.
1817320.
1818In a packet switching network, packets are routed from source to destination along a single path
1819having two intermediate node. If the message size is 24 bytes and each packet contains a
1820header of 3 bytes, then the optimum packet size is
1821(a) 4
1822(b) 6
1823(c) 7
1824(d) 9
1825321.
1826Why is market segmentation primarily undertaken?
1827322.
1828_______DATA MODEL________________gives the concepts to describe the
1829structure of the database.
1830323.
1831Identify the sorting technique that supports divide and conquer strategy and has (n2) complexity
1832in worst case
1833a. Bubble sort
1834b. Insertion sort
1835c. Quick sort
1836d. All of above
1837Answer: Quick Sort
1838324.
1839Station A uses 32 byte packets to transmit messages to Station B using a sliding window
1840protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bankwidth
1841on the path between aA and B is 128 kbps. What is the optimal window size that A should use ?
1842(A) 20
1843(B) 40
1844(C) 160
1845(D) 320
1846Answer (B)
1847325.
1848If a firm emphasizes it’s product’s benefits, rather than it’s product’s attributes, it is oriented towards
1849_______________
1850326.
1851Given the basic ER and relational models, which of the following is INCORRECT?
1852A. An attribute of an entity can have more than one value
1853B. An attribute of an entity can be composite
1854C. In a row of a relational table, an attribute can have more than one
1855value
1856D. In a row of a relational table, an attribute can have exactly one value or a
1857NULL value
1858327.
1859The searching technique that takes O (1) time to find a data is
1860Answer: Hashing
1861328.
1862If a disk has a seek time of 20ms, rotates 20 revolutions per second, has 100 words per block,
1863and each track has capacity of 300 words. Then the total time required to access one block is
1864A.25
1865B.30
1866C.40
1867D.60
1868329.
1869The data bus buffer is controlled by
1870Answer: Read/write control logic
1871330.
1872Which of the following is not a conversion function in SQL?
1873331.
1874Which behavioural science discipline contributes to Organizational Behavior 's understanding of
1875group decision-making processes?
1876332.
1877Two computers C1 and C2 are configured as follows. C1 has IP address 203. 197.2.53 and
1878netmask 255.255. 128.0. C2 has IP address 203.197.75.201 and netmask 255.255.192.0. Which
1879one of the following statements is true?
1880A. C1 and C2 both assume they are on the same network
1881B. C2 assumes C1 is on same network, but C1 assumes C2 is on a different
1882network
1883C. C1 assumes C2 is on same network, but C2 assumes C1 is on a
1884different network
1885D. C1 and C2 both assume they are on different networks.
1886333.
1887In control word register, if SC1=0 and SC0=1, then the counter selected is
1888a) counter 0
1889b) counter 1
1890c) counter 2
1891d) none
1892334.
1893Information about a process is maintained in a _________.
18941 Stack
18952 Translation Lookaside Buffer
18963 Process Control Block
18974 Program Control Block
1898335.
1899AVL trees have a faster __________
1900A. Insertion
1901B. Deletion
1902C. Updation
1903D. Retrival
1904336.
1905The time required in worst case for search operation in binary tree is
1906Answer: O(n).
1907337.
1908Which of the following is shared between all of the threads in a process? Assume a kernel level
1909thread implementation
1910Answer: File Descriptors
1911338.
1912The communication that is used by managers to assign goals, point out problems that need attention
1913and provide job instructions is called as ____________
1914339.
1915The counter starts counting only if
1916a) GATE signal is low
1917b) GATE signal is high
1918c) CLK signal is low
1919d) CLK signal is high
1920340.
1921Station A needs to send a message consisting of 9 packets to Station B using a siding window
1922(window size 3) and go-back-n error control strategy. All packets are ready and immediately
1923available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever
1924get lost), then what is the number of packets that A will transmit for sending the message to B ?
1925(A) 12
1926(B) 14
1927(C) 16
1928(D) 18
1929341.
1930Which level of RAID refers to disk mirroring with block striping?
1931a) RAID level 1
1932b) RAID level 2
1933c) RAID level 0
1934d) RAID level 3
1935342.
1936Identify the data structure which allows deletions at both ends of the list but insertion at only one
1937end
1938a. Input-restricted deque
1939b. Output-restricted deque
1940c. Priority queues
1941d. None of above
1942343.
1943When an instruction is read from the memory, it is called
1944Answer: Instruction cycle (Also called Fetch-Decode-Execute Cycle)
1945344.
1946Experiments performed by Ivan Pavlov led to what theory?
1947345.
1948Which of the following is not true of virtual memory?
1949Ans: It requires the use of a disk or other secondary storage.( Actually it does not
1950require).
1951346.
1952In a token ring network the transmission speed is 10^7 bps and the propagation speed is 200
1953metres/ s μ . The 1-bit delay in this network is equivalent to;
1954(A) 500 metres of cable.
1955(B) 200 metres of cable.
1956(C) 20 metres of cable.
1957(D) 50 metres of cable.
1958Answer (C)
1959347.
1960To change the access path programs are categorized under ____PHYSICAL______
1961data independence.
1962348.
1963What are the desirable properties of a transaction?
1964Atomicity.
1965Consistency.
1966Isolation.
1967Durability.
1968349.
1969Job analysis provides information used for writing _____________________
1970350.
1971A Boolean function may be transformed into Logical Diagram
1972351.
1973The average time required to reach a storage location in memory and obtain its contents
1974is called the
1975Answer: Access time
1976352.
1977The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the
1978maximum number of subnets and the maximum number of hosts in each subnet?
1979(A) 62 subnets and 262142 hosts.
1980(B) 64 subnets and 262142 hosts.
1981(C) 62 subnets and 1022 hosts.
1982(D) 64 subnets and 1024 hosts.
1983Maximum number of subnets = 2^6-2 =62.
1984Maximum number of hosts is 2^10-2 = 1022.
1985353.
1986The time required in worst case for search operation in binary tree is
1987Answer: O(n).
1988354.
1989Shift registers are used for
1990Shift registers are commonly used in converters that translate parallel data to serial
1991data, or vice-versa.
1992355.
1993In the slow start phase of TCP congesting control algorithm, the size of the congestion window
1994(A) does not increase
1995(B) increases linearly
1996(C) increases quadratically
1997(D) increases exponentially
1998356.
1999_____________ is the process of deciding how to fill the company's most important executive
2000positions
2001357.
2002Operating System
20031. Assume that ?C? is a Counting Semaphore initialized to value ?10?. Consider the following
2004program segment:
2005P(C); V(C); P(C); P(C); P(C); V(C); V(C)
2006V(C); V(C); V(C); P(C); V(C); V(C); P(C)
2007What is the value of C?
2008C=10
2009there are 6 wait and 8 signal operation
2010wait operation reduce count by 1 and signal increase count by 1 in
2011general
2012so 10-6+8=12
2013358.
2014If a transaction T has obtained an exclusive lock on item Q, then T can
2015Answer: both read and write Q
2016359.
2017To represent hierarchical relationship between elements, which data structure is suitable?
2018a. Deque
2019b. Priority
2020c. Tree
2021d. All of above
2022360.
2023A binary search tree is generated by inserting in order the following integers 50, 15, 62, 5, 20, 58,
202491, 3, 8, 37, 60, 24. The number of nodes in the left subtree and right subtree of the root
2025respectively are
2026(a) (4, 7) (b) (7, 4) (c) (8, 3) (d) (3, 8)
2027361.
2028Two variables will be represented by
2029362.
2030If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum
2031number of hosts per subnet?
2032A. 1022
2033B. 1023
2034C. 2046
2035D. 2047
2036363.
2037If two relations R and S are joined, then the non matching tuples of both R and S are
2038ignored in
2039(A) left outer join (B) right outer join
2040 (C) full outer join (D) inner join
2041364.
2042Which of these does not belong to Maslow’s Hierarchy Need Theory?
2043365.
2044Mutual exclusion problem occurs between
2045-Two disjoint process that do not interact
2046- Process sharing same resources
2047- Process not sharing same resources
2048- None of these
2049366.
2050A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a
2051rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the maximum duration for
2052which the computer can transmit at the full 10Mbps?
2053(A) 1.6 seconds
2054(B) 2 seconds
2055(C) 5 seconds
2056(D) 8 seconds
2057367.
2058The FD A → B , DB→ C implies
2059368.
2060The base (or radix) of the number system such that the equation 312/20=13.1 holds is
2061(A) 3
2062(B) 4
2063(C) 5
2064(D) 6
2065369.
2066A binary tree in which every non-leaf node has non-empty left and right subtrees is called a
2067strictly binary tree. Such a tree with 10 leaves
2068A. Cannot have more than 19 nodes
2069B. Has exactly 19 nodes
2070C.Has exactly 17 nodes
2071D.Cannot have more than 19 nodes
2072A strictly binary tree with 'n' leaves must have (2n - 1) nodes
2073370.
2074The amount of time required to read a block of data from a disk into memory is composed
2075of seek time, rotational latency, and transfer time. Rotational latency refers to ______.
2076A. the time its takes for the platter to make a full rotation
2077B. the time it takes for the read-write head to move into position over the appropriate track
2078C. the time it takes for the platter to rotate the correct sector under the head
2079D. none of the above
2080371.
2081“Doing an activity or behaviour voluntarily for its own sake, for the inherent satisfaction and pleasure
2082derived from participation” well defines:
2083372.
2084Which type of managers takes less time to make their decisions and less information in making their
2085choices?
2086373.
2087The removal of process from active contention of CPU and reintroduce them into memory later is
2088known as ____________
20891 Interrupt
20902 Swapping
20913 Signal
20924 Thread
2093374.
2094For which one of the following reason: does Internet Protocol (IP) use the time-to-live (TTL) field
2095in the IP datagram header?
2096(A) Ensure packets reach destination within that time
2097(B) Discard packets that reach later than that time
2098(C) Prevent packets from looping indefinitely
2099(D) Limit the time for which a packet gets queued in intermediate routers.
2100375.
2101Consider a relation R (A, B). If A  B is a trivial functional dependency and A is the
2102super key for R, then what is the maximum normal form R can be in?
2103376.
2104The recurrence relation that arises in relation with the complexity of binary search is
2105A. T(n)=2T(n/2)+k, k is a constant T(n)=2T(n2)+k, k is a constant
2106B. T(n)=T(n/2)+k, k is a constant T(n)=T(n2)+k, k is a constant
2107C. T(n)=T(n/2)+lognT(n)=T(n2)+log⁡n
2108D. T(n)=T(n/2)+n
2109377.
2110A 20-bit address bus allows access to a memory of capacity
2111Answer: 1MB
21122^20 = 1048576
2113378.
2114The algorithm design technique used in the quick sort algorithm is
2115Dynamic programming
2116Backtracking
2117Divide and conquer
2118Greedy method
2119379.
2120Which of the following assertions is false about the internet Protocol (IP) ?
2121(A) It is possible for a computer to have multiple IP addresses
2122(B) IP packets from the same source to the same destination can take different routes in
2123the network
2124(C) IP ensures that a packet is discarded if it is unable to reach its destination within a
2125given number of hops
2126(D) The packet source cannot set the route of an outgoing packets; the route is
2127determined only by the routing tables in the routers on the way
2128In computer networking, source routing, also called path addressing, allows a sender of
2129a packet to partially or completely specify the route of the packet takes through the network.
2130380.
2131The technique, for sharing the time of a computer among several jobs, which switches jobs so
2132rapidly such that each job appears to have the computer to itself, is called
2133Time sharing
2134time out
2135time domain
2136FIFO
2137None of the above
2138381.
2139If the offset of the operand is stored in one of the index registers, then it is
2140Answer: indexed addressing mode
2141382.
2142Which of the following is a disadvantage of file processing system?
2143(I) Efficiency of high level programming,
2144(II) Data Isolation
2145(III) Integrity issues
2146(IV) Storing of records as files
2147383.
2148Organizational democracy requires _____________style of management
2149384.
2150If Human voice is required to be digitized what will be the bit rate at 16 bits per sample?
2151Therefore, the bit rate can be calculated by calculating the sample rate first.
2152Sampling rate = 4000 x 2 = 8000 samples/s
2153Considering the bit rate to be 16 bits per sample,
2154The total bit rate will be = 8000 x 16 = 128,000 bps = 128 kbps.
2155Therefore, the bit rate needed to digitize human voice is 128 kbps.
2156385.
2157The operating system of a computer serves as a software interface between the user and the
2158________
2159A. hardware B. peripheral C. memory D. screen
2160386.
2161The data manipulation language used in SQL is a,
2162387.
2163Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected,
2164undirected graph. The tree T formed by the tree arcs is a data structure for computing
2165(A) the shortest path between every pair of vertices.
2166(B) the shortest path from W to every vertex in the graph.
2167(C) the shortest paths from W to only those nodes that are leaves of T.
2168(D) the longest path in the graph
2169388.
2170The common register(s) for all the four channels of 8257 are
2171a. DMA address register
2172b. terminal count register
2173c. mode set register and status register
2174d. none of the mentioned
2175389.
2176Which of the following requires the listener to pay reasonably close attention to the speaker?
2177390.
2178 A full binary tree with n leaves contains
2179A. nn nodes
2180B. log2n nodes
2181C. 2n−1
2182D. 2n nodes
2183.
2184391.
2185Which of the following is not a function of a DBA?
2186A. Network Maintenance
2187B. Routine maintenance
2188C. Schema Definition
2189D. Authorization for data access
2190392.
2191The collection of processes on the disk that is waiting to be brought into memory for execution
2192forms the ___________
21931 Ready queue
21942 Device queue
21953 Input queue
21964 Priority queue
2197393.
2198Six channels, each with a 200 khz bandwidth are to be multiplexed together. what is the
2199minimum bandwidth requirement if each guard band is 20Khz
2200394.
2201____________ is the variable reward granted to employees as per their performance
2202395.
2203Which of the following is not a data copy/transfer instruction?
2204a)MOV
2205b) PUSH
2206c) DAS - Decimal Adjust after Subtraction
2207d) POP
2208396.
2209The unique characteristics that a learning organization possesses is that ______________
2210397.
2211The complexity of multiplying two matrices of order m*n and n*p is
2212A. mnp
2213B. mp
2214C. mn
2215D. np
2216398.
2217Which of these multiplexing techniques is digital for combining several low -rate channels into
2218one high-rate one
2219399.
2220The part of the operating system that coordinates the activities of other program is called the
2221Answer: Control program
2222400.
2223In DMA transfers, the required signals and addresses are given by the______
2224a) Processor
2225b) Device drivers
2226c) DMA controllers
2227d) The program itself
2228Explanation: The DMA controller acts like a processor for DMA transfers and overlooks the entire
2229process.
2230401.
2231Assume a relation R with keys X, Y and Z, where X, Y, and Z are sets of one or more
2232attributes. Also assume that Y is a subset or equal to X and Z is a subset of X and Y.
2233Which of the following is true for this case?
2234402.
2235A binary tree T has 20 leaves. The number of nodes in T having two children is
2236(A) 18
2237(B) 19
2238(C) 17
2239(D) Any number between 10 and 20
2240403.
2241The minimum number of JK flip-flops required to construct a synchronous counter with the count
2242sequence (0,0, 1, 1, 2, 2, 3, 3, 0, 0,…….) is
2243Answer: 3
2244404.
2245Assume relations R and S with the schemas R (A, B, C) and S (B, D). Which of the
2246following is equivalent to r ⋈ s?
2247ABCD
2248405.
2249Which of these is an off the job training?
2250Off-the-job training occurs when employees are taken away from their place of work
2251to be trained. Common methods of off-the-job training include: Day release (employee
2252takes time off work to attend a local college or training centre) Distance learning /
2253evening classes.
2254406.
2255What are the three phases in virtual circuit switching?
2256The three phases in virtual circuit switching are setup, data transfer, and teardown
2257407.
2258Switching the CPU to another Process requires saving state of the old process and loading new
2259process state is called as __________.
2260ANSWER: Context Switch
2261408.
2262Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250KB,
2263where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357
2264KB, 210KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are
2265NOT allotted to any process?
2266(A) 200 KB and 300 KB
2267(B) 200 KB and 250 KB
2268(C) 250 KB and 300 KB
2269(D) 300 KB and 400 KB
2270409.
2271Which of the following asymptotic notation is the worst among all?
2272a. Ο(n+9378)
2273b. Ο(n^3)
2274c. nΟ(1)
2275d. 2Ο(n)
2276410.
2277Consider a relational table with the schema R (A, B, C). Assume that the cardinality
2278of attribute A is 10, B is 20, and C is 5. What is the maximum number of records R
2279can have without duplicate?
2280Answer : 1000
2281411.
2282Which method is used to assess an organization’s training needs?
2283Training Need Analysis
2284412.
2285A half adder is implemented with XOR and AND gates. A full adder is implemented with two half
2286adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR
2287gate. The propagation delay of an AND/OR gate is 1.2 microseconds. A 4-bit ripple-carry binary
2288adder is implemented by using four full adders. The total propagation time
2289of this 4-bit binary adder in microseconds is ____________.
2290A Ripple Carry Adder allows to add two n-bit numbers. It uses half and full adders.
2291Following diagram shows a ripple adder using full adders.
2292Let us first calculate propagation delay of a single
22931 bit full adder.
2294Propagation Delay by n bit full adder is (2n + 2)
2295gate delays.
2296[See this for formula].
2297Here n = 1, so total delay of a 1 bit full adder
2298is (2 + 2)*1.2 = 4.8 ms
2299Delay of 4 full adders is = 4 * 4.8 = 19.2 ms
2300413.
2301Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth ?
2302Transmission is in half-duplex mode. For PSK the baud rate is the same as the bandwidth,
2303which means the baud rate is 5000. But in 8-PSK the bit rate is 3 times the baud rate, so the
2304bit rate is 15,000 bps.
2305414.
2306Virtual memory is __________.
2307An illusion of extrememly large main memory
2308415.
2309Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet
2310address ?
2311Answer : 201.14.78.64
2312At every router basically we have 3 entries in a routing table
23131. Network Id / Subnet address
23142. Subnet Mask
23153 .Interface
2316So with the help of these we can figure out where to send a packet.
2317IP address 201.14.78.65 subset mask 255.255.255.224
2318IP address 11111111.11111111.11111111.11100000
2319Subnet Mask 11001001.00001110.01001110.01000001
2320Subnet address 11001001.00001110.01001110.01000000
2321201 . 14 . 78 . 64
2322It is a Bitwise ANDing in above operation.
2323416.
2324Which of the following operator in SQL would produce the following result if
2325applied between two relations Employee and Department?
2326Eno EName DeptNo DName
2327111 Kumar 100 Sales
2328222 Steve 200 Finance
2329Null Null 300 Admn
2330244 Meera 400 Mktg
2331417.
2332The postfix expression of the given infix expression a+b*c+(d*e+f)*g is
2333418.
2334The truth table
2335X Y f(X,Y)
23360 0 0
23370 1 0
23381 0 1
23391 1 1
2340represents the Boolean function
2341419.
2342Consider a disk with following specification; sector size - 512 bytes, tracks per
2343surface - 2000, sectors per track - 60, double-sided platters - 4, and average seek time
2344- 20 msec. For a 5400 rpm hard disk for one revolution, if a single track of data can be
2345transferred, then what is the transfer rate?
2346the data transfer rate is 25K/ 0.011= 2, 250Kbytes/second
2347420.
2348We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then
2349repeats. The minimum number of J-K flip-flops required to implement this counter is
2350Total 4.
2351421.
2352Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at
2353cylinder
2354100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135
2355and
2356145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request
2357for
2358cylinder 90 is serviced after servicing ____________ number of requests.
23593 Number of requests
2360422.
2361For non-negative functions, f(n) and g(n), f(n) is theta of g(n) if and only if
2362max(f(n), g(n)) = Θ(f(n) + g(n))
2363423.
2364If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the
2365transmission before division ?
2366If divisor is n bit long then we add (n-1) no of 0's in the data unit before division
2367so here divisor is 1010 hence 3 0's are added in data unit so ans will be 111111000 i.e C
2368424.
2369The output after second iteration of the sorting technique is given below. Identify the
2370technique used 23 45 78 8 32 56
2371MERGE SORT
2372425.
2373Assume that a table CUSTOMER has 10000 records. If the block size 1024 bytes and
2374the record size is 80 bytes, how many records can be stored in each block to achieve
2375maximum performance and how many blocks are required to store the entire table?
2376Number of records in file = 16384
2377Record size = 32 bytes
2378Key Size = 6 bytes
2379Block Size on file system = 1024 bytes
2380Size of Block Pointer = 10 bytes
2381Size of a record or index Entry = 10 + 6 = 16
2382Number of blocks in first level = (Number of records in file)/
2383 (Disk Block Size)
2384 = (16384 * 16)/(1024)
2385= 16 * 16
2386= 256
2387In second level, there will be 256 * 16 entries.
2388Number of blocks in second level = (Number of entries) /
2389 (Block Size)
2390 = (256 * 16) / 1024
2391 = 4
2392Answer : 256+4 = 260
2393426.
2394which type of EM waves are used for unicast communication such as cellular telephones,
2395satellite networks and wireless LANS.
2396Radio waves!
2397427.
2398_________ register keeps track of the instructions stored in program stored in memory.
2399. PC (Program Counter)
2400428.
2401How many address bits are needed to select all memory locations in the 16K × 1 RAM?
2402The size of the memory is N*M
2403where N is the address lines and M is word length
2404no of registers/memory location required is 2^N
2405Given memory capacity is 16k
2406thus 2^N=16K
24071K=1024 memory locations
2408thus16k=16*1024=16384
2409now 2^N=16384
2410After factorising 16384 by 2 we ll get N AS 14
2411SO ADDRESS LINE REGUIRED IS 14.
2412429.
24131024 bit is equal to how many byte = 128 bytes
2414430.
2415The technique, for sharing the time of a computer among several jobs, which switches jobs so
2416rapidly such that each job appears to have the computer to itself, is called
2417ANS: time sharing
2418431.
2419Consider a relation R (A, B, C, D, E) with set of functional dependencies F = {ABC,
2420CDE, BD, EA}. Which of the following is one of the candidate keys of R?
2421432.
2422A method which creates the problem of secondary clustering is
2423LINEAR PROBING
2424433.
2425In stop and wait ARQ, the sequence numbers are generated using
2426Maximum sequence number in GBN is same as window size.
2427For sequence bits = n, number of sequence numbers = 2n and window size = 2n - 1
2428Consider n = 3, sequence numbers will be 23 = 8 ( i.e. from 0 - 7 )
2429and maximum window size = 23 - 1 = 7 i.e window will carry frames from 0 to 6
2430which are 7 in number.
2431Now, for sender window = 5
2432number of sequence bits needed = ceil (log2(1+window size)) = 3
2433So, sequence numbers generated would be 0 to 7 but window will carry
2434frames from 0 to 4 which is 5 in number (same as window size)
2435434.
2436How many ways are present in 4-way set associative cache of 16 sets?
2437Number of sets = Cache memory/(set associativity * cache block size)
2438 = 256KB/(4*16 B)
2439 = 4096
2440435.
2441Find the time complexity of given code snippet
2442for(int i=1;i<=n;i++)
2443for(int j=1;j<=n;j*=2)
2444 Printf(“*”);
2445O(Logn) Time Complexity of a loop is considered as O(Logn) if the loop variables is
2446divided / multiplied by a constant amount.
2447436.
2448Given R = ABCDEFGH and set of functional dependencies F = {BHC, BHF,
2449EF, AD, FA, BHE, CE, FD}, which of the following is redundant set of
2450functional dependencies?
2451437.
2452Which of these is true for go-back-N protocol, if m is the size of sequence number field
2453438.
2454Mac Operating system is developed by which company
2455Apple Inc.
2456439.
2457In the running state
2458440.
2459void Function(int n)
2460{
2461int i, count =0;;
2462for(i=1; i*i<=n; i++)
2463count++;
2464}
2465The time complexity of the above code snippet is
2466441.
2467Consider the entities customer (customer-name, customer-city,customer-street) and account(
2468account-no,balance) with following relationship
2469If depositor is a one-to-many relationship from account to customer, then this ER
2470diagram can be reduced to which of the following relational schemas?
2471442.
2472To guarantee the detection of up to s errors in all cases, the minimum Hamming distance in a
2473block code must be
2474S+1
2475443.
2476RS flip-flops are also called
2477444.
2478Consider this binary search tree:
2479 14
2480 / 
2481 2 16
2482 / 
2483 1 5
2484 /
2485 4
2486Suppose we remove the root, replacing it with something from the left
2487445.
2488The 1-address instructions for a=b*c + d is
2489446.
2490A critical region is
2491447.
2492The conjunctive selection operation σθ1∧θ2 (E) is equivalent to __________
2493448.
2494Which of the following is not used for synchronization?
2495Banker’s ALgorithm
2496449.
2497What is maximum throughput for slotted ALOHA ?
24980.5/e
2499450.
2500Which of the following concurrency control mechanisms insist unlocking of all read
2501and write locks of transactions at the end of commit?
2502Answer: 2 Phase Locking
2503451.
2504While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in the
2505sequence shown, the element in the lowest level is
2506Answer: 67
2507452.
2508The number of inputs, minterms in full adder is
2509Answer : 3,
2510453.
2511The major difference between a moore and mealy machine is that
2512The output of the moore machine depends only on the current state
2513454.
2514The process of analyzing the given relation schemas based on their functional
2515dependencies is known as
2516Normalization
2517455.
2518The main function of dispatcher is:
2519The main function of the dispatcher (the portion of the process scheduler)
2520is assigning ready process to the CPU.
2521456.
2522A complex low pass signal has a bandwidth of 100kHz. What is the minimum sampling rate for
2523this signal
2524Answer: 200000 samples ( 2 times the bandwidth)
2525457.
2526Which of the following sorting algorithms has the lowest worst-case complexity?
2527Merge Sort
2528458.
2529What is the difference between CSMA/CD and ALOHA?
2530Main difference between Aloha and CSMA is that Aloha protocol does not try to
2531detect whether the channel is free before transmitting but the CSMA protocol
2532verifies that the channel is free before transmitting data.
2533459.
2534X=1010100 and Y=1000011 using 2's complement X-Y is
2535Answer: 10001
2536460.
2537Consider ?n? processes sharing the CPU in a round robin fashion. Assume that the context
2538switch takes ?s? seconds. What must be the quantum ?q? such that the overhead of context
2539switching is minimized and at same time each process is getting guaranteed execution on the
2540CPU atleast once in every ?t? seconds?
2541ANSWER: q<=((t-ns)/n-1)
2542461.
2543Which one of the following is the recurrence equation for the worst case time complexity of the
2544Quicksort algorithm for sorting n(≥ 2) numbers? In the recurrence equations given in the options
2545below, c is a constant.
2546T(n) = T(n – 1) + T(0) + cn
2547462.
2548What operator performs pattern matching?
2549Answer: LIKE
2550463.
2551Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?
2552Answer: 3
2553464.
2554What is the content of Stack Pointer (SP)?
2555The Stack Pointer is used to indicate where the next value to be removed from
2556the stack should be taken from.
2557465.
2558Identify the minimal key for relational scheme R(A, B, C, D, E) with functional
2559dependencies F = {A → B, B → C, AC → D}
2560466.
2561A heap memory area is used to store the
2562467.
2563If user A wants to send an encrypted message to user B. The plain text of A is encrypted with the
2564_______.
2565Answer: Public Key of User B
2566468.
2567The minimum number of JK flip-flops required to construct a synchronous counter with the count
2568sequence (0,0, 1, 1, 2, 2, 3, 3, 0, 0,??.) is
25693 flip flops
2570469.
2571For an undirected graph with n vertices and e edges, the sum of the degree of each vertex
2572isequal to
2573Answer : 2e
2574470.
2575Programs tend to make memory accesses that are in proximity of previous access this is called
2576spatial locality
2577471.
2578________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
2579Long Term Scheduler
2580472.
2581The best normal form of relation scheme R (A, B, C, D) along with the set of functional
2582dependencies F = {AB →C, AB → D, C → A, D → B} is
2583Third Normal Form
2584473.
2585Mnemonic codes and variable names are used in
2586Assembly Language
2587474.
2588Time required to merge two sorted lists of size m and n, is
2589475.
2590What happens to destination address in the header of a packet in a datagram network ?
2591476.
2592___________ mechanism is used for converting a weak entity set into
2593strong entity set in entity-relationship diagram
2594Adding suitable attributes
2595477.
2596Which of the following disk seek algorithms would be the best choice to implement in a
2597system that services an average of 5 disk requests per second
2598478.
2599_________ register keeps track of the instructions stored in program stored in memory.
2600Program Counter
2601479.
2602Bayone-Neill-Concelman(BNC) connectors are used with which type of cables
2603Coaxial Cable
2604480.
2605Which of the following disk seek algorithms has the most variability in response time?
2606481.
2607What data structure is used for depth first traversal of a graph?
2608Stack
2609482.
2610Division operation is ideally suited to handle queries of the type:
2611Division identify the attribute values from relation that are found
2612to be paired with all of the values from the other relation.
2613Customers who have no account in any of the branches in Delhi.
2614Customers who have an account at all branches in Delhi.
2615Customers who have an account in atleast one branch in Delhi.
2616Customers who have only joint account in any one branch in Delhi
2617483.
2618A clustering index is created when _______.
2619Foreign key ordered
2620484.
2621In TDM Data rate management is done by which of these strategies
2622A. Multilevel multiplexing
2623B. Multi-slot allocation
2624C. Pulse stuffing
2625D. all of the above
2626485.
2627Graph traversal is different from a tree traversal, because
2628486.
2629Which of the following instructions should be allowed only in Kernel Mode?
2630(a) Disable all interrupts
2631(b) Read the time-of-day clock
2632(c) Set the time-of-day clock
2633(d) Change the memory map (Answer: A, C & D)
2634487.
2635One operation that is not given by magnitude comparator
2636A. equal
2637B. less
2638C. greater
2639D. addition
2640488.
2641Supervisor call
2642489.
2643Re-balancing of AVL tree costs
2644490.
2645Consider a B+ tree in which the search Answer is 12 bytes long, block size is 1024 bytes,record
2646pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can
2647be accommodated in each non-leaf node of the tree is ____ .
2648Answer: 50
2649491.
2650After fetching the instruction from the memory, the binary code of the
2651instruction goes to
2652492.
2653Which of these is correct for synchronous Time Division Multiplexing
2654Data rate of link is n times faster and the unit duration is n times shorter
2655493.
2656In communication satellite, multiple repeaters are known as?
2657Transponders
2658494.
2659Table that is not a part of asynchronous analysis procedure
2660A. transition table
2661B. state table
2662C. flow table
2663D. excitation table
2664495.
2665This Key Uniquely Identifies Each Record
2666Primary Key
2667496.
2668Paging suffer from ………………..
2669Internal Fragmentation
2670497.
2671How many swaps are required to sort the given array using bubble
2672sort - { 2, 5, 1, 3, 4}
2673498.
2674Error detection at the data link layer is achieved by?
2675Cyclic Redundancy Code
2676499.
2677The O notation in asymptotic evaluation represents
2678he Big O notation defines an upper bound of an algorithm
2679500.
2680Which of the following provides interface (UI) between user and OS
2681Shell
2682501.
2683_________ register keeps track of the instructions stored in program stored in
2684memory.
2685Program Counter
2686502.
2687Which of the following is not a function of a DBA?
2688Application Creation
2689503.
2690Assume a relation R with keys X, Y and Z, where X, Y, and Z are sets of one or more attributes.
2691Also assume that Y is a subset or equal to X and Z is a subset of X and Y. Which of the following
2692is true for this case?
2693Y and Z are candidate Keys of R
2694504.
2695What is a shell ?
2696
2697 Shell is a UNIX term for the interactive user interface with an operating system
2698
2699 
2700505.
2701Baud means?
27021. a unit of transmission speed equal to the number of times a signal changes state per
2703second. For signals with only two possible states one baud is equivalent to one bit
2704per second.
2705506.
2706A group of bits that tell the computer to perform a specific operation is known as
2707Instruction Code
2708507.
2709Recursion uses more memory space than iteration because
2710Every Recursive call has to be stored
2711508.
2712A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order
2713traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in
2714that order. The level-order traversal of the heap after the insertion of the elements is:
2715509.
2716We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then
2717repeats. The minimum number of J-K flip-flops required to implement this counter is
2718Answer: 4
2719510.
2720You have 10 users plugged into a hub running 10Mbps half-duplex. There is a server connected
2721to the switch running 10Mbps half-duplex as well. How much bandwidth does each host have to
2722the server?
272310 Mbps
2724511.
2725A system has a resource ‘Z’ with 20 instances; each process needs 5 instances to complete its
2726execution. What is the minimum process in the system that may cause deadlock?
27275 Processes
2728512.
2729The constraint ?primary key cannot be null? is called as?
2730Not Null COnstraint
2731513.
2732In Multi-Processing Operating Systems:
2733Maximum Utilization of CPU can be achieved
2734514.
2735A circuit produces 1's complement of the input word, one application is binary subtraction. It is
2736called
2737(A) Logic gate
2738(B) Register
2739(C) Multiplexer
2740(D) BCD converter
2741515.
2742A station in a network forwards incoming packets by placing them on its shortest output queue.
2743What routing algorithm is being used?
2744Hot Potato Routing
2745516.
2746Assume that a mergesort algorithm in the worst case takes 30 second for an input of size 64.
2747Which of the following most closely approximates the maximum input size of a problem that can
2748be solved in 6 minutes?
2749Answer: 512
2750517.
2751The cartesian product ,followed by select is equivalent to
2752Answer :Join
2753518.
2754If a , b , c, are three nodes connected in sequence in a singly linked list, what is
2755the statement to be added to change this into a circular linked list?
2756a) $$$
2757b) $$
2758c) NULL
2759d) error
2760519.
2761The Internet Control Message Protocol (ICMP)
2762520.
2763In a digital counter circuit feedback loop is introduced to
2764A:improve distortion
2765B:improve stability
2766C:reduce the number of input pulses to reset the counter
2767D:synchronous input and output pulses
2768521.
2769Consider the virtual page reference string
27701,2,3,2,4,1,3,2,4,1
2771on a demand paged virtual memory system running on a computer system that has main
2772memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the
2773number of page faults under the corresponding page replacement policy. Then
2774(A) OPTIMAL < LRU < FIFO
2775(B) OPTIMAL < FIFO < LRU
2776(C) OPTIMAL = LRU
2777(D) OPTIMAL = FIFO
2778522.
2779A data dictionary does not provide information about
2780Answer : Size of storage disk.
2781523.
2782How many illegitimate states has synchronous mod-6 counter ?
2783A.3 (Answer)
2784B.2
2785C.1
2786D.6
2787524.
2788For the array (77 ,62,114,80,9,30,99), write the order of the elements after two passes using the
2789Radix sort
2790114, 30, 62, 77, 9, 99
2791525.
2792Which of the following technique is used for fragment?
2793one of the pieces that results when an IP gateway divides an IP datagram into
2794smaller pieces for transmission across a network that cannot handle the
2795original datagram size
2796526.
2797Which of the following RDBMS does not incorporate relational algebra
2798527.
2799Which scheduling policy is most suitable for a time-shared operating system?
2800Preemptive scheduling
2801528.
2802When you ping the loopback address, a packet is sent where?
2803Answer: Down through the layers of IP architecture and then up the layers
2804again
2805529.
2806Round robin scheduling is essentially the preemptive version of __________
2807ANSWER: FIFO
2808530.
2809A ring counter is same as
2810531.
2811Which of these is asymptotically bigger?
2812Answer: 6*2^n
2813532.
2814Which of the following is not a property of DBMS?
2815A). INCREASE DATE REDUNDONCY.
2816B).INTERGRATION OF DATA.
2817C).IMPROVED IN SECURITY.
2818D).ACHIEVING DATA INDEPENDENCE,
2819533.
2820In the blocked state
2821the processes waiting for I/O are found
2822the process which is running is found
2823the processes waiting for the processor are found
2824the process ready to execute
2825534.
2826Which of the following devices assigns IP address to devices connected to a network that uses
2827TCP/IP?
2828DHCP Server
2829535.
2830The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42.
2831Which one of the following is the postorder traversal sequence of the same tree?
2832536.
2833A sequential circuit outputs a ONE when an even number (> 0) of one's are input; otherwise the
2834output is ZERO. The minimum number of states required is
2835Answer : 2
2836537.
2837In which category does the discrepancy between duplicate records belong?
2838538.
2839Data Structures and Algorithms:
2840In a min-heap:
2841parent nodes have values less than or equal to their children
2842539.
2843Which of the following technique is used for Time-To-Line (TTL)?
2844a technique used in best-effort delivery system to avoid endlessly
2845looping packets.
2846540.
2847A page fault occurs
2848When the page is not in the memory
2849541.
2850To build a mod-19 counter the number of flip-flops required is
28515 Flip Flops
2852542.
2853The cartesian product ,followed by select is equivalent to
2854Answer: Join
2855543.
2856The number of clock pulses needed to shift one byte of data from input to the output of a 4-bit
2857shift register is
285816 Clock Pulses
2859544.
2860Consider the following New-order strategy for traversing a binary tree:
28611)Visit the root;
28622)Visit the right subtree using New-order;
28633)Visit the left subtree using New-order;
2864The New-order traversal of the expression tree corresponding to the reverse polish expression 3
28654 * 5 - 2 ? 6 7 * 1 + - is given by:
2866Answer : - + 1 * 7 6 ^ 2 - 5 * 4 3
2867545.
2868Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format.
2869The main program is loaded into memory & is executed. This type of loading is called _________
2870Dynamic Linking
2871546.
2872You are trying to decide which type of network you will use at your office, and you want the type
2873that will provide communication and avoid collisions on the cable. Which of the following is the
2874best choice?
2875Token Ring
2876547.
2877Which of the following is not a property of DBMS?
2878548.
2879You are working with a network that has the network ID 172.16.0.0, and you require 25 subnets
2880for your company and an additional 30 for the company that will merge with you within a month.
2881Each network will contain approximately 600 nodes. What subnet mask should you assign?
2882255.255.252.0
2883549.
2884_________________ constraint is specified between two relations and is used to maintain the
2885consistency among tuples of the two relations
2886Referential Integrity
2887550.
2888If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the
2889disk queue of I/O blocks requests are 98,37,14,124,65,67.
2890Answer: 321
2891551.
2892For non-negative functions, f(n) and g(n), f(n) is theta of g(n) if and only if
2893552.
2894The main difference between JK and RS flip-flop is that
2895553.
2896The sign magnitude representation of binary number + 1101.011 is
2897Answer: 01101.011
2898554.
2899Minimum number of moves required to solve a Tower of Hanoi puzzle is
2900Answer: 2^n - 1
2901555.
2902The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting.
2903The Statement is true
2904556.
2905Parity bit is
29061. a bit which acts as a check on a set of binary values, calculated in such a way
2907that the number of 1s in the set plus the parity bit should always be even (or
2908occasionally, should always be odd).
2909557.
2910Changing the conceptual schema without having to change the external schema is
2911called as _________________
2912Physical Data Independence
2913558.
2914The problem of thrashing is effected scientifically by _____Program Strructure.
2915559.
2916A sort which relatively passes through a list to exchange the first element with any element less
2917than it and then repeats with a new first element is called
2918quick sort
2919560.
2920Update operation will violate
2921561.
2922When an inverter is placed between both inputs of an SR flip-flop, then resulting flip-lop is
2923D Flip Flop
2924562.
2925Ethernet and Token-Ring are the two most commonly used network architectures in the world.
2926Jim has heard of the different topologies for networks and wants to choose the architecture that
2927will provide him with the most options. Which of the following would that be? Choose the most
2928correct answer.
2929Ethernet, because it can be set up with most topologies and can use multiple transfer
2930speeds
2931563.
2932A 2 MHz signal is applied to the input of a J-K lip-lop which is operating in the 'toggle' mode. The
2933frequency of the signal at the output will be
2934Answer: 2 MHz
2935564.
2936CSMA (Carrier Sense Multiple Access) is
2937Media Access control protocol
2938565.
2939---------------------is data about data
2940Metadata
2941566.
2942Which module gives control of the CPU to the process selected by the short-term scheduler?
2943Dispatcher
2944567.
2945The searching technique that takes O (1) time to find a data is
2946Hashing
2947568.
2948The master slave JK lip-flop is effectively a combination of
2949569.
2950The mechanism that bring a page into memory only when it is needed is called _____________
2951Demand Paging
2952570.
2953The main difference between synchronous and asynchronous transmission is
2954SR and T Flip FLop
2955571.
2956Let R be the relation on the set of positive integers such that a aRb if and only if a and b are
2957distinct and have a common divisor other than 1. Which one of the following statements about R
2958is true?
2959572.
2960What technique is often used to prove the correctness of a recursive function?
2961A. Communitivity.
2962ï‚· B. Diagonalization.
2963ï‚· C. Mathematical induction.
2964ï‚· D. Matrix Multiplication.
2965573.
2966The command which undo the transaction is
2967Undo-Transaction command
2968574.
2969Which of the following is a Non-linear data structure
2970None of the above
2971575.
2972Which directory implementation is used in most Operating System?
2973Tree Directory Structure
2974576.
2975Which of the following is not true of virtual memory?
2976Virtual memory allows more efficient use of memeory( Actually, it doesn’t)
2977577.
2978ARP (Address Resolution Protocol) is
2979578.
2980A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the
2981output bit-string after stuffing is 01111100101, then the input bit-string is
2982Answer: 0111110101
2983579.
29841. If a sequence of push(1), push(2), pop,push(1),push(2),pop,pop,pop, push(2) pop operations
2985are performed in a stack , the sequence of popped out values are
29862 2 1 1 2
2987580.
2988Changing the conceptual schema without having to change physical schema is
2989Logical Data Independence
2990581.
2991When two or more processes trying to execute a set of instructions and if the output depends on
2992the order of execution of the process, this is termed as:
2993582.
2994With a single resource, deadlock occurs,
2995583.
2996The best index for range query is
2997584.
2998A system has ‘n’ processes and each process need 2 instances of a resource. There are n+1
2999instances of resource provided. This could:
3000585.
3001How switching is performed in the internet?
3002586.
30031. You are given pointer p that points to the last node in a circular list and another singly linked
3004list whose first node is pointed to by ‘head’ and last node is pointed to by ‘tail’ has to be
3005appended to the end of the circular list. Which of the following is correct?
3006587.
3007Which of the following is shared between all of the threads in a process? Assume a kernel
3008level thread implementation.
3009588.
3010A telephone switch is a good example of which of the following types of switches.
3011589.
3012 Among the following which is not the application of a stack?
3013590.
3014Commit, Savepoint, Rollback are ________
3015TCL Commands
3016591.
3017Which of the following is shared between all of the threads in a process? Assume a kernel
3018level thread implementation.
3019592.
3020In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
3021compared with the priority of
3022Currently Running Process
3023593.
3024The performance of cache memory is frequently measured in terms of a quantity called
3025Hit Ratio
3026594.
3027You are given pointers to first and last nodes of a singly linked list, which of the following
3028operations are dependent on the length of the linked list?
3029Delete the last element of the list
3030595.
3031R right outer join S on a=b gives
3032596.
3033the following pairs of OSI protocol layer/sub-layer and its functionality,
3034the INCORRECT pair is
3035Data Link Layer and Bit synchronization
3036597.
3037Consider a system with ‘M’ CPU processors and ‘N’ processes then how many processes can be
3038present in ready, running and blocked state at maximum
3039lets say you have n number of cpu and p number of processes
3040ready state the mininum number of processes = 0, maximum = M
3041run state the mininum number of processes = 0, maximum = M (at the run state the
3042maximum number of process cannot be p or 0 because we have cpu bound processes.
3043that is n ……..p depicts number of i/o bound processes)
3044at wait state the mininum number of processes = 0, maximum = N
3045598.
3046Four jobs to be executed on a single processor system arrive at time 0 in order A, B, C, and D.
3047Their burst time requirements are 4,1,8,1 time units respectively. Find the completion of A under
3048round robin scheduling with time slice of one time unit.
30499 Units
3050599.
3051Which one of the following protocols is NOT used to resolve one form of address to another
3052one?
3053DHCP
3054600.
3055What is the software that runs a computer, including scheduling tasks, managing storage, and
3056handling communication with peripherals?
3057Operating System
3058601.
30591. If a , b , c, are three nodes connected in sequence in a singly linked list
3060 struct node *temp=a;
3061 while(temp!=NULL) {
3062 temp=temp->next; printf( “$”); }
3063Assuming ‘c’ to be the last node, the output is $$$
3064602.
3065This user makes canned transaction naïve or end user
3066603.
3067For 3 page frames, the following is the reference string:
30687 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1.
3069How many page faults does the FIFO page replacement algorithm produce?
307015
3071604.
3072Buffering is useful because it allows devices and the CPU to operate asynchronously
3073605.
3074What does the code snippet given below do?
3075void fun1(struct node *head)
3076{ if(head==NULL) return;
3077fun1(head->next);
3078printf("%d",head->data);
3079}
3080Fun1() prints the given Linked List in reverse manner
3081606.
3082The transport layer protocols used for real time multimedia, file transfer, DNS and email,
3083respectively are
3084UDP, TCP, UDP and TCP
3085For real time multimedia, timely delivery is more important than correctness. –> UDP
3086For file transfer, correctness is necessary. –> TCP
3087DNS, timely delivery is more important –> UDP
3088Email again same as file transfer –> TCP
3089607.
3090This Key Uniquely Identifies Each Record
3091Primary Key
3092608.
3093What is the main difference between traps and interrupts?
3094How they are initiated
3095609.
3096Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the
3097First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K, and 426K (in
3098order)? Which algorithm makes the most efficient use of memory?
3099First-fit:
3100212k -> 500K (288 left)
3101417k -> 600k (183 left)
3102122k -> 288k (166k left)
3103426k -> nowhere big enough left! doh!
3104Best-fit:
3105212k -> 300k (88k left)
3106417k -> 500k (83k left)
3107122k -> 200k (78k left)
3108426k -> 600k (174k left)
3109Worst-fit:
3110212k -> 600k (388k left) 
3111417k -> 500k (83k left)
3112122k -> 388k (266k left)
3113426k -> nowhere big enough again!
3114the best fit algorithms uses memory most efficiently (it's also the only one that can even put all
3115the processes into memory!)
3116610.
3117Which of the following transport layer protocols is used to support electronic mail?
3118TCP(transport layer) SMTP(application layer)
3119611.
3120The following query is called as ? select * from emp where ssn in ( select dssn from dependent
3121order by age desc ) ?;
3122DML query
3123612.
3124Which of the following is termed as reverse polish notation?
3125Any postfix notation
3126613.
3127In one of the pairs of protocols given below, both the protocols can use multiple TCP
3128connections between the same client and the server. Which one is that?
3129SMTP: only one TCP connection
3130Telnet: only one TCP connection
3131HTTP: Multiple connections can be used for each resource
3132FTP: FTP uses Telnet protocol for Control info on a TCP connection and another TCP
3133connection for data exchange
3134So, answer is HTTP and FTP
3135614.
3136The term P means in semaphores
3137Wait(probheer)
3138615.
3139If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the
3140service provided is for
3141Higher priority
3142616.
3143The data type describing the types of values that can appear in each column is
3144called ______________________.
3145domain
3146617.
3147For the given infix expression a+b^c*(d-e) where ‘^’ denotes the EX-OR operator, the
3148 corresponding prefix expression is
3149^+ab*c-de
3150618.
3151Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following
3152statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S);
3153respectively. The above situation depicts a _________ .
3154deadlock
3155619.
3156The query to print alternate records (i.e even numbered) from a table is
3157Select * from TableName where ColumnName % 2 = 0(even number)
3158SELECT usernameFROM (SELECT ROWNUM num, usernameFROM dba_users)
3159WHERE MOD (num, 2) = 0;(even number)
3160Select * from TableName where ColumnName % 2 = 1(odd number)
3161620.
3162A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of
31638 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number
3164of bits for the TAG field is
3165Number of sets = cache size / sizeof a set
3166Size of a set = blocksize * no. of blocks in a set
3167= 8 words * 4 (4-way set-associative)
3168= 8*4*4 (since a word is 32 bits = 4 bytes)
3169= 128 bytes.
3170So, number of sets = 16 KB / (128 B) = 128
3171Now, we can divide the physical address space equally between these 128 sets. So, the number
3172of bytes each set can access
3173= 4 GB / 128
3174= 32 MB
3175= 32/4 = 8 M words = 1 M blocks. (220 blocks)
3176So, we need 20 tag bits to identify these 220 blocks.
3177621.
3178Which of the following is two way list?
3179None of the above
3180622.
3181The protocol data unit (PDU) for the application layer in the Internet stack is
3182Message
3183623.
3184In an Ethernet local area network, which one of the following statements isTRUE?
3185The exponential backoff mechanism reduces the probability of collision on
3186retransmissions
3187624.
3188Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method.
3189There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for
3190intermediate results. Assuming size(r(R))
3191relation r(R) is in the outer loop.
3192625.
3193An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of
3194processes is ________.
3195SJF
3196626.
3197In the process state transition diagram, the transition from the READY state to the
3198RUNNING state indicates that:
3199the process in the running state can be preempted and brought back to ready state.
3200627.
32011. A circularly linked list is used to represent a Queue. A single variable p is used to access the
3202Queue. To which node should p point such that both the operations enQueue and deQueue
3203can be performed in constant time?
3204Rear node
3205628.
3206Consider the following four schedules due to three transactions (indicated by the subscript) using
3207read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is
3208conflict serializable?
3209Answer : D
3210629.
3211The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage
3212(with delay 800 picoseconds) is replaced with a functionally equivalent design involving two
3213stages with respective delays 600 and 350 picoseconds. The throughput increase of the pipeline
3214is percent
321533.33
3216630.
3217In the IPv4 addressing format, the number of networks allowed under Class C addresses is
32182^21
3219631.
32201. If a sequence of enque(1), enque (2), deque, enque (1), enque (2), deque, deque, deque,
3221enque (2) operations are performed in a queue , the list of elements that would have been
3222processed are
3223632.
3224Which of the following is not true about segmented memory management?
3225virtual memory is used only in multi-user systems
3226633.
3227R has n tuples and S has m tuples, then the Cartesian product of R and S will
3228produce ___________ tuples.
3229m*n
3230634.
32311. In a circular list with 5 nodes, let ‘temp’ point to the 4th node at present.
3232int i;
3233for(i=0;i<4;i++)
3234 temp=temp->next;
3235The above code will make ‘temp’ point to
32363
3237rd Node
3238635.
3239What is the main difference between traps and interrupts?
3240Trap is s/w generated. Interrupt is h/w generated.
3241636.
3242IEEE 802.5 is a _______________
3243Token Ring related
3244637.
3245Which one of the following fields of an IP header is NOT modified by a typical IP router?
3246Source Address
3247638.
3248Minimal super key of a relation is called _______________.
3249Candidate key
3250639.
3251For what value of c1 and c2 , the theta notation of f(n)=5n2+3n+2 is n2?
3252640.
3253When a program tries to access a page that is mapped in address space but not loaded
3254in physical memory, then
3255Page fault occurs
3256641.
3257The main advantage of DMA is that it
3258High transfer rates
3259642.
3260If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum
3261number of hosts per subnet?
32622046
3263643.
3264A typical hard drive has a peak throughput of about
3265600 mbps (not sure)
3266644.
3267Which algorithm chooses the page that has not been used for the longest period of time
3268whenever the page required to be replaced?
3269LRU
3270645.
3271Consider a relation R (A, B, C, D, E) with set of functional dependencies F = {A¿BC, CD¿E,
3272B¿D, E¿A}. Which of the following is one of the candidate keys of R?
3273The candidate keys are A, E, CD, and BC
3274646.
32751. Consider a dynamic queue with two pointers: front and rear. What is the time needed
3276to insert an element in a queue of length of n?
3277O(1). Insert element at rear.
3278647.
3279DMA is useful for the operations
3280DMA is useful for transferring data between memory and devices if large volume of data is to be
3281transferred, or the devices have small response times. Because after setting up buffers, pointers,
3282and counters for the I/O device, the device controller transfers an entire block of data directly to
3283or from its own buffer storage to memory, with no intervention by the CPU. Only one interrupt is
3284generated per block, rather than the one interrupt per byte (or word) generated for low-speed
3285devices.
3286Alternatively, you may simply say:
3287DMA is useful for transferring large quantities of data between memory and devices. It eliminates
3288the need for the CPU to be involved in the transfer, allowing the transfer to complete more
3289quickly and the CPU to perform other tasks concurrently.
3290648.
32911. Which sorting technique uses a data structure similar to the one used in bucket hashing?
3292Bucket sort
3293649.
3294How many address bits are needed to select all memory locations in the 16K × 1 RAM?
329514
3296650.
3297RAID is a way to:
3298RAID is the way of combining several independent and relatively small disks into a single
3299storage of a large size. The disks included into the array are called array members. The disks
3300can be combined into the array in different ways which are known as RAID levels.
3301651.
3302Assume that source S and destination D are connected through two intermediate routers labeled
3303R. Determine how many times each packet hasto visit the network layer and the data link layer
3304during a transmission from S to D.
3305Network layer – 4 times and Data link layer – 6 times
3306652.
3307__________is the description of the database
3308653.
3309Identify the correct sequence in which the following packets are transmitted on the network by
3310a host when a browser requests a webpage from a remote server, assuming that the host has
3311just been restarted.
3312DNS query, TCP SYN, HTTP GET request
3313654.
33141. On adopting shell sort technique, the output of the array (21,62,14,9,30,77,80,25) after a pass
3315with increment size =3, is
3316655.
3317Which of these would not be a good way for the OS to improve battery lifetime in a
3318laptop?
3319656.
3320Which of the following is not included in an inode in Linux?
3321File name and directory
3322657.
3323The DMA controller has _______ registers
33243
3325658.
3326Consider a relational table with the schema R (A, B, C). Assume that the cardinality of attribute A
3327is 10, B is 20, and C is 5. What is the maximum number of records R can have without duplicate?
33281000
3329659.
3330An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an
3331IPpacket of size 4404 bytes with an IP header of length 20 bytes. The values of the
3332relevant fields in the header of the third IP fragment generated by the router for this packet are
3333MF bit: 0, Datagram Length: 1444; Offset: 370
3334660.
33351. For the array , (77 ,62,114,80,9,30,99), write the order of the elements after two passes
3336 using the Radix sort.
3337661.
3338What is the correct HTML for making a hyperlink?
3339a href = “”
3340662.
3341One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the
3342following statements best explains the need for this field?
3343It can be used to prevent packet looping
3344663.
3345Assume relations R and S with the schemas R (A, B, C) and S (B, D). Which of the following is
3346equivalent to r ¿ s?
3347664.
3348A Program Counter contains a number 825 and address part of the instruction contains the
3349number 24. The effective address in the relative address mode, when an instruction is read from
3350the memory is
3351849
3352665.
33531. Time complexity of the program to generate Fibonacci sequence is
3354T(n) = T(n-1) + T(n-2) which is exponential.
3355Or O(n)
3356666.
3357Which one of the following is NOT a part of the ACID properties of database transactions?
3358Atomicity, Consistency, Isolation, durability
3359667.
33601. While applying Quick sort technique for the array 5 4 3 8 12 6 10 1 7 9, if pivot =5, after the first
3361traversal on both sides, ‘l’ and ‘r’ will be
33625 4 3 1 12 6 10 8 7 9
3363668.
3364When process requests for a DMA transfer ,
3365process is temporarily suspended and another process gets executed.
3366669.
3367How switching is performed in the internet?
3368Packet Switching
3369670.
3370The <big> tag makes
3371the text bigger than the normal. Not supported in HTML 5
3372671.
33731. If a[] is the array containing the elements to be sorted using radix sort, during the second
3374iteration in which the second Least Significant Digit is considered, row number in 2D array to
3375which an element has to be stored is given by
3376672.
3377Which of following property returns the window object generated by a frame object
3378contentWindow
3379673.
3380Foreign key is a subset of primary key is stated in _____________ constraint
3381Foreign Key
3382674.
3383What is the unique characteristic of RAID 6 ?
3384Two independent distributed parity.
3385675.
3386A layer -4 firewall (a device that can look at all protocol headers up to the transport layer)
3387CANNOT
3388Block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00AM
3389676.
3390Which of the following address modes calculate the effective address as
3391address part of the instruction) + (content of CPU register)
3392. Indirect Address Mode
3393677.
3394A telephone switch is a good example of which of the following types of switches.
3395circuit
3396678.
3397Which component of a database is used for sorting?
3398procedure
3399679.
34001What is the output of following JavaScript code
3401680.
3402If a , b , c, d are four nodes connected in sequence in a doubly-linked list
3403 Struct node *temp=a;
3404 Temp=temp->next;
3405 (Temp->next)->prev=temp->prev;
3406 (Temp->prev)->next=temp->next; Which of the following is true?
3407B is deleted from the list
3408681.
3409The load instruction is mostly used to designate a transfer from memory to a
3410processor register known as
3411accumulator
3412682.
3413You can refresh the web page in javascript by using ................ method.
3414Reload()
3415683.
3416The max-heap for the array ( 4, 3, 1, 5, 9, 2, 8 ) is
34179
3418 5 8
34193 4 1 2
3420684.
3421If message in Segmentation and Reassembly (SAR) sub layer of Application Adaptation
3422Layer 3/4 has value of Segment type is 11 then it is called a
3423single segment message.
3424685.
3425Consider the following relation
3426Cinema (theater, address, capacity)
3427Which of the following options will be needed at the end of the SQL query
3428SELECT P1. address
3429FROM Cinema P1
3430Such that it always finds the addresses of theaters with maximum capacity?
3431WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)613.
3432686.
3433In Circuit Switching, resources need to be reserved during the
3434Setup phase
3435687.
3436The load instruction is mostly used to designate a transfer from memory to a processor register
3437known as____.
3438accumulator
3439688.
3440Which of the following is the correct way for writing JavaScript array?
3441var txt = new Array("arr ","kim","jim")
3442689.
3443Among the following ,which has the highest time complexity O(n2
3444) in all the three
3445 cases.(Worst,average and best) and cannot be improved?
3446690.
3447Which of the following relational algebra operations do not require the participating tables to be
3448union-compatible?
3449Join
3450691.
3451In RMI Architecture which layer Intercepts method calls made by the client/redirects these calls
3452to a remote RMI service?
3453Stub and Skeleton layer
3454692.
3455Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on
3456R.
3457It will immediately be granted
3458693.
3459A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output
3460bit-string after stuffing is 01111100101, then the input bit-string is
34610111110101
3462694.
3463For an algorithm whose step-count is 45n3+34n , choose the correct statement.
3464695.
3465What is the output of following JavaScript code
3466696.
3467Relations produced from an E-R model will always be
3468697.
3469How do you put a message in the browser's status bar?
3470window.status = "put your message here"
3471698.
3472Congestion control and quality of service is qualities of the
3473ATM
3474699.
3475If the associativity of a processor cache is doubled while keeping the capacity and block size
3476unchanged, which one of the following is guaranteed to be NOT affected?
3477Width of processor to main memory data bus
3478700.
3479If the element 12 has to be searched in the array (2,4,8, 9,14,16, 18), using binary
3480 search, the result can be obtained within _____ comparisons.
34813
3482701.
3483A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each
3484page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
3485maximum size of the page table of a process is 24 megabytes, the length of the virtual address
3486supported by the system is _________ bits.
348736
3488702.
3489Which two files are used during operation of the DBMS?
3490data dictionary and transaction log
3491703.
3492In the following pairs of OSI protocol layer/sub-layer and its functionality,
3493the INCORRECT pair is
3494Data Link Layer and Bit Synchronization
3495704.
3496What is the output of following JavaScript code?
3497705.
34981. For the array , (77 ,62,14,80,9,30,99) , if Quick sort technique is followed,what will be
3499 the array status after placing the first pivot element in its appropriate place?
350062,14,9,30,77,80,99
3501706.
3502What is the correct JavaScript syntax to write "Hello World"
3503document. write("Hello World");
3504707.
3505The local host and the remote host are defined using IP addresses. To define the processes,
3506we need second identifiers called.........
3507UDP Addresses
3508708.
3509The number of outputs in n-input decoder is
35102^n
3511709.
3512Which two RAID types use parity for data protection?
3513RAID 4 and RAID 5
3514710.
3515Rotation method of hashing is usually combined with other hashing techniques except
3516Last character
3517711.
3518The two's complement of 101011 is
3519010101
3520712.
3521----------------------is a description of the database
3522Schema
3523713.
3524Browsers typically render text wrapped in ___________ tags as an indented paragraph.
3525<blockquote>
3526714.
3527Which one of the following protocols is NOT used to resolve one form of address to another
3528one?
3529DHCP
3530715.
35311. Among the following sorting techniques ,which has its time complexity as O(n) in the 
3532 best-case?
3533Insertion,Bubble
3534716.
3535-------involves finding the best line to fit two attributes so that one attribute is used to predict
3536another attribute.
3537Linear Regression
3538717.
3539The number of boolean functions in n-variables is
3540(2^(2^n))
3541718.
3542UDP uses........ to handle outgoing user datagrams from multiple processes on one host.
3543Multiplexing
3544719.
3545Who invented the JavaScript programming language?
3546Brendan Eich
3547720.
3548Java package is a grouping mechanism with the purpose of
3549Controlling the visibility of classes, interface and methods
3550721.
3551A heap memory area is used to store the
3552Heap memory is used for dynamic memory allocation
3553722.
3554The transport layer protocols used for real time multimedia, file transfer, DNS and email,
3555respectively are
3556(A) TCP, UDP, UDP and TCP
3557(B) UDP, TCP, TCP and UDP
3558(C) UDP, TCP, UDP and TCP
3559(D) TCP, UDP, TCP and UDP
3560Answer: (C)
3561723.
3562What is the output of following JavaScript code?
3563Output : 44
3564724.
3565The lifetime of flash memory is ---------------------
3566Lifetime of a flash memory is long.
3567725.
3568A schema describes
3569A. Record & files
3570B. data elements
3571C. record relationships
3572D. all of the above
3573Ans Correct Answer is d
3574726.
3575What is the output of following JavaScript code
3576727.
3577The ......... protocol defines a set of messages sent over either User Datagram Protocol (UDP)
3578port53 or Transmission Control Protocol(TCP) port53.
3579A. Name space
3580B. DNS
3581C. Domain space
3582D. Zone transfer
3583Ans: B. DNS
3584728.
3585What is the multiplexer used for?
3586a) It is a type of decoder which decodes several inputs and gives one output
3587b) A multiplexer is a device which converts many signals into one
3588c) It takes one input and results into many output
3589d) None of the Mentioned
3590Ans. B
3591729.
3592Which of the following is true for the given tree?
3593730.
3594Trigger is a
3595Trigger is a special kind of a store procedure that executes in response to certain action on the
3596table like insertion, deletion or updation of data
3597731.
3598Which of the following transport layer protocols is used to support electronic mail?
3599(A) SMTP
3600(B) IP
3601(C) TCP
3602(D) UDP
3603Answer (C)
3604E-mail uses SMTP as application layer protocol. SMTP uses TCP as transport layer
3605protocol.
3606732.
3607What will be printed as the output of the following program?
3608public class testincr
3609 {
3610 public static void main(String args[])
3611 {
3612 int i = 0;
3613 i = i++ + i;
3614 System.out.println(" I = " +i);
3615 }
3616 }
3617Output: I = 1
3618733.
3619Identify the addressing mode of the following instruction
3620Add R1, R2, R3
3621where R1, R2 are operands and R3 destination
3622Answer : Three-Address Instructions
3623734.
3624R left outer join S on a=b gives
3625No table given
3626735.
3627What is the output of following JavaScript code
3628Output : N
3629736.
3630Foreign key is a subset of primary key is stated in -----------constraint
3631737.
3632What is the output of following JavaScript code
3633738.
3634When a network interface has a failure in its circuitry, it sends a continuous stream of frames
3635causing the Ethernet LAN to enter a Collapse state. This condition is known as __________.
3636a.Scattering
3637b.Jabbering
3638c.Blocking
3639d.Refreshing
3640Ans: b.Jabbering
3641739.
3642To prevent any method from overriding, the method has to declared as,
3643And: Method is declared with a ‘final’ keyword
3644740.
3645Which of the following addressing modes has minimum number of memory access to access the
3646operands?
3647A. Indirect
3648B. Direct
3649C. Indexed
3650D. Immediate
3651And: D.Immediate
3652741.
3653In one of the pairs of protocols given below, both the protocols can use multiple TCP
3654connections between the same client and the server. Which one is that?
3655(A) HTTP, FTP
3656(B) HTTP, TELNET
3657(C) FTP, SMTP
3658(D) HTTP, SMTP
3659Answer: (A)
3660Explanation: HTTP may use different TCP connection for different objects of a webpage if
3661non-persistent connections are used.
3662FTP uses two TCP connections, one for data and another control.
3663TELNET and FTP can only use ONE connection at a time
3664742.
3665R left outer join S on a=b gives
3666743.
3667The ways to accessing html elements in java script
3668document.getElementById("intro");
3669getElementsByTagName("p");
3670getElementsByClassName("intro");
3671document.forms["frm1"];
3672744.
3673How many flip-flops are present in register of sixteen bits?
3674Ans: 16 Flip flops
3675745.
3676temp=root->left;
3677 while(temp->right!=NULL)
3678 temp=temp->right;
3679 return temp;
3680 The above code snippet for a BST with the address of the root node in pointer ‘root’
3681 returns
3682Ans:Inorder Predecessor
3683746.
3684A subnet has been assigned a subnet mask of 255.255.255.192. What is the maximum number of hosts
3685that can belong to this subnet?
3686(A) 14
3687(B) 30
3688(C) 62
3689(D) 126
3690Answer: (C)
3691747.
36924. What is the correct syntax for referring to an external script called " abc.js"
3693A. <script href=" abc.js">
3694B. <script name=" abc.js">
3695C. <script src=" abc.js">
3696D. None of the above
3697Ans: C. <script src=" abc.js">
3698748.
3699Which one of the following is not true?
3700749.
3701In a relational schema, each tuple is divided into fields called
3702A) Relations
3703B) Domains
3704C) Queries
3705D) All of the above
3706Ans: B) Domains
3707750.
3708If a pipeline has five stages, assuming each stage is one cycle, the earliest time to receive an
3709output from an instruction without any forwarding (not nop) is after which cycle?
3710751.
3711The term scheme means:
3712752.
3713How many phases are present in the simplest pipeline system?
3714753.
3715Identify the sorting technique that supports divide and conquer strategy and has (n2) complexity
3716in worst case
3717a. Bubble sort
3718b. Insertion sort
3719c. Quick sort
3720d. All of above
3721Ans: c. Quick sort
3722754.
3723A system of interlinked hypertext documents accessed via the Internet is known as
3724The World Wide Web (abbreviated as WWW or W3, commonly known as the web),
3725is a system of interlinked hypertext documents accessed via the Internet
3726755.
3727Value of checksum must be recalculated regardless of
3728De-fragmentation
3729Fragmentation
3730Transfer
3731Size
3732Ans: Fragmentation
3733756.
3734In Circuit Switching, resources need to be reserved during the
3735Ans: the resources need to be reserved during the setup phase
3736757.
3737The language used in application programs to request data from the DBMS is referred to as the
3738A. DML
3739B. DDL
3740C. query language
3741D. All of the above
3742E. None of the above
3743Answer: Option A
3744758.
3745A ____________ is often used if you want the user to verify or accept
3746confirm box
3747759.
3748Can any unsigned number be represented using one register in 64-bit processor
3749ANS: 2^63 – 1 numbers (Not sure).
3750760.
37511. Inorder and postorder traversal sequences of a binary tree are 45 50 55 65 70 75 80 85 90
3752and 45 55 65 50 75 90 85 80 70. What are its leaf nodes?
3753Ans: 45,55,70,85
3754761.
3755Which normal form is considered adequate for relational database design?
3756Ans: Which normal form is considered adequate for normal relational database
3757design? Explanation: A relational database table is often described as “normalized” if
3758it is in the Third Normal Form because most of the 3NF tables are free of insertion,
3759update, and deletion anomalies
37603NF
3761762.
3762In Javascript, which of the following method is used to find out the character at a position
3763in a string?
3764a) charAt()
3765b) CharacterAt()
3766c) CharPos()
3767d) characAt()
3768ans: a
3769763.
3770If the page size is 1024 bytes, what is the page number in decimal of the following virtual address
37711110 1010010101
3772764.
3773The protocol data unit (PDU) for the application layer in the Internet stack is
3774(A) Segment
3775(B) Datagram
3776(C) Message
3777(D) Frame
3778Answer (C)
3779The Protocol Data Unit for Application layer in the Internet Stack (or TCP/IP) is called
3780Message.
3781765.
37821. The preorder traversal of the AVL tree obtained by inserting 17,7,20,10,8 is
3783766.
3784A queue data structure can be used for
3785Ans: Typical uses of queues are in simulations and operating systems.
3786Operating systems often maintain a queue of processes that are ready to execute or
3787that are waiting for a particular event to occur.
3788Computer systems must often provide a “holding area” for messages between two
3789processes, two programs, or even two systems. This holding area is usually called a
3790“buffer” and is often implemented as a queue.
3791767.
3792What is the JavaScript syntax to insert a comment that has more than one line?
3793ans: “/* … */” can be used to insert comment > 1line
3794768.
3795Given four frames in main memory, the following is the content of the page table. Assuming
3796the frames are fetched at time instant 3, 4, 1, 2 which frame will be replaced to place the page
379746 using first in first out replacement algorithm?
379823
379934
380010
38014
3802page 46?????
3803769.
3804In an Ethernet local area network, which one of the following statements isTRUE?
3805(A) A station stops to sense the channel once it starts transmitting a frame.
3806(B) The purpose of the jamming signal is to pad the frames that are smaller than the minimum
3807frame size.
3808(C) A station continues to transmit the packet even after the collision is detected.
3809(D) The exponential backoff mechanism reduces the probability of collision on retransmissions
3810Answer: (D)
3811770.
3812The concept of locking can be used to solve the problem of
3813Deadlock
3814Lost update
3815Inconsistent
3816All of the above
3817Ans: All of the above
3818771.
3819………… is very useful in situation when data have to stored and then
3820retrieved in reverse order.
3821Ans: Stack
3822772.
3823In a E-R diagram, ellipses represent a
3824Ans : Attributes are represented by means of ellipses. Every ellipse represents one attribute
3825773.
3826What does isNaN function do in JavaScript?
3827Ans: The isNaN() function determines whether a value is an illegal number (Not-a-Number). This
3828function returns true if the value equates to NaN. Otherwise it returns false.
3829774.
3830Consider the following message M = 1010001101. The cyclic redundancy check (CRC) for this message
3831using the divisor polynomial x5 + x4 + x2 + 1 is :
3832Ans: 01110
3833775.
3834The daisy chaining prioirty gives least priority to which device?
3835Ans: Slow devices such as Keyboard
3836776.
3837A binary search tree whose left subtree and right subtree differ in hight by at
3838most 1 unit is called ……
3839Ans AVL Tree
3840777.
3841Which method is implemented in RAID 1?
3842RAID 1 consists of an exact copy (or mirror) of a set of data on two or more disks; a classic RAID
38431 mirrored pair contains two disks. This configuration offers no parity, striping, or spanning of disk
3844space across multiple disks, since the data is mirrored on all disks belonging to the array, and
3845the array can only be as big as the smallest member disk. This layout is useful when read
3846performance or reliability is more important than write performance or the resulting data storage
3847capacity.
3848778.
3849Dotted-decimal notation of 10000001 00001011 00001011 11101111 would be
3850Ans: 129 .11 .11.239
3851779.
3852Which of the following desired features are beyond the capability of relational algebra?
3853(a) Aggregate computation
3854(b) Multiplication
3855(c) Finding transitive closure
3856(d) None of the above
3857Ans: All a,b,c (Aggregate Computation,Multiplication,Finding transitive closure)
3858780.
3859How do you create a new object in JavaScript?
3860Ans : There are various ways to create an object in js:
3861a)define a constructor function and then create an object by using the new keyword
3862b)Using object.create() method
3863Object.create(proto [, propertiesObject ])
3864781.
3865A processor can support a maximum memory of 4 GB, where the memory is word-addressable
3866(a word consists of two bytes). The size of the address bus of the processor is at least
3867__________ bits
3868Ans: Maximum Memory = 4GB = 232 bytes
3869Size of a word = 2 bytes
3870Therefore, Number of words = 232 / 2 = 231
3871So, we require 31 bits for the address bus of the processor.
3872782.
3873When determining the efficiency of algorithm the time factor is measured by
3874Ans: Counting the number of key operations
3875783.
3876What is the output of following JavaScript code?
3877Ans: Quality 100
3878784.
3879What are the potential problems when a DBMS executes multiple transaction concurrently
3880Ans: Lost update problem,dirty read problem
3881785.
3882In the IPv4 addressing format, the number of networks allowed under Class C addresses
3883is
3884Ans: 2^21
3885786.
3886Which one of the following allows a user at one site to establish a connection to another site
3887and then pass keystrokes from local host to remote host?
3888Ans : Telnet
3889787.
3890RAM type is justified as
3891Ans RAM is justified as being reliable and error detecting
3892788.
3893Linked lists are best suited
3894Ans for the size of the structure and the data in the structure are constantly changing
3895789.
3896Which of the following object is the highest-level object in the browser object hierarchy?
3897Ans Javascript Window object
3898790.
3899Let R be a relation. Which of the following comments about the relation R are correct?
3900791.
3901The resources needed for communication between end systems are reserved for the
3902duration of session between end systems in
3903Ans Circuit Switching
3904792.
3905The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer
3906a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable. The
3907minimum number of times the DMA controller needs to get the control of the system bus from the
3908processor to transfer the file from the disk to main memory is
3909Ans 
3910Size of data count register of the DMA controller = 16 bits
3911Data that can be transferred in one go = 216 bytes = 64 kilobytes
3912File size to be transferred = 29154 kilobytes
3913So, number of times the DMA controller needs to get the control of the system bus from the
3914processor to transfer the file from the disk to main memory = ceil(29154/64) = 456
3915793.
3916Linked list are not suitable data structure of which one of the following problems ?
3917Ans: Binary Search(Because it will take O(n/2) time to find the middle element)
3918794.
3919What is the output of following JavaScript code?
3920Ans 2
3921795.
3922Changing the conceptual schema without having to change physical schema is
3923Ans Data Independence
3924796.
3925________ extracts the DML statements from a host language and passes to DML Compiler
3926Ans Precompiler
3927797.
3928What is the output of following JavaScript code?
3929Ans 16
3930798.
3931Which of the following is useful in implementing quick sort?
3932Ans Stacks
3933799.
3934Which of the following raid levels provides maximum usable disk space?
3935Ans Raid 0
3936800.
3937Which one of the following fields of an IP header is NOT modified by a typical IP router?
3938Ans Source Address
3939801.
3940What are the states of the Auxiliary Carry (AC) and Carry Flag (CF) after executing the following
39418085 program? MVI H, 5DH; MIV L, 6BH; MOV A, H; ADD L
3942Ans AC=1 CY 0
3943802.
3944Which of the following object represents the HTML document loaded into a browser
3945window?
3946Ans Window object
3947803.
3948What is the result of the following operation Top (Push (S, X))
3949Ans X
3950804.
3951These networking classes encapsulate the "socket" paradigm pioneered in the (BSD) Give the
3952abbreviation of BSD?
3953Ans Berkeley Software Distribution
3954805.
3955Truncate is _________ command
3956Ans DDL
3957806.
3958In a priority queue insertion and deletion takes place at
3959Ans Any Position
3960807.
3961A transaction is permanently saved in the hard disk only after giving
3962Ans COMMIT Command
3963808.
3964The performance of cache memory is frequently measured in terms of a quantity called
3965Ans Hit Ratio
3966809.
3967If message in Segmentation and Reassembly (SAR) sub layer of Application Adaptation
3968Layer 3/4 has value of Segment type is 11 then it is called a
3969Ans Single segmented Message
3970810.
3971What is the output of following JavaScript code?
3972811.
3973When does the top value of stack changes?
3974Ans Before Insertion
3975812.
3976Digital signature envelope is decrypted by using _________.
3977Ans Symmetric key
3978813.
3979What is mean by "this" keyword in javascript?
3980Ans In JavaScript, the thing called this, is the object that "owns" the JavaScript code. The value
3981of this, when used in a function, is the object that "owns" the function. The value of this, when
3982used in an object, is the object itself. The this keyword in an object constructor does not have a
3983value.
3984814.
3985DMA is useful for the operations
3986Ans DMA is useful for transferring data between memory and devices if large volume of data is to
3987be transferred, or the devices have small response times.
3988815.
3989The data manipulation language (DML)
3990816.
3991If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the
3992maximum number of hosts per subnet?
3993Ans 2046
3994817.
3995int unknown(int n) {
3996 int i, j, k = 0;
3997 for (i = n/2; i <= n; i++)
3998 for (j = 2; j <= n; j = j * 2)
3999 k = k + n/2;
4000 return k;
4001}
4002818.
4003Math. round(-20.5)=?
4004Ans 21
4005819.
4006Computers use addressing mode techniques for _____________________.
4007Ans : A. giving programming versatility to the user by providing facilities as pointers to memory
4008counters for loop control
4009B. to reduce no. of bits in the field of instruction
4010C. specifying rules for modifying or interpreting address field of the instruction
4011Ans ALL ABC
4012820.
4013An advantage of the database approach is
4014Ans The advantages in the database approach are as follows:
4015are using the same database; hence, any report using the
4016information will not be inconsistent.
4017the database occurs once only and is protected by the security measures.
4018fast by using the logic of the data structures.
4019821.
4020Which of the following is not characteristics of a relational database model
4021822.
4022The maximum number of binary trees that can be formed with three unlabeled nodes is:
40235
4024823.
4025A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32
4026Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory
4027entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit. The
4028size of the cache tag directory is
402916
4030824.
4031Which built-in method sorts the elements of an array
4032Sort()
4033825.
4034In ………………. Mode, the authentication header is inserted immediately after the IP
4035header.
4036Tunnel
4037826.
4038Assume that source S and destination D are connected through two intermediate routers
4039labeled R. Determine how many times each packet hasto visit the network layer and the
4040data link layer during a transmission from S to D.
4041network layer -4 times, data link layer-6times
4042827.
4043The minimum duration of the active low interrupt pulse for being sensed without being lost must
4044be
4045one machine cycle
4046828.
4047Microsoft SQL Server is an example for which OLAP Server?
4048Specialized SQL servers
4049829.
4050Which built-in method returns the length of the string?
4051length()
4052830.
4053Trace the output of the following code?
4054#include
4055using namespace std;
4056int main()
4057{
4058int x=15,y=27;
4059x = y++ + x++;
4060y = ++y + ++x;
4061cout<<x+y++<<++x+y;
4062return 0;
4063}</x+y++<<++x+y;
4064116,116
4065831.
4066Which of the following is not a stored procedure?
4067832.
4068Determine the output of the following code?
4069#include
4070using namespace std;
4071class one
4072{
4073int a;
4074static int b;
4075public:
4076void initialize();
4077void print();
4078static void print_S();
4079};
4080int one::b = 0;
4081void one::initialize()
4082{
4083a = 10;
4084b ++;
4085}
4086void one::print()
4087{
4088cout<<a;
4089cout<<b;
4090}
4091void one::print_S()
4092{
4093cout<<b;
4094}
4095int main()
4096{
4097one o;
4098o.initialize();
4099o.print();
4100o.print_S();
4101return 0;
4102}
4103</b;
4104</b;
4105</a;
41061011
4107833.
4108Which of the following statements is FALSE regarding a bridge
4109Bridge reduces broadcast domain
4110834.
4111How many 8-bit characters can be transmitted per second over a 9600 baud serial
4112communication link using asynchronous mode of transmission with one start bit, eight data bits,
4113two stop bits, and one parity bit?
4114800
4115835.
4116Which of the following function of Array object calls a function for
4117each element in the array?
4118forEach()
4119836.
4120Consider the following pseudo code fragment:
4121printf (“Hello”);
4122if(!fork( ))
4123printf(“World”);
4124Which of the following is the output of the code fragment?
4125837.
4126Congestion control and quality of service is qualities of the
4127frame relay
4128838.
4129Which one of these is characteristic of RAID 5?
4130Distributed parity
4131839.
4132A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect
4133block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and
4134the size of each disk block address is 8 Bytes. The maximum possible file size in this file system
4135in KBytes is
413635 Kbytes
4137840.
4138Dynamic web page
4139generates on demand by a program or a request from browser
4140841.
4141Identify the correct sequence in which the following packets are transmitted on the network
4142by a host when a browser requests a webpage from a remote server, assuming that the host
4143has just been restarted.
4144DNS query, TCP SYN, HTTP GET request
4145842.
4146Generally Dynamic RAM is used as main memory in a computer system as it______.
4147has higher speed
4148843.
4149Which one of the following statements is false?
4150844.
4151Which of the following is not a function of a DBA?
4152Network maintenance
4153845.
4154What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note
4155that the first parameter is passed by reference, whereas the second parameter is passed by
4156value.
4157int f (int &x, int c) {
4158c=c-1;
4159if (c-0) return 1;
4160x=x+1;
4161return f (x,c)*x;}
4162846.
4163Uniform Resource Locator (URL), is a standard for specifying any kind of information on the
4164internet
4165847.
4166Which one of the following is a cryptographic protocol used to secure HTTP connection?
4167transport layer security (TSL)
4168848.
4169If a virtual memory system has 4 pages in real memory and the rest must be swapped to disk.
4170Which of the following is the hit ratio for the following page address stream. Assume memory
4171starts empty, use the FIFO algorithm
417231%
4173849.
4174Consider a relation R (A, B). If A ¿ B is a trivial functional dependency and A is the super key for
4175R, then what is the maximum normal form R can be in?
4176BCNF
4177850.
4178What is the unique characteristic of RAID 6 (Choose one)?
4179Two independent distributed parity
4180851.
4181An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an
4182IPpacket of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant
4183fields in the header of the third IP fragment generated by the router for this packet are
4184MF bit: 0, Datagram Length: 1444; Offset: 370
4185852.
4186What will be the values of x, m and n after the execution of the following statements?
4187int x, m, n;
4188m = 10;
4189n = 15;
4190x = ++m + n++;
419126 11 16
4192853.
4193What is the code to be used to trim whitespaces ?
4194let trimmed = (l.trim() for (l in lines));
4195854.
4196Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11,92,
419710. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63,
4198moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from
41990 to 199. The total head movement (in number of cylinders) incurred while servicing these
4200requests is
4201165
4202855.
4203What’s the output of the following code?
4204var city = new Array("delhi", "agra", "akot", "aligarh");
4205city.push('palampur');
4206document.write(city);
4207["delhi", "agra", "akot", "aligarh", "palampur"]
4208856.
4209RAID is a way to:
4210combining several independent and relatively small disks into a single storage of a large size
4211857.
4212If the offset of the operand is stored in one of the index registers, then it is
4213is indexed addressing mode
4214858.
4215What happens when a pointer is deleted twice?
4216it can cause a trap
4217859.
4218The local host and the remote host are defined using IP addresses. To define the
4219processes, we need second identifiers called
4220port addressess
4221860.
4222Consider the following relation
4223Cinema (theater, address, capacity)
4224Which of the following options will be needed at the end of the SQL query
4225SELECT P1. address
4226FROM Cinema P1
4227Such that it always finds the addresses of theaters with maximum capacity?
4228WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)
4229861.
4230Which of the following are sufficient conditions for deadlock?
4231mutual exclusion
4232b) a process may hold allocated resources while awaiting assignment of other resources
4233c) no resource can be forcibly removed from a process holding it
4234d) all of the mentioned
4235Answer-All of the mentioned
4236862.
4237One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the
4238following statements best explains the need for this field?
4239It can be used to prevent packet looping
4240863.
4241Which of the following type casts will convert an Integer variable named amount to a Double
4242type?
4243(double) amount
4244864.
4245Assume that a table R with 1000 records is to be joined with another table S with
424610000 records. What is the maximum number of records that would result in if we
4247join R with S and the equi-join attribute of S is the primary key?
42481000
4249865.
4250UDP uses........ to handle outgoing user datagrams from multiple processes on one host.
4251multiplexing
4252866.
4253When an instruction is read from the memory, it is called
4254instruction cycle (sometimes called a fetch–decode–execute cycle)
4255867.
4256What should be used to point to a static class member?
4257Normal pointer
4258868.
4259The ‘$’ present in the RegExp object is called a
4260metacharacter
4261869.
4262Which of the following is a disadvantage of file processing system?
4263(I) Efficiency of high level programming,
4264(II) Data Isolation
4265(III) Integrity issues
4266(IV) Storing of records as files
4267870.
4268Foreign key is a subset of primary key is stated in _____________ constraint
4269871.
4270The ......... protocol defines a set of messages sent over either User Datagram Protocol (UDP)
4271port53 or Transmission Control Protocol(TCP) port53.
4272DNS
4273872.
4274Consider the following statement containing regular expressions
4275var text = "testing: 1, 2, 3";
4276var pattern = /d+/g;
4277In order to check if the pattern matches, the statement is
4278pattern.test(text)
4279873.
4280Which two RAID types use parity for data protection?
4281RAID 4, RAID 5
4282874.
4283Which cause a compiler error?
4284875.
4285The regular expression to match any one character, not between the brackets is
4286[^…]
4287876.
4288Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ
4289>, and sends it to Y, where it is d
4290ecrypted. Which one of the following sequences of keys is used for the operations?
4291Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key
4292followed by X’s public key
4293877.
4294Which of the following relational algebra operations do not require the participating tables to be
4295union-compatible?
4296JOIN
4297878.
4298Which of the following scan() statements is true?
4299879.
4300A process executes the code
4301fork();
4302fork();
4303fork();
4304The total number of child process created is
43057
4306880.
4307A variable P is called pointer if
4308P contains the address of an element in DATA.
4309881.
4310Suppose that everyone in a group of N people wants to communicate secretly with N-1
4311others using symmetric key cryptographic system. The communication between any two
4312persons should not be decodable by the others in the group. The number of keys required
4313in the system as a whole to satisfy the confidentiality requirement is
4314N(N – 1)/2
4315882.
4316Which of the following statement on the view concept in SQL is invalid?
4317The definition of a view should not have GROUP BY clause in it.
4318883.
4319A 20-bit address bus allows access to a memory of capacity
43201Mb
4321884.
4322What does /[^(]* regular expression indicate ?
4323Match zero or more characters that are not open paranthesis
4324885.
4325A RAM chip has a capacity of 1024 words of 8 bits each (1K*8). The number of 2*4 decoders
4326with enable line needed to construct a 16K*6 RAM from 1K*8 RAM is
43275
4328886.
4329A layer -4 firewall (a device that can look at all protocol headers up to the transport layer)
4330CANNOT
4331block HTTP traffic during 9:00PM and 5:00AM
4332887.
4333The function scanf() reads
4334Multiple characters
4335888.
4336In SQL, testing whether a subquery is empty is done using
4337EXISTS
4338889.
4339What will be the result when non greedy repetition is used on the pattern /a+?b/ ?
4340Matches the letter b preceded by the fewest number of a’s possible
4341890.
4342DMA is useful for the operations
4343DMA is useful for transferring large quantities of data between memory and devices. It eliminates
4344the need for the CPU to be involved in the transfer, allowing the transfer to complete more
4345quickly and the CPU to perform other tasks concurrently
4346891.
4347main() is an example of
4348892.
4349What does the subexpression /java(script)?/ result in ?
4350It matches “java” followed by the optional “script”
4351893.
4352Which of the following is not a characteristic of a relational database model?
4353treelike structure
4354894.
4355Which type of error detection uses binary division?
4356Cyclic Redundancy Check (CRC)
4357895.
4358When a network interface has a failure in its circuitry, it sends a continuous stream of frames
4359causing the Ethernet LAN to enter a Collapse state. This condition is known as __________.
4360Jabbering
4361896.
4362An identifier in C
4363897.
4364A RAM chip has a capacity of 1024 words of 8 bits each (1K*8). The number of 2*4 decoders
4365with enable line needed to construct a 16K*6 RAM from 1K*8 RAM is
43665
4367898.
4368Given the basic ER and relational models, which of the following is INCORRECT?
4369In a row of a relational table, an attribute can have more than one value
4370899.
4371What is the most essential purpose of parantheses in regular expressions ?
4372Define subpatterns within the complete pattern
4373900.
4374Which of the following are sufficient conditions for deadlock?
43755. mutual exclusion
4376The resources involved must be unshareable; otherwise, the processes would not
4377be prevented from using the resource when necessary.
43786. hold and wait or partial allocation
4379The processes must hold the resources they have already been allocated while
4380waiting for other (requested) resources. If the process had to release its resources
4381when a new resource or resources were requested, deadlock could not occur
4382because the process would not prevent others from using resources that it
4383controlled.
43847. no pre-emption
4385The processes must not have resources taken away while that resource is being
4386used. Otherwise, deadlock could not occur since the operating system could simply
4387take enough resources from running processes to enable any process to finish.
43888. resource waiting or circular wait
4389901.
4390The method that performs the search-and-replace operation to strings for pattern matching is
4391a) searchandreplace()
4392b) add()
4393c) edit()
4394d) replace()
4395902.
4396Which of the following is TRUE?
4397903.
4398A variable whose size is determined at compile time and cannot be changed at run time is
4399A. Static Variable
4400B. Dynamic Variable
4401C. Not a variable
4402D. None of These
4403904.
4404Value of checksum must be recalculated regardless of
4405a) De-fragmentation
4406b) Fragmentation
4407c) Transfer
4408d) Size
4409905.A union that has no constructor can be initialized with another union of __________ type
4410A. different
4411B. same
4412C. virtual
4413D. class
4414906.
4415Dotted-decimal notation of 10000001 00001011 00001011 11101111 would be
4416A. 193.131.27.255
4417B. 129.11.11.239
4418C. 192.168.10.9
4419D. 172.16.11.3
4420907.
4421Memory mapped displays
4422Uses ordinary memory to store the display data in character form
4423908.
4424What would be the result of the following statement in JavaScript using regular
4425expression methods ?
4426a) Returns [“123″”456″”789”].
4427b) Returns [“123″,”456″,”789”].
4428c) Returns [1,2,3,4,5,6,7,8,9].
4429d) Throws an exception
4430909.
4431Which one of the following statements if FALSE?
4432910.
4433Consider the following code snippet. What purpose does exec() solve in the above code ?
4434var pattern = /Java/g;
4435 var text = "JavaScript is more fun than Java!";
4436 var result;
4437 while ((result = pattern.exec(text)) != null)
4438 {
4439 alert("Matched '" + result[0] + "'" +" at position " + result.index +"; ne
4440xt search begins at " + pattern.lastIndex);
4441 }
4442a) Returns the same kind of array whether or not the regular expression has the
4443global g flag
4444b) Returns different arrays in the different turns of iterations
4445c) All of the mentioned
4446d) None of the mentioned
4447911.
4448Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If
4449the computer system has a one-level page table per process and each page table entry requires
445048 bits, then the size of the per-process page table is __________ megabytes.
4451(A) 384
4452(B) 48
4453(C) 192
4454(D) 96
4455912.
4456Structured programming involves
4457A. decentralisation of program activity
4458B. functional modularisation
4459C. localisation of errors
4460D. All of the above
4461E. None of the above
4462913.
4463Which one of the following allows a user at one site to establish a connection to another
4464site and then pass keystrokes from local host to remote host?
4465a) HTTP
4466b) FTP
4467c) Telnet
4468d) None of the mentioned
4469914.
4470Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are
4471two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2
4472do not have any attributes of their own. What is the minimum number of tables required to
4473represent this situation in the relational model?
4474(a) 2
4475(b) 3
4476(c) 4
4477(d) 5
4478915.
4479Which function among the following lets to register a function to be invoked once?
4480a) setTimeout()
4481b) setTotaltime()
4482c) setInterval()
4483d) none of the mentioned
4484916.
4485Select operation in SQL is equivalent to
4486(A) the selection operation in relational algebra
4487(B) the selection operation in relational algebra, except that select in SQL retains duplicates
4488(C) the projection operation in relational algebra
4489(D) the projection operation in relational algebra, except that select in SQL retains
4490duplicates
4491917.
4492By default, any real number in C is treated as
4493A. A float
4494B. A double
4495C. A long double
4496D. Depend upon memory model that you are using
4497918.
4498These networking classes encapsulate the "socket" paradigm pioneered in the (BSD) Give
4499the abbreviation of BSD?
4500A) Berkeley Software Distribution
4501B) Berkeley Socket Distribution
4502C) Berkeley System Distribution
4503D) None of the above
4504919.
4505. For computers based on three - address instruction formats, each address field can be used to
4506specify which of the following:
4507S1: A memory operand
4508S2: A processor register
4509S3: An implied accumulator registers
4510(A) Either S1 or S2
4511(B) Either S2 or S3
4512(C) Only S2 and S3
4513(D) All of S1, S2 and S3
4514920.
4515Integer division in a C program results in
4516A. Truncation
4517B. Rounding
4518C. Underflow
4519D. None of these
4520921.
4521Which function among the following lets to register a function to be invoked repeatedly after a
4522certain time?
4523a) setTimeout()
4524b) setTotaltime()
4525c) setInterval()
4526d) none of the mentioned
4527922.
4528Grant and revoke are ....... statements
4529DCL Commands – Data Control Language
4530923.
4531The minimum number of page frames that must be allocated to a running process in a virtual
4532memory environment is determined by
4533a) the instruction set architecture
4534b) page size
4535c) physical memory size
4536d) number of processes in memory
4537924.
4538Which is the handler method used to invoke when uncaught JavaScript exceptions occur?
4539a) Onhalt
4540b) Onerror
4541c) Both onhalt and onerror
4542d) None of the mentioned
4543View Answer
4544925.
4545For C• Programming language
4546926.
4547The processed S/MIME along with security related data is called as ________.
4548a. public key cryptography standard.
4549b. private key cryptography standard.
4550c. S/MIME.
4551d. MIME.
4552927........... command can be used to modify a column in a table
4553Answer: ALTER
4554928.
4555The function f(x) = ab + a can be simplified as
4556Answer: a
4557929.
4558Consider the C function given below.
4559int f(int j)
4560{
4561static int i = 50;
4562int k;
4563if (i == j)
4564{
4565printf(?something?);
4566k = f(i);
4567return 0;
4568}
4569else return 0;
4570}
4571Which one of the following is TRUE?
4572(A) The function returns 0 for all values of j.
4573(B) The function prints the string something for all values of j.
4574(C) The function returns 0 when j = 50.
4575(D) The function will exhaust the runtime stack or run into an infinite loop when j = 50
4576930.Which property is used to obtain browser vendor and version information?
4577a) modal
4578b) version
4579c) browser
4580d) navigator
4581931.
4582___________ Substitution is a process that accepts 48 bits from the XOR operation.
4583a. S-box.
4584b. P-box.
4585c. Expansion permutations.
4586d. Key transformation.
4587932.
4588The number of squares in K-map of n-variables is 2^n
4589933.
4590Data independence means
4591It means we change the physical storage/level without affecting the conceptual or external
4592view of the data.
4593934.
4594In ………………. Mode, the authentication header is inserted immediately after the IP
4595header.
4596A) Tunnel
4597B) Transport
4598C) Authentication
4599D) Both A and B
4600935.
4601The output of combinational circuit depends on the levels present at input
4602terminals.
4603936.
4604Which method receives the return value of setInterval() to cancel future
4605invocations?
4606a) clearInvocation()
4607b) cancelInvocation()
4608c) clearInterval()
4609d) None of the mentioned
4610937.
4611DCL stands for DATA CONTROL LANGUAGE
4612938.
46136. Consider the below code fragment:
4614if(fork k( ) = = 0)
4615{
4616a= a+5; printf(?%d, %d n?, a, &a);
4617}
4618else
4619{
4620a= a ? 5;
4621printf(?%d %d n?, 0, &a);
4622}
4623Let u, v be the values printed by parent process and x, y be the values printed by child process.
4624Which one of the following is true?
4625(A) u = x + 10 and v = y
4626(B) u = x + 10 and v != y
4627(C) u + 10 = x and v = y
4628(D) u + 10 = x and v != y
4629939.
4630_________ uniquely identifies the MIME entities uniquely with reference to multiple
4631contexts.
4632a. Content description.
4633b. Content -id.
4634c. Content type.
4635d. Content transfer encoding.
4636940.
4637.………………… is preferred method for enforcing data integrity
4638A) Constraints
4639B) Stored procedure
4640C) Triggers
4641D) Cursors
4642941.
4643Find the output of the following program?
4644#include
4645using namespace std;
4646typedef int * IntPtr;
4647int main()
4648{
4649IntPtr A, B, C;
4650int D,E;
4651A = new int(3);
4652B = new int(6);
4653C = new int(9);
4654D = 10;
4655E = 20;
4656*A = *B;
4657B = &E;
4658D = (*B)++;
4659*C= (*A)++ * (*B)--;
4660E= *C++ - *B--;
4661cout<<*A<<*B<<*C<<d<<e;
4662return 0;
4663}</d<<e;
4664942.
4665The setTimeout() belongs to which object?
4666a) Element
4667b) Window
4668c) Location
4669d) None of the mentioned
4670943.
4671Which of the folloiwng is fully functional ?
4672944.
4673Which one of the following is a cryptographic protocol used to secure HTTP connection?
4674a) stream control transmission protocol (SCTP)
4675b) transport layer security (TSL)
4676c) explicit congestion notification (ECN)
4677d) resource reservation protocol
4678945.
4679The alpahbet are represented in which format inside the computer?
4680Answer: Binary/ASCII
4681946.
4682Which method receives the return value of setTimeout() to cancel future invocations?
4683a) clearTimeout()
4684b) clearInterval()
4685c) clearSchedule()
4686d) none of the mentioned
4687947.
4688Which of the following is not a binary operator in relational algebra?
4689A) Join
4690B) Semi-Join
4691C) Assignment
4692D) Project
4693948.
4694The library function exit() causes an exit from
4695a) the loop in which it occurs
4696(b) the block is which it occurs
4697(c) the functions in which it occurs
4698(d) the progam in which it occurs
4699949.
4700Which of the following statement is correct about destructors?
4701A). A destructor has void return type.
4702B). A destructor has integer return type.
4703C). A destructor has no return type.
4704D). A destructors return type is always same as that of main().
4705950.
4706------------- is a mode of operation for a block cipher, with the characteristic that each possible
4707block of plaintext has a defined corresponding ciphertext value and vice versa.
4708Answer: Electronic Code Book
4709951.
4710What will happen if we call setTimeout() with a time of 0 ms?
4711In short, setTimeout(someFunc, 0) will run someFunc 0ms after the current executing
4712functions has finished running.
4713952.
4714Which of the following is/are not a DDL statements?
4715a) UPDATE
4716b) TRUNCATE
4717c) ALTER
4718d) None of the Mentioned
4719Explanation: Data definition language (DDL) commands enable you to perform the following
4720tasks:Create, alter, and drop schema objects.
4721953.
4722The number of bits to represent 128 sets in direct mapped cache is 7 bits
4723954.
4724To which object does the location property belong?
4725a) Window
4726b) Position
4727c) Element
4728d) Location
4729955. Which database level is closest to the users?
4730A. External
4731B. Internal
4732C. Physical
4733D. Conceptual
4734956.
4735The interrupts are serviced using which of the following
4736Answer: Interrupt Service Routine
4737957.
4738A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no
4739repeaters. The signal speed in the cable is 2 x 108 m/sec. The minimum frame size for this network
4740should be
4741(A) 10000 bits
4742(B) 10000 bytes
4743(C) 5000 bits
4744(D) 5000 bytes
4745958. Java package is a grouping mechanism with the purpose of
4746Answer: encapsulate a group of classes
4747959. What is the data structure used for executing interrupt service subroutine ?
4748960.
47491. What will be printed as the output of the following program?
4750 public class testincr
4751 {
4752 public static void main(String args[])
4753 {
4754 int i = 0;
4755 i = i++ + i;
4756 System.out.println(" I = " +i);
4757 }
4758 }
4759(a) I = 0
4760(b) I = 1
4761(c) I = 2
4762(d) I = 3
4763961.
4764........ data type can store unstructured data
4765A. RAW
4766B. CHAR
4767C. NUMERIC
4768D. VARCHAR
4769962.
4770What is the result of the following code snippet?
4771window.location === document.location
4772a) False
4773b) True
4774c) 0
4775d) 1
4776963.
4777What is the access point (AP) in wireless LAN?
4778a) device that allows wireless devices to connect to a wired network
4779b) wireless devices itself
4780c) both (a) and (b)
4781d) none of the mentioned
4782964.
4783Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?
4784a) CDMA
4785b) CSMA/CA – Carrier Service Multiple Access with Collision Avoidance
4786c) ALOHA
4787d) None of the mentioned
4788965.
4789The output in sequential circuit depends on which of the folloiwng?
4790Answer: Present and past inputs
4791966.A table can have only one PRIMARY KEY
4792967.
4793To prevent any method from overriding, the method has to declared as, FINAL
4794968.
4795*
4796In which part does the form validation should occur?
4797a) Client
4798b) Server
4799c) Both Client and Server
4800d) None of the mentioned
4801969.How to find the index of a particular string?
4802a.position()
4803b.index()
4804c.indexOf()
4805d.Noneofthementioned
4806Explanation : The indexOf() function can be used to find out the index of a particular
4807character or a string.
4808970.
4809The power consumed by full adder can be reduced by using which of the following?
4810971.
4811What is the output of the following program:
4812 public class testmeth
4813 {
4814 static int i = 1;
4815 public static void main(String args[])
4816 {
4817 System.out.println(i+” , “);
4818 m(i);
4819 System.out.println(i);
4820 }
4821 public void m(int i)
4822 {
4823 i += 2;
4824 }
4825 }
4826a) 1 , 3
4827b) 3 , 1
4828c) 1 , 1
4829d) 1 , 0
4830e) none of the above.
4831972.
4832-------------------module of the DBMS controls access to DBMS information that is stored
4833on disk, whether it is part of the database or the catalog
4834Answer: Data Manager Module (Higher Level Stored)
4835973.
4836A 20 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs the "go
4837back n ARQ" scheme with n set to 10. Assuming that each frame is 100 bytes long, what is the
4838maximum data rate possible?
4839A. 5 Kbps
4840B.10 Kbps
4841C. 15 Kbps
4842D. 20 Kbps
4843974.
4844Which of the following is the child object of the JavaScript navigator?
4845a.Navicat
4846b.Plugins
4847c.NetRight
4848d. None of the mentioned
4849Explanation : The JavaScript navigator object includes a child object called plugins.
4850975.
4851A wireless network interface controller can work in
4852a) infrastructure mode
4853b) ad-hoc mode
4854c) both (a) and (b)
4855d) none of the mentioned
4856Explanation: In infrastructure mode WNIC needs access point but in ad-hoc mode access
4857point is not required.
4858976.
4859Given the code
4860 String s1 = “ VIT” ;
4861 String s2 = “ VIT “ ;
4862 String s3 = new String ( s1);
4863 Which of the following would equate to true?
4864(A) s1 == s2
4865(B) s1 = s2
4866(C) s3 == s1
4867(D) s1.equals(s2)
4868(E) s3.equals(s1)
4869a) (A), (D) & (E)
4870b) (A), (C) & (E)
4871c) (A), (B) & (C) 
4872d) (C), (D) & (E)
4873e) (D) & (E)
4874Explanation: s1==s2 is indeed “true” since they point to the same instance of “VIT” as
4875they are “not” declared with the new String(“VIT”) function.
4876977.
4877The number of distinct symbols in radix-r is
4878Answer: r
4879Explanation: A number system of radix r uses a string consisting of r distinct symbols
4880to represent a value.
4881978.---PRECOMPILER---- component of DBMS extracts DML commands from an
4882application program written in a host programming language
4883979.
4884Which one of the following event is not possible in wireless LAN.
4885a) collision detection
4886b) acknowledgement of data frames
4887c) multi-mode data transmission
4888d) none of the mentioned
4889980.
4890Which of the following are the properties of a plug-in entry?
4891a) name
4892b) filename
4893c) mimeTypes
4894d) all of the mentioned
4895Each plug-in has an entry in the array. Each entry has the following properties:
4896 name – is the name of the plug-in.
4897 filename – is the executable file that was loaded to install the plug-in.
4898 description – is a description of the plug-in, supplied by the developer.
4899 mimeTypes – is an array with one entry for each MIME type supported by the plug-in
4900981.
4901The runtime database processor of DBMS executes-----QUERY CODE------
4902982.
4903What is the sequence of major events in the life of an applet?
4904Answer:
4905i) loading the applet
4906ii) leaving and returning to the applet’s page
4907iii) reloading the applet
4908iv)quitting the browser
4909983.
4910Can a system have multiple DMA controllers?
4911Answer: True ??
4912984.
4913Which of the following events will cause a thread to die?
4914Which of the following events will cause a thread to die?
4915ANSWER : D
4916985.
4917What is Wired Equivalent Privacy (WEP) ?
4918a) security algorithm for ethernet
4919b) security algorithm for wireless networks
4920c) security algorithm for usb communication
4921d) none of the mentioned
4922986.
4923A relation R(A,B,C,D,E,H) has the following functional dependencies
4924 F= {{A→BC},{CD→E},{E→C}, {D→AEH}, {ABH→BD}, {DH→BC}}.
4925Find the Normal form of the relation
4926987.
4927What is the number of maxterms in a function of n variables?
4928Answer: The number of possible max terms posiible for n variable : 2^n
4929 The number of possible min terms posiible for n variable : 2^n
4930988.What is the purpose of the mimeTypes property of a plug-in entry?
4931a. Contains MIME properties
4932b. Contains MIME sizes
4933c. Contains MIME types
4934d. None of the mentioned
4935Answer : c
4936989.A method within a class is only accessible by classes that are defined within the same
4937package as the class of the method. Which one of the following is used to enforce such
4938restriction?
4939(a) Declare the method with the keyword public
4940(b) Declare the method with the keyword private
4941(c) Declare the method with the keyword protected
4942(d) Do not declare the method with any accessibility modifiers
4943(e) Declare the method with the keyword public and private
4944Reason: The desired accessibility is package accessibility, which is the default accessibility
4945for members that have no accessibility modifier. Package is not an accessibility modifier.
4946990.
4947How many output lines are present in an encoder with 2^n input lines?
4948ANSWER: n
4949991.
4950------DENSE-------index has an entry for every search key value (and
4951hence every record) in the data file
4952992.
4953A subset of a network that includes all the routers but contains no loops is called:
4954a) spanning tree
4955b) spider structure
4956c) spider tree
4957d) none of the mentioned
4958Answer: a
4959993.
4960AJAX has become very commonly used because
4961a) It allows pages to be interactive without further communication with the server.
4962b) Xml is a close relative of html.
4963c) It avoids the need for javascript.
4964d) It allows page content to be updated without requiring a full page reload.
4965994.
4966If link transmits 4000 frames per second, and each slot has 8 bits,the transmission rate
4967of circuit this TDM is
4968a) 32kbps
4969b) 500bps
4970c) 500kbps
4971d) None of the mentioned
4972995.
4973Consider the following code.
4974static void nPrint(String message, int n) {
4975 while (n > 0) {
4976 System.out.print(message);
4977 n--;
4978 }
4979}
4980What is the printout of the call nPrint('a', 4)?
4981(a) aaaaa
4982(b) aaaa
4983(c) aaa
4984(d) aa
4985(e) invalid call.
4986Reason : Invalid call because char 'a' cannot be passed to string message
4987996.
4988Which flip flop has the characterstic function Q(next) = input
4989997.
4990More than one transaction can apply this lock on X for reading its value but no write
4991lock can be applied on X by any other transaction. What is that lock?
4992Two-Phase Locking Techniques: Essential components
4993More than one transaction can apply share lock on X for
4994its value but no write lock can be applied on X by any
4995other transaction.
4996998.
4997Which of the following is not a reason XML gained popularity as a data interchange format for
4998AJAX?
4999a) It has been around a while and libraries exist for many languages to work with it
5000b) It can be navigated using JavaScript DOM methods.
5001c) It is extensible, allowing it to be adapted to virtually any application.
5002d) It is concise and simple to use.
5003999.
5004The performance of cache memories is measured by
5005Answer: hit ratio
50061000.
5007Lock manager uses -----LOCK TABLE--------- to store the identify of transaction locking a data
5008item, the data item, lock mode and pointer to the next data item locked.
50091001.
5010Which one of the following allows a user at one site to establish a connection to another
5011site and then pass keystrokes from local host to remote host?
5012a) HTTP
5013b) FTP
5014c) Telnet
5015d) None of the mentioned
50161002.
5017Which method must be defined by a class implementing the java.lang.Runnable
5018 interface?
5019Answer: public void run()
50201003.
5021The jQuery AJAX methods .get(), .post(), and .ajax() all require which parameter to be supplied?
5022a) method
5023b) url
5024c) data
5025d) headers
50261004.
5027If an AJAX request made using jQuery fails,
50281. the browser will automatically report the problem with an alert message.
50292. an error message will be displayed in the browser window content area.
50303. the programmer should arrange for it to be reported using the
5031jQuery .fail() method.
50324. there is no way to notify the user.
50331005.
5034class X implements Runnable
5035{
5036 public static void main(String args[])
5037 {
5038 /* Missing code? */
5039 }
5040 public void run() {}
5041}
5042Which of the following line of code is suitable to start a thread ?
5043A. Thread t = new Thread(X);
5044B. Thread t = new Thread(X); t.start();
5045C. X run = new X(); Thread t = new Thread(run); t.start();
5046D. Thread t = new Thread(); x.run();
5047Answer: Option C
50481006.
5049-----AGGREGATE FUNCTION--------is used to summarize information
5050from multiple tuples into a single-tuple summary
50511007.In negative edge triggered flip flop, the transitions happen at
50521008.The probability that a single bit will be in error on a typical public telephone line using 4800
5053bps modem is 10 to the power -3. If no error detection mechanism is used, the residual error rate
5054for a communication line using 9-bit frames is approximately equal to
5055[A]. 0.003
5056[B]. 0.009
5057[C]. 0.991
5058[D]. 0.999
5059[E]. None of the above
50601009.
5061In ER- Relational Mapping, Binary 1:1 Relationship types are mapped to
5062----------
50631010.
5064Which method is used to call the base class methods from the subclass?
5065super
50661011.
5067Nested documents in the HTML can be done using
50681012.
5069The race condition in RS flip flop is rectified in which flip flop
5070Master Slave JK Flip Flop
50711013.
5072Frames from one LAN can be transmitted to another LAN via the device
5073Bridge
50741014.
5075A new web browser window can be opened using which method of the Window object ?
5076createtab()
5077b. Window.open()
5078c. open()
5079d. All of the mentioned
50801015.
5081Answer the following question based on the given table.
5082Package Name Class Name
5083Lab.project.util Date, Time
5084Lab.project.game Car, Puzzle
5085What will be the access modifier if a method in Date class is inherited in the Puzzle class?
50861016.
5087You are working with a network that is 172.16.0.0 and would like to support 600 hosts per
5088subnet. What subnet mask should you use?
5089255.255.252.0 (/10)
50901017.
5091--------------contains information such as the structure of each file, the type and storage
5092format of each data item, and various constraints on the data
5093DBMS Catalog
50941018.
5095What does the command XCHG in 8085 do?
5096Exchange H and L with D and E. The contents of register H are exchanged with the
5097contents of register D, and the contents of register L are exchanged with the
5098contents of register E.
50991019.
5100Which of the following digits are known as the sub-address digits (for use by the user) of the
5101Network User Address (NUA)?
5102 5-7
5103[B]. 1-4
5104[C]. 8-12
5105[D]. 13-14
51061020.
5107What statement is used to execute stored procedure in Java JDBC
5108CallableStatement cstmt = null;
5109try {
5110 String SQL = "{call getEmpName (?, ?)}";
5111 cstmt = conn.prepareCall (SQL);
5112 . . .
5113}
5114catch (SQLException e) {
5115 . . .
5116}
5117finally {
5118 . . .
5119
51201021.
5121Which object serves as the global object at the top of the scope chain?
5122a) Hash
5123b) Property
5124c) Element
5125d) Window
5126Answer: d
5127Explanation: The Window object serves as the global object at the top of the scope chain
5128in client-side JavaScript.
51291022.
5130If the opearand of stack operation is register, the stack contents in 8085 store which of the
5131following?
51321023.
5133Who is responsible for correlating the different perspectives of distinct users?
51341024. A modulator converts a _____ signal to a(n) _____ signal.
5135A. FSK; PSK
5136B. PSK; FSK
5137C. analog; digital
5138D. digital; analog
5139E. None of the above
51401025.
5141In 8085 subtraction is performed using which method?
5142Answer: by the 2's complement method
51431026.
5144Data Model that provides ad-hoc queries is --------------
51451027.
5146Consider following code.
5147public class Test {
5148public static void main(String[] args) {
5149System.out.println(m(2));
5150}
5151public static int m(int num) {
5152return num;
5153}
5154public static void m(int num) {
5155System.out.println(num);
5156}
5157}
5158(a)The program has a syntax error because the two methods
5159m have the same signature
5160(b) The program has a syntax error because the second m method is
5161defined, but not invoked in the main method
5162(c) The program runs and prints 2 once
5163(d) The program runs and prints 2 twice
5164(e) The program runs and prints 2 thrice.
51651028.
5166What does the location property represent?
5167a) Current DOM object
5168b) Current URL
5169c) Both DOM object and URL
5170d) None of the mentioned
51711029.
5172Which among the following is not a property of the Location object?
5173a) protocol
5174b) host
5175c) hostee
5176d) hostname
5177Explanation: The various properties of the location object are the protocol, host,
5178hostname, port, search, and hash.
51791030.
5180What is the number of distinct symbols in base-16 ?
5181Answer: 16
51821031.
5183What is the loopback address?
5184Answer: type of IP address that is used to test the communication or transportation medium
5185on a local network card and/or for testing network applications. Special ip address 127.0.0.1
51861032.
5187A state that refers to the database when it is loaded is---- Initial Database State -----
51881033.
5189Consider the following code:
5190public class Test {
5191public static void main(String[] args) {
5192int[] x = new int[5];
5193int i;
5194for (i = 0; i < x.length; i++)
5195 x[i] = i;
5196System.out.println(x[i]);
5197}
5198}
5199(a) The program displays 0 1 2 3 4
5200(b) The program displays 4
5201(c) The program has a runtime error because the last statement in the main
5202method causes ArrayIndexOutOfBoundsException
5203(d) The program has syntax error because i is not defined in the last
5204statement in the main method
5205(e) The program displays 1 2 3 4 5.
52061034.
5207How many bits are present in registers A, B, C together in 8085?
5208Answer: 24 – ( 3 x 8 )
52091035.
5210What is the return type of the hash property?
5211The hash property sets or returns the anchor part of a URL
52121036.
5213------------------ is used to describe the structure and constraints for the whole database for a
5214community of users hides the details of physical storage structures in three -schema architecture
52151037.
5216A 4 KHz noise less channel with one sample ever 125 per sec is used to transmit digital signals.
5217Differential PCM with 4 bit relative signal value is used. Then how many bits per second are
5218actually sent?
5219A. 32 Kbps
5220B. 64 Kbps
5221C. 8 Kbps
5222D. 128 Kbps.
52231038.
5224What will be the value of c at the end of execution?
5225public static void main(String args[])
5226{ int a = 10, b = 2,c=0,d=0;
5227int[] A = {1,2,3};
5228try { c=a/b;
5229try { d = a/(a-a); d= A[1]+1; }
5230catch(ArrayIndexOutOfBoundsException e)
5231{ System.out.println("Array - unreachable element "+e); }
5232Finally { System.out.println("Finally block inside "); } }
5233catch(Exception e)
5234{ System.out.println("Some Problem:"+e); b = 1; c = a/b; }
5235finally { System.out.println("Finally block outside“) }
5236System.out.println("after try/catch blocks");
5237System.out.println("Ans = " +c); }
5238ERROR two
52391039.
5240What does the instruction INX H perform in 8085 microprocessor?
5241Increment register pair by 1.
5242Eg: INX H (It means the location pointed by the HL pair is incremented by 1)
52431040.
5244Which is the method that removes the current document from the browsing history before loading
5245the new document?
5246a) modify()
5247b) assign()
5248c) replace()
5249d) remove()
52501041.
5251Which method is used for loading the driver in Java JDBC.
5252Answer: . Class.forName()
5253
52541042.
5255What is the minimum number of wires required for sending data over a serial communications
5256links?
5257A. 1
5258B. 2 (answer)
5259C. 4
5260D. 6
52611043. --------EXTERNAL SCHEMA--------describes the the part of the database that a particular
5262user group is interested in and hides the rest.
52631044.
5264Which one is the first high level programming language
52651045.
5266The 8255 chip is an example of
52671046.
5268------------ is used to define internal schema
52691047.
5270Why is the replace() method better than the assign() method?
52711048.
5272In cyclic redundancy checking, the divisor is _____ the CRC.
5273A) The same size as
5274B) one bit less than
5275C) one bit more than
5276D) none of the above
52771049.
5278Centralized DBMS has----------
5279A centralized database (sometimes abbreviated CDB) is a database that is located,
5280stored, and maintained in a single location.
52811050.
5282What is 8254 used for?
5283The Intel 8253 and 8254 are Programmable Interval Timers (PITs), which perform
5284timing and counting functions using three 16-bit counters.
52851051.
5286An error-detecting code inserted as a field in a block of data to be transmitted is known as
5287A. Frame check sequence
5288B. Error detecting code
5289C. Checksum
5290D. flow control
5291E. None of the above
52921052.When a class extends the Thread class ,it should override ............ method of Thread class
5293to start that thread.
5294A. start()
5295B. run()
5296C. init()
5297D. go()
52981053.What is the purpose of the assign() method?
5299a) Only loading
5300b) Loading of window and display
5301c) Displays already present window
5302d) Unloading of window
5303The assign() method of the Location object makes the window load and display the document at
5304the URL you specify.
53051054.
5306Which two are valid constructors for Thread?
5307a.) Thread(Runnable r, String name)
5308b.) Thread()
5309c.) Thread(int priority)
5310d.) Thread(Runnable r, ThreadGroup g)
5311e.) Thread(Runnable r, int priority)
5312A. 1 and 3
5313B. 2 and 4
5314C. 1 and 2
5315D. 2 and 5
53161055.
5317Working of the WAN generally involves
5318A. telephone lines
5319B. microwaves
5320C. satellites
5321D. All of the above
53221056.
5323How many modes are present in 8255 and what are they?
53241. Bit Set/Reset mode (BSR mode).
53252. Input/Output mode (I/O mode). –
5326ï‚· Mode 0 - Simple I/O
5327ï‚· Mode 1 - Strobed I/O
5328ï‚· Mode 2 - Strobed Bi-directional I/O
53291057.
5330The history property belongs to which object?
5331a) Element
5332b) Window
5333c) History
5334d) Location
5335Explanation: The history property of the Window object refers to the History object for the
5336window.
53371058.
5338An Employee entity of a company database can be a SECRETARY, TECHNICIAN or
5339MANAGER.
5340What kind of participation constraint can be used for Employee and its job types?
53411059.
5342public class MyRunnable implements Runnable
5343{
5344public void run()
5345{
5346// some code here
5347}
5348}
5349which of these will create and start this thread?
5350[A]. new Runnable(MyRunnable).start();
5351[B]. new Thread(MyRunnable).run();
5352[C]. new Thread(new MyRunnable()).start();
5353[D]. new MyRunnable().start();
53541060.
5355If you configure the TCP/IP address and other TCP/IP parameters manually, you can always
5356verify the configuration through which of the following? Select the best answer.
5357A. Network Properties dialog box
5358B. Server Services dialog box
5359C. DHCPINFO command-line utility
5360D. Advanced Properties tab of TCP/ IP Info.
5361E. None of the above
53621061.
5363Which of the following is one of the fundamental features of JavaScript?
5364a) Single-threaded
5365b) Multi-threaded
5366c) Both Single-threaded and Multi-threaded
5367d) None of the mentioned
5368Explanation: One of the fundamental features of client-side JavaScript is that it is singlethreaded:
5369a browser will never run two event handlers at the same time, and it will never
5370trigger a timer while an event handler is running, for example.
53711062.If we can determine exactly those entities that will become members of each subclass by a
5372condition then such subclasses are called------ predicate-defined --------
53731063.
5374Which of the following is DMA controller?
53751064.
5376Given the code
5377String s1 = ? VIT? ;
5378String s2 = ? VIT ? ;
5379String s3 = new String ( s1);
5380Which of the following would equate to true?
5381 (A) s1 == s2
5382(B) s1 = s2
5383(C) s3 == s1
5384(D) s1.equals(s2)
5385(E) s3.equals(s1)
5386a) (A), (D) & (E)
5387b) (A), (C) & (E)
5388c) (A), (B) & (C)
5389d) (C), (D) & (E)
5390e) (D) & (E)
53911065.
5392The expected size of the join result divided by the maximum size is called
5393_________________.
53941066.
5395Four bits are used for packet sequence numbering in a sliding window protocol used in a
5396computer network. What is the maximum window size?
5397(a) 4
5398(b) 15
5399(c) 8
5400(d) 16.
54011067.
5402OOPs
5403Find the output of the following program?
5404#include
5405#define pow(x) (x)*(x)*(x)
5406using namespace std;
5407int main()
5408{
5409int a=3,b=3;
5410a=pow(b++)/b++;
5411cout<<a<<b;
5412return 0;
5413}
5414Answer: 107
54151068.
5416How many gate delays are present in efficient implementation of XOR gate ?
54171069.
5418. The attributes in foreign key and primary key have the same ____________.
54191070.
5420What is the output of the following program?
5421#include
5422using namespace std;
5423int main()
5424{
5425int x=20;
5426if(!(!x)&&x)
5427cout<<x;
5428else
5429{
5430x=10;
5431cout<<x;
5432return 0;
5433}}
5434Answer: 20
54351071.
5436What is the correct HTML for making a hyperlink?
5437<a href=”link”> text</a>
54381072.
5439Error control is needed at the transport layer because of potential errors occurring _____.
5440A. from transmission line noise
5441B. in routers
5442C. from out-of-sequence delivery
5443D. from packet losses.
54441073.
5445How many possible outcome values are present in boolean algebra?
5446Answer: 2
54471074.
5448Determine the output of the following code?
5449#include
5450using namespace std;
5451void func_a(int *k)
5452{
5453*k += 20;
5454}
5455void func_b(int *x)
5456{
5457int m=*x,*n = &m;
5458*n+=10;
5459}
5460int main()
5461{
5462int var = 25,*varp=&var;
5463func_a(varp);
5464*varp += 10;
5465func_b(varp);
5466cout<<var<<*varp;
5467return 0;
5468}
5469Answer: 5555
54701075.
5471Data link layer retransmits the damaged frames in most networks. If the probability of a frame's
5472being damaged is p, what is the mean number of transmissions required to send a frame if
5473acknowledgements are never lost.
5474A. K / K - P
5475B. 1 / K - P
5476C. K / K(1 + p)
5477D. p / K + 1
54781076.
5479___ Naïve or parametric end users __ users work on canned transactions
54801077.
5481Which of the following input controls that cannot be placed using tag?
54821078.
5483What does JSP stand for?
5484Answer: Java Server Pages
54851079.
5486What will be the output of the following program?
5487#include
5488using namespace std;
5489class x {
5490public:
5491int a;
5492x();
5493};
5494x::x() { a=10; cout<
5495class b:public x {
5496public:
5497b();
5498};
5499b::b() { a=20; cout<
5500int main ()
5501{
5502b temp;
5503return 0;
5504}
5505Answer: 10 20
55061080.
5507If a hospital has to store the description of each visit of a patient according to date what
5508attribute you will use in the patient entity type?
5509Answer: Composite
55101081.
5511The SQL statement SELECT SUBSTR('123456789', INSTR('abcabcabc','b'), 4)
5512FROM EMP; prints
5513The SQL statement
5514SELECT SUBSTR('123456789', INSTR('abcabcabc', 'b'), 4) FROM DUAL;
5515A. 6789
5516B. 2345
5517C. 1234
5518D. 456789
55191082.
5520Find the output of the following program?
5521#include
5522using namespace std;
5523void myFunction(int& x, int* y, int* z) {
5524static int temp=1;
5525temp += (temp + temp) - 1;
5526x += *(y++ + *z)+ temp - ++temp;
5527*y=x;
5528x=temp;
5529*z= x;
5530cout<<x<<*y<<*z<<temp;
5531}
5532int main() {
5533int i = 0;
5534int j[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
5535i=i++ - ++i;
5536myFunction(i, j, &i);
5537return 0;
5538}
5539Answer: 3-333/ 3425379433
55401083.
5541__SELECTORS__ is used to define a special CSS style for a group of HTML elements
55421084.
5543In HTTP, which method gets the resource as specified in the URI - GET
55441085.
5545JAVA PROGRAMMING
5546Java package is a grouping mechanism with the purpose of
55471086.
5548In SQL, which command is used to issue
5549multiple CREATE TABLE, CREATE VIEW and GRANT statements in a single
5550transaction?
5551a) CREATE PACKAGE
5552b) CREATE SCHEMA
5553c) CREATE CLUSTER
5554d) All of the mentioned
55551087.
5556Which of the following is the right syntax for assertion?
5557Create assertion ‘assertion-name’ check ‘predicate’;
55581088.
5559Which of these is Server side technology?
55601089.
5561Which one of these lists contains only Java programming language keywords
5562A. class, if, void, long, Int, continue
5563B. goto, instanceof, native, finally, default, throws
5564C. try, virtual, throw, final, volatile, transient
5565D. strictfp, constant, super, implements, do
5566E. byte, break, assert, switch, include
5567Answer: Option B
55681090.
5569. __FLASH MEMORY________ is increasingly being used in server systems to
5570improve performance by caching frequently used data, since it provides faster access
5571than disk, with larger storage capacity than main memory.
55721091.
5573Which of these interface abstractes the output of messages from httpd?
5574a) LogMessage
5575b) LogResponse
5576c) Httpdserver
5577d) httpdResponse
55781092.
5579The C++ language is
55801093.
5581Passing the request from one schema to another in DBMS architecture is called as
5582_______MAPPING______
55831094.
5584Where in an HTML document is the correct place to refer to an external style sheet?
5585Answer: In the <head> section
55861095.
5587Changing the conceptual schema without having to change the external schema is called as
5588______LOGICAL INDEPENDENCE__________
55891096.
5590Which method is used to remove the first element of an Array object?
5591Answer: Shift
55921097.
5593What does the following bit of JavaScript print out?
5594var a = [1,,3,4,5];
5595console.log([a[4], a[1], a[5]]);
5596Output - 5,null,indefined
55971098.
5598 Creating a B Tree index for your database has to specify in _____.
5599 a. DDL
5600 b. SDL
5601 c. VDL
5602 d. TCL
56031099.
5604Which one of the following statements is NOT correct about HTTP cookies?
5605A. A cookie is a piece of code that has the potential to compromise the
5606security of an Internet user
5607B. A cookie gains entry to the user's work area through an HTTP header
5608C. A cookie has an expiry date and time
5609D. Cookies can be used to track the browsing pattern of a user at a particular site
56101100.
5611The following HTML attribute is used to specify the URL of the html document to be opened
5612when a hyperlink is clicked.
5613Answer: HREF
56141101.
5615HTTP is implemented over - TCP
56161102.
5617If the directive session.cookie_lifetime is set to 3600, the cookie will live until..
5618a) 3600 sec
5619b) 3600 min
5620c) 3600 hrs
5621d) the browser is restarted
56221103.
5623AJAX made popular by
5624Option A):Sun Micro system
5625Option B):Google
5626Option C):IBM
5627Option D):Microsoft
56281104.
5629How to create a Date object in JavaScript?
5630dateObjectName = new Date([parameters])
56311105.
5632Output------?
56331106.
5634Choose the correct HTML tag to make a text italic
5635Answer: <i></i>
56361107.
5637table {color: blue;}
5638With the above code snippet in use, what happens to a table?
5639a) The table border would be colored blue.
5640b) The table background would be colored blue.
5641c) The text inside the table would be colored blue
56421108.
5643What sever support AJAX ?
56441109.
5645What does the XMLHttpRequest object accomplish in Ajax?
5646A.It's the programming language used to develop Ajax applications
5647B.It provides a means of exchanging structured data between the Web server and
5648client.
5649C.It provides the ability to asynchronously exchange data
5650between Web browsers and a Web server.
5651D.It provides the ability to mark up and style the display of Web-page text.
56521110.
5653Which Web browser is the least optimized for Microsoft's version of AJAX?
5654SAFARI
56551111.
5656Which one of these technologies is NOT used in AJAX?
5657A. CSS
5658B. DOM
5659C. DHTML
5660D. Flash
56611112.
5662When a user views a page containing a JavaScript program, which machine actually executes
5663the script?
5664The User’s machine running the web browser
56651113.
5666A graphical HTML browser resident at a network client machine Q accesses a static HTML
5667webpage from a HTTP server S. The static HTML page has exactly one static embedded image
5668which is also at S. Assuming no caching, which one of the following is correct about the HTML
5669webpage loading (including the embedded image)?
5670(A) Q needs to send at least 2 HTTP requests to S, each necessarily in a separate TCP
5671connection to server S
5672(B) Q needs to send at least 2 HTTP requests to S, but a single TCP connection
5673to server S is sufficient
5674(C) A single HTTP request from Q to S is sufficient, and a single TCP connection
5675between Q and S is necessary for this
5676(D) A single HTTP request from Q to S is sufficient, and this is possible without any
5677TCP connection between Q and S
56781114.
5679How does servlet differ from CGI?
5680Servlets are thread based and CGI is process based
5681Servlet is light weight.
56821115.
5683What does JSP stand for?
5684Java Server Pages
56851116.
5686Which of these is a stand alone tag?
5687<img> <br>
5688Standalone tags are used for elements which have no logical beginning or end.
5689One example of a standalone tag is the br tag,
56901117.
5691If you don’t want the frame windows to be resizeable, simply add what to the lines ?
5692noresize
56931118.
5694<a> and </a> are the tags used for ?
5695Adding links to your page