PasteFS logoPasteFS
guest on 27 Feb, 2018
Raw Data
  1. Questions And answers
  2. 1. Relational Schema is the first schema to be designed when you are developing a DBMS
  3. 2.
  4. Consider the following recursive C function.
  5. Void get (int n)
  6. {if (n<1) return;
  7. get (n-1)
  8. get (n-3) ;
  9. printf ("%d",n);
  10. If get(6) function is being called in main () then how many times will the get() function be invoked before returning to the main ( ) ?
  11. Answer - 24
  12. 3. Router (probably) operate at the network layer, connecting two or more network segments that use the same or different data link layer protocols, but the same network layer protocol.
  13. 4.
  14. Which of the following is shared between all of the threads in a process? Assume a kernel level thread implementation.
  15. - code
  16. - data
  17. - heap memory and memory address
  18. - memory management information (base/relocation & limit registers, page tables
  19. - process state (new, ready, running, waiting, halted, etc)
  20. - I/O status information (opened file descriptors, etc)
  21. - signals
  22. - environment variables
  23. Are all shared between threads.
  24. 5.
  25. The truth table
  26. X Y f(X,Y)
  27. 0 0 0
  28. 0 1 0
  29. 1 0 1
  30. 1 1 1
  31. represents the Boolean function
  32. Answer - f(x,y) = x
  33. 6. The Hub/Switch is generally used to group hosts based on the physical network topology.
  34. 7.
  35. #include
  36. int main ()
  37. {
  38. static int a[]={10, 20, 30 40, 50};
  39. static int *p[]= {a, a+3, a+4, a+1, a+2};
  40. int **ptr=p;
  41. ptr++;
  42. printf ("%d%d", ptr p, **ptr);
  43. }
  44. The output of the program is __________.
  45. Assuming “printf ("%d%d", ptr p, **ptr);” is actually just “ptr” instead of “ptr p” (incorrect syntax), Answer – Memory location of the a+3 memory location and 40.
  46. 8.
  47. Which of the following is not true of virtual memory?
  48. No Options
  49. 9.
  50. General Purpose Software which creates and manipulates database is MySQL (DBMS)
  51. 10.
  52. The addressing mode used in an instruction of the form ADD R1, R2 is Direct.
  53. 11.
  54. Router operate at the network layer, connecting two or more network segments that use the same or different data link layer protocols, but the same network layer protocol.
  55. 12.
  56. The load instruction is mostly used to designate a transfer from memory to a
  57. processor register known as Accumulator.
  58. 13.
  59. With a single resource, deadlock occurs
  60. Vague
  61. 14.
  62. System catalogue is a system created database that describes
  63. A system catalog is a group of tables and views that incorporate vital details regarding a database. Table metadata, basically.
  64. 15.
  65. What will be the output of the following C program?
  66. void count(int n){
  67. static int d=1;
  68. printf("%d ", n);
  69. printf("%d ", d);
  70. d++;
  71. if(n>1) count(n-1);
  72. printf("%d ", d);
  73. }
  74. void main(){
  75. count(3);
  76. }
  77. Answer - 3 1 2 2 1 3 4 4 4
  78. 16.
  79. Consider the following program:
  80. int f(int *p, int n)
  81. {
  82. if (n <= 1) return 0;
  83. else return max ( f (p+1, n-1),p[0]-p[1]);
  84. }
  85. int main()
  86. {
  87. int a[] = {3,5,2,6,4};
  88. printf("%d", f(a,5));
  89. }
  90. The value printed by this program is
  91. Answer - 3 (max difference between adjacent pairs)
  92. Example Tree
  93. Depth First Traversals:
  94. (a) Inorder (Left, Root, Right) : 4 2 5 1 3
  95. (b) Preorder (Root, Left, Right) : 1 2 4 5 3
  96. (c) Postorder (Left, Right, Root) : 4 5 2 3 1
  97. Breadth First or Level Order Traversal : 1 2 3 4 5
  98. 17.
  99. Which of the following is an advantage of using database systems?
  100. No Options
  101. 18.
  102. User Datagram Protocol adds no additional reliability mechanisms except one which is optional. Identify that.
  103. Answer - Checksum.
  104. 19.
  105. Simplified form of the boolean expression (X + Y + XY) (X + Z) is X+YZ
  106. 20.
  107. Mutual exclusion problem occurs between Processes that access shared memory.
  108. 21.
  109. What schema defines how and where the data are organized in a physical storage?
  110. Physical Schema
  111. 22.
  112. Which of the following logic expression is incorrect?
  113. No Options
  114. 23.
  115. For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements is/are TRUE ?
  116. I. At least three non-overlapping channels are available for transmissions.
  117. II. The RTS-CTS mechanism is used for collision detection.
  118. III.Unicast frames are ACKed.
  119. I and III are correct.
  120. 24.
  121. To prevent any method from overriding, the method has to declared as, final
  122. 25.
  123. Use of Interrupts/Preemption (if answer is abstract and not very specific) allows for some processes to be waiting on I/O while another process executes.
  124. 26.
  125. The truth table
  126. X Y f(X,Y)
  127. 0 0 0
  128. 0 1 0
  129. 1 0 1
  130. 1 1 1
  131. represents the Boolean function f(x,y) = x
  132. 27.
  133. The E-R model was first introduced by Peter Chen
  134. 28.
  135. Consider the following C program.
  136. #include
  137. int f1 (void) ;
  138. int f 2 void ;
  139. int x 10;
  140. int main ()
  141. {
  142. int x=1;
  143. x+=f1()+ f2()+f3()+f2() ;
  144. printf("%d", x);
  145. return 0;
  146. }
  147. int f1(){int x=25; x++; return x;}
  148. int f2(){static int x =50; x++;return x;}
  149. int f3(){x*=10; return x};
  150. The output of the program is 230.
  151. 29.
  152. Real Time OS pays more attention on the meeting of the time limits.
  153. 30.
  154. The protocol data unit (PDU) for the application layer in the Internet stack is Message
  155. 31.  An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the remaining with itself. Which of the following is a valid allocation of address to A and B?
  156. (A) 245.248.136.0/21 and 245.248.128.0/22
  157. (found online)
  158. 32.
  159. The performance of cache memory is frequently measured in terms of a quantity called hit ratio.
  160. 33.
  161. Using 10's complement 72532- 3250 is 69282
  162. 34.
  163. The father of relational database system is  Edgar Frank “Ted” Codd
  164. 35.
  165. Consider the function func shown below:
  166. int func(int num) {
  167. int count = 0;
  168. while (num) {
  169. count++;
  170. num>>= 1;
  171. }
  172. return (count);
  173. }
  174. The value returned by func(435) is 9
  175. 36.
  176. The 16-bit 2’s complement representation of an integer is 1111 1111 1111 0101, its decimal representation is -11
  177. 37.
  178. What is the RDBMS terminology for a row Tuple.  
  179. 38.
  180. Consider the following C program segment.
  181. #include
  182. intmain()
  183. {char sl [7]="1234",*p;
  184. p=sl+2;
  185. *p='0';
  186. printf ("%s",sl)
  187. {
  188. What will be printed by the program?
  189. Answer - 1204
  190. 39.
  191. Which of the following is/are example(s) of stateful application layer protocols?
  192. (i)HTTP
  193. (ii)FTP
  194. (iii)TCP
  195. (iv)POP3
  196. II and IV
  197. 40.
  198. What is the software that runs a computer, including scheduling tasks, managing storage, and handling communication with peripherals?
  199. Operating Systems
  200. 41.  The relationship that exists within the same entity type is called as Recursive relationship.
  201. 42.
  202. Which of the following is not usually stored in a two-level page table?
  203. Ans : Virtual page number
  204. No Options/Vague
  205. 43.
  206. Consider the following recursive C function.
  207. Void get (int n)
  208. {if (n<1) return;
  209. get (n-1)
  210. get (n-3) ;
  211. printf ("%d",n);
  212. If get(6) function is being called in main () then how many times will the get() function be invoked before returning to the main ( ) ?
  213. Answer - 24
  214. 44.
  215. TCP manages a point-to-point and _______ connection for an application between two computers.
  216. Ans: MAYBE Reliable
  217. No idea/Vague
  218. 45.
  219. A circuit that converts n inputs to 2^n outputs is called
  220. Answer - Decoder
  221. 46.
  222. Normalisation of database is used to Remove anomalies by removing duplicate data.
  223. 47.
  224. The purpose of a TLB(transaction lookaside buffer) is Used in cache for faster lookup
  225. 48.
  226. Decoder is a circuit that changes a code into a set of signals. It is called a decoder because it does the reverse of encoding.
  227. 49.
  228. #include
  229. int main ()
  230. {
  231. static int a[]={10, 20, 30 40, 50};
  232. static int *p[]= {a, a+3, a+4, a+1, a+2};
  233. int **ptr=p;
  234. ptr++;
  235. printf ("%d%d", ptr p, **ptr);
  236. }
  237. The output of the program is
  238. Assuming “printf ("%d%d", ptr p, **ptr);” is actually just “ptr” instead of “ptr p” (incorrect syntax), Answer is – Memory location of the a+3 memory location and 40..
  239. 50.
  240. What is the maximum number of IP addresses that can be assigned to hosts on a local subnet that uses the 255.255.255.224 subnet mask?
  241. Answer - 30 hosts in each subnet.
  242.       Slot 2 – 51 -100
  243. [55,72,79,100] donnow MCQs
  244. 51.
  245. To build a mod-19 counter the number of flip-flops required is
  246. A) Remember with 'n' no. of flip-flop you
  247. can get upto max. modulo-[2^n] counter.
  248. Therefore for modulo-19 counter
  249. 2^5 = 32 which is greater than 19 and
  250. 2^4 = 16 which is less than 19
  251. Hence we require 5 F/F.
  252. 52.
  253. What is the RDBMS terminology  for a set of legal values that an attribute can have ?
  254. A)Domain
  255. 53.
  256. System calls((((((((((((((((((((((((((((((((((((((((((((((Think of it as operating system)
  257. A) System calls can be roughly grouped into five major categories:
  258. 1.   Process Control
  259. •   load
  260. •   execute
  261. •   end, abort
  262. •   create process (for example, fork on Unix-like systems, or NtCreateProcess in the Windows NT Native API)
  263. •   terminate process
  264. •   get/set process attributes
  265. •   wait for time, wait event, signal event
  266. •   allocate, free memory
  267. 2.   File management
  268. •   create file, delete file
  269. •   open, close
  270. •   read, write, reposition
  271. •   get/set file attributes
  272. 3.   Device Management
  273. •   request device, release device
  274. •   read, write, reposition
  275. •   get/set device attributes
  276. •   logically attach or detach devices
  277. 4.   Information Maintenance
  278. •   get/set time or date
  279. •   get/set system data
  280. •   get/set process, file, or device attributes
  281. 5.   Communication
  282. •   create, delete communication connection
  283. •   send, receive messages
  284. •   transfer status information
  285. •   attach or detach remote devices
  286. 54)Consider the following program in C language:
  287. #include
  288. main()
  289. {
  290. int i;
  291. int *pi = &i;
  292. scanf(?%d?,pi);
  293. printf(?%d\n?, i+5);
  294. }
  295. Which one of the following statements is TRUE?
  296. (A) Compilation_fails.
  297. (B) Execution results in a run-time error.
  298. (C) On execution, the value printed is 5 more than the address of variable i.
  299. (D) On execution, the value printed is 5 more than the integer value entered.
  300. Answer: (D)
  301. Explanation: There is no problem in the program as pi points to a valid location.
  302. Also, in scanf() we pass address of a variable and pi is an address.
  303. 55.
  304. The _____ is generally used to group hosts based on the physical network topology.
  305. A)Ethernet/Physical Topology
  306. 56.
  307. What is the main difference between traps and interrupts?
  308. A trap is an exception in a user process. It's caused by division by zero or invalid memory access. It's also the usual way to invoke a kernel routine (a system call) because those run with a higher priority than user code. Handling is synchronous (so the user code is suspended and continues afterwards). In a sense they are "active" - most of the time, the code expects the trap to happen and relies on this fact.
  309. A trap is an exception that is reported immediately following the execution of the trapping instruction. Traps allow execution of a program or task to be continued without loss of program continuity. The return address for the trap handler points to the instruction to be executed after the trapping instruction.
  310. An interrupt is something generated by the hardware (devices like the hard disk, graphics card, I/O ports, etc). These are asynchronous (i.e. they don't happen at predictable places in the user code) or "passive" since the interrupt handler has to wait for them to happen eventually.
  311. Interrupts occur at random times during the execution of a program, in response to signals from hardware. System hardware uses interrupts to handle events external to the processor, such as requests to service peripheral devices. Software can also generate interrupts by executing the INT n instruction.
  312. 57.
  313. Consider the following C program.
  314. #include
  315. int f1 (void) ;
  316. int f 2 void ;
  317. int x 10;
  318. int main ()
  319. {
  320. int x=1;
  321. x+=f1()+ f2()+f3()+f2() ;
  322. printf("%d", x);
  323. return 0;
  324. }
  325. int f1(){int x=25; x++; return x;}
  326. int f2(){static int x =50; x++;return x;}
  327. int f3(){x*=10; return x};
  328. The output of the program is_________.
  329. ANS)
  330. 58.
  331. The smallest integer than can be represented by an 8-bit number in 2?s complement form is
  332. (A) -256
  333. (B) -128
  334. (C) -127
  335. (D) 0
  336. Answer: (B)
  337. Explanation: See Two’s complement
  338. For n bit 2’s complement numbers, range of number is -(2(n-1)) to +(2(n-1)-1)
  339. 59.
  340. ATM uses a ____ packet size
  341. A)
  342. 53 octets(or bytes)
  343. ATM transfers information in fixed-size units called cells. Each cell consists of 53 octets, or bytes. The first 5 bytes contain cell-header information, and the remaining 48 contain the payload (user information).
  344. 60.
  345. Which of the following concurrency control mechanisms insist unlocking of all read and write locks of transactions at the end of commit?
  346. A)____________
  347. 61.
  348. What is the RDBMS technology for the number of attributes in a relation?
  349. A)Degree
  350. 62.
  351. Class D in network is used for
  352. A)
  353. Class D has its highest bit order set to 1-1-1-0 it is used to support multicasting.
  354. 63.
  355. 1024 bit is equal to how many byte
  356. =128 BYTES
  357. 64.
  358. Consider the following C code segment:
  359. int a, b, c = 0;
  360. void prtFun(void);
  361. main( )
  362. { static int a = 1; /* Line 1 */
  363. prtFun( );
  364. a + = 1;
  365. prtFun( )
  366. printf(?\n %d %d ?, a, b);
  367. }
  368. void prtFun(void)
  369. {
  370. static int a=2; /* Line 2 */
  371. int b=1;
  372. a+=++b;
  373. printf(?\n %d %d ?, a, b);
  374. }
  375. What output will be generated by the given code segment if:
  376. Line 1 is replaced by auto int a = 1;
  377. Line 2 is replaced by register int a = 2;
  378. A)
  379. error: two or more data types in declaration of ‘a’
  380. auto int a = 1;
  381. -----------------------------IF no static/auto and register
  382. 4 2
  383. 4 2
  384. 2 0
  385. -----------------------------similar gate ques.......................
  386. int a, b, c = 0;
  387. void prtFun(void);
  388. main( )
  389. { static int a = 1; /* Line 1 */
  390. prtFun( );
  391. a + = 1;
  392. prtFun( )
  393. printf(?\n %d %d ?, a, b);
  394. }
  395. void prtFun(void)
  396. {
  397. static int a=2; /* Line 2 */
  398. int b=1;
  399. a+=++b;
  400. printf(?\n %d %d ?, a, b);
  401. }
  402. What output will be generated by the given code segment?
  403. (A)
  404. 3 1
  405. 4 1
  406. 4 2
  407. (B)
  408. 4 2
  409. 6 1
  410. 6 1
  411. (C)
  412. 4 2
  413. 6 2
  414. 2 0
  415. (D)
  416. 3 1
  417. 5 2
  418. 5 2
  419. Answer: (C)
  420. 65.
  421. Buffering is useful because
  422. a data buffer (or just buffer) is a region of a physical memory storage used to temporarily store data while it is being moved from one place to another. Typically, the data is stored in a buffer as it is retrieved from an input device (such as a microphone) or just before it is sent to an output device (such as speakers). However, a buffer may be used when moving data between processes within a computer. This is comparable to buffers in telecommunication. A majority of buffers are implemented in software, which typically use the faster RAM to store temporary data, due to the much faster access time compared with hard disk drives. Buffers are typically used when there is a difference between the rate at which data is received and the rate at which it can be processed, or in the case that these rates are variable
  423. 66.
  424. Adjacent squares in a K-Map represents a
  425. opportunities to simplify the expression
  426. 67.
  427. Consider the following program:
  428. int f(int *p, int n)
  429. {
  430. if (n <= 1) return 0;
  431. else return max ( f (p+1, n-1),p[0]-p[1]);
  432. }
  433. int main()
  434. {
  435. int a[] = {3,5,2,6,4};
  436. printf("%d", f(a,5));
  437. }
  438. The value printed by this program is
  439. (A) 2
  440. (B) 3
  441. (C) 4
  442. (D) 5
  443. A)
  444. Note: max(x,y) returns the maximum of x and y. The value printed by this program is
  445. Answer: (B)
  446. Explanation:
  447. Look at the recursion stack of the given code in the below image. Assuming that the base address of array starts from 1000 and an integer takes 4 Bytes.
  448. After the last recursive call f(1016,1) returns, in the previous call we will have return max(0,2) and then return max(2,-4) and then return max(2,3) and then finally return max(3,-2) = 3.
  449. 68.
  450. If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the service provided is for
  451. A)
  452. Answer: b
  453. Explanation: If two interrupts, occur simultaneously, then the one with higher priority level and early polling sequence will receive service. The other one with lower priority may get lost there, as there is no mechanism for storing the interrupt requests.
  454. 69.
  455.        ____________is the first schema to be designed when you are developing a DBMS
  456. The term "schema" refers to the organization of data as a blueprint of how the database is constructed (divided into database tables in the case of relational databases). The formal definition of a databaseschema is a set of formulas (sentences) called integrity constraints imposed on a database.[citation needed] These integrity constraints ensure compatibility between parts of the schema. All constraints are expressible in the same language. A database can be considered a structure in realization of the database language.[1] The states of a created conceptual schema are transformed into an explicit mapping, the database schema. This describes how real-world entities are modeled in the database.
  457. ANSWER) Conceptual Design
  458. 70.
  459. Suppose that everyone in a group of N people wants to communicate secretly with N-1 others using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is
  460. (A) 2N
  461. (B) N(N – 1)
  462. (C) N(N – 1)/2
  463. (D) (N – 1)2
  464. Answer: (C)
  465. Explanation: In Symmetric Key Cryptography, access of key is with both the parties. It implies every person needs to communicate N-1 other users using different keys i.e 1+2+3…N-2+N-1
  466. This is like number of edges needed in a complete graph with N vertices is N(N-1)/2.
  467. Answer is therefore C
  468. 71.
  469. Minterms are arranged in map in a sequence of
  470. The minterms ('minimal terms') for the final expression are found by encircling groups of 1s in the map. Minterm groups must be rectangular and must have an area that is a power of two (i.e., 1, 2, 4, 8…). Minterm rectangles should be as large as possible without containing any 0s. Groups may overlap in order to make each one larger.
  471. The grid is toroidally connected, which means that rectangular groups can wrap across the edges .
  472. 72.
  473. What will be the output of the following program?
  474. #include
  475. using namespace std;
  476. class x {
  477. public:
  478. int a;
  479. x();
  480. };
  481. x::x() { a=10; cout<
  482. class b:public x {
  483. public:
  484. b();
  485. };
  486. b::b() { a=20; cout<
  487. int main ()
  488. {
  489. b temp;
  490. return 0;
  491. }
  492. A)______________
  493. 73.
  494. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.
  495. 1 FCFS scheduling algorithm
  496. 2 Round robin scheduling algorithm
  497. 3 Shorest job - first scheduling algorithm
  498. 4 None of the above
  499. Ans ) 3
  500. 74.
  501. In the IPv4 addressing format, the number of networks allowed under Class C addresses is
  502. 2,097,152 (221)
  503. 75.
  504. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then
  505. a) segmentation fault occurs
  506. b) fatal error occurs
  507. c) page fault occurs
  508. d) no error occurs
  509. View Answer
  510. Answer:c
  511. Explanation:None.
  512. 76.
  513. The servlet life cycle has the following cycle.
  514. 1.   Servlet class is loaded.
  515. 2.   Servlet instance is created.
  516. 3.   init method is invoked.
  517. 4.   service method is invoked.
  518. 5.   destroy method is invoked.
  519. 77.
  520. SQl allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below:
  521. select * from R where a in (select S.a from S)
  522. (A) Select R.* from R, S where R.a=S.a
  523. (B) Select distinct R.* from R, S where R.a=S.a
  524. (C) Select R.* from R, (select distinct a from S) as S1 where R.a=S1.a
  525. (D) Select R.* from R, S where R.a = S.a and is unique R
  526. Multiplicity of duplicate tuples will be distributed when there is a match between R.a and S.a; and for that match, S.a's value is repeated in each cases except the third case.
  527. So, the correct answer is option (C).
  528. 78.
  529. The main difference between JK and RS flip-flop is that
  530. The JK Flipflop is a variation or an improvement of the SR Flipflop.
  531. The disadvantage of the SR flip-flop is that both inputs shouldn't be HIGH when the clock is triggered. This is considered an invalid input condition, and the resulting output isn't predictable if this condition occurs.
  532. The main difference between a JK flip-flop and an SR flip-flop is that in the JK flip-flop, both inputs can be HIGH. When both the J and K inputs are HIGH, the Q output is toggled, which means that the output alternates between HIGH and LOW. Thereby the invalid condition which occurs in the SR flipflop is eliminated.----------------------------
  533. The functional difference between SR flip-flop and JK flip-flop is that
  534. [A].   JK flip-flop is faster than SR flip-flop
  535. [B].   JK flip-flop has a feed back path
  536. [C].   JK flip-flop accepts both inputs 1   
  537. [D].   JK flip-flop does not require external clock
  538. [E].   None of the above
  539. Answer: Option C
  540. 79. Which of the following unit will choose to transform decimal number to binary code ?
  541. A.
  542. Encoder
  543. B.
  544. Decoder
  545. C.
  546. Multiplexer
  547. D.
  548. Counter
  549. Ans: A
  550. 80.
  551. The following function computes the maximum value contained in an integer array
  552. p[ ] of size n (n >= 1).
  553. int max(int *p, int n) {
  554. int a=0, b=n-1;
  555. while (__________) {
  556. if (p[a] <= p[b]) { a = a+1; }
  557. else { b = b-1; }
  558. }
  559. return p[a];
  560. }
  561. The missing loop condition is
  562. (A) a != n
  563. (B) b != 0
  564. (C) b > (a + 1)
  565. (D) b != a
  566. Answer: (D)
  567. Explanation:
  568. #include<iostream>
  569. int max(int *p, int n)
  570. {
  571.     int a=0, b=n-1;
  572.     while (a!=b)
  573.     {
  574.         if (p[a] <= p[b])
  575.         {
  576.             a = a+1;
  577.         }
  578.         else
  579.         {
  580.             b = b-1;
  581.         }
  582.     }
  583.     return p[a];
  584. }
  585. int main()
  586. {
  587.    int arr[] = {10, 5, 1, 40, 30};
  588.    int n = sizeof(arr)/sizeof(arr[0]);
  589.    std::cout << max(arr, 5);
  590. }
  591. 81.
  592. ICMP is primarily used for
  593. a) error and diagnostic functions
  594. b) addressing
  595. c) forwarding
  596. d) none of the mentioned
  597. View Answer
  598. Answer: a
  599. 82.
  600. Given the following schema:employees(emp-id, first-name, last-name, hire-date,dept-id, salary)departments(dept-id, dept-name, manager-id, location-id)
  601. You want to display the last names and hire dates of all latest hires in their respective departments in the location ID 1700. You issue the following query:SQL>SELECT last-name, hire-date
  602. FROM employees
  603. WHERE (dept-id, hire-date) IN
  604. (SELECT dept-id, MAX(hire-date)
  605. FROM employees JOIN departments USING(dept-id)
  606. WHERE location-id = 1700
  607. GROUP BY dept-id);
  608. What is the outcome?
  609. What is the outcome?
  610. A)   It executes but does not give the correct result
  611. B)   It executes and gives the correct result.
  612. C)   It generates an error because of pairwise comparison.
  613. D)   It generates an error because of the GROUP BY clause cannot be used with table joins in a sub-query.
  614. SELECT dept-id, MAX(hire-date)
  615.     FROM employees JOIN departments USING(dept-id)
  616.     WHERE location-id =1700
  617.     GROUP BY dept-id
  618. this inner query will give the max hire date of each department whose location_id =1700
  619. and outer query will give the last name and hire-date of all those employees who joined on max hire date. 
  620. answer should come to (B)  no errors
  621. And we can use group by and where together, who said we can not :(
  622. Example: create table departments(dept_id number, dept_name varchar2(25), location_id number);
  623. Query: select d1.dept_name,max(d1.location_id)
  624. from departments d1, departments d2
  625. where  d1.dept_name = d2.dept_name
  626. and d1.dept_name='AA'
  627. group by d1.dept_name;
  628. will give output
  629. 83.
  630. Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?
  631. a) first in first out algorithm
  632. b) additional reference bit algorithm
  633. c) least recently used algorithm
  634. d) counting based page replacement algorithm
  635. View Answer
  636. Answer:c
  637. 84.
  638. Which of the following boolean expressions is not logically equivalent to all of the rest ?
  639. (a) wxy' + wz' + wxyz + wy'z
  640. (b) w(x + y' + z')
  641. (c) w + x + y' + z'
  642. (d) wx + wy' + wz'
  643. Is it choice c? If so how do I show that a is logically equivalent to b and d ?
  644. Re: Which one of following Boolean expressions is not logically equivalent to all of
  645. Yes, it's c. You can show that (a) = (b) as follows. Note that a + a'b = (a + a')(a + b) (by distributivity of disjunction over conjunction) = 1(a + b) = a + b. Of course, similarly a' + ab = a' + b. Using this trick and factoring out w, we get
  646. xy' + z' + xyz + y'z =
  647. xy' + xyz + z' + y' =
  648. xyz + z' + y' (since xy' + y' = (x + 1)y' = 1y' = y') =
  649. xy + z' + y' =
  650. x + z' + y'
  651. The fact that (b) = (d) is trivial. Nonequivalence of (c) is best verified by finding truth values where the expressions differ. Of course, equivalence can also be checked using truth tables.
  652. 85.
  653. How many address bits are needed to select all memory locations in the 16K × 1 RAM?
  654. How many address bits are needed to select all memory locations in the 2118 16K × 1 RAM?
  655. [A].   8
  656. [B].   10
  657. [C].   14   
  658. [D].   16
  659. Answer: Option C
  660. The size of the memory is N*M
  661. where N is the address lines and M is word length
  662. no of registers/memory location required is 2^N
  663. Given memory capacity is 16k
  664. thus 2^N=16K
  665. 1K=1024 memory locations
  666. thus16k=16*1024=16384
  667. now 2^N=16384
  668. After factorising 16384 by 2 we ll get N AS 14
  669. SO ADDRESS LINE REGUIRED IS 14.
  670. 2^4= 2 x 2 x 2 x 2 = 16.
  671. 2^10= 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 = 1024.
  672. 2 to the power of 4 = 16.
  673. 2 to the power of 10 = 1024.
  674. So: add the two power 4 + 10 = 14.
  675. 86.
  676. The embedded c program is converted by cross compiler to
  677. object file. This is a specially formatted binary file that contains the set of instructions and data resulting from the language translation process. Although parts of this file contain executable code, the object file cannot be executed directly.
  678. A compiler such as this—that runs on one computer platform and produces code for another—is called a cross-compiler.
  679. 87.
  680. TCP manages a point-to-point and ______stateless/ reliable_ connection for an application between two computers
  681. 88.
  682. The best index for exact match query is
  683. 89.
  684. Assume a table Employee (Eno, Ename, Dept, Salary, Phone) with 10000 records.
  685. Also assume that Employee has a non-clustering index on Salary, clustering indexes on Dept and Phone. If there is a SQL query "SELECT Eno FROM Employee WHERE Salary/12 = 10000", which of the following will happen during query execution?
  686. Search/Selection?
  687. 90.
  688. Which of the following statements is true ?
  689. ...
  690. 91.
  691. Which standard TCP port is assigned for contacting SSH servers?
  692. a) port 21
  693. b) port 22
  694. c) port 23
  695. d) port 24
  696. View Answer
  697. Answer:b
  698. Explanation: None.
  699. 92.
  700. If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative mapping. Then each word of cache memory shall be_____.
  701. 93.
  702. What is the output of the following program?
  703. #include
  704. using namespace std;
  705. int main()
  706. {
  707. int x=20;
  708. if(!(!x)&&x)
  709. cout<<x;
  710. else
  711. {
  712. x=10;
  713. cout<<x;
  714. return 0;
  715. }}</x;
  716. </x;
  717. Output)20
  718. 94.
  719. Consider the following function written the C programming language.
  720. void foo (char * a ) {
  721. if (* a & & * a ! =' ' ){
  722. putchar (*a);
  723. }
  724. }
  725. }
  726. The output of the above function on input ?ABCD EFGH? Is
  727. (A) ABCD EFGH
  728. (B) ABCD
  729. (C) HGFE DCBA
  730. (D) DCBA
  731. Answer: (D)
  732. Explanation: The program prints all characters before ‘ ‘ or ‘\0’ (whichever comes first) in reverse order.
  733. Let’s assume that Base address of given Array is 1000. It can be represented as given below in the image
  734. Below is the complete Recursion Stack of the Given Code
  735. After calling foo(1004), recursion will return as character at 1004 is ‘  ’. foo(1004) will return to its caller which is foo(1003) and next line in foo(1003) will be executed which will print character at 1003 (‘D’). foo(1003) will then return to foo(1002) and character at 1002 (‘C’) will get printed and the process will continue till foo(1000).
  736. 95.
  737. Consider the following schema as:
  738. Product_Master (prod_id, prod_name, rate)
  739. Purchase_details (prod_id, quantity, dept_no, purchase_date).
  740. Choose the suitable relational algebra expressionn for Get Product_id, Product_name & quantity for all purchased products.
  741. Q. Consider the structure as Product_Master = {prod_id, prod_name, rate} Purchase_details = {prod_id, quantity, dept_no,purchase_date} Write a relational algebra expression for the following: i) Get product_id, product_name and quantity for all purchased product ii) Get the products with rates between 100 and 4500. i) Π prod_id, prod_name, quantity (σ Product_Master.prod_id=Purchase_details.prod_id (Product_Master Purchase_details)) OR Π prod_id, prod_name, quantity (Product_Master Purchase_details) ii) Π prod_name,rates (σ rates>100 ^ rates < 4500 (Product_Master ))
  742. 96.
  743. When an instruction is read from the memory, it is called
  744. program instruction/instruction code
  745. 97.
  746. Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window is
  747. ANS)1100 msec
  748. 98.
  749. The minimum number of NAND gates required to implement the Boolean function. A + AB' + AB'C is equal to
  750. The minimum number of NAND gates required to implement the Boolean function A+AB¯+AB¯CA+AB¯+AB¯Cis equal to
  751. A.   0 (Zero)
  752. B.   1
  753. C.   4
  754. D.   7
  755. ZERO    Because After simplifying You would get This
  756. A(1+B'+B'C)   which is equal To A
  757. So No need For any NAND gate
  758. 99.
  759. For a C program accessing X[i][j][k], the following intermediate code is generated by a compiler. Assume that the size of an integer is 32 bits and the size of a character is 8 bits.
  760. t0 = i * 1024
  761. t1 = j * 32
  762. t2 = k * 4
  763. t3 = t1 + t0
  764. t4 = t3 + t2
  765. t5 = X[t4]
  766. Which one of the following statements about the source code for the C program is CORRECT?
  767. (A) X is declared as “int X[32][32][8]”.
  768. (B) X is declared as “int X[4][1024][32]”.
  769. (C) X is declared as “char X[4][32][8]”.
  770. (D) X is declared as “char X[32][16][2]”.
  771. Answer: (A)
  772. Explanation: The final expression can be simplified in form ofi, j and k by following the intermediate code steps in reverse order
  773. t5 = X[t4]
  774.    = X[t3 + t2]
  775.    = X[t1 + t0 + t2]
  776.    = X[i*1024 + j*32 + k*4]
  777.    = X + i*1024 + j*32 + k*4
  778. Since k is multiplied by 4, the array must be an int array.
  779. We are left with 2 choices (A and B) among the 4 given choices.
  780. X[i][j][k]’th element in one dimensional array is equivalent to
  781. X[i*M*L + j*L + k]’th element in one dimensional array
  782. (Note that multi-dimensional arrays are stored in row major order in C).
  783. So we get following equations
  784. j*L*4 = j*32, we get L = 8 (4 is the sizeof(int))
  785. i*1024 = i*M*L*4, we get M = 1024/32 = 32
  786. Therefore option A is the only correct option as M and L are 32 and 8 respectively
  787. only in option A.
  788. 100. Creating a B Tree index for your database has to specify in _____.
  789. _________________
  790. SLOT 3
  791. NAME: AISHWARYA
  792. Not answered: 109,115,130, 140
  793. 101.
  794.   UDP has a smaller overhead then TCP, especially when the total size of the messages is
  795. Ans: UDP has a smaller overhead then TCP, especially when the total size
  796. of the messages is small.   
  797. 102.
  798. The 16 bit flag of 8086 microprocessor is responsible to indicate --------------
  799. Ans: the condition of result of ALU operation
  800. 103.
  801. A solution to the Dining Philosopher?s problem which avoids Deadlock can be:
  802. Ans:  ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork
  803. 104.
  804. The 16-bit 2?s complement representation of an integer is 1111 1111 1111 0101, its decimal representation is
  805. Ans: -11
  806. 105.
  807. The OS of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called
  808. Ans: Garbage collection
  809. 106.
  810. Which of the following are used to generate a message digest by the network security protocols?
  811. (P) RSA (Q) SHA-1 (R) DES (S) MD5
  812. Ans:
  813. •   RSA – It is an algorithm used to encrypt and decrypt messages.
  814. •   SHA 1 – Secure Hash Algorithm 1, or SHA 1 is a cryptographic hash function. It produces a 160 bit (20 byte) hash value (message digest).
  815. •   DES – Data Encryption Standard, or DES is a symmetric key algorithm for encryption of electronic data.
  816. •   MD5 – Message Digest 5, or MD5 is a widely used cryptographic hash function that produces a 128 bit hash value (message digest).
  817. Ⅱ and Ⅳ i.e SHA 1 and MD5 are used to generate a message digest by the network security protocols.
  818. 107.
  819. public class MyRunnable implements Runnable
  820. {
  821. public void run()
  822. {
  823. // some code here
  824. }
  825. }
  826. which of these will create and start this thread?
  827. Ans: new Thread(new MyRunnable()).start();
  828. 108.
  829. The data manipulation language used in SQL is a,
  830. (I) Procedural DML
  831. (II) Non-Procedural DML
  832. (III) Modification DML
  833. (IV) Declarative DML
  834. Ans: procedural
  835. 109.
  836. Assume a relation ACCOUNT (acno, balance, type, branch, last_accessed) with 1 million records. If a SQL query "SELECT balance FROM account WHERE balance>5000" would produce 800000 records, which one of the following is the optimized version of relational algebra expressions that is equivalent to the given SQL query?
  837. 110.
  838. DMA is useful for the operations
  839. Ans : DMA is useful for transferring large quantities of data between memory and devices. It eliminates the need for the CPU to be involved in the transfer, allowing the transfer to complete more quickly and the CPU to perform other tasks concurrently.
  840. 111.
  841. What does the code snippet given below do?
  842. void fun1(struct node* head)
  843. {
  844.   if(head == NULL)
  845.     return;
  846.  
  847.   fun1(head->next);
  848.   printf("%d  ", head->data);
  849. }
  850. Ans: Prints all nodes of linked list in reverse order
  851. 112.
  852. Data security threats include
  853. Ans: privacy invasion
  854. 113.
  855. A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is 24 megabytes, the length of the virtual address supported by the system is _________ bits.
  856. Ans: 36
  857. Explanation
  858. Max size of virtual address can be calculated by
  859. calculating maximum number of page table entries.
  860. Maximum Number of page table entries can be calculated
  861. using given maximum page table size and size of a page
  862. table entry.
  863. Given maximum page table size = 24 MB
  864. Let us calculate size of a page table entry.
  865. A page table entry has following number of bits.
  866. 1 (valid bit) +
  867. 1 (dirty bit) +
  868. 3 (permission bits) +
  869. x bits to store physical address space of a page.
  870. Value of x = (Total bits in physical address) -
  871.              (Total bits for addressing within a page)
  872. Since size of a page is 8 kilobytes, total bits needed within
  873. a page is 13.
  874. So value of x = 32 - 13 = 19
  875. Putting value of x, we get size of a page table entry =
  876.                                    1 + 1 + 3  + 19 = 24bits.
  877. Number of page table entries
  878.            = (Page Table Size) / (An entry size)
  879.            =  (24 megabytes / 24 bits)                            
  880.            =  223
  881. Vrtual address Size
  882.              = (Number of page table entries) * (Page Size)
  883.              =  223 * 8 kilobits
  884.              = 236 
  885. Therefore, length of virtual address space = 36
  886. 113.
  887. A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is 24 megabytes, the length of the virtual address supported by the system is _________ bits.
  888. 114.
  889. General Purpose Software which creates and manipulates database is
  890. Ans: DBMS
  891. 115.
  892. Given the following structure template, choose the correct syntax for accessing the 5th subject marks of the 3rd student.
  893. struct stud
  894. {
  895.        int marks[6];
  896.        char sname[20];
  897.        char rno[10];
  898. }s[10];
  899. 116.
  900. Eight minterms will be used for
  901. Ans: Eight minterms will be used for 3 variables
  902. 117.
  903. Which of the following transport layer protocols is used to support electronic mail?
  904. Ans: TCP
  905. 118.
  906. Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; Process Y executes the P operation on semaphores b, c and d; Process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
  907. Ans: X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
  908. 119.
  909. This topology requires multipoint connection
  910. Ans: BUS
  911. 120.
  912. Consider a join (relation algebra operation) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R))
  913. Ans: relation r(R)is in the outer loop.
  914. Explanation:
  915. A join between r(R) and s (S) using nested loop method will be as follows.
  916. For each tuple r in R do
  917. For each tuple s in S do
  918. If r and s satisfy the join condition then output the tuple <r,s>
  919. This algorithm will involve Nr*Bs+Br block transfers and Nr+Br seeks, where Br and Bs are
  920. number of blocks in relations R and S respectively and Nr is number of tuple in relation R.
  921. Now to have less block accesses, Nr should be less and it is already given that |R|<|S|. Relation
  922. r(R) should be in the outer loop to have fewer number of disk block accesses.
  923. 121.
  924. Consider the following C code segment:
  925. int a, b, c = 0;
  926. void prtFun(void);
  927. main( )
  928. { static int a = 1; /* Line 1 */
  929. prtFun( );
  930. a + = 1;
  931. prtFun( )
  932. printf(?\n %d %d ?, a, b);
  933. }
  934. void prtFun(void)
  935. { static int a=2; /* Line 2 */
  936. int b=1;
  937. a+=++b;
  938. printf(?\n %d %d ?, a, b);
  939. }
  940. What output will be generated by the given code segment?
  941. Ans:
  942. 4 2
  943. 6 2
  944. 2 0
  945. Explanation:
  946. ‘a’ and ‘b’ are global variable. prtFun() also has ‘a’ and ‘b’ as local variables. The local variables hide the globals (See Scope rules in C). When prtFun() is called first time, the local ‘b’ becomes 2 and local ‘a’ becomes 4.
  947. When prtFun() is called second time, same instance of local static ‘a’ is used and a new instance of ‘b’ is created because ‘a’ is static and ‘b’ is non-static. So ‘b’ becomes 2 again and ‘a’ becomes 6.
  948. main() also has its own local static variable named ‘a’ that hides the global ‘a’ in main. The printf() statement in main() accesses the local ‘a’ and prints its value. The same printf() statement accesses the global ‘b’ as there is no local variable named ‘b’ in main. Also, the defaut value of static and global int variables is 0. That is why the printf statement in main() prints 0 as value of b.
  949. 122.
  950. Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder
  951. 100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135 and
  952. 145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for
  953. cylinder 90 is serviced after servicing ____________ number of requests.
  954. Ans:
  955. In Shortest-Seek-First algorithm, request closest to the current position of the disk arm and head is handled first.
  956. In this question, the arm is currently at cylinder number 100. Now the requests come in the queue order for cylinder numbers 30, 85, 90, 100, 105, 110, 135 and 145.
  957. The disk will service that request first whose cylinder number is closest to its arm. Hence 1st serviced request is for cylinder no 100 ( as the arm is itself pointing to it ), then 105, then 110, and then the arm comes to service request for cylinder 90. Hence before servicing request for cylinder 90, the disk would had serviced 3 requests.
  958. Hence answer is 3.
  959. 123.
  960. The number of min-terms after minimizing the following Boolean expression is _______.
  961. [D'+AB'+A'C+AC'D+A'C'D]'
  962. Ans 1
  963. ABCD
  964. 124.
  965. Which of the following is NOT a superkey in a relational schema with attributes V,W,X,Y,Z and primary key V Y?
  966. V W X Z
  967. Which of the following is NOT a superkey in a relational schema with attributes V, W, X, Y, Z and primary key V Y ?
  968. (A) V X Y Z
  969. (B) V W X Z
  970. (C) V W X Y
  971. (D) V W X Y Z
  972. Answer: (B)
  973. Explanation: Super key = Candidate Key + other attributes. But option B does not include Y which is a part of PK or candidate key.
  974. 125.
  975. 1024 bit is equal to how many byte
  976. Ans: 128
  977. 126.
  978. HTTP is ________ protocol
  979. Ans: application layer
  980. 127.
  981. Consider the following C program
  982. #inclue
  983. int main()
  984. int i, j, k 0;
  985. j=2*3/4+2.0 / 5+8 / 5;
  986. k-= --j;
  987. for (i=0; i<5; i++)
  988. {
  989. Switch (i + k)
  990. {
  991. case1:
  992. case 2 : printf ("\ n%d", i+k)
  993. case 3 : printf ("\ n%d", i+k);
  994. default : printf ("\n%d",i+k);
  995. }
  996. }
  997. Return 0:
  998. }
  999. The number of times printf statement is executed is ________.
  1000. Ans : 10
  1001. Explanation:
  1002. j = (((2 * 3) / 4) + (2.0 / 5) ) + (8/5); //As associativity of +,* and / are from left to right and + has less precedence than * and /.
  1003. j = ((6/4) + 0.4) + 1); //2.0 is double value and hence 5 is implicitly typecast to double and we get 0.4. But 8 and 5 are integers and hence 8/5 gives 1 and not 1.6
  1004. j = (1 + 0.4) + 1; // 6/4 also gives 1 as both are integers
  1005. j = 1.4 + 1; //1 + 0.4 gives 1.4 as 1 will be implicitly typecast to 1.4
  1006. j = 2.4; // since j is integer when we assign 2.4 to it, it will be implicitly typecast to int.
  1007. So, j = 2;
  1008. k -= --j;
  1009. This makes j = 1 and k = -1.
  1010. The variables j and k have values 1 and -1 respectively before the for loop. Inside the for loop, the variable i is initialized to 0 and the loop runs from 0 to 4.
  1011. ,  ,  , default case is executed, printf count = 1
  1012. ,  ,  , default case is executed, printf count = 2
  1013. ,  ,  , case 2, case 3 and default case is executed, printf count = 5
  1014. ,  ,  , case 2, case 3 and default case is executed, printf count = 8
  1015. ,  ,  , case 3 and default case is executed, printf count = 10
  1016. , loop exits and the control returns to main
  1017. Answer: 
  1018. 128.
  1019. In which addressing mode the operand is given explicitly in the instruction
  1020. ANS: Direct mode
  1021. 129.
  1022. The HTTP response message leaves out the requested object when ____________ method is used
  1023. a) GET
  1024. b) POST
  1025. c) HEAD
  1026. d) PUT
  1027. View Answer
  1028. Answer: c
  1029. 130.
  1030. Which of the following is not a part of instruction cycle?
  1031. 131.
  1032. Consider the following C
  1033. function.
  1034. int fun (int n) {
  1035. int x =1, k;
  1036. if (n ==1) return x;
  1037. for (k=1; k < n; ++k)
  1038. x = x + fun (k)* fun (n - k); return x;
  1039. }
  1040. The return value of fun (5) is _______\
  1041. Ans:51
  1042. explanation
  1043. un(1) = 1;
  1044. fun(2) = 1 + fun(1) * fun(1) = 1 + 1 = 2;
  1045. fun(3) = 1 + fun(1) * fun(2) + fun(2) * fun(1) = 5;
  1046. fun(4) = 1 + fun(1) * fun(3) + fun(2) * fun(2) + fun(3) * fun(1) = 1 + 5 + 4 + 5 = 15;
  1047. fun(5) = 1 + fun(1) * fun(4) + fun(2) * fun(3) + fun(3) * fun(2) + fun(4) * fun(1) = 1 + 15 + 10 + 10 + 15  = 51;
  1048. 132.
  1049. A process executes the code
  1050. fork ();
  1051. fork ();
  1052. fork ();
  1053. The total number of child processes created is
  1054. Ans: 7
  1055. 133.
  1056. SQl allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below:
  1057. select * from R where a in (select S.a from S)
  1058. Ans: Select R.* from R, (select distinct a from S) as S1 where R.a=S1.a
  1059. 134.
  1060. The average time required to reach a storage location in memory and obtain its contents is called the
  1061. Ans: access time
  1062. 135.
  1063. The following function computes the maximum value contained in an integer array
  1064. p[ ] of size n (n >= 1).
  1065. int max(int *p, int n) {
  1066. int a=0, b=n-1;
  1067. while (__________) {
  1068. if (p[a] <= p[b]) { a = a+1; }
  1069. else { b = b-1; }
  1070. }
  1071. return p[a];
  1072. }
  1073. The missing loop condition is
  1074. Ans: b != a
  1075. Explanation
  1076. #include<iostream>
  1077. int max(int *p, int n)
  1078. {
  1079.     int a=0, b=n-1;
  1080.     while (a!=b)
  1081.     {
  1082.         if (p[a] <= p[b])
  1083.         {
  1084.             a = a+1;
  1085.         }
  1086.         else
  1087.         {
  1088.             b = b-1;
  1089.         }
  1090.     }
  1091.     return p[a];
  1092. }
  1093. int main()
  1094. {
  1095.    int arr[] = {10, 5, 1, 40, 30};
  1096.    int n = sizeof(arr)/sizeof(arr[0]);
  1097.    std::cout << max(arr, 5);
  1098. }
  1099. 136.
  1100. The relation R={A,B,C,D,E,F} with FD A,B-> C, C-> D, C->E,F holds
  1101. A.   Ans: AEH, BEH, DEH
  1102. 137.
  1103. After fetching the instruction from the memory, the binary code of the
  1104. instruction goes to
  1105. Ans :instruction register
  1106. 138.
  1107. ______ cryptography refers to encryption methods in which both the sender and receiver share the same key.
  1108. Ans: public key
  1109. 139.
  1110. When CPU is executing a Program that is part of the Operating System, it is said to be in
  1111. Ans:  System mode
  1112. 140.
  1113. The relationship that exists within the same entity type is called as __Recursive_______ relationship.
  1114. 141.
  1115. Consider the following C
  1116. function.
  1117. int fun (int n) {
  1118. int x =1, k;
  1119. if (n ==1) return x;
  1120. for (k=1; k < n; ++k)
  1121. x = x + fun (k)* fun (n - k); return x;
  1122. }
  1123. The return value of fun (5) is _______
  1124. Ans: question 131
  1125. 142.
  1126. Flip-flops can be constructed with two
  1127. Ans: NAND gates
  1128. 143.
  1129. Using public key cryptography, X adds a digital signature σ to message M, encrypts , and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
  1130. Ans: Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed by X’s public key
  1131. 144.
  1132. Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
  1133. Ans: Shortest remaining time first
  1134. 145.
  1135. Error correction and error detection happens in ___________ layer.
  1136. Ans : Data link layer
  1137. 146.
  1138. If a hospital has to store the description of each visit of a patient according to date what attribute you will use in the patient entity type?
  1139. Ans: multivalued attribute
  1140. 147.
  1141. Decimal digit in BCD can be represented by
  1142. ANS: Four        eg.5-> 0101
  1143. Ans: binary-coded decimal (BCD) is a class of binary encodings of decimal numbers where each decimal digit is represented by a fixed number of bits, usually four or eight.
  1144. 148.
  1145. What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note
  1146. that the first parameter is passed by reference, whereas the second parameter is passed by value.
  1147. int f (int &x, int c) {
  1148. c=c-1;
  1149. if (c==0) return 1;
  1150. x=x+1;
  1151. return f (x,c)*x;}
  1152. Ans:
  1153. 6561
  1154. Since c is passed by value and x is passed by reference, all functions will have same copy of x, but different copies of c.
  1155. f(5, 5) = f(x, 4)*x = f(x, 3)*x*x = f(x, 2)*x*x*x = f(x, 1)*x*x*x*x = 1*x*x*x*x = x^4
  1156. Since x is incremented in every function call, it becomes 9 after f(x, 2) call. So the value of expression x^4 becomes 9^4 which is 6561.
  1157. 149.
  1158. KDD (Knowledge Discovery in Databases) is referred to,
  1159. Ans:  broad process of finding knowledge in data, and emphasizes the "high-level" application of particular data mining methods
  1160. 150.
  1161. Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main memory consists of 256 blocks and the request for memory blocks is in the following order: 0, 255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155 Which one of the following memory block will NOT be in cache if LRU
  1162. Ans: 216
  1163. 16 blocks and sets with 4 blocks each means there are 4 sets. So, the lower 2 bits are used for getting a set. And 4 way associative means in a set only the last 4 cache accesses can be stored.
  1164. 0, 255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155
  1165. Mod 4 gives
  1166. 0, 3, 1, 0, 3, 0, 1, 3, 0, 1, 3, 0, 0, 0, 1, 0, 3
  1167. Now for each of 0..3, the last 4 accesses will be in cache. So, {92, 32, 48, 8}, {155, 63, 159, 3}, {73, 129, 133, 1} and {} will be in cache. So, the missing element from choice is 216.
  1168. 151.Design procedure of combinational circuit involves
  1169. Ans -
  1170. 1.   Determine required number of inputs and outputs from the specifications.
  1171. 2.   Derive the truth table for each of the outputs based on their relationships to the input.
  1172. 3.   Simplify the boolean expression for each output. Use Karnaugh Maps or Boolean algebra.
  1173. 4.   Draw a logic diagram that represents the simplified Boolean expression. Verify the design by analysing or simulating the circuit.
  1174. 152. ______is used by network devices, like routers, to send error messages indicating, for example, that a requested service is not available or that a host or router could not be reached.
  1175. Ans – ICMP(Internet control message protocol)
  1176. 153. The output of the following program is
  1177. main()
  1178. {
  1179. int a = 5;
  1180. int b = 10;
  1181. cout << (a>b?a:b);
  1182. }
  1183. Ans - 10
  1184. 154. Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11,92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is
  1185. Ans – 165
  1186. 155. In design procedure input output values are assigned with
  1187. Ans – Letter Symbols as in (A , B , A’ or B’)
  1188. 156. In dynamic routing mechanism the route changes in response to_______
  1189. Ans - Dynamic routing, also called adaptive routing, is a process where a router can forward data via a different route or given destination based on the current conditions of the communication circuits within a system
  1190. 157.  _______________________ gives the concepts to describe the structure of the database.
  1191. Ans – Data Model(physical)
  1192. 158. Mod-6 and mod-12 counters are most commonly used in
  1193. Ans – Digital Clocks
  1194. 159. The Third stage in designing a database is when we analyze our tables more closely and create a ___________ between tables.
  1195. Ans – Relationship
  1196. 160. Multiplexing is used in _______
  1197. Ans  - Circuit Switching
  1198. 161. A race condition occurs when
  1199. Ans - Two concurrent activities interact to cause a processing error
  1200. 162. _______ is a set of networks sharing the same routing policy
  1201. Ans – Autonomous System
  1202. 163 The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
  1203. Ans - the instruction set architecture
  1204. 164. Mod-6 and mod-12 counters are most commonly used in
  1205. Ans- Digital Clocks
  1206. 165. Passing the request from one schema to another in DBMS architecture is called as ___________________
  1207. Ans – Mapping
  1208. 166. _____, also known as "port forwarding," is the transmission of data intended for use only within a private, usually corporate network through a public network in such a way that the routing nodes in the public network are unaware that the transmission is part of a private network.
  1209. Ans - Tunneling
  1210. 167. . For computers based on three - address instruction formats, each address field can be used to specify which of the following:
  1211. S1: A memory operand
  1212. S2: A processor register
  1213. S3: An implied accumulator registers
  1214. Ans - Either S1 or S2
  1215. 168. What is a trap?
  1216. Ans - A trap is an exception in a user process. It's caused by division by zero or invalid memory access. It's also the usual way to invoke a kernel routine (a system call)
  1217. 169. A relation schema R is said to be in 4NF if for every MVD A-->>B that holds over R
  1218. Ans - A ->> B is a trivial MVD
  1219.        A is a superkey
  1220. 170. In Binary trees nodes with no successor are called ......
  1221. Ans – Terminal Nodes
  1222. 171. The Snapshot of a table is called as
  1223. Ans – View
  1224. 172. In real time Operating System, which of the following is the most suitable scheduling scheme?
  1225. Ans – Pre-emptive
  1226. 173. Congestion control and quality of service is qualities of the
  1227. Ans – Data Flow
  1228. 174. The _________ translates a byte from one code to another code
  1229. Ans – XLAT
  1230. 175. Which amongst the following refers to Absolute addressing mode
  1231. A.   Ans - the address of the operand is inside the instruction
  1232. 176. _______ detects loss of data errors in data, requests retransmission of lost data, rearranges out-of-order data, and even helps minimize network congestion to reduce the occurrence of the other problems
  1233. Ans – TCP
  1234. 177. If every node u in G adjacent to every other node v in G, A graph is said to be
  1235. Ans – Complete
  1236. 178. If a virtual memory system has 4 pages in real memory and rest must be swapped to disk.which of the following is the hit ratio for the following page address stream? Assume that memory starts empty .use the first in first out(FIFO) algorithm.
  1237. (a) 10%
  1238. (b) 15%
  1239. (C) 25%
  1240. (d) 31%
  1241. ANS: D.31%
  1242. 179. A relation R(a,b,c,d,e,f) with the FDs { a -> b,c; c -> d, e, f } satisfies ----- normal form at the most where ?a? is the primary key.
  1243. Ans - ??
  1244. 180. On simple paging system with 224 bytes of physical memory, 256 pages of logical address space, and a page size 210 bytes, how many bytes are in a page frame?                          
  1245. Ans - A frame is where a page can be mapped into memory, so a frame has to be the same size as a page - 210 bytes.so ANS=210 bytes,
  1246. 181. Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window is
  1247. Ans – 1100msec
  1248. 182. Course_Info{Course_no, Sec_no, Offering_dept, Credit_hours, Course_level, Instructor_ssn, Semester, Year, Days_hours, Room_no, No_of_students}.
  1249. The Course_Info has following functional dependencies:
  1250. {Course_no}{Offering_dept, Credit_hours, Course_level}
  1251. {Course_no, Sec_no, Semester, Year} {Days_hours, Room_no, No_of_students, Instructor_ssn }
  1252. {Room_no, Days_hours, Semester, Year} {Instructor_ssn, Course_no, Sec_no}
  1253. Find the keys of the relation
  1254. Ans - ??
  1255. 183. NOP instruction introduces
  1256. Ans – NOP is the No operation. It means that the processor performs no operation for the clock cycle and thus there exists a delay. ANS: Delay
  1257. 184.  A binary tree in which all the leaves are on the same level is called as:
  1258. Ans – Perfect binary tree
  1259. 185. The addressing mode used in an instruction of the form ADD X Y, is _____.
  1260. Ans – index
  1261. 186.
  1262. Which of the following are sufficient conditions for deadlock?       
  1263. Ans -      
  1264. 1.   mutual exclusion
  1265. The resources involved must be unshareable; otherwise, the processes would not be prevented from using the resource when necessary.
  1266. 2.   hold and wait or partial allocation
  1267. The processes must hold the resources they have already been allocated while waiting for other (requested) resources. If the process had to release its resources when a new resource or resources were requested, deadlock could not occur because the process would not prevent others from using resources that it controlled.
  1268. 3.   no pre-emption
  1269. The processes must not have resources taken away while that resource is being used. Otherwise, deadlock could not occur since the operating system could simply take enough resources from running processes to enable any process to finish.
  1270. 4.   resource waiting or circular wait
  1271.  
  1272. 187.
  1273. In ORDBMS, When an object O is brought into memory, they check each oid contained in O and replace oids of in-memory objects by in-memory pointers to those objects. This concept refers to:
  1274. Ans – Swizzling is the act of changing the functionality of a method by replacing the implementation of that method with another, usually at runtime. There are many different reasons one might want to use swizzling: introspection, overriding default behavior, or maybe even dynamic method loading
  1275. ANS:  pointer swizzling
  1276. 188.
  1277. A binary tree T has 20 leaves. The number of nodes in T having two children is
  1278. Ans - In Binary tree If there are NN leaf nodes then the number of Nodes having two children will be N−1N−1. So in this case answer will be 20−120−1, means  19
  1279. 189.
  1280. How many 8-bit characters can be transmitted per second over a 9600 baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits, and one parity bit?
  1281. Ans – 800
  1282. 190.
  1283. A receiving host has failed to receive all of the segments that it should acknowledge. What can the host do to improve the reliability of this communication session?
  1284. Explanation:
  1285. A receiving host can control the transmitter by using flow control (TCP uses Windowing by default). By decreasing the window size, the receiving host can slow down the transmitting host so the receiving host does not overflow its buffers.
  1286. Ans - Decrease the window size.
  1287. 191.
  1288. The port that is used for the generation of handshake lines in mode 1 or mode 2 is
  1289. Ans – port C upper
  1290. 192.
  1291. Consider the following transaction involving two bank account x and y.
  1292. read (x) ; x : = x ? 50; write (x) ; read (y); y : = y + 50 ; write (y)
  1293. The constraint that the sum of the accounts x and y should remain constant is that of
  1294. Explanation: Consistency in database systems refers to the requirement that any given database transaction must only change affected data in allowed ways, that is sum of x and y must not change.
  1295. Ans – Consistency
  1296. 193.
  1297. A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is 24 megabytes, the length of the virtual address supported by the system is _________ bits.
  1298. Ans - 36
  1299. 194.
  1300. What happens when you push a new node onto a stack?
  1301. Skill/Topic: Stacks using Linked List
  1302. A) the new node is placed at the front of the linked list.
  1303. ANS::::B) the new node is placed at the back of the linked list.
  1304. C) the new node is placed at the middle of the linked list.
  1305. D) No Changes happens
  1306. 195.
  1307. In 8257 register format, the selected channel is disabled after the terminal count condition is reached when
  1308. Explanation: If the TC STOP bit is set, the selected channel is disabled after the terminal count condition is reached, and it further prevents any DMA cycle on the channel.Ans - TC STOP bit is set
  1309. 196. ____ users work on canned transactions
  1310. These are usually very structured transactions done by non-IT-skilled personnel. Example, a skilled IT person would create a process for the non-IT-skilled worker to do that is very easy to follow and should almost be impossible to make a mistake that would cause harm. We call them "canned" because it is like a pre-packaged canned of food, consistent and easily understood.
  1311. Ans – Naïve
  1312. 197.
  1313. Which of the following information is not part of Process Control Block?
  1314. (i) Process State
  1315. (ii) Process Page table
  1316. (iii) List of Open files
  1317. (iv) Stack Pointer
  1318. ANS:::::: B. Process page table
  1319. 198.
  1320. The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
  1321. Ans - T(n) = 2T(n – 1) + 1
  1322. 199.
  1323. For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements is/are TRUE ?
  1324. I. At least three non-overlapping channels are available for transmissions.
  1325. II. The RTS-CTS mechanism is used for collision detection.
  1326. III.Unicast frames are ACKed.
  1327. Ans – I and III only
  1328. 200.
  1329. Partial Degree of multiprogramming is controlled by
  1330. Ans – long term scheduler
  1331. 201.
  1332. Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable?
  1333. 1.r1(x); r2(x); w1(x); r3(x); w2(x);
  1334. 2.r2(x); r1(x); w2(x); r3(x); w1(x);
  1335. 3.r3(x); r2(x); r1(x); w2(x); w1(x);
  1336. 4.r2(x); w2(x); r3(x); r1(x); w1(x);
  1337. Ans:: D.
  1338. Explanation: In option D, there is no interleaving of operations. The option D has first all operations of transaction 2, then 3 and finally 1 There can not be any conflict as it is a serial schedule with sequence 2 –> 3 — >1
  1339. 202.
  1340. If  a , b , c, are three nodes connected in sequence in a singly linked list, what is the  statement to be added to change this into a circular linked list?
  1341. Ans:: Connect last node to the first node.
  1342. 203.
  1343. The effective address of the following instruction is , MUL 5(R1,R2)
  1344. a) 5+R1+R2               b) 5+(R1*R2)
  1345. c) 5+[R1]+[R2]               d) 5*([R1]+[R2])
  1346.    Ans:: C
  1347. 204.
  1348. X.25 Networks are ________ networks
  1349. Ans:: Packet Switched wide area network.
  1350. 205.
  1351. When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called
  1352. Ans:: Race Condition.
  1353. 206.
  1354. Which one of the following protocols is NOT used to resolve one form of address to another one?
  1355. (A) DNS
  1356. (B) ARP
  1357. (C) DHCP
  1358. (D) RARP
  1359. Answer: (C)
  1360. DHCP does not do any kind of address resolution(means resolving of one form of address to another one). It just gives one IP address to the Host (If requested).
  1361. 207.
  1362. The output of the above function on input “ABCD EFGH” is
  1363. void foo (char *a)
  1364. {
  1365.   if (*a && *a != ` `)
  1366.   {
  1367.      foo(a+1);
  1368.      putchar(*a);
  1369.   }
  1370. }
  1371. Run on IDE
  1372. (A) ABCD EFGH
  1373. (B) ABCD
  1374. (C) HGFE DCBA
  1375. (D) DCBA
  1376. Answer: (D)
  1377. **208.
  1378. Consider a schedule S1 given below;
  1379. R1(A); W1(A); R2(B); R2(A); R1(B); W2(A+B); W1(B); where R1 and W1 are read and write operations of transaction T1 and R2 and W2 are read and write operations of transaction T2.
  1380. Which of the following is correct regarding schedule S1?
  1381. t
  1382. 209.
  1383. The effective address of the following instruction is , MUL 5(R1,R2)
  1384. a) 5+R1+R2               b) 5+(R1*R2)
  1385. c) 5+[R1]+[R2]               d) 5*([R1]+[R2])
  1386.    Ans:: C
  1387. 210.
  1388. The degree of a leaf node is:
  1389. Ans: 0.
  1390. The number of subtrees of a node is called the degree of the node. In a binary tree, all nodes have degree 0, 1, or 2. A node of degree zero is called a terminal nodeor leaf node. A non-leaf node is often called a branch node. The degree of a tree is the maximum degree of a node in the tree.
  1391. 211.
  1392. The instructions which copy information from one location to another either in the processor’s internal register set or in the external main memory are called
  1393. Ans:: Data transfer instructions
  1394. **212.
  1395. State the type of multitasking supported by OS when process switched its state from 'Running' to 'Ready' due to scheduling act.
  1396. 213.
  1397. End-to-end connectivity is provided from host-to-host in:
  1398. Ans:: Transport layer.
  1399. 214.
  1400. An index is clustered, if
  1401. (A) it is on a set of fields that form a candidate key.
  1402. (B) it is on a set of fields that include the primary key.
  1403. (C) the data records of the file are organized in the same order as the data entries of the index.
  1404. (D) the data records of the file are organized not in the same order as the data entries of the index.
  1405. Ans :: C
  1406. Explanation: A database index is clustered if physical records on disk follow the index order
  1407. **215.
  1408. Creating a B Tree index for your database has to be specified in _____.
  1409. 216.
  1410. 1) The protocol data unit(PDU) for the application layer in the Internet stack is
  1411. (A) Segment
  1412. (B) Datagram
  1413. (C) Message
  1414. (D) Frame
  1415. Answer (C)
  1416. The Protocol Data Unit for Application layer in the Internet Stack (or TCP/IP) is called Message.
  1417. 217.
  1418. The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal
  1419. 1.ABFCDE
  1420. 2.ADBFEC
  1421. 3.ABDECF
  1422. 4.None of the above
  1423. Ans:: 3
  1424. 218.
  1425. Consider 6 memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB, 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
  1426. 1.200 KB and 300 KB
  1427. 2.200 KB and 250 KB
  1428. 3.250 KB and 300 KB
  1429. 4.300 KB and 400 KB
  1430. Ans: 1
  1431. 219.
  1432. PSW is saved in stack when there is a _____.
  1433. A.      interrupt recognized                              B.      execution of RST instruction
  1434. C.      Execution of CALL instruction           D.      All of these
  1435. Ans:: A
  1436. 220.
  1437. Error detection at the data link layer is achieved by?   
  1438. [A]   Bit stuffing
  1439. [B]   Cyclic redundancy codes(Answer)
  1440. [C]   Hamming codes
  1441. [D]   Equalization
  1442. 221.
  1443. Which of the following is not a function of a DBA?  
  1444. Ans:: Network Maintenance.    (DBA- Database Administration)
  1445. 222.
  1446. A system uses 3 page frames for storing process pages in main memory. It uses the Least
  1447. Recently Used (LRU) page replacement policy. Assume that all the page frames are
  1448. initially empty. What is the total number of page faults that will occur while processing the page reference string given below?
  1449. 4, 7, 6, 1, 7, 6, 1, 2, 7, 2
  1450. Ans:: 6
  1451. 223.
  1452. What is the postfix expression for the following infix expression?
  1453.       Infix =  a+b%c>d
  1454. 224.
  1455. What is a trap?
  1456. down voteaccepted   A trap is an exception in a user process. It's caused by division by zero or invalid memory access.
  1457. 225.
  1458. Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires 48 bits, then the size of the per-process page table is __________ megabytes.
  1459. Explanation: Size of memory = 240
  1460. Page size = 16KB = 214
  1461. No of pages= size of Memory/ page size = 240 / 214 = 226
  1462. Size of page table = 226 * 48/8 bytes = 26*6 MB =384 MB
  1463. Thus, A is the correct choice.
  1464. Ans:: 384 MB
  1465. 226.
  1466.   Passing the request from one schema to another in DBMS architecture is called as ____Mappings._______________
  1467. 227.
  1468. Computers use addressing mode techniques for ____________.
  1469. A.      giving programming versatility to the user by providing facilities as pointers to memory counters for loop control
  1470. B.      to reduce no. of bits in the field of instruction
  1471. C.      specifying rules for modifying or interpreting address field of the instruction
  1472. D.      All the above
  1473. Ans: D
  1474. 228.
  1475. Loss in signal power as light travels down the fiber is called?
  1476. Ans:: attenuation.
  1477. 229.
  1478. A binary tree T has 20 leaves. The number of nodes in T having two children is
  1479. (A) 18
  1480. (B) 19
  1481. (C) 17
  1482. (D) Any number between 10 and 20
  1483. Answer: (B)
  1484. 230.
  1485. Which of the following is NOT a superkey in a relational schema with attributes V,W,X,Y,Z and primary key V Y?
  1486. Ans::V W X Z
  1487. 231.
  1488. Computers use addressing mode techniques for _____________________.
  1489. Repeated refer 227.
  1490. 232.
  1491. In OSI model dialogue control and token management are responsibilities of ?
  1492. Ans:: session layer
  1493. 233.
  1494. Which of the following is example of in-place algorithm?
  1495. Ans:: Heap Sort , Selection Sort, Bubble Sort , insertion sort, shell sort.
  1496. 234.
  1497. Consider the 3 process, P1, P2 and P3 shown in the table.
  1498. Process Arrival time Time units Required
  1499. P1 0 5
  1500. P2 1 7
  1501. P3 3 4
  1502. The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling) with CPU quantum of 2 time units are
  1503. Ans::
  1504. FCFS: P1, P2, P3
  1505. RR2: P1, P3, P2
  1506. 235.
  1507. A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero(the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
  1508. Ans:: This algorithm is equivalent to the round-robin algorithm.
  1509. *236.
  1510. Which of the following operator in SQL would produce the following result if applied between two relations Employee and Department?
  1511. Eno EName DeptNo DName
  1512. 111 Kumar 100 Sales
  1513. 222 Steve 200 Finance
  1514. Null Null 300 Admn
  1515. 244 Meera 400 Mktg
  1516. Ans:: Right join.
  1517. 237.
  1518. The run time of the following algorithm is
  1519. Procedure A(n)
  1520. If(n<=2) return(1)
  1521. Else return(A(sqrt(n))
  1522. Ans:: O(log logn)
  1523. 238.
  1524. The address to the next instruction lies in
  1525. Ans:: Program Counter
  1526. 239.
  1527. Which protocol does Ping use?
  1528. Ans:: ICMP
  1529. 240.
  1530. What is the unique characteristic of RAID 6 ?
  1531. Ans:: Two independent distributed parity
  1532. 241.
  1533. The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by __________.
  1534. Ans:: System Call.
  1535. 242.
  1536. Consider a dynamic queue with two pointers: front and rear. What is the time needed to insert an element in a queue of length of n?
  1537. Ans:: O(1)
  1538. *243.
  1539. Which of the following address modes calculate the effective address as
  1540. address part of the instruction) + (content of CPU register)
  1541. 244.
  1542. If CurrNode pointer points to the previous node in the list and NewNode points to the newly created Node, the address assignments to be done for inserting a node in the middle of a singly linke
  1543. Ans::
  1544. newnode.next=currNode.next;
  1545. currentNode.next=NewNode.
  1546. d list is
  1547. 245.
  1548. A group of bits that tell the computer to perform a specific operation is known as
  1549. Ans:: Instruction code 
  1550. 246.
  1551. On simple paging system with 224 bytes of physical memory, 256 pages of logical address space, and a page size 210 bytes, how many bytes are in a page frame?
  1552. A frame is where a page can be mapped into memory, so a frame has to be the same size as a page - 210 bytes.
  1553. Ans:: Page frame size is 2^10 bytes.
  1554. 247.
  1555. A 2 km long broadcast LAN has 107 bps bandwidth and uses CSMA/CD. The signal travels along the wire at 2 × 108 m/s. What is the minimum packet size that can be used on this network?
  1556. (A) 50 bytes
  1557. (B) 100 bytes
  1558. (C) 200 bytes
  1559. (D) None of these
  1560. Answer: (D)
  1561. 248.
  1562. The data manipulation language used in SQL is a,
  1563. (I) Procedural DML
  1564. (II) Non-Procedural DML
  1565. (III) Modification DML
  1566. (IV) Declarative DML
  1567. Ans:: 1
  1568. **249.
  1569. Consider the following pseudo code fragment:
  1570. printf (“Hello”);
  1571. if(!fork( ))
  1572. printf(“World”);
  1573. Which of the following is the output of the code fragment?
  1574. 250.
  1575. The time factor when determining the efficiency of algorithm is measured by
  1576. Ans:: Counting the no of key operations.
  1577. 251.
  1578. How many 8-bit characters can be transmitted per second over a 9600 baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, and one parity bit ?
  1579. "9600 baud" means that the serial port is capable of transferring a maximum of 9600 bits per second."
  1580. So, transmission rate here = 9600 bps
  1581. An eight bit data (which is a char) requires 1 start bit, 2 stop bits and 1 parity bit = 12 bits.
  1582. So, number of characters transmitted per second = 9600 / 12 = 800
  1583. 252.
  1584. When we use auto increment or auto decrements, which of the following is/are true?
  1585. 1) In both, the address is used to retrieve the operand and then the address gets altered
  1586. 2) In auto increment the operand is retrieved first and then the address altered
  1587. 3) Both of them can be used on general purpose registers as well as memory locations
  1588. a) 1, 2, 3
  1589. b) 2
  1590. c) 1, 3
  1591. d) 2, 3
  1592. View Answer
  1593. Answer: d
  1594. Explanation: In case of, auto increment the increment is done afterwards and in auto decrement the decrement is done first.
  1595. .
  1596. 253.
  1597. Having clause in SQL occurs with
  1598. ANS~ Group By
  1599. The HAVING clause should appear before an INTO clause; otherwise, a syntax error occurs.
  1600. 254.
  1601. One that is not type of flipflop is
  1602. Types of Flip-Flops
  1603. • RS flip-flop
  1604. • JK flip-flop
  1605. • D flip-flop
  1606. • T flip-flop
  1607. 255.
  1608. If a node having two children is deleted from a BST, it is replaced by its
  1609. In-order successor
  1610. 256.
  1611. The best way to retrieve todays date in DBMS is
  1612. SELECT CURDATE();
  1613. 257.
  1614. The address resolution protoc0l (ARP) is used for
  1615. The address resolution protocol (arp) is a protocol used by the IPv4, to map IP network addresses to the hardware addresses.
  1616. 257.
  1617. The address resolution protoc0l (ARP) is used for
  1618. 258.
  1619. 7. There are ‘m’ processes and ‘n’ instances of a Resource provided. Each process needs ‘P’ instances of the resource. In which case deadlock will never occur?
  1620. 259.
  1621. Which are invalid process state transition?
  1622. a.  Timer Start: ready->running
  1623. b.  Timer Out: running->blocked
  1624. c.  I/O: running->ready
  1625. d.  Resume : suspend->running
  1626. ANS: D
  1627. 260.
  1628. All the functions of the ports of 8255 are achieved by programming the bits of an internal register called
  1629. control word register
  1630. 261.
  1631. 1. Which of the following is not a stable sorting algorithm?
  1632. a) Insertion sort
  1633. b) Selection sort
  1634. c) Bubble sort
  1635. d) Merge sort
  1636. View Answer / Hide Answer
  1637. ANSWER: B
  1638. 262.
  1639. An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be:
  1640. A.   255.255.0.0
  1641. B.   255.255.64.0
  1642. C.   255.255.128.0
  1643. D.   255.255.252.0
  1644. to form subnet for 64 departments we need 6  continuous bit and the value of  11111100 = 252.
  1645. organization has  class B network so subnet mask would be 255.255.252.0
  1646. 263.
  1647. R right outer join S on a=b gives
  1648. 264.
  1649. In a packet switching network, packets are routed from source to destination along a single path having two intermediate node. If the message size is 24 bytes and each packet contains a header of 3 bytes, then the optimum packet size is
  1650. ANS:     9
  1651. 265.
  1652. The process in which of the following states will be in secondary memory?
  1653. ANS: New state, suspended ready state  and suspended blocked state
  1654. 266.
  1655. The number of counters that are present in the programmable timer device 8254 is
  1656. 3
  1657. 267.
  1658. _______________________gives the concepts to describe the structure of the database.
  1659. DBMS data models
  1660. 268.
  1661. Identify the sorting technique that supports divide and conquer strategy and has (n2) complexity in worst case
  1662. Quicksort
  1663. 269.
  1664. Given the basic ER and relational models, which of the following is INCORRECT?
  1665. A.   An attribute of an entity can have more than one value
  1666. B.   An attribute of an entity can be composite
  1667. C.   In a row of a relational table, an attribute can have more than one value
  1668. D.   In a row of a relational table, an attribute can have exactly one value or a NULL values
  1669. ANS: C
  1670. 270.
  1671. If a disk has a seek time of 20ms, rotates 20 revolutions per second, has 100 words per block, and each track has capacity of 300 words. Then the total time required to access one block is
  1672. Time taken to access one block = seek time + rotational delay + block transfer time
  1673. Seek time = 20 ms (given)
  1674. Rotational delay = on an average taken to be the time to rotate by half = 1/2 X time for 1 rotati X 1/20 sec s = 25 ms
  1675. Block Transfer time = block size / transfer rate = 100 / transfer rate
  1676. Now, transfer rate = Track capacity / rotation rate = 300 / ( 1/ 20) = 6000 word per sec = 6 word per ms
  1677. Block Transfer time = block size / transfer rate = 100 / 6 ~ 16.67 ms per blockTime taken to access one block = seek time + rotational delay + block transfer time= 20 + 25 + 16.67 = 61.67 ms
  1678. 271.
  1679. Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bankwidth on the path between aA and B is 128 kbps. What is the optimal window size that A should use ?
  1680. Round Trip propagation delay = 80ms
  1681. Frame size = 32*8 bits
  1682. Bandwidth = 128kbps
  1683. Transmission Time = 32*8/(128) ms = 2 ms
  1684. Let n be the window size.
  1685. UtiliZation = n/(1+2a) where a = Propagation time / transmission time
  1686.             = n/(1+80/2)
  1687. For maximum utilization: n = 41
  1688. 272.
  1689. The searching technique that takes O (1) time to find a data is
  1690. Hashing
  1691. 273.
  1692. The data bus buffer is controlled by
  1693. Read/write control logic
  1694. 274.
  1695. In control word register, if SC1=0 and SC0=1, then the counter selected is
  1696. Counter 1
  1697. SC denotes select counter
  1698. 275.
  1699. Information about a process is maintained in a _________.
  1700. Process control block
  1701. 276.
  1702. Which of the following is not a conversion function in SQL?
  1703. 277.
  1704. Two computers C1 and C2 are configured as follows. C1 has IP address 203.197.2.53 and netmask 255.255.128.0. C2 has IP address 203.197.75.201 and netmask 255.255.192.0. Which one of the following statements is true?
  1705. A.   C1 and C2 both assume they are on the same network
  1706. B.   C2 assumes C1 is on same network, but C1 assumes C2 is on a different network
  1707. C.   C1 assumes C2 is on same network, but C2 assumes C1 is on a different network
  1708. D.   C1 and C2 both assume they are on different networks.
  1709. CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
  1710. 278.
  1711. AVL trees have a faster __________
  1712. Retrieval
  1713. 279.
  1714. Which level of RAID refers to disk mirroring with block striping?
  1715. RAID level 1
  1716. 280.
  1717. The counter starts counting only if
  1718. a) GATE signal is low
  1719. b) GATE signal is high
  1720. c) CLK signal is low
  1721. d) CLK signal is high
  1722. View Answer
  1723. Answer: b
  1724. Explanation: If the GATE signal is enabled, then the counter starts counting.
  1725. 281.
  1726. Station A needs to send a message consisting of 9 packets to Station B using a siding window (window size 3) and go-back-n error control strategy. All packets are ready and immediately available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever get lost), then what is the number of packets that A will transmit for sending the message to B ?
  1727. There is a  formula
  1728. N=1/(1-p)
  1729. where p -probability of failure
  1730. N-total number of packets(including the extra packets) to be sent for one data packet .
  1731. p=1/5 = 0.2
  1732. N=1/1-0.2 = 1/0.8
  1733. for 9 packets , 9/0.8 = 11.25 ~ 12
  1734. 282.
  1735. The time required in worst case for search operation in binary tree is
  1736. O(n)
  1737. 283.
  1738. Which of the following is shared between all of the threads in a process? Assume a kernel level thread implementation.
  1739. FILE DESCRIPTORS
  1740. 284.
  1741. Which of the following is not true of virtual memory?
  1742. It requires the use of disk or other secondary storage
  1743. 285.
  1744.       To change the access path programs are categorized under __________ data independence.
  1745. Physical
  1746. 286.
  1747. When an instruction is read from the memory, it is called
  1748. instruction cycle (sometimes called a fetch decode execute cycle) is the basic operational process of a computer.
  1749. 287.
  1750. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
  1751. a. Input-restricted deque
  1752. b. Output-restricted deque
  1753. c.   Priority queues
  1754. d. None of above
  1755. ANS : Input-restricted deque
  1756. 288.
  1757. In a token ring network the transmission speed is 10 bps and the propagation speed is 200 metres/ s μ . The 1-bit delay in this network is equivalent to;
  1758. (A)   500 metres of cable.
  1759. (B) 200 metres of cable.
  1760. (C) 20 metres of cable.
  1761. (D) 50 metres of cable
  1762. Ans: C
  1763. As, token ring network
  1764.   So,        transmission delay = length / bandwidth
  1765.                   transmission delay = 1/10^7 = 0.1micro sec.
  1766.    as,  propagation speed =200m/micro sec.
  1767.          In , 1micro sec.  it covers 200m
  1768.   than in 0.1micro sec. it is 20metres.
  1769. 289.
  1770. The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet?
  1771. ANS: 62 AND 1022
  1772. Maximum number of subnets = 2^6-2 =62.
  1773. Note that 2 is subtracted from 2^6. The RFC 950 specification reserves the subnet values consisting of all zeros (see above) and all ones (broadcast), reducing the number of available subnets by two.
  1774. Maximum number of hosts is 2^10-2 = 1022.
  1775. 2 is subtracted for Number of hosts is also. The address with all bits as 1 is reserved as broadcast address and address with all host id bits as 0 is used as network address of subnet.
  1776. In general, the number of addresses usable for addressing specific hosts in each network is always 2^N – 2 where N is the number of bits for host id.
  1777. 289.
  1778. The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet?
  1779. 290.
  1780. What are the desirable properties of a transaction?   
  1781. A transaction is a very small unit of a program and it may contain several lowlevel tasks. A transaction in a database system must maintain Atomicity, Consistency, Isolation, and Durability − commonly known as ACID properties − in order to ensure accuracy, completeness, and data integrity.
  1782.    
  1783. 291.
  1784. A Boolean function may be transformed into   
  1785. Logical diagram
  1786. 292.
  1787. The time required in worst case for search operation in binary tree is
  1788. O(n)
  1789. 293.
  1790. The average time required to reach a storage location in memory and obtain its contents is called the
  1791. access time
  1792. 294.
  1793. In the slow start phase of TCP congesting control algorithm, the size of the congestion window
  1794. increases exponentially
  1795. Although the name is slow start, during the slow start phase, window size is increased by the number of segments acknowledged, which means window size grows exponentially. This happens until either an acknowledgment is not received for some segment or a predetermined threshold value is reached.
  1796. 295.
  1797. Shift registers are used for
  1798. (Shifts between parallel and serial)
  1799. Shift registers are commonly used in converters that translate parallel data to serial data, or vice-versa.
  1800. 296.
  1801. To represent hierarchical relationship between elements, which data structure is suitable?
  1802. Tree
  1803. 297.
  1804. If a transaction T has obtained an exclusive lock on item Q, then T can
  1805. ANS: both read and write Q   
  1806. 298.
  1807. Operating System
  1808. 1. Assume that ?C? is a Counting Semaphore initialized to value ?10?. Consider the following program segment:
  1809. P(C); V(C); P(C); P(C); P(C); V(C); V(C)
  1810. V(C); V(C); V(C); P(C); V(C); V(C); P(C)
  1811. What is the value of C?
  1812. C=10
  1813. there are 6 wait and 8 signal operation
  1814. wait operation reduce count by 1 and signal increase count by 1 in general
  1815. so 10-6+8=12
  1816. 299.
  1817. If two relations R and S are joined, then the non matching tuples of both R and S are
  1818. ignored in
  1819. Inner join
  1820. 300.
  1821. Two variables will be represented by
  1822. A.   eight minterms
  1823. B.   six minterms
  1824. C.   five minterms
  1825. D.   four minterms
  1826. Answer
  1827. Four Minterms 2^2
  1828. 300. Two variables will be represented by
  1829. Ans .4 minterms
  1830. 301. If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the
  1831. maximum number of hosts per subnet?
  1832. Ans . A) 1022 (B) 1023 (C) 2046 (D) 2047
  1833. The binary representation of subnet mask is 11111111.11111111.11111000.00000000.
  1834. There are 21 bits set in subnet. So 11 (32-21) bits are left for host ids. Total possible
  1835. values of host ids is 2^11 = 2048. Out of these 2048 values, 2 addresses are reserved.
  1836. The address with all bits as 1 is reserved as broadcast address and address with all
  1837. host id bits as 0 is used as network address of subnet.
  1838. In general, the number of adder]sses usable for addressing specific hosts in each
  1839. network is always 2^N – 2 where N is the number of bits for host id.
  1840. 302. A binary search tree is generated by inserting in order the following integers 50, 15, 62, 5,
  1841. 20, 58, 91, 3, 8, 37, 60, 24. The number of nodes in the left subtree and right subtree of the root
  1842. respectively are
  1843. Ans . a) (4, 7) (b) (7, 4) (c) (8, 3) (d) (3, 8)
  1844. Explanation:
  1845. Difference between Binary Tree and Binary Search Tree.
  1846. Binary Tree - Tree in which each node has at most two child nodes.
  1847. Binary search tree - A binary tree in which the left child contains only nodes with values less than the parent
  1848. node, and the right child contains only nodes with values greater than or equal to the parent. Binary search tree
  1849. is used for efficient searching. The binary search tree for the above problem is given below.
  1850. 304. The amount of time required to read a block of data from a disk into memory is composed
  1851. of seek time, rotational latency, and transfer time. Rotational latency refers to ______.
  1852. Ans A. the time its takes for the platter to make a full rotation
  1853. B. the time it takes for the read-write head to move into position over the appropriate track
  1854. C. the time it takes for the platter to rotate the correct sector under the head
  1855. D. none of the above
  1856. 305. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a
  1857. strictly binary tree. Such a tree with 10 leaves
  1858. Ans .Has 19 nodes
  1859. 306. The FD A → B , DB→ C implies
  1860. Ans A) DA→ C B) A → C C) B → A D) DB → A
  1861. 307. A computer on a 10Mbps network is regulated by atoken bucket. The token bucket is filled
  1862. at a rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the maximum
  1863. duration for which the computer can transmit at the full 10Mbps?
  1864. Ans. (A) 1.6 seconds
  1865. (B) 2 seconds
  1866. (C) 5 seconds
  1867. (D) 8 seconds
  1868. New tokens are added at the rate of r bytes/sec which is
  1869. 2Mbps in the given question.
  1870. Capacity of the token bucket (b) = 16 Mbits
  1871. Maximum possible transmission rate (M) = 10Mbps
  1872. So the maximum burst time = b/(M-r) = 16/(10-2) = 2 seconds
  1873. 308. The base (or radix) of the number system such that the equation 312/20=13.1 holds is
  1874. Ans. (A) 3
  1875. (B) 4
  1876. (C) 5
  1877. (D) 6
  1878. Explanation: Let x (≠ 0) be the base of the given equation.
  1879. We have,
  1880. LHS = ( 3x2 + x + 2 ) / ( 2x) = ( 3x / 2 ) + ( 1 / 2 ) + ( 1 / x )
  1881. RHS = x + 3 + ( 1 / x )
  1882. Now, for the equation to hold true, LHS = RHS
  1883. ( 3x / 2 ) + ( 1 / 2 ) + ( 1 / x ) = x + 3 + ( 1 / x )
  1884. ⇒ 3x + 1 = 2x + 6
  1885. ⇒ x = 5
  1886. 309. A 20-bit address bus allows access to a memory of capacity
  1887. Ans 1 Mb
  1888. 310. The removal of process from active contention of CPU and reintroduce them into memory later is
  1889. known as ____________.
  1890. Ans . 1 Interrupt 2 Swapping 3 Signal 4 Thread
  1891. 311. For which one of the following reason: does Internet Protocol (IP) use the time-to-live
  1892. (TTL) field in the IP datagram header?
  1893. Ans . (A) Ensure packets reach destination within that time
  1894. (B) Discard packets that reach later than that time
  1895. (C) Prevent packets from looping indefinitely
  1896. (D) Limit the time for which a packet gets queued in intermediate routers.
  1897. Time to live (TTL) or hop limit is a mechanism that limits the lifespan or lifetime of data in a
  1898. computer or network. TTL may be implemented as a counter or timestamp attached to or
  1899. embedded in the data. Once the prescribed event count or timespan has elapsed, data is
  1900. discarded. In computer networking, TTL prevents a data packet from circulating indefinitely.
  1901. 312. The recurrence relation that arises in relation with the complexity of binary search is
  1902. Ans .t(n)=t(n/2)+k ,where k is constant
  1903. 313. Consider a relation R (A, B). If A  B is a trivial functional dependency and A is the super
  1904. key for R, then what is the maximum normal form R can be in?
  1905. Ans BCNF
  1906. 314. The algorithm design technique used in the quick sort algorithm is
  1907. Ans.Divide and conquer
  1908. 315. Which of the following is a disadvantage of file processing system?
  1909. (I) Efficiency of high level programming,
  1910. (II) Data Isolation
  1911. (III) Integrity issues
  1912. (IV) Storing of records as files
  1913. Ans
  1914. 316. If the offset of the operand is stored in one of the index registers, then it is
  1915. Ans . a) based indexed addressing mode
  1916. b) relative based indexed addressing mode
  1917. c) indexed addressing mode
  1918. d) none of the mentioned
  1919. 317. Which of the following assertions is false about the internet Protocol (IP) ?
  1920. Ans (A) It is possible for a computer to have multiple IP addresses
  1921. (B) IP packets from the same source to the same destination can take different routes in the
  1922. network
  1923. (C) IP ensures that a packet is discarded if it is unable to reach its destination within a given
  1924. number of hops
  1925. (D) The packet source cannot set the route of an outgoing packets; the route is
  1926. determined only by the routing tables in the routers on the way
  1927. In computer networking, source routing allows a sender of a packet to partially or
  1928. completely specify the route the packet takes through the network.
  1929. In the Internet Protocol, two header options are available which are rarely used: “strict
  1930. source and record route” (SSRR) and “loose source and record route” (LSRR). Because of
  1931. security concerns, packets marked LSRR are frequently blocked on the Internet. If not
  1932. blocked, LSRR can allow an attacker to spoof its address but still successfully receive
  1933. response packets.
  1934. 318. The technique, for sharing the time of a computer among several jobs, which switches jobs
  1935. so rapidly such that each job appears to have the computer to itself, is called
  1936. Ans .Time Sharing
  1937. 319. The operating system of a computer serves as a software interface between the user and the
  1938. ________.
  1939. Ans .Hardware
  1940. 320. The common register(s) for all the four channels of 8257 are
  1941. Ans . a) DMA address register b) terminal count register c) mode set register and status register
  1942. d)none of the mentioned
  1943. 321. If Human voice is required to be digitized what will be the bit rate at 16 bits per sample?
  1944. Ans taking human voice frequency at 150 hz
  1945. Bit rate will be 150*16=2400hzps or2.4Khps
  1946. 323. Consider the tree arcs of a BFS traversal from a source node W in an unweighted,
  1947. connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing
  1948. Ans. (A) the shortest path between every pair of vertices.
  1949. (B) the shortest path from W to every vertex in the graph.
  1950. (C) the shortest paths from W to only those nodes that are leaves of T.
  1951. (D) the longest path in the graph
  1952. BFS always produces shortest paths from source to all other vertices in an unweighted
  1953. graph. The reason is simple, in BFS, we first explore all vertices which are 1 edge away
  1954. from source, then we explore all vertices which are 2 edges away from the source and
  1955. so on. This property of BFS makes it useful in many algorithms like Edmonds–Karp
  1956. algorithm.
  1957. 324. Which of the following is not a data copy/transfer instruction?
  1958. Ans. a) MOV b) PUSH c) DAS d) POP
  1959. 325. A full binary tree with n leaves contains
  1960. Ans. 2n-1 nodes
  1961. 326. Six channels, each with a 200 khz bandwidth are to be multiplexed together. what is the
  1962. minimum bandwidth requirement if each guard band is 20Khz
  1963. Ans 6*200+5*20=1300
  1964. 328. The collection of processes on the disk that is waiting to be brought into memory for
  1965. execution forms the ___________
  1966. Ans. 1 Ready queue 2 Device queue 3 Input queue 4. Priority queu
  1967. 329. Assume a relation R with keys X, Y and Z, where X, Y, and Z are sets of one or more
  1968. attributes. Also assume that Y is a subset or equal to X and Z is a subset of X and Y. Which of
  1969. the following is true for this case?
  1970. Ans .
  1971. (a) X and Y are candidate keys of R    (b) Y and Z are the candidate keys of R
  1972. (c) X is the only candidate key of R    (d) Z is the only candidate key of R
  1973. 330. In DMA transfers, the required signals and addresses are given by the______
  1974. Ans . a) Processor b) Device drivers c) DMA controllers d) The program itself
  1975. 331. Which of these multiplexing techniques is digital for combining several low -rate channels
  1976. into one high-rate one
  1977. Ans Time division multiplexing
  1978. 332. The part of the operating system that coordinates the activities of other program is called the
  1979. Ans.Monitor
  1980. 333. The complexity of multiplying two matrices of order m*n and n*p is
  1981. Ans.mnp
  1982. 335. Assume relations R and S with the schemas R (A, B, C) and S (B, D). Which of the
  1983. following is equivalent to r ⋈ s?
  1984. Ans. B (above is symbol of inner join)
  1985. 336. Switching the CPU to another Process requires saving state of the old process
  1986. and loading new process state is called as __________.
  1987. Ans 1 Process Blocking 2 Context Switch 3 Time Sharing 4 None of the above
  1988. 338. What are the three phases in virtual circuit switching?
  1989. Ans .Setup ,data transfer and breakdown
  1990. 339. Consider a relational table with the schema R (A, B, C). Assume that the cardinality of
  1991. attribute A is 10, B is 20, and C is 5. What is the maximum number of records R can have
  1992. without duplicate?
  1993. Ans
  1994. 341. Which of the following asymptotic notation is the worst among all?
  1995. Ans . A - Οn + 9378 B - Ο(n ^3) C– n^Ο1 D – 2^Οn
  1996. 342. Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth ?
  1997. Ans 7500 bps
  1998. 343. A half adder is implemented with XOR and AND gates. A full adder is implemented with
  1999. two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an
  2000. AND/OR gate. The propagation delay of an AND/OR gate is 1.2 microseconds. A 4-bit ripplecarry binary adder is implemented by using four full adders. The total propagation time
  2001. of this 4-bit binary adder in microseconds is ____________.
  2002. Ans. (A) 19.2 microseconds
  2003. Let us first calculate propagation delay of a single
  2004. 1 bit full adder.
  2005. Propagation Delay by n bit full adder is (2n + 2)
  2006. gate delays.
  2007. [See this for formula].
  2008. Here n = 1, so total delay of a 1 bit full adder
  2009. is (2 + 2)*1.2 = 4.8 ms
  2010. Delay of 4 full adders is = 4 * 4.8 = 19.2 ms
  2011. 344. Which of the following operator in SQL would produce the following result if applied
  2012. between two relations Employee and Department?
  2013. Eno    EName    DeptNo    DName
  2014. 111    Kumar    100    Sales
  2015. 222    Steve    200    Finance
  2016. Null    Null    300    Admn
  2017. 244    Meera    400    Mktg
  2018. Ans.Outer join
  2019. 345. Virtual memory is __________.
  2020. Ans . 1 An extremely large main memory
  2021. 2 An extremely large secondary memory
  2022. 3 An illusion of extremely large main memory
  2023. 4 A type of memory used in super computers.
  2024. 346. The postfix expression of the given infix expression a+b*c+(d*e+f)*g is
  2025. Ans.abc*+(de*f+)g*+
  2026. 347. Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the
  2027. subnet address ?
  2028. Ans 201.14.78.64
  2029. 351.
  2030. Consider a disk with following specification; sector size - 512 bytes, tracks per surface - 2000, sectors per track - 60, double-sided platters - 4, and average seek time - 20 msec. For a 5400 rpm hard disk for one revolution, if a single track of data can be transferred, then what is the transfer rate? – Ans. 2792 Kbytes per sec.
  2031. 352.
  2032. If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission before division ? Ans. 111111000
  2033. If divisor is n bit long then we add (n-1) no of 0's in the data unit before division
  2034. so here divisor is  1010 hence 3  0's are added in data unit so ans will be  111111000
  2035. 353.
  2036. We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is Ans. 4
  2037. 354.
  2038. How many address bits are needed to select all memory locations in the 16K × 1 RAM?Ans. 14
  2039. 355.
  2040. _________ register keeps track of the instructions stored in program stored in memory. Ans. PC (Program Counter)
  2041. 356.
  2042. The output after second iteration of the sorting technique is given below. Identify the technique used 23 45 78 8 32 56 Ans. Bubble sort
  2043. 357.
  2044. Assume that a table CUSTOMER has 10000 records. If the block size 1024 bytes and the record size is 80 bytes, how many records can be stored in each block to achieve maximum performance and how many blocks are required to store the entire table?
  2045. 358.
  2046. which type of EM waves are used for unicast communication such as cellular telephones, satellite networks and wireless LANS. Ans.radio waves
  2047. 359.   
  2048. 1024 bit is equal to how many byte Ans. 128
  2049. 360.
  2050. Consider a relation R (A, B, C, D, E) with set of functional dependencies F = {ABC, CDE, BD, EA}. Which of the following is one of the candidate keys of R?  Ans. - A, E, CD, and BC
  2051. 361.
  2052. A method which creates the problem of secondary clustering is Ans. - Quadratic Probing(secondary clustering means less severe clustering)
  2053. REFER NET.
  2054. 362.
  2055. The technique, for sharing the time of a computer among several jobs, which switches jobs so rapidly such that each job appears to have the computer to itself, is called Ans. Time sharing
  2056. 363.
  2057. In stop and wait ARQ, the sequence numbers are generated using  Ans. - Modulo – 2 arithmetic operations
  2058. 364.
  2059. Mac Operating system is developed by which company Ans. Apple Inc.
  2060. 365.
  2061. Find the time complexity of given code snippet    
  2062. for(int i=1;i<=n;i++)
  2063.         for(int j=1;j<=n;j*=2)
  2064.                    Printf(“*”);
  2065. ANS: n*log n
  2066. 366.
  2067. How many ways are present in 4-way set associative cache of 16 sets?
  2068. 367.
  2069. Given R = ABCDEFGH and set of functional dependencies F = {BHC, BHF, EF, AD, FA, BHE, CE, FD}, which of the following is redundant set of functional dependencies?
  2070. 368.
  2071. Which of these is true for go-back-N protocol, if m is the size of sequence number field , Ans. -  ‘m’ should be greater than or equal to the sum of sender and reciever window size
  2072. PDF
  2073. Which of these is true for go-back-N protocol, if m is the size of sequence number field
  2074. Ans
  2075. A.    size of send window must be less than 2m and size of receiver window
  2076. must be 1
  2077. B.    size of send window must be greater than 2m and size of receiver window must be
  2078. 1
  2079. C.    size of send window must be less than 2m and size of receiver window must be 2m
  2080. D.    size of send window must be greater than 2m and size of receiver window must be
  2081. 2m
  2082. ANS: A
  2083. 369.
  2084. RS flip-flops are also called Ans. -  RS Latch
  2085. 370.
  2086. In the running state,  Ans. - only the process which has control of the processor is found
  2087. 371.
  2088. void Function(int n)
  2089. {
  2090. int i, count =0;;
  2091. for(i=1; i*i<=n; i++)
  2092. count++;
  2093. }
  2094. The time complexity of the above code snippet is
  2095. ANS: Log N
  2096. 372.
  2097. Consider the entities customer (customer-name, customer-city,customer-street) and account( account-no,balance) with following relationship
  2098. If depositor is a one-to-many relationship from account to customer, then this ER diagram can be reduced to which of the following relational schemas?
  2099. 373.
  2100. To guarantee the detection of up to s errors in all cases, the minimum Hamming distance in a block code must be   Ans. -  2s+1
  2101. 374.
  2102. The conjunctive selection operation σθ1∧θ2 (E) is equivalent to   Ans. - σθ1(σθ2 (E))
  2103. 375.
  2104. The 1-address instructions for a=b*c + d is
  2105. REFER: https://www.iare.ac.in/sites/default/files/PPT/CO%20Lecture%20Notes.pdf
  2106. 376.
  2107. A critical region is Ans. -  a set of instructions that access common shared resource which exclude one another in time
  2108. 377.
  2109. Consider this binary search tree:
  2110.        14
  2111.       /  \
  2112.      2    16
  2113.     / \  
  2114.    1   5
  2115.       /  
  2116.      4   
  2117. Suppose we remove the root, replacing it with something from the left
  2118. 378.
  2119. Which of the following is not used for synchronization?   Ans. - Thread / pipe / Socket  (Semaphore is used for Synchronization)
  2120. 379.
  2121. What is maximum throughput for slotted ALOHA ? Ans. - 0.184 when G=1/2
  2122. 380.
  2123. While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is Ans.- 67
  2124. 381.
  2125. The number of inputs, minterms in full adder is
  2126. Ans: 3
  2127. 382
  2128. Which of the following concurrency control mechanisms insist unlocking of all read and write locks of transactions at the end of commit?
  2129. Ans .
  2130. (a) Strict 2 Phase Locking    (b) Simple 2 Phase Locking
  2131. (c) Timestamp ordering    (d) Rigorous 2 Phase Locking
  2132. ANS: D
  2133. 383.
  2134. The main function of dispatcher is: is assigning ready process to the CPU.
  2135. Another component that is involved in the CPU-scheduling function is the dispatcher,which is the module that gives control of the CPU to the process selected by the short-term scheduler. It receives control in kernel mode as the result of an interrupt or system call
  2136. 384.
  2137. A complex low pass signal has a bandwidth of 100kHz. What is the minimum sampling rate for this signal Ans. –
  2138. The bandwidth of a low-pass signal is between 0 and f, where f is the maximum frequency in the signal. Therefore, we can sample this signal at 2 times the highest frequency (100 kHz). The sampling rate is therefore 200,000 samples per second.
  2139. 385
  2140. Which of the following sorting algorithms has the lowest worst-case complexity? Merge Sort
  2141. 386.
  2142. The process of analyzing the given relation schemas based on their functional
  2143. dependencies is known as  Normalization
  2144. 387.
  2145. The major difference between a moore and mealy machine is that
  2146. In a Mealy machine, instead, it is associated to both a state and a specific input. Moore machine output is a function only of the state of the machine, Mealy machine output is a function of the state of the machine and its inputs.
  2147. 388.
  2148. Consider n processes sharing the CPU in a round robin fashion. Assume that the context switch takes s seconds. What must be the quantum q such that the overhead of context switching is minimized and at same time each process is getting guaranteed execution on the CPU atleast once in every t seconds? Ans. – q  ≤  t−ns/n−1
  2149. 389.
  2150. What is the difference between CSMA/CD and ALOHA?
  2151. Ans .
  2152. A.    frame transmission
  2153. B.    Addition of persistence process
  2154. C.    Jamming signal
  2155. D.    All of the above
  2156. ANS: D
  2157. Main difference between Aloha and CSMA is that Aloha protocol does not try to detect whether the channel is free before transmitting but the CSMA protocol verifies that the channel is free before transmitting data. Thus CSMA protocol avoids clashes before they happen while Aloha protocol detects that a channel is busy only after a clash happens. Due to this, CSMA is more suitable for networks such as Ethernet where multiple sources and destinations use the same channel.
  2158. 390.
  2159. Which one of the following is the recurrence equation for the worst case time complexity of
  2160. the Quicksort algorithm for sorting n(≥ 2) numbers? In the recurrence equations given in the
  2161. options below, c is a constant.
  2162. (A) T(n) = 2T (n/2) + cn
  2163. (B) T(n) = T(n – 1) + T(0) + cn
  2164. (C) T(n) = 2T (n – 2) + cn
  2165. (D) T(n) = T(n/2) + cn
  2166. ANS: B
  2167. 391.
  2168. What operator performs pattern matching? Ans. LIKE
  2169. 392.
  2170. X=1010100 and Y=1000011 using 2's complement X-Y is Ans. 10001
  2171. Q.Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X
  2172. -Y and (b) Y - X using 2’s complements.
  2173. a) X = 1010100
  2174. 2’s complement of Y = + 0111101
  2175. --------------
  2176. Sum = 10010001
  2177. Discard end carry
  2178. Answer: X - Y = 0010001
  2179. b) Y = 1000011
  2180. 2’s complement of X = + 0101100
  2181. ---------------
  2182. Sum = 1101111
  2183. There is no end carry,
  2184. Therefore the answer is Y-X = -(2’s complement of 1101111) = -0010001
  2185. 393.
  2186. If user A wants to send an encrypted message to user B. The plain text of A is encrypted with the Ans. - public key of  user B
  2187. 394.
  2188. A heap memory area is used to store the dynamic memory allocation
  2189. 395.
  2190. Identify the minimal key for relational scheme R(A, B, C, D, E) with functional
  2191. dependencies F = {A → B, B → C, AC → D}
  2192. ANS: Maybe AC
  2193. 396.
  2194. What is the content of Stack Pointer (SP)?  Ans. -  Address of the top element of the stack
  2195. 397.
  2196. Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?  Ans. -  3
  2197. 398.
  2198. The minimum number of JK flip-flops required to construct a synchronous counter with the count sequence (0, 0, 1, 1, 2, 2, 3, 3, 0, 0,…) is ________
  2199. (A) 0
  2200. (B) 1
  2201. (C) 2
  2202. (D) 3
  2203. Answer: (D)
  2204. Explanation: Count sequence they are saying is :
  2205. 00, 00, 01, 01, 10, 10, 11, 11
  2206. We can see repeated sequence above. So two bits will not be sufficient, we need atleast three flip flops.
  2207. So, answer is 3.
  2208. Ans. - 3
  2209. 399.
  2210. For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to Ans. 2E
  2211. 400.
  2212. The best normal form of relation scheme R (A, B, C, D) along with the set of functional dependencies F = {AB →C, AB → D, C → A, D → B} is Ans. - Third Normal form
  2213. 401.
  2214. Programs tend to make memory accesses that are in proximity of previous access this is called -    ANS: spatial locality
  2215. 402.
  2216. ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue. ANS: long term scheduler
  2217. 403.
  2218. Which of the following disk seek algorithms would be the best choice to implement in a system that services an average of 5 disk requests per second? ANS: SSTF
  2219. 404.
  2220. What happens to destination address in the header of a packet in a datagram network ?
  2221. ANS: Remains Same
  2222. 405.
  2223. ___________ mechanism is used for converting a weak entity set into
  2224. strong entity set in entity-relationship diagram ANS: adding suitable attributes
  2225. 406.
  2226. Mnemonic codes and variable names are used in ANS: ALP(Assembly language program)
  2227. 407.
  2228. Time required to merge two sorted lists of size m and n, is   0(m+n)
  2229. 408.
  2230. Division operation is ideally suited to handle queries of the type:
  2231. ANS: customers who have account at all branches
  2232. 409.
  2233. Bayone-Neill-Concelman(BNC) connectors are used with which type of cables ANS: COAXIAL Cables
  2234. 410.
  2235. _________ register keeps track of the instructions stored in program stored in memory. ans: program counter
  2236. 411.
  2237. What data structure is used for depth first traversal of a graph? ANS: stack
  2238. 412.
  2239. Which of the following disk seek algorithms has the most variability in response time?
  2240. C-LOOK has an average response time just a few percent higher than LOOK but that C-LOOK has a significantly lower variance in response time for medium and heavy workloads
  2241. 413.
  2242. Graph traversal is different from a tree traversal, because
  2243. ANS: there can be a loop in the graph
  2244. 414.
  2245. Which of the following instructions should be allowed only in Kernel Mode?
  2246. ANS: all
  2247. Which of the following instructions should be allowed only in kernel mode?
  2248. a.   disable all interrupts
  2249. b.   read the time of day clock
  2250. c.   set the time of day clock
  2251. d.   change the memory map
  2252. a.   Kernel mode only. Obvious
  2253. b.   Doesn't need to be done only in kernel mode
  2254. c.   Needs to be done only in kernel mode otherwise, a job could set the clock back to increase its processor time slice (among other things)
  2255. d.   Kernel mode only. Obvious
  2256. 415.
  2257. A clustering index is created when _______.
  2258. a)primary key is declared and ordered b)no key ordered
  2259. c)foreign key ordered d)there is no key and no order
  2260. ANS: C
  2261. 416.
  2262. One operation that is not given by magnitude comparator
  2263. A.   equal
  2264. B.   less
  2265. C.   greater
  2266. D.   addition
  2267. ANS: D
  2268. 417.
  2269. In TDM Data rate management is done by which of these strategies
  2270. A.   Multilevel multiplexing
  2271. B.   Multi-slot allocation
  2272. C.   Pulse stuffing
  2273. D.   all of the above
  2274. View/Hide Ans   
  2275. Correct Answer is d
  2276. 418.
  2277. Which of these is correct for synchronous Time Division Multiplexing
  2278. A.       Data rate of link is n times faster and the unit duration is n times longer
  2279. B.   Data rate of link is n times slower and the unit duration is n times shorter
  2280. C.   Data rate of link is n times slower and the unit duration is n times longer
  2281. D.   Data rate of link is n times faster and the unit duration is n times shorter
  2282. View/Hide Ans   
  2283. Correct Answer is d
  2284. 419.
  2285. Re-balancing of AVL tree costs ANS: O(Log n)
  2286. 420.
  2287. Supervisor call transfers control to supervisor program
  2288. 421.
  2289. After fetching the instruction from the memory, the binary code of the
  2290. instruction goes to ANS: ACC
  2291. 422.
  2292. Consider a B+ tree in which the search Answer is 12 bytes long, block size is 1024 bytes,record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is
  2293. ANS: 50 .
  2294. 423.
  2295. Table that is not a part of asynchronous analysis procedure
  2296. A. Ans . transition table
  2297. B. state table
  2298. C. flow table
  2299. D. excitation table
  2300. ANS: excitation table
  2301. 424.
  2302. How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4}
  2303. ANS: 4
  2304. 425.
  2305. In communication satellite, multiple repeaters are known as?
  2306. ANS: Transponders
  2307. Next
  2308. 426.
  2309. Paging suffer from
  2310. ANS: internal fragmentation
  2311. 427.
  2312. This Key Uniquely Identifies Each Record
  2313. ANS: primary key
  2314. 428.
  2315. Error detection at the data link layer is achieved by?
  2316. ANS: cyclic redundancy code
  2317. 429.
  2318. _________ register keeps track of the instructions stored in program stored in
  2319. memory.
  2320. ANS: program counter
  2321. 430.
  2322. Which of the following provides interface (UI) between user and OS
  2323. ANS: Shell
  2324. 431.
  2325. The O notation in asymptotic evaluation represents
  2326. ANS: Time complexity
  2327. 432.
  2328. Which of the following is not a function of a DBA?
  2329. ANS: Network maintenance
  2330. 433.
  2331. Recursion uses more memory space than iteration because
  2332. ANS: Every recursive call has to be stored
  2333. 434.
  2334. Assume a relation R with keys X, Y and Z, where X, Y, and Z are sets of one or more attributes. Also assume that Y is a subset or equal to X and Z is a subset of X and Y. Which of the following is true for this case?
  2335. ANS: X is only candidate key of R
  2336. 435.
  2337. Baud means?
  2338. ANS: rate at which signal changes
  2339. 436.
  2340. A group of bits that tell the computer to perform a specific operation is known as
  2341. ANS: Instruction code
  2342. 437.
  2343. What is a shell ?
  2344. ANS: User interface for access to OS services   
  2345. 438.
  2346. A system has a resource ‘Z’ with 20 instances; each process needs 5 instances to complete its execution. What is the minimum process in the system that may cause deadlock?
  2347. 439.
  2348. You have 10 users plugged into a hub running 10Mbps half-duplex. There is a server connected to the switch running 10Mbps half-duplex as well. How much bandwidth does each host have to the server?
  2349. ANS: 10 MBPS
  2350. In the above question hub is the state of half duplex at a time one user can only send the data or receive the data. So user gets 10mbps bandwidth.
  2351. 440.
  2352. We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is
  2353. ANS: 4 f/f
  2354. 441.
  2355. The constraint ?primary key cannot be null? is called as?
  2356. ANS: Entitiy integrity constraint
  2357. 442.
  2358. A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:
  2359. ANS: 10, 8, 7, 3, 2, 1, 5
  2360. 443.
  2361. A station in a network forwards incoming packets by placing them on its shortest output queue. What routing algorithm is being used?
  2362. ANS: Hot potato routing
  2363. 444.
  2364. In Multi-Processing Operating Systems:
  2365. Ans.a)Maximum utilization of CPU can be achieved b)Maximum throughput is achieved
  2366. c)Maximum security can be achieved d)Not suitable for Real Time Applications
  2367. AnS: A
  2368. In Multi-Processing Operating Systems:
  2369. Multiprocessing sometimes refers to executing multiple processes (programs) at the same time. This might be misleading because we have already introduced the term “multiprogramming” to describe that before.
  2370. In fact, multiprocessing refers to the hardware (i.e., the CPU units) rather than the software (i.e., running processes). If the underlying hardware provides more than one processor then that is multiprocessing.
  2371. ANS: Two or more cpu's are used
  2372. 445.
  2373. A circuit produces 1's complement of the input word, one application is binary subtraction. It is called
  2374. A.
  2375. Logic gate
  2376. B.
  2377. Register
  2378. C.
  2379. Multiplexer
  2380. D.
  2381. BCD convertor
  2382.     Answer  Report  Discuss
  2383.    Option: B
  2384. 446.
  2385. The cartesian product ,followed by select is equivalent to
  2386. ANS: Join
  2387. 447.
  2388. Assume that a mergesort algorithm in the worst case takes 30 second for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?
  2389. Time complexity of merge sort is Θ(nLogn)
  2390. c*64Log64 is 30
  2391. c*64*6 is 30
  2392. c is 5/64
  2393. For time 6 minutes
  2394. 5/64*nLogn = 6*60
  2395. nLogn = 72*64 = 512 * 9
  2396. n = 512.
  2397. ANS: 512
  2398. 448.
  2399. Consider the virtual page reference string
  2400. 1,2,3,2,4,1,3,2,4,1
  2401. on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then
  2402. ANS: OPTIMAL < FIFO < LRU
  2403. 449.
  2404. If  a , b , c, are three nodes connected in sequence in a singly linked list, what is the  statement to be added to change this into a circular linked list?
  2405. 450.
  2406. In a digital counter circuit feedback loop is introduced to
  2407. ANS:reduce the number of input pulses to reset the counter
  2408. 451.
  2409. The Internet Control Message Protocol (ICMP)
  2410. 452.
  2411. A data dictionary does not provide information about
  2412. ANS: the size of the disk storage device
  2413. 453.
  2414. How many illegitimate states has synchronous mod-6 counter ?
  2415. ANS:3
  2416. 454.
  2417. Which scheduling policy is most suitable for a time-shared operating system? 
  2418. ANS: Round Robin
  2419. NAME – KAVINDRA SINGH
  2420. SLOT NO. – 10
  2421. QUES 451 TO 500
  2422. Q451.
  2423. The Internet Control Message Protocol (ICMP)?(QUESTION NOT EXPLAINED)?
  2424. ANS :-is an error-reporting protocol,creates and sends messages to the source IP address indicating that a gateway to the Internet that a router, service or host cannot be reached for packet delivery. Any IP network device has the capability to send, receive or process ICMP messages.
  2425. Q452.   
  2426. A data dictionary does not provide information about
  2427. Ans.
  2428. - Where data is located
  2429. - Size of storage disk
  2430. - Who owns or is responsible for data
  2431. - How data is used
  2432. ANS : Size of storage disk
  2433. Q453.
  2434.   How many illegitimate states has synchronous mod-6 counter ?
  2435. Ans  3.
  2436. Q454.
  2437. Which scheduling policy is best suited for time-sharing operating systems
  2438. •   Shortest job first
  2439. •   Round robin
  2440. •   First come first serve
  2441. •   Elevator
  2442. Ans Option B
  2443. Q455.
  2444. Which of the following RDBMS does not incorporate relational algebra?(as options not provided these all can be the answers.)
  2445. Ans :-Select,Project(where),Union,Set different,Cartesian product,Rename(Thes are incorporated)
  2446. Q456
  2447. Which of the following technique is used for fragment?
  2448. A. a technique used in best-effort delivery systems to avoid endlessly looping packets
  2449. B. a technique used by protocols in which a lower level protocol accepts a message from a higher level protocol and places it in the data portion of the low level frame
  2450. C. one of the pieces that results when an IP gateway divides an IP datagram into smaller pieces for transmission across a network that cannot handle the original datagram size
  2451. D. All of the above
  2452. E. None of the above
  2453. Answer: Option C
  2454. Q457.
  2455. For the array (77 ,62,114,80,9,30,99), write the order of the elements after two passes using the Radix sort
  2456. Ans. 09,114,30,62,77,80,99.
  2457. Q458.
  2458. Round robin scheduling is essentially the preemptive version of ________.
  2459. 1 FIFO
  2460. 2 Shortest job first
  2461. 3 Shortes remaining
  2462. 4 Longest time first
  2463. Ans ) 1 FIFO
  2464. Q459.
  2465. A ring counter is same as
  2466. ANS: circular shift register.
  2467. Q460.
  2468. Which of these is asymptotically bigger? lg(lg* n) or lg*(lg n)
  2469. Ans :lg*(lg n) is asymptotically larger.
  2470. Q461.
  2471. Which of the following is not a property of DBMS?
  2472. A). INCREASE DATE REDUNDONCY.
  2473. B).INTERGRATION OF DATA.
  2474. C).IMPROVED IN SECURITY.
  2475. D).ACHIEVING DATA INDEPENDENCE,
  2476. Ans A ). INCREASE DATE REDUNDONCY.
  2477. Q462.   
  2478. Q   When you ping the loopback address, a packet is sent where?
  2479. A. On the network
  2480. B. Down through the layers of the IP architecture and then up the layers again
  2481. C. Across the wire
  2482. D. through the loopback dongle
  2483. E. None of the above
  2484. Answer: Option B(forms a loop)
  2485. Q463.
  2486. In which category does the discrepancy between duplicate records belong?
  2487. Q464.   
  2488. The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42.
  2489. Which one of the following is the postorder traversal sequence of the same tree?
  2490. ANS 15, 10, 23, 25, 20, 35, 42, 39, 30
  2491. 465.
  2492. A sequential circuit outputs a ONE when an even number (> 0) of one's are input; otherwise
  2493. the output is ZERO. The minimum number of states required is
  2494. Ans.2
  2495. 466.
  2496. Which of the following devices assigns IP address to devices connected to a network that uses TCP/IP?
  2497. DHCP
  2498. Server
  2499. B NIC
  2500. C Gateway
  2501. D Hub
  2502. ANS DHCP  DHCP (Dynamic Host Configuration Protocol
  2503. 467.
  2504. In the blocked state
  2505. Ans .a) the processes waiting for I/O are found
  2506. b)the process which is running is found
  2507. c)the processes waiting for the processor are found
  2508. d)the process ready to execute
  2509. ANS: A
  2510. 468.
  2511. Which of the following technique is used for Time-To-Live (TTL)?
  2512. A. a technique used in best-effort delivery system to avoid endlessly looping packets.
  2513. B. a technique used by protocols in which a lower level protocol accepts a message from a higher level protocol and places it in the data portion of the low level frame
  2514. C. One of the pieces that results when an IP gateway divides an IP datagram into smaller pieces for transmission across a network that cannot handle the original datagram size.
  2515. D. All of the above
  2516. E. None of the above
  2517. Answer: Option A
  2518. 469.
  2519. The cartesian product ,followed by select is equivalent to
  2520. Ans: join
  2521. 470.
  2522. To build a mod-19 counter the number of flip-flops required is
  2523. Ans:Remember with 'n' no. of flip-flop you
  2524. can get upto max. modulo-[2^n] counter.
  2525. Therefore for modulo-19 counter
  2526. 2^5 = 32 which is greater than 19 and
  2527. 2^4 = 16 which is less than 19
  2528. Hence we require 5 F/F.
  2529. 471.
  2530. A page fault occurs
  2531. Ans when the page is in not in the memory
  2532. 472.
  2533. Data Structures and Algorithms:
  2534. In a min-heap:
  2535. Ans:Where the value of the root node is less than or equal to either of its children.
  2536. 473.
  2537. Consider the following New-order strategy for traversing a binary tree:
  2538. 1)Visit the root;
  2539. 2)Visit the right subtree using New-order;
  2540. 3)Visit the left subtree using New-order;
  2541. The New-order traversal of the expression tree corresponding to the reverse polish expression
  2542. 3 4 * 5 - 2 ? 6 7 * 1 + - is given by:
  2543. Options
  2544. (A) + – 1 6 7 * 2 ˆ 5 – 3 4 *
  2545. (B) – + 1 * 6 7 ˆ 2 – 5 * 3 4
  2546. (C) – + 1 * 7 6 ˆ 2 – 5 * 4 3
  2547. (D) 1 7 6 * + 2 5 4 3 * – ˆ –
  2548. Answer: (C) – + 1 * 7 6 ˆ 2 – 5 * 4 3
  2549. (JUST REVERSE THE GIVEN QUESTION)
  2550. 474.
  2551. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format.
  2552. The main program is loaded into memory & is executed. This type of loading is called _________
  2553. Ans dynamic linking.
  2554. 475.
  2555. You are trying to decide which type of network you will use at your office, and you want the type that
  2556. will provide communication and avoid collisions on the cable. Which of the following is the best choice?
  2557. A. Token-Ring
  2558. B. CSMA/CD
  2559. C. Ethernet
  2560. D. CSMA/CA
  2561. E. ARCnet
  2562. Answer: Option A
  2563. 476.
  2564. Which of the following is not a property of DBMS?
  2565. A). INCREASE DATE REDUNDONCY.
  2566. B).INTERGRATION OF DATA.
  2567. C).IMPROVED IN SECURITY.
  2568. D).ACHIEVING DATA INDEPENDENCE,
  2569. Ans A ). INCREASE DATE REDUNDONCY.
  2570. 477.
  2571. The number of clock pulses needed to shift one byte of data from input to the output of a 4-bit shift register is
  2572. A.
  2573. 10
  2574. B.
  2575. 12
  2576. C. 
  2577. 16
  2578. D.
  2579. 32
  2580.    Answer
  2581.    Option: C
  2582. 4*4=16.
  2583. 478.
  2584. You are working with a network that has the network ID 172.16.0.0, and you require 25 subnets for
  2585. your company and an additional 30 for the company that will merge with you within a month.
  2586. Each network will contain approximately 600 nodes. What subnet mask should you assign?
  2587. [A].    255.255.192.0
  2588. [B].    255.255.224.0
  2589. [C].    255.255.240.0
  2590. [D].    255,255.248.0
  2591. [E].    255.255.252.0   
  2592. Answer: Option E
  2593. IP belongs to class B so 255.255.0.0 mask and for that 16 bits.
  2594. Remaining bits are 16 out of 16, and now we want 600 host per subnet.
  2595. Total subnets = 25+30 = 55, 55<2^6(2^6 = 64 subnet).
  2596. So, mask becomes 1111 1111.1111 1111.1111 1100.0000 0000 for subnet.
  2597. 134.57.252.0.
  2598. 479.
  2599. _________________ constraint is specified between two relations and is used to   maintain
  2600. the consistency among tuples of the two relations
  2601. a)   key b) domain c) referential-integrity d) entity-integrity
  2602. ans: C
  2603. 480.
  2604. For non-negative functions, f(n) and g(n), f(n) is theta of g(n) if and only if
  2605. AnsA f(n) = O(g(n)) and f(n) = Ω(g(n))
  2606. Bf(n) = O(g(n)) and f(n) = o( (g(n))
  2607. C f(n) = O(g(n)) and f(n) = ω (g(n))
  2608. D f(n) = Q(g(n)) and f(n) = Ω(g(n))
  2609. 481.   
  2610. If the Disk head is located initially at 32, find the number of disk moves required with FCFS
  2611. if the disk queue of I/O blocks requests are 98,37,14,124,65,67.
  2612. 1 310
  2613. 2 324
  2614. 3 315
  2615. 4 321
  2616. Right Ans ) 4
  2617. 482.
  2618. The main difference between JK and RS flip-flop is that
  2619. A.   JK Flip-flop is faster than SR flip-flop
  2620. B.   JK flip-flop has a feedback path
  2621. C.   JK fkip-flop accepts both inputs 1
  2622. D.   none of them
  2623. ANS)C. in the JK flip-flop, both inputs can be HIGH. When both the J and K inputs are HIGH, the Q output is toggled, which means that the output alternates between HIGH and LOW. Thereby the invalid condition which occurs in the SR flipflop is eliminated.
  2624. 483.
  2625. The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting.
  2626. ANS: A solution to the critical section problem must satisfy the following three conditions: Mutual Exclusion - Only one process at a time can be executing in their critical section. ... processes cannot be blocked forever waiting to get into their critical sections
  2627. 484.
  2628. Minimum number of moves required to solve a Tower of Hanoi puzzle is
  2629. ANS: With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.
  2630. 485.
  2631. Parity bit is
  2632. ANS: a bit which acts as a check on a set of binary values, calculated in such a way that the number of 1s in the set plus the parity bit should always be even (or occasionally, should always be odd).
  2633. (hint: 0 is itself even)
  2634. 486.
  2635. Changing the conceptual schema without having to change the external schema is called as __________________
  2636. ANS: Logical Data Independence.
  2637. 487.
  2638. The sign magnitude representation of binary number + 1101.011 is
  2639. Ans:01101.011
  2640. 488.
  2641. Update operation will violate
  2642. Ans: data integrity constraints
  2643. https://www.ibm.com/support/knowledgecenter/SSEPGG_10.1.0/com.ibm.db2.luw.admin.dbobj.doc/doc/c0020153.html
  2644. 489.
  2645. When an inverter is placed between both inputs of an SR flip-flop, then resulting flip-lop is
  2646. A. JK flip-flop
  2647. B. D flip-flop
  2648. C. T flip-flop
  2649. D. Master slave JK flip-flop
  2650. E. None of the above
  2651. Answer: Option B
  2652. 490.
  2653. A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
  2654. A.
  2655. insertion sort
  2656. B.
  2657. selection sort
  2658. C.
  2659. heap sort
  2660. D.
  2661. quick sort
  2662.    Answer Report Discuss
  2663.    Option: B
  2664. 491.
  2665. Ethernet and Token-Ring are the two most commonly used network architectures in the world. Jim has heard of the different topologies for networks and wants to choose the architecture that will provide him with the
  2666. most options. Which of the following would that be? Choose the most correct answer.
  2667. A.
  2668. Token-Ring because it currently can run at both 4Mbps and 16Mbps. This means that it can be used in any topology
  2669. B.
  2670. Ethernet, because it is cabled using fiber-optic cable
  2671. C.
  2672. Token-Ring, because it uses a MAU
  2673. D.
  2674. Ethernet, because it can be set up with most topologies and can use multiple transfer speeds   
  2675. E.
  2676. Neither Token-Ring nor Ethernet is the proper choice. Only ARCnet can be used in all topologies
  2677. Answer: Option D
  2678. 492.
  2679. The problem of thrashing is effected scientifically by ________.
  2680. A.
  2681. program structure   
  2682. B.
  2683. program size
  2684. C.
  2685. primary-storage size
  2686. D.
  2687. all of the above
  2688. E.
  2689. None of the above
  2690. Answer: Option A
  2691. 493.
  2692. ---------------------is data about data
  2693. Ans:MetaData or Data dictionoary
  2694. 494.
  2695. The searching technique that takes O (1) time to find a data is
  2696. Ans:Hashing
  2697. 495.
  2698. CSMA (Carrier Sense Multiple Access) is
  2699. Ans: is a media access control (MAC) protocol in which a node verifies the absence of other traffic
  2700. before transmitting on a shared transmission medium, such as an electrical bus or a band of the electromagnetic spectrum.
  2701. 496.
  2702. Which module gives control of the CPU to the process selected by the short-term scheduler?
  2703. Ans. dispatcher
  2704. 497.
  2705. A 2 MHz signal is applied to the input of a J-K lip-lop which is operating in the 'toggle' mode.
  2706. The frequency of the signal at the output will be
  2707. ANS: 8MHz
  2708. 498.
  2709. The master slave JK lip-flop is effectively a combination of
  2710.    The master slave JK flip-flop is effectively a combination of
  2711.    A.
  2712. an SR flip-flop and a T flip-flop   
  2713. B.
  2714. an SR flip-flop and a D flip-flop
  2715. C.
  2716. a T flip-flop and a D flip-flop
  2717. D.
  2718. two T flip-flops
  2719. E.
  2720. None of the above
  2721. Answer: Option A
  2722. 499.
  2723. The main difference between synchronous and asynchronous transmission is
  2724. Ans:
  2725. The protocols for serial data transfer can be grouped into two types: synchronous and asynchronous. For synchronous data transfer, both the sender and receiver access the data according to the same clock. ... Although the difference is very small, it can accumulate fast and eventually cause errors in data transfer.
  2726. 500.
  2727. Let R be the relation on the set of positive integers such that a aRb if and only if a and b are distinct
  2728. and have a common divisor other than 1. Which one of the following statements about R is true?
  2729. (A)   R is symmetric and reflexive but not transitive
  2730. (B) R is reflexive but not symmetric and not transitive
  2731. (C) R is transitive but not reflexive and not symmetric
  2732. (D) R is symmetric but not reflexive and not transitive
  2733. Answer: (D)
  2734. Let R be a binary relation on a set A.
  2735. R is reflexive if for all x  A, xRx.
  2736. R is symmetric if for all x,y  A, if xRy, then yRx.
  2737. R is transitive if for all x,y, z  A, if xRy and yRz, then xRz.
  2738. R is an equivalence relation if A is nonempty and R is reflexive, symmetric and transitive.
  2739. 501.
  2740. The mechanism that bring a page into memory only when it is needed is called ____________demand paging
  2741. 502.
  2742. What technique is often used to prove the correctness of a recursive function? Mathematical Induction
  2743. 503.
  2744. Which of the following is a Non-linear data structure  tree or graph
  2745. 504.
  2746. ARP (Address Resolution Protocol) is 16 bit field
  2747. 505.
  2748. The command which undo the transaction is Rollback
  2749. 506.
  2750. Which directory implementation is used in most Operating System? Tree directory structure
  2751. 507.
  2752. Which of the following is not true of virtual memory?
  2753. It requires the use of a disk or other secondary storage
  2754. 508.
  2755. When two or more processes trying to execute a set of instructions and if the output depends on the order of execution of the process, this is termed as:
  2756. race condition
  2757. 509.
  2758. A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the
  2759. output bit-string after stuffing is 01111100101, then the input bit-string is  01111110101
  2760. EXPLAIN: in input after 5 consecutive 1’s, a 0 is stuffed to create output
  2761. 510.
  2762. 1.      If a sequence of push(1), push(2), pop,push(1),push(2),pop,pop,pop, push(2) pop operations are performed in a stack ,  the sequence of popped out values are
  2763. 2 2 1 1 2
  2764. 511.
  2765. Changing the conceptual schema without having to change physical schema is logical data independence
  2766. 512.
  2767. With single resource, deadlock occurs
  2768. A.   if there are more than two processes competing for that resources
  2769. B.   if there are only two processes competing for that resources
  2770. C.   if there is a single process competing for that resources
  2771. D.   none of these
  2772. ANS: D. remember starvation may occur in case A but not deadlock because in deadlock none is using resource.
  2773. 513.
  2774. How switching is performed in the internet?
  2775. Done by datagram approach to packet switching at network layer
  2776. 514.
  2777. The best index for range query is Clustered index
  2778. 515.
  2779. 1.      You are given pointer p that points to the last node in a circular list and another singly linked list whose first node is pointed to by ‘head’ and last node is pointed to by ‘tail’  has to be appended to the end of the circular list. Which of the following is correct?
  2780. 516. A system has ‘n’ processes and each process need 2 instances of a resource. There are n+1
  2781. instances of resource provided. This could:
  2782. Ans.a) lead to deadlock
  2783. b)lead to starvation & the deadlock
  2784. c)never leads to deadlock
  2785. d)leads to inconsistency
  2786. ANS: c
  2787. 517.
  2788. Which of the following is shared between all of the threads in a process? Assume a kernel level thread implementation.
  2789. File descriptors
  2790. 518.
  2791. A telephone switch is a good example of which of the following types of switches. circuit switch.
  2792. 520.
  2793. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
  2794. compared with the priority of the process running in cpu
  2795. 521.
  2796. Commit, Savepoint, Rollback are ________Transaction Control Language(TCL)
  2797. 522.
  2798.     Among the following which is not the application of  a stack? Job scheduling
  2799. 523.
  2800. R right outer join S on a=b gives
  2801. 524.   
  2802. The performance of cache memory is frequently measured in terms of a quantity called hit ratio
  2803. 525.
  2804. You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?
  2805. Delete the last element of the list
  2806. Explanation: a) Can be done in O(1) time by deleting memory and changing the first pointer.
  2807. b) Can be done in O(1) time, see push() here
  2808. c) Delete the last element requires pointer to previous of last, which can only be obtained by traversing the list.
  2809. d) Can be done in O(1) by changing next of last and then last.
  2810. 526.
  2811. Consider a system with ‘M’ CPU processors and ‘N’ processes then how many processes can be present in ready, running and blocked state at max?
  2812.   N,M,N(respectively)   
  2813. 527.
  2814. the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is
  2815. 1) Yes, Network layer does Rotuing
  2816. 2) No, Bit synchronization is provided by Physical Layer
  2817. 3) Yes, Transport layer provides End-to-end process
  2818.    communication
  2819. 4) Yes, Medium Access Control sub-layer of Data Link Layer provides
  2820.    Channel sharing.
  2821. 528.
  2822. What is the software that runs a computer, including scheduling tasks, managing storage, and handling communication with peripherals? Operating system
  2823. 529.
  2824. Which one of the following protocols is NOT used to resolve one form of address to another one?
  2825. A) DNS-host name to IP address
  2826. B) ARP - IP to MAC
  2827. D) RARP - MAC to IP
  2828. So ANSWER DHCP
  2829. 530.
  2830.     If  a , b , c, are three nodes connected in sequence in a singly linked list
  2831.         struct node *temp=a;
  2832.         while(temp!=NULL)       {
  2833.             temp=temp->next;  printf( “$”);        }
  2834. Assuming ‘c’ to be the last node, the output is
  2835. $$$
  2836. 531.
  2837. Four jobs to be executed on a single processor system arrive at time 0 in order A, B, C, and D. Their burst time requirements are 4,1,8,1 time units respectively. Find the completion of A under round robin scheduling with time slice of one time unit. 9
  2838. 532.
  2839. This user makes canned transaction naïve or end users
  2840. 533.
  2841. Buffering is useful because
  2842. Buffering is useful because:
  2843. a. It makes it seem like there is more memory in the machine
  2844. b. It allows devices and the CPU to operate asynchronously
  2845. c. It requires fewer memory copies
  2846. It allows devices and the CPU to operate asynchronously
  2847. 534.
  2848. This Key Uniquely Identifies Each Record  Primary Key
  2849. 535.
  2850. The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
  2851. UDP, TCP, UDP and TCP
  2852. For real time multimedia, timely delivery is more important than correctness. –> UDP
  2853. For file transfer, correctness is necessary. –> TCP
  2854. DNS, timely delivery is more important –> UDP
  2855. Email again same as file transfer –> TCP
  2856. 536.
  2857. For 3 page frames, the following is the reference string:
  2858. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1.
  2859. How many page faults does the FIFO page replacement algorithm produce?15
  2860. 537.
  2861. What does the code snippet given below do?
  2862. void fun1(struct node *head)
  2863. { if(head==NULL) return;
  2864. fun1(head->next);
  2865. printf("%d",head->data);
  2866. }
  2867. fun1() prints the given Linked List in reverse manner
  2868. 538.
  2869. Which of the following transport layer protocols is used to support electronic mail? TCP(transport layer) SMTP(application layer)
  2870. 539.
  2871. Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K, and 426K (in order)? Which algorithm makes the most efficient use of memory?
  2872. First-fit:
  2873. 212k -> 500K (288 left)
  2874. 417k -> 600k (183 left)
  2875. 122k -> 288k (166k left)
  2876. 426k -> nowhere big enough left! doh!
  2877. Best-fit:
  2878. 212k -> 300k (88k left)
  2879. 417k -> 500k (83k left)
  2880. 122k -> 200k (78k left)
  2881. 426k -> 600k (174k left)
  2882. Worst-fit:
  2883. 212k -> 600k (388k left)
  2884. 417k -> 500k (83k left)
  2885. 122k -> 388k (266k left)
  2886. 426k -> nowhere big enough again!
  2887. the best fit algorithms uses memory most efficiently (it's also the only one that can even put all the processes into memory!)
  2888. 540.
  2889. Which of the following is termed as reverse polish notation?  Any postfix notation
  2890. 541.
  2891. What is the main difference between traps and interrupts? How they are initiated
  2892. 542.
  2893. The following query is called as ? select * from emp where ssn in ( select dssn from dependent order by age desc ) ?; DML query
  2894. 543.
  2895. The data type describing the types of values that can appear in each column is called            ___________domain___________.
  2896. 544.
  2897. For the given infix expression a+b^c*(d-e) where ‘^’ denotes the EX-OR operator, the      
  2898.      corresponding prefix expression is ^+ab*c-de
  2899. 545.
  2900. The term P means in semaphores wait(probheer)
  2901. 546.
  2902. In one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is that?
  2903. ANS: HTTP and FTP.
  2904. SMTP: only one TCP connection
  2905. Telnet: only one TCP connection
  2906. HTTP: Multiple connections can be used for each resource
  2907. FTP: FTP uses Telnet protocol for Control info on a TCP connection and another TCP connection for data exchange
  2908. So, answer is HTTP and FTP
  2909. 547.
  2910. If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the service provided is for higher priority
  2911. 548.
  2912. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a _________ .deadlock
  2913. 549.
  2914. A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is
  2915. Number of sets = cache size / sizeof a set
  2916. Size of a set = blocksize * no. of blocks in a set 
  2917. = 8 words * 4 (4-way set-associative)
  2918. = 8*4*4 (since a word is 32 bits = 4 bytes)
  2919. = 128 bytes.
  2920. So, number of sets = 16 KB / (128 B) = 128
  2921. Now, we can divide the physical address space equally between these 128 sets. So, the number of bytes each set can access
  2922. = 4 GB / 128
  2923. = 32 MB
  2924. = 32/4 = 8 M words = 1 M blocks. (220 blocks)
  2925. So, we need 20 tag bits to identify these 220 blocks.
  2926. 550.
  2927. The query to print alternate records (i.e even numbered) from a table is
  2928. Select * from TableName where ColumnName % 2 = 0(even number)
  2929. SELECT usernameFROM (SELECT ROWNUM num, usernameFROM dba_users)
  2930. WHERE MOD (num, 2) = 0;(even number)
  2931. Select * from TableName where ColumnName % 2 = 1(odd number)
  2932. 550. The query to print alternate records (i.e even numbered) from a table is
  2933. Ans
  2934. 552. Which of the following is two way list?
  2935. Ans . A. Grounded header list
  2936. B. Circular header list
  2937. C. Linked list with header and trailer nodes
  2938. D. List traversed in two directions
  2939. 553. Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop
  2940. method. There are 3 buffers each of size equal to disk block size, out of which one buffer is
  2941. reserved for intermediate results. Assuming size(r(R))
  2942. Ans. (A) relation r(R) is in the outer loop.
  2943. (B) relation s(S) is in the outer loop.
  2944. (C) join selection factor between r(R) and s(S) is more than 0.5.
  2945. (D) join selection factor between r(R) and s(S) is less than 0.5.
  2946. Explanation:
  2947. Nested loop join is one of the methods to implement database in memory. A nested loop join is an algorithm
  2948. that joins two sets by using two nested loops.
  2949. According to nested join,given relation R and S
  2950. For each tuple r in R do
  2951. For each tuple s in S do
  2952. If r and s satisfy the join condition
  2953. Then output the tuple <r,s>
  2954. Cost estimations for the above loop:
  2955. – b(R) and b(S) number of blocks in R and in S
  2956. – Each block of outer relation is read once
  2957. – Inner relation is read once for each block of outer relation
  2958. Summing up : IO= b(R)+b(R)*b(S) total IO operations
  2959. Lets assume |R|>|S| i.e b(R) =10 and b(s) =3
  2960. Now, if R is outer relation then, IO= 10+10*3=40
  2961. if S is outer relation then IO=3+10*3=33
  2962. As it can be observed , that total IO is lesser if the value of outer variable is less and as it is already given
  2963. that |R|<|S|.Therefore, Relation r(R) should be in the outer loop to have fewer number of disk block
  2964. accesses.
  2965. References:
  2966. 555. In an Ethernet local area network, which one of the following statements isTRUE?
  2967. Ans. (A) A station stops to sense the channel once it starts transmitting a frame.
  2968. (B) The purpose of the jamming signal is to pad the frames that are smaller than the
  2969. minimum frame size.
  2970. (C) A station continues to transmit the packet even after the collision is detected.
  2971. (D) The exponential backoff mechanism reduces the probability of collision on
  2972. retransmissions
  2973. Explanation:
  2974. An Ethernet is the most popularly and widely used LAN network for data transmission.
  2975. It is a protocol of data link layer and it tells how the data can be formatted to transmit and
  2976. how to place the data on network for transmission.
  2977. 556. A circularly linked list is used to represent a Queue. A single variable p is used to access the
  2978. Queue. To which node should p point such that both the operations enQueue and deQueue can be
  2979. performed in constant time?
  2980. Ans (A) rear node (B) front node (C) not possible with a single pointer (D) node next to
  2981. front
  2982. 557. In the process state transition diagram, the transition from the READY state to the
  2983. RUNNING state indicates that:
  2984. Ans.
  2985. a. A process was pre-empted by another process
  2986. b. A process has blocked for a semaphore or other operation
  2987. c. A process is done waiting for an I/O operation
  2988. d. A process was just created
  2989. 558. If a sequence of enque(1), enque (2), deque, enque (1), enque (2), deque, deque, deque,
  2990. enque (2) operations are performed in a queue , the list of elements that would have been
  2991. processed are
  2992. Ans
  2993. 559. Which of the following is not true about segmented memory management?
  2994. Ans.
  2995. a. Segment length must be a multiple of the page size
  2996. b. Segmentation allows multiple linear address space in one process
  2997. c. Segmentation can be used with paging to keep segments partially resident in memory
  2998. d. A segment can be read-only for one process and read-write for another
  2999. 560. The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first
  3000. stage (with delay 800 picoseconds) is replaced with a functionally equivalent design involving
  3001. two stages with respective delays 600 and 350 picoseconds. The throughput increase of the
  3002. pipeline is percent.
  3003. Ans . A) 33 or 34
  3004. (B) 30 or 31
  3005. (C) 38 or 39
  3006. (D) 100
  3007. Explanation:
  3008. Throughput of 1st case T1: 1/max delay =1/800
  3009. Throughput of 2nd case T2: 1/max delay= 1/600
  3010. %age increase in throughput: (T2-T1)/T2
  3011. = ( (1/600) - (1/800) ) / (1/800)
  3012. = 33.33%
  3013. 564.In a circular list with 5 nodes, let ‘temp’ point to the 4th node at present.
  3014. int i;
  3015. for(i=0;i<4;i++)
  3016. temp=temp->next;
  3017. The above code will make ‘temp’ point to
  3018. Ans.
  3019. 565. IEEE 802.5 is a
  3020. Ans.Token ring   _______________
  3021. 566. R has n tuples and S has m tuples, then the Cartesian product of R and S will
  3022. produce
  3023. Ans.   ___________ tuples.
  3024. 567. Which one of the following fields of an IP header is NOT modified by a typical IP router?
  3025. Ans. (A) Checksum
  3026. (B) Source address
  3027. (C) Time to Live (TTL)
  3028. (D) Length
  3029. Explanation: Length and checksum can be modified when IP fragmentation
  3030. happens. Time To Live is reduced by every router on the route to destination.
  3031. Only Source Address is what IP address can not change SO B is the answer.
  3032. 568. When a program tries to access a page that is mapped in address space but not loaded in
  3033. physical memory, then
  3034. Ans. a) segmentation fault occurs b) fatal error occurs c) page fault occurs d)no error occurs
  3035. 569. Minimal super key of a relation is called _______________
  3036. Ans .Primary Key
  3037. 570. The main advantage of DMA is that it
  3038. Ans .
  3039. a. Increases system performance by increasing concurrency
  3040. b. Allows the CPU to run faster
  3041. c. Reduces the traffic on the data bus
  3042. d. Removes the requirement that transfers be properly aligned
  3043. 571. For what value of c1 and c2 , the theta notation of f(n)=5n2+3n+2 is n2?
  3044. Ans
  3045. 573. A typical hard drive has a peak throughput of about
  3046. Ans .
  3047. a. 2 x 105 bytes per second
  3048. b. 2 x 106 bytes per second
  3049. c. 2 x 107 bytes per second
  3050. d. 2 x 108 bytes per second
  3051. 574. Consider a dynamic queue with two pointers: front and rear. What is the time needed to
  3052. insert an element in a queue of length of n?
  3053. Ans .O(1)
  3054. 575. Consider a relation R (A, B, C, D, E) with set of functional dependencies F = {A¿BC,
  3055. CD¿E, B¿D, E¿A}. Which of the following is one of the candidate keys of R?
  3056. Ans
  3057. 581. Which sorting technique uses a data structure similar to the one used in bucket hashing?
  3058. Ans .Radix
  3059. 582. __________is the description of the database
  3060. Ans Schema
  3061. 583. Which of these would not be a good way for the OS to improve battery lifetime in a laptop?
  3062. Ans .a)Shut down the hard drive until it’s needed
  3063. b)Reduce the processor speed while it’s idle
  3064. c)Turn off power to the memory
  3065. d)Shut down the modem when it’s not connected
  3066. 584. Identify the correct sequence in which the following packets are transmitted on the network
  3067. by a host when a browser requests a webpage from a remote server, assuming that the host has
  3068. just been restarted.
  3069. Ans . (A) HTTP GET request, DNS query, TCP SYN
  3070. (B) DNS query, HTTP GET request, TCP SYN
  3071. (C) DNS query, TCP SYN, HTTP GET request
  3072. (D) TCP SYN, DNS query, HTTP GET request
  3073. Explanation: Step 1 : Whenever the client request for a webpage, the query is made in
  3074. the form say www.geeksforgeeks.org.
  3075. As soon as the query is made the server makes the DNS query to identify the Domain
  3076. Name Space. DNS query is the process to identify the IP address of the DNS such as
  3077. www.org. The client’s computer will make a DNS query to one of its internet service
  3078. provider’s DNS server.
  3079. Step 2 : As soon as DNS server is located a TCP connection is to be established for the
  3080. further communication. The TCP protocol requests the server to establishing a connection
  3081. by sending a TCP SYN message. Which is further responded by the server using SYN_
  3082. ACK from server to client and then ACK back to server from client (3- way hand shaking
  3083. protocol).
  3084. Step 3 : Once the connection has been established the HTTP protocol comes into picture.
  3085. It requests for the webpage using its GET method and thus, sending an HTTP GET
  3086. request.
  3087. Hence, the correct sequence for the transmission of packets is
  3088. DNS query, TCP SYN, HTTP GET reques
  3089. 585. On adopting shell sort technique, the output of the array (21,62,14,9,30,77,80,25) after a
  3090. pass with increment size =3, is
  3091. Ans a) 9 30 14 21 25 77 80 62 b) 9 25 14 21 30 77 80 62
  3092. c) 9 14 21 25 30 62 77 80 d) the same array
  3093. 586. Which of the following is not included in an inode in Linux?
  3094. Ans.a)File owner b)File name c)File modification date d)Pointer to the first data block
  3095. 587. The DMA controller has _______ registers
  3096. Ans a) 4 b)2 c)3 d)1
  3097. 590. An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an
  3098. IPpacket of size 4404 bytes with an IP header of length 20 bytes. The values of the
  3099. relevant fields in the header of the third IP fragment generated by the router for this packet are
  3100. Ans . A) MF bit: 0, Datagram Length: 1444; Offset: 370
  3101. (B) MF bit: 1, Datagram Length: 1424; Offset: 185
  3102. (C) MF bit: 1, Datagram Length: 1500; Offset: 37
  3103. (D) MF bit: 0, Datagram Length: 1424; Offset: 2960
  3104. Explanation:
  3105. Number of packet fragments = ⌈ (total size of packet)/(MTU) ⌉
  3106. = ⌈ 4404/1500 ⌉
  3107. = ⌈ 2.936 ⌉
  3108. = 3
  3109. So Datagram with data 4404 byte fragmented into 3 fragments.
  3110. The first frame carries bytes 0 to 1479 (because MTU is 1500 bytes and HLEN is 20 byte
  3111. so the total bytes in fragments is maximum 1500-20=1480). the offset for this datagram
  3112. is 0/8 = 0.
  3113. The second fragment carries byte 1480 to 2959. The offset for this datagram is 1480/8 =
  3114. 185.finally the third fragment carries byte 2960 to 4404.the offset is 370.and for all
  3115. fragments except last one the M bit is 1.so in the third bit M is 0
  3116. 591. One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the
  3117. following statements best explains the need for this field?
  3118. Ans . (A) It can be used to priortize packets
  3119. (B) It can be used to reduce delays
  3120. (C) It can be used to optimize throughput
  3121. (D) It can be used to prevent packet looping
  3122. Time to Live can be thought as an upper bound on the time that an IP datagram can exist
  3123. in the network. The purpose of the TTL field is to avoid a situation in which an
  3124. undeliverable datagram keeps circulating.
  3125. 592. Time complexity of the program to generate Fibonacci sequence is
  3126. Ans .O(n)
  3127. 593. A Program Counter contains a number 825 and address part of the instruction contains the
  3128. number 24. The effective address in the relative address mode, when an instruction is read from
  3129. the memory is
  3130. Ans
  3131. (A) 849.    (B) 850.
  3132. (C) 801.    (D) 802.
  3133. 595. What is the correct HTML for making a hyperlink?
  3134. Ans a) <a href=”http:// mcqsets.com”>ICT Trends Quiz</a>
  3135. b) <a name=”http://mcqsets.com”>ICT Trends Quiz</a>
  3136. c) <http://mcqsets.com</a>
  3137. d) url=”http://mcqsets.com”>ICT Trends Quiz
  3138. 597.While applying Quick sort technique for the array 5 4 3 8 12 6 10 1 7 9, if pivot =5, after the
  3139. first traversal on both sides, ‘l’ and ‘r’ will be
  3140. Ans
  3141. 598. The <big> tag makes
  3142. Ans .Makes text bigger than normal
  3143. 599. Which one of the following is NOT a part of the ACID properties of database transactions?
  3144. Ans . Transaction in a database system must maintain Atomicity, Consistency, Isolation,
  3145. and Durability - commonly known as ACID properties - in order to ensure accuracy,
  3146. completeness, and data integrity
  3147. 601.Which of following property returns the window object generated by a frame object
  3148. Ans. contentWindow
  3149. 602.A layer -4 firewall (a device that can look at all protocol headers up to the transport layer) CANNOT
  3150. Ans. Block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00AM
  3151. 603.What is the unique characteristic of RAID 6 ?
  3152. Ans. Two independent distributed parity.
  3153. 604.Foreign key is a subset of primary key is stated in _____________ constraint
  3154. Ans. Group by
  3155. 605. If a[] is the array containing the elements to be sorted using radix sort, during the second iteration in which the second Least Significant Digit is considered, row number in 2D array to which an element has to be stored is given by
  3156. Ans. Least significant bit
  3157. 606.Which of the following address modes calculate the effective address as
  3158. address part of the instruction) + (content of CPU register)
  3159. Ans. Indirect Address Mode
  3160. 607.A telephone switch is a good example of which of the following types of switches.
  3161. Ans.Circuit
  3162. 608.If  a , b , c, d are four nodes connected in sequence in a doubly-linked list
  3163.         Struct node *temp=a;
  3164.          Temp=temp->next;
  3165.           (Temp->next)->prev=temp->prev;
  3166.            (Temp->prev)->next=temp->next;    Which of the following is true?
  3167. Ans.
  3168. 609.Which component of a database is used for sorting?
  3169. Ans, Procedure / group by
  3170. 610.What is the output of following JavaScript code: Knowledge base software
  3171. Ans.  no
  3172. 611.  If message in Segmentation and Reassembly sublayer of AAL3/4 has value of Segment type 11, then it is a
  3173. A.   Initiation of message
  3174. B.   ending message
  3175. C.   single-segment message
  3176. D.   multi-segment message
  3177. Answer : C
  3178. 612.Consider the following relation
  3179. Cinema (theater, address, capacity)
  3180. Which of the following options will be needed at the end of the SQL query
  3181. SELECT P1. address
  3182. FROM Cinema P1
  3183. Such that it always finds the addresses of theaters with maximum capacity?
  3184. (A) WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)
  3185. (B) WHERE P1. Capacity> = Any (select P2. Capacity from Cinema P2)
  3186. (C) WHERE P1. Capacity > All (select max(P2. Capacity) from Cinema P2)
  3187. (D) WHERE P1. Capacity > Any (select max (P2. Capacity) from Cinema P2)
  3188. Answer: (A)
  3189. Explanation: When the ALL condition is followed by a list, the optimizer expands the initial condition to all elements of the list and strings them together with AND operators.
  3190. When the ANY condition is followed by a list, the optimizer expands the initial condition to all elements of the list and strings them together with OR operators, as shown below.
  3191. Ans. WHERE P1. Capacity> = All (select P2. Capacity from Cinema P2)
  3192. 613.The max-heap for the array  ( 4, 3, 1, 5, 9, 2, 8 ) is
  3193. Ans.      https://www.youtube.com/watch?v=WsNQuCa_-PU
  3194. 614.
  3195. You can refresh the web page in javascript by using ................ method.
  3196. Ans. Reload()
  3197. 615.
  3198. The load instruction is mostly used to designate a transfer from memory to a processor register known as
  3199. Ans. Accumulator
  3200. 616.
  3201. Among the following ,which has the highest time complexity O(n2) in all the three
  3202.      cases.(Worst,average and best) and cannot be improved?
  3203. Ans. Selection sort
  3204. 617.Which of the following relational algebra operations do not require the participating tables to be union-compatible?
  3205. Ans. Join
  3206. 618.
  3207. Which of the following is the correct way for writing JavaScript array?
  3208. Ans. var txt = new Array("arr ","kim","jim")
  3209. 619.
  3210. The load instruction is mostly used to designate a transfer from memory to a processor register known as____.
  3211. Ans.Accumulator
  3212. 620.In Circuit Switching, resources need to be reserved during the
  3213. Ans. Setup Phase
  3214. 621.In RMI Architecture which layer Intercepts method calls made by the client/redirects these calls to a remote RMI service?
  3215. Ans. Stub & Skeleton Layer
  3216. 622.A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output bit-string after stuffing is 01111100101, then the input bit-string is
  3217. Ans. 0111110101
  3218. 623.Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
  3219. Ans. It will immediately be granted
  3220. 624.What is the output of following JavaScript code
  3221. Chadha software technologies
  3222. Ans:
  3223. 625.For an algorithm whose step-count is 45n3+34n , choose the correct statement.
  3224. Ans.
  3225. 626.Congestion control and quality of service is qualities of the
  3226. Ans. ATM
  3227. 627.If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?
  3228. (A) Width of tag comparator
  3229. (B) Width of set index decoder
  3230. (C) Width of way selection multiplexor
  3231. (D) Width of processor to main memory data bus
  3232. (D) is the correct answer- main memory data bus has nothing to do with cache associativity- this can be answered without even looking at other options.
  3233. Ans. Width of processor to main memory data bus
  3234. 628.Relations produced from an E-R model will always be
  3235. Ans. 3NF
  3236. 629.If the element 12 has to be searched  in the array  (2,4,8, 9,14,16, 18), using binary search, the result can be obtained within _____ comparisons.
  3237. Ans.3
  3238. 630.How do you put a message in the browser's status bar?
  3239. How do you put a message in the browser's status bar ?
  3240. A) status("put your message here")   B) window.status = "put your message here"
  3241. C) statusbar = "put your message here"   D) window.status("put your message here")
  3242. Answer:   B) window.status = "put your message here"
  3243. 631.A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is 24 megabytes, the length of the virtual address supported by the system is _________ bits.
  3244. Ans. 36
  3245. 632.Which two files are used during operation of the DBMS?
  3246. Ans. data dictionary and transaction log
  3247. 633.What is the output of following JavaScript code?
  3248. chadha
  3249. Ans. Re technologies
  3250. 634.In the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is
  3251. Ans. Data Link Layer and Bit Synchronization
  3252. 635.  For the array , (77 ,62,14,80,9,30,99) , if Quick sort technique is followed,what will be  the array status after placing the  first pivot element in its appropriate place?
  3253. Ans.62,14,9,30,77,80,99
  3254. 636.The local host and the remote host are defined using IP addresses. To define the processes, we need second identifiers called.........
  3255. Ans. UDP Addresses
  3256. 637.Which two RAID types use parity for data protection?
  3257. Ans. RAID 4 and RAID 5
  3258. 638.The number of outputs in n-input decoder is
  3259. Ans. 2^n
  3260. 639.What is the correct JavaScript syntax to write "Hello World"
  3261. Ans. document. write("Hello World");
  3262. 640.Rotation method of hashing is usually combined with other hashing techniques except
  3263. Ans. Last character
  3264. 641.The two's complement of 101011 is
  3265. Ans.010101
  3266. 642.Which one of the following protocols is NOT used to resolve one form of address to another one?
  3267. Ans.DHCP
  3268. 643.Browsers typically render text wrapped in ___________ tags as an indented paragraph.
  3269. Ans. .<blockquote>
  3270. 644.----------------------is a description of the database
  3271. Ans. Schema
  3272. 645.  Among the following sorting techniques ,which has its time complexity as O(n) in the     
  3273.      best-case?
  3274. Ans.Insertion,Bubble
  3275. 646.The number of boolean functions in n-variables is
  3276. What is the maximum number of different Boolean functions involving n Boolean variables?
  3277. (A) n2
  3278. (B) 2n
  3279. (C) 22n
  3280. (D) 2n2
  3281. Answer: (C)
  3282. No of inputs sequences possible for a n variable Boolean function = 2n
  3283. Each input sequence can give either T or F as output ( 2 possible values )
  3284. So, Total no of Boolean functions are -
  3285. 2X2X2X2X2X2X.............X2X2X2X2X2X2
  3286. <-------------------- 2n Times -------------->
  3287. Ans. .(2^(2^n))
  3288. 647.-------involves finding the best line to fit two attributes so that one attribute is used to predict another attribute.
  3289. Ans. Linear Regression
  3290. 648. Java package is a grouping mechanism with the purpose of
  3291. Ans. Controlling the visibility of classes, interface and methods
  3292. 649.Who invented the JavaScript programming language?
  3293. Ans.Brendan Eich
  3294. 650.UDP uses........ to handle outgoing user datagrams from multiple processes on one host.
  3295. Ans.Multiplexing
  3296. Slot 14: Sagar Kulkarni
  3297. Answers not found:
  3298. [670,679,689,692]
  3299. ----------------------------------------------------------------------------------------------------------------
  3300. 651.
  3301. A heap memory area is used to store the
  3302. Heap memory is used for dynamic memory allocation
  3303. 652.
  3304. The lifetime of flash memory is --------------------- 10-100k erase cycles
  3305. Lifetime of a flash memory is long.(Flash  drives means pendrive,memory card etc)
  3306. 653.
  3307. What is the output of following JavaScript code?
  3308. Output : 44
  3309. 654.
  3310. A schema describes
  3311. A.   Record & files
  3312. B.   data elements
  3313. C.   record relationships
  3314. D.   all of the above
  3315. Ans   Correct Answer is d
  3316. 655.
  3317. The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
  3318. (A) TCP, UDP, UDP and TCP
  3319. (B) UDP, TCP, TCP and UDP
  3320. (C) UDP, TCP, UDP and TCP
  3321. (D) TCP, UDP, TCP and UDP
  3322. Answer: (C)
  3323. 656.
  3324. Which of the following is true for the given tree?
  3325. 657.
  3326. The ......... protocol defines a set of messages sent over either User Datagram Protocol (UDP) port53 or Transmission Control Protocol(TCP) port53.
  3327. A. Name space
  3328. B. DNS
  3329. C. Domain space
  3330. D. Zone transfer
  3331. Ans: B. DNS
  3332. 658.
  3333. What is the multiplexer used for?
  3334. a) It is a type of decoder which decodes several inputs and gives one output
  3335. b) A multiplexer is a device which converts many signals into one
  3336. c) It takes one input and results into many output
  3337. d) None of the Mentioned
  3338. Ans. b
  3339. 659.
  3340. What is the output of following JavaScript code
  3341. 660.
  3342. Trigger is a
  3343. Trigger is a special kind of a store procedure that executes in response to certain action on the table like insertion, deletion or updation of data
  3344. 661.
  3345. Which of the following transport layer protocols is used to support electronic mail?
  3346. (A) SMTP
  3347. (B) IP
  3348. (C) TCP
  3349. (D) UDP
  3350. Answer (C)
  3351. E-mail uses SMTP as application layer protocol. SMTP uses TCP as transport layer protocol
  3352. 662.
  3353. What will be printed as the output of the following program?
  3354. public class testincr
  3355.                   {
  3356.                   public static void main(String args[])
  3357.                   {
  3358.                      int i = 0;
  3359.                      i = i++ + i;
  3360.                      System.out.println(" I = " +i);
  3361.                    }
  3362.                    }
  3363. Output: I = 1
  3364. 663.
  3365. What is the output of following JavaScript code
  3366. Output : N
  3367. 664.
  3368. R left outer join S on a=b gives
  3369. No table given
  3370. 665.
  3371. Identify the addressing mode of the following instruction
  3372. Add R1, R2, R3
  3373. where R1, R2 are operands and R3 destination
  3374. Answer : Three-Address Instructions
  3375. 666.
  3376. When a network interface has a failure in its circuitry, it sends a continuous stream of frames causing the Ethernet LAN to enter a Collapse state. This condition is known as __________.
  3377. a.Scattering
  3378. b.Jabbering
  3379. c.Blocking
  3380. d.Refreshing
  3381. Ans: b.Jabbering
  3382. 667.
  3383. What is the output of following JavaScript code
  3384. Ans: yes
  3385. 668.
  3386. Which of the following addressing modes has minimum number of memory access  to access the operands?
  3387. A. Indirect
  3388. B. Direct
  3389. C. Indexed
  3390. D. Immediate
  3391. And: D.Immediate
  3392. 669.
  3393. To prevent any method from overriding, the method has to declared as,
  3394. And: Method is declared with a ‘final’ keyword
  3395. 670.
  3396. Foreign key is a subset of primary key is stated in -----------constraint
  3397. 671.
  3398. The ways to accessing html elements in java script
  3399. Finding HTML Elements
  3400. Often, with JavaScript, you want to manipulate HTML elements.
  3401. To do so, you have to find the elements first. There are a couple of ways to do this:
  3402. •   Finding HTML elements by id
  3403. •   Finding HTML elements by tag name
  3404. •   Finding HTML elements by class name
  3405. •   Finding HTML elements by CSS selectors
  3406. •   Finding HTML elements by HTML object collections
  3407. document.getElementById("intro");
  3408. getElementsByTagName("p");
  3409. getElementsByClassName("intro");
  3410. document.forms["frm1"];
  3411. 672.
  3412. temp=root->left;
  3413.      while(temp->right!=NULL)
  3414.       temp=temp->right;
  3415.       return temp;
  3416.      The above code snippet for a BST with the address of the root node in pointer ‘root’  
  3417.      returns
  3418. Ans:Inorder Predecessor
  3419. 673.
  3420. R left outer join S on a=b gives
  3421. 674.
  3422. How many flip-flops are present in register of sixteen bits?
  3423. Ans: 4 Flip flops
  3424. 675.
  3425. In one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is that?
  3426. (A) HTTP, FTP
  3427. (B) HTTP, TELNET
  3428. (C) FTP, SMTP
  3429. (D) HTTP, SMTP
  3430. Answer: (A)
  3431. Explanation: HTTP may use different TCP connection for different objects of a webpage if non-persistent connections are used.
  3432. FTP uses two TCP connections, one for data and another control.
  3433. TELNET and FTP can only use ONE connection at a time.
  3434. 676.
  3435. A subnet has been assigned a subnet mask of 255.255.255.192. What is the maximum  number of hosts that can belong to this subnet?
  3436. (A) 14
  3437. (B) 30
  3438. (C) 62
  3439. (D) 126
  3440. Answer: (C)
  3441. 677.
  3442. Which one of the following is not true?
  3443. 678.
  3444. In a relational schema, each tuple is divided into fields called
  3445. A) Relations
  3446. B) Domains
  3447. C) Queries
  3448. D) All of the above
  3449. Ans: B) Domains
  3450. 679.
  3451. If a pipeline has five stages, assuming each stage is one cycle, the earliest time to receive an output from an instruction without any forwarding (not nop)  is after which cycle?
  3452. 680.
  3453. What is the correct syntax for referring to an external script called " abc.js"
  3454. A. <script href=\" abc.js\">
  3455. B. <script name=\" abc.js\">
  3456. C. <script src=\" abc.js\">
  3457. D. None of the above
  3458. Ans: C. <script src=\" abc.js\">
  3459. 681.
  3460. A system of interlinked hypertext documents accessed via the Internet is known as
  3461. The World Wide Web (abbreviated as WWW or W3, commonly known as the web), is a system of interlinked hypertext documents accessed via the Internet
  3462. 682.
  3463. How many phases are present in the simplest pipeline system? 
  3464. 4 or 5
  3465. 683.
  3466. The term scheme means:
  3467. 684.
  3468. Value of checksum must be recalculated regardless of
  3469. De-fragmentation
  3470. Fragmentation
  3471. Transfer
  3472. Size
  3473. Ans: Fragmentation
  3474. 685.
  3475. Identify the sorting technique that supports divide and conquer strategy and has (n2) complexity in worst cas
  3476. a. Bubble sort
  3477. b. Insertion sort
  3478. c.   Quick sort
  3479. d. All of above
  3480. Ans: c. Quick sort
  3481. 686.
  3482. A ____________ is often used if you want the user to verify or accept
  3483. A confirm box is often used if you want the user to verify or accept something
  3484. 687.
  3485. The language used in application programs to request data from the DBMS is referred to as the
  3486. A.   DML
  3487. B.   DDL
  3488. C.   query language
  3489. D.   All of the above
  3490. E.   None of the above
  3491. Answer: Option A
  3492. 688.
  3493. In Circuit Switching, resources need to be reserved during the
  3494. Ans: the resources need to be reserved during the setup phase
  3495. 689.
  3496. Can any unsigned number be represented using one register in 64-bit processor
  3497. ANS: 2^63 – 1 numbers (Not sure). / 14
  3498. 690.
  3499. Inorder and postorder traversal sequences of a binary tree are 45 50 55 65 70 75 80 85 90
  3500. and 45 55 65 50 75 90 85 80 70. What are its leaf nodes?
  3501. Ans: 45,55,70,85
  3502. 691.
  3503. The protocol data unit (PDU) for the application layer in the Internet stack is
  3504. (A) Segment
  3505. (B) Datagram
  3506. (C) Message
  3507. (D) Frame
  3508. Answer (C)
  3509. The Protocol Data Unit for Application layer in the Internet Stack (or TCP/IP) is called Message.
  3510. 692.
  3511. If the page size is 1024 bytes, what is the page number in decimal of the following virtual address
  3512. 1110 1010010101
  3513. 693.
  3514. Which normal form is considered adequate for relational database design?
  3515. Ans: Which normal form is considered adequate for normal relational database design? Explanation: A relational database table is often described as “normalized” if it is in the Third Normal Form because most of the 3NF tables are free of insertion, update, and deletion anomalies
  3516. 694.
  3517. In Javascript, which of the following method is used to find out the character at a position in a string?
  3518. a) charAt()
  3519. b) CharacterAt()
  3520. c) CharPos()
  3521. d) characAt()
  3522. ans: a
  3523. 695.
  3524. The preorder traversal of the AVL tree obtained by inserting 17,7,20,10,8 is
  3525. 696.
  3526. The concept of locking can be used to solve the problem of
  3527. Deadlock
  3528.    Lost update
  3529.    Inconsistent
  3530.    All of the above
  3531. Ans: All of the above
  3532. 697.
  3533. What is the JavaScript syntax to insert a comment that has more than one line?
  3534. Next
  3535. ans: “/* …  */” can be used to insert comment > 1line
  3536. 698.
  3537. In an Ethernet local area network, which one of the following statements isTRUE?
  3538. (A) A station stops to sense the channel once it starts transmitting a frame.
  3539. (B) The purpose of the jamming signal is to pad the frames that are smaller than the minimum frame size.
  3540. (C) A station continues to transmit the packet even after the collision is detected.
  3541. (D) The exponential backoff mechanism reduces the probability of collision on retransmissions
  3542. Answer: (D)
  3543. Explanation:
  3544. Now considering the Ethernet protocol we will discuss all the options one by one
  3545. (A) This option is false as in Ethernet the station is not required to stop to sense for the channel prior frame transmission.
  3546. (B) A signal is jammed to inform all the other devices or stations about collision that has occurred so that further data transmission is stopped. Thus this option is also false
  3547. (C) Once the collision has occurred the data transmission is stopped as the jam signal is sent. Thus this option is also incorrect.
  3548. (D) To reduce the probability of collision on retransmissions an exponential back off mechanism is used. Thus, only this option is true
  3549. 699.
  3550. A queue data structure can be used for
  3551. Ans: Typical uses of queues are in simulations and operating systems.
  3552. Operating systems often maintain a queue of processes that are ready to execute or that are waiting for a particular event to occur.
  3553. Computer systems must often provide a “holding area” for messages between two processes, two programs, or even two systems. This holding area is usually called a “buffer” and is often implemented as a queue.
  3554. 700.
  3555. Given four frames in main memory, the following is the content of the page table. Assuming the frames are fetched at time instant 3, 4, 1, 2 which frame will be replaced to place the page 46 using first in first out replacement algorithm?
  3556. 23
  3557. 34
  3558. 10
  3559. 4
  3560. page 46?????
  3561. Answers not found:
  3562. [670,679,689,692]
  3563. 701.
  3564. ………… is very useful in situation when data have to stored and then retrieved in reverse order.
  3565. Ans: Stack
  3566. 702.
  3567. Consider the following message M = 1010001101. The cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1 is : 01110
  3568. Ans: 01110
  3569. 703.
  3570. The daisy chaining prioirty gives least priority to which device?
  3571. Ans: Slow devices such as Keyboard
  3572. 704.
  3573. What does isNaN function do in JavaScript?
  3574. Ans: The isNaN() function determines whether a value is an illegal number (Not-a-Number). This function returns true if the value equates to NaN. Otherwise it returns false.
  3575. 705.
  3576. In a E-R diagram, ellipses represent a
  3577. Ans : Attributes are represented by means of ellipses. Every ellipse represents one attribute
  3578. 706.
  3579. Which of the following desired features are beyond the capability of relational algebra?
  3580. (a)   Aggregate computation (b) Multiplication (c) Finding transitive closure (d) None of the above
  3581. Ans: All a,b,c (Aggregate Computation,Multiplication,Finding transitive closure)
  3582. 707.
  3583. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
  3584. Ans AVL Tree
  3585. 708.
  3586. How do you create a new object in JavaScript?
  3587. Ans : There are various ways to create an object in js:
  3588. a)define a constructor function and then create an object by using the new keyword
  3589. b)Using object.create() method
  3590. Object.create(proto [, propertiesObject ])
  3591. 709. Which method is implemented in RAID 1?
  3592. Ans Parity
  3593. Mirroring without striping or parity / disk mirroring with block stripping
  3594. 710.
  3595. Dotted-decimal notation of 10000001 00001011 00001011 11101111 would be
  3596. Ans: 129 .11 .11.239
  3597. 711.
  3598. What are the potential problems when a DBMS executes multiple transaction concurrently
  3599. Ans: Lost update problem,dirty read problem
  3600. 712.
  3601. In the IPv4 addressing format, the number of networks allowed under Class C addresses is
  3602. Ans: 2^21
  3603. 713.
  3604. A processor can support a maximum memory of 4 GB, where the memory is word-addressable (a word consists of two bytes). The size of the address bus of the processor is at least __________ bits
  3605. Ans:  Maximum Memory = 4GB = 232 bytes
  3606. Size of a word = 2 bytes
  3607. Therefore, Number of words = 232 / 2 = 231
  3608. So, we require 31 bits for the address bus of the processor.
  3609. 714.
  3610. When determining the efficiency of algorithm the time factor is measured by
  3611. Ans: Counting the number of key operations
  3612. 715.
  3613. What is the output of following JavaScript code?
  3614. Ans: Quality 100
  3615. 716.
  3616. Linked lists are best suited
  3617. Ans for the size of the structure and the data in the structure are constantly changing
  3618. 717.
  3619. Let R be a relation. Which of the following comments about the relation R are correct?
  3620. Ans ??
  3621. 718.
  3622. Which one of the following allows a user at one site to establish a connection to another site and then pass keystrokes from local host to remote host?
  3623. Ans : Telnet
  3624. 719.
  3625. Which of the following object is the highest-level object in the browser object hierarchy?
  3626. Ans Javascript Window object
  3627. 720.
  3628. RAM type is justified as
  3629. Ans RAM is justified as being reliable and error detecting
  3630. 721.
  3631. The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable. The minimum number of times the DMA controller needs to get the control of the system bus from the processor to transfer the file from the disk to main memory is
  3632. Ans
  3633. Size of data count register of the DMA controller = 16 bits
  3634. Data that can be transferred in one go = 216 bytes = 64 kilobytes
  3635. File size to be transferred = 29154 kilobytes
  3636. So, number of times the DMA controller needs to get the control of the system bus from the processor to transfer the file from the disk to main memory = ceil(29154/64) = 456
  3637. 722.
  3638. Changing the conceptual schema without having to change physical schema is
  3639. Ans Data Independence
  3640. 723.
  3641. The resources needed for communication between end systems are reserved for the duration of session between end systems in
  3642. Ans Circuit Switching
  3643. 724.
  3644. What is the output of following JavaScript code?
  3645. Ans 2
  3646. 725.
  3647. Linked list are not suitable data structure of which one of the following problems ?
  3648. Ans: Binary Search(Because it will take O(n/2) time to find the middle element)
  3649. 726.
  3650. What is the output of following JavaScript code?
  3651. Ans Chadha,Software,Technologies
  3652. 727.
  3653. Which of the following is useful in implementing quick sort?
  3654. Ans Stacks
  3655. 728.
  3656. Which of the following raid levels provides maximum usable disk space?
  3657. Ans Raid 0
  3658. 729.
  3659. Which one of the following fields of an IP header is NOT modified by a typical IP router?
  3660. Ans Source Address
  3661. 730.
  3662. ________ extracts the DML statements from a host language and passes to DML Compiler
  3663. Ans Precompiler
  3664. 731.
  3665. What are the states of the Auxiliary Carry (AC) and Carry Flag (CF) after executing the following 8085 program? MVI H, 5DH; MIV L, 6BH; MOV A, H; ADD L
  3666. Ans AC=1 CY 0
  3667. 732.
  3668. Truncate is _________ command
  3669. Ans DDL
  3670. 733.
  3671. These networking classes encapsulate the "socket" paradigm pioneered in the (BSD) Give the abbreviation of BSD?
  3672. Ans Berkeley Software Distribution
  3673. 734.
  3674. Which of the following object represents the HTML document loaded into a browser window?
  3675. Ans Window object
  3676. 735.
  3677. What is the result of the following operation Top (Push (S, X))
  3678. Ans X
  3679. 736.
  3680. The performance of cache memory is frequently measured in terms of a quantity called
  3681. Ans Hit Ratio
  3682. 737.
  3683. What is the output of following JavaScript code?
  3684. Ans 16
  3685. 738.
  3686. A transaction is permanently saved in the hard disk only after giving
  3687. Ans COMMIT Command
  3688. 739.
  3689. In a priority queue insertion and deletion takes place at
  3690. Ans Any Position
  3691. 740.
  3692. If message in Segmentation and Reassembly (SAR) sub layer of Application Adaptation Layer 3/4 has value of Segment type is 11 then it is called a
  3693. Ans Single segmented Message
  3694. 741.
  3695. Digital signature envelope is decrypted by using _________.
  3696. Ans Symmetric key
  3697. 742.
  3698. When does Top value of stack change in insertion process?
  3699. A. Before insertion
  3700. B. After insertion
  3701. C. At the time of insertion
  3702. D. While checking overflow
  3703. Ans Before Insertion
  3704. 743.
  3705. DMA is useful for the operations
  3706. Ans DMA is useful for transferring data between memory and devices if large volume of data is to be transferred, or the devices have small response times.
  3707. 744.The data manipulation language (DML)
  3708. Ans ??
  3709. 745.
  3710. What is mean by "this" keyword in javascript?
  3711. Ans In JavaScript, the thing called this, is the object that "owns" the JavaScript code. The value of this, when used in a function, is the object that "owns" the function. The value of this, when used in an object, is the object itself. The this keyword in an object constructor does not have a value.
  3712. 746.
  3713. int unknown(int n) {
  3714.     int i, j, k = 0;
  3715.     for (i  = n/2; i <= n; i++)
  3716.         for (j = 2; j <= n; j = j * 2)
  3717.             k = k + n/2;
  3718.     return k;
  3719. }
  3720. Ans n^2 logn
  3721. 747.
  3722. Math. round(-20.5)=?
  3723. Ans  -20
  3724. 748.
  3725. An advantage of the database approach is
  3726. Ans The advantages in the database approach are as follows:
  3727.          All the three managers are using the same database; hence, any report using the information will not be inconsistent.
  3728.          All the three managers can view the database as per their needs.
  3729.          The application systems can be developed independent of the database.
  3730.          The data validation and updating will be once and same for all.
  3731.          The data is shared by all users.
  3732.          The data security and privacy can be managed and ensured because the data entry in the database occurs once only and is protected by the security measures.
  3733.          Since the database is storage of the structured information, the queries can be answered fast by using the logic of the data structures.
  3734. 749.
  3735. If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum number of hosts per subnet?
  3736. Ans 2046
  3737. 750.
  3738. Computers use addressing mode techniques for _____________________.
  3739. Ans : A. giving programming versatility to the user by providing facilities as pointers to memory counters for loop control
  3740. B.      to reduce no. of bits in the field of instruction
  3741. C.      specifying rules for modifying or interpreting address field of the instruction
  3742. Ans ALL ABC
  3743. Questions 751-800
  3744. 751.Which built-in method sorts the elements of an array
  3745. Ans .sort()
  3746. 752.In ---------------Mode, the authentication header is inserted immediately after the IP header.
  3747. Ans Tunnel
  3748. 753.Which of the following is not characteristics of a relational database model
  3749. Ans TreeLike structure
  3750. 754.The maximum number of binary trees that can be formed with three unlabeled nodes is:
  3751. Ans (A) 1 (B)5 (C)4 (D)3…..
  3752. Ans: B
  3753. 755.A computer has a 256 KByte, 4-way set associative, write back data cache with block size of
  3754. 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory
  3755. entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit. The
  3756. size of the cache tag directory is
  3757. Ans . (A) 11
  3758. (B) 14
  3759. (C) 16
  3760. (D) 27
  3761. Asn 16
  3762. 756.Trace the output of the following code?
  3763. #include
  3764. using namespace std;
  3765. int main()
  3766. {
  3767. int x=15,y=27;
  3768. x = y++ + x++;
  3769. y = ++y + ++x;
  3770. cout<<x+y++<<++x+y;
  3771. return 0;
  3772. }</x+y++<<++x+y;
  3773. Ans 116,116.
  3774. 757.Microsoft SQL Server is an example for which OLAP Server?
  3775. Ans multidimensional / specialized sql servers
  3776. 758.Which built-in method returns the length of the string?
  3777. Ans .length
  3778. 759.The minimum duration of the active low interrupt pulse for being sensed without being lost
  3779. must be
  3780. Ans. a) greater than one machine cycle
  3781. b) equal to one machine cycle
  3782. c) greater than 2 machine cycles
  3783. d) equal to 2 machine cycles
  3784. View Answer
  3785. Answer: b
  3786. 760.Assume that source S and destination D are connected through two intermediate routers
  3787. labeled R. Determine how many times each packet hasto visit the network layer and the
  3788. data link layer during a transmission from S to D.
  3789. Ans. (A) Network layer – 4 times and Data link layer – 4 times
  3790. (B) Network layer – 4 times and Data link layer – 3 times
  3791. (C) Network layer – 4 times and Data link layer – 6 times
  3792. (D) Network layer – 2 times and Data link layer – 6 times
  3793. ans: c
  3794. 761.Which of the following function of Array object calls a function for each element in the
  3795. array?
  3796. Ans A – concat B – every C – filter D – forEach
  3797. Ans: d
  3798. 762.Which of the following statements is FALSE regarding a bridge
  3799. Ans . A) Bridge is a layer 2 device
  3800. (B) Bridge reduces collision domain
  3801. (C) Bridge is used to connect two or more LAN segments
  3802. (D) Bridge reduces broadcast domain
  3803. Ans:d
  3804. Explanation:
  3805. 763.Which of the following is not a stored procedure?
  3806. Ans
  3807. 765.Determine the output of the following code?
  3808. #include
  3809. using namespace std;
  3810. class one
  3811. {
  3812. int a;
  3813. static int b;
  3814. public:
  3815. void initialize();
  3816. void print();
  3817. static void print_S();
  3818. };
  3819. int one::b = 0;
  3820. void one::initialize()
  3821. {
  3822. a = 10;
  3823. b ++;
  3824. }
  3825. void one::print()
  3826. {
  3827. cout<<a;
  3828. cout<<b;
  3829. }
  3830. void one::print_S()
  3831. {
  3832. cout<<b;
  3833. }
  3834. int main()
  3835. {
  3836. one o;
  3837. o.initialize();
  3838. o.print();
  3839. o.print_S();
  3840. return 0;
  3841. }</b;
  3842. </b;
  3843. </a;
  3844. Ans 10 1 1
  3845. 767.A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1
  3846. indirect block address and 1 doubly indirect block address. The size of each disk block is 128
  3847. Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this
  3848. file system in KBytes is
  3849. Ans. (A) 3 Kbytes
  3850. (B) 35 Kbytes
  3851. (C) 280 Bytes
  3852. (D) Dependent on the size of the disk
  3853. ans: b
  3854. 768.Which one of these is characteristic of RAID 5?
  3855. Ans.Distributed Parity
  3856. 769.Dynamic web page
  3857. Ans. A dynamic web page is a web page that displays different content each time it's
  3858. viewed. For example, the page may change with the time of day, the user that accesses
  3859. the webpage, or the type of user interaction. There are two types of dynamic web pages
  3860. 770.Consider the following pseudo code fragment:
  3861. printf (“Hello”);
  3862. if(!fork( ))
  3863. printf(“World”);
  3864. Which of the following is the output of the code fragment?
  3865. Ans hello world hello world
  3866. 772.Generally Dynamic RAM is used as main memory in a computer system as it______.
  3867. Ans. A.Consumes less power B.has higher speed
  3868. C.has lower cell density D.needs refreshing circuitry
  3869. Ans: b
  3870. 775.Consider a relation R (A, B). If A ¿ B is a trivial functional dependency and A is the super
  3871. key for R, then what is the maximum normal form R can be in? Ans
  3872. 776.Which one of the following is a cryptographic protocol used to secure HTTP connection?
  3873. Ans . Transport Layer Security (TLS) is a cryptographic protocol that is used to
  3874. secureweb (HTTP/HTTPS) connections.
  3875. 777.What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note
  3876. that the first parameter is passed by reference, whereas the second parameter is passed by value.
  3877. int f (int &x, int c) {
  3878. c=c-1;
  3879. if (c-0) return 1;
  3880. x=x+1;
  3881. return f (x,c)*x;}
  3882. Ans . int f(int &x, int c) {
  3883. c = c - 1;
  3884. if (c == 0) return 1;
  3885. x = x + 1;
  3886. return f(x, c) * x;
  3887. }
  3888. (A) 3024
  3889. (B) 6561
  3890. (C) 55440
  3891. (D) 161051
  3892. which is 6561.
  3893. 778.Uniform Resource Locator (URL), is a standard for specifying any kind of information on the
  3894. Ans.Internet
  3895. 779.If a virtual memory system has 4 pages in real memory and the rest must be swapped to disk.
  3896. Which of the following is the hit ratio for the following page address stream. Assume memory
  3897. starts empty, use the FIFO algorithm
  3898. Ans.
  3899. A.   10%
  3900. B.   15%
  3901. C.   25%
  3902. D.   31%
  3903. ans   d
  3904.    
  3905. 781.What will be the values of x, m and n after the execution of the following statements?
  3906. int x, m, n;
  3907. m = 10;
  3908. n = 15;
  3909. x = ++m + n++;
  3910. Ans.
  3911. 783.What is the unique characteristic of RAID 6 (Choose one)?
  3912. Ans.Two independent distributed parity
  3913. 784.What is the code to be used to trim whitespaces ?
  3914. Ans . a. let trimmed = (l.trim() for (l in lines));
  3915. b. let trimmed = (trim(l));
  3916. c. let trimmed = l.trim();
  3917. d. let trimmed = for(l in lines));
  3918. Ans : a
  3919. 785.RAID is a way to:
  3920. Ans RAID (redundant array of independent disks; originally redundant
  3921. array of inexpensive disks) is a way of storing the same data in different
  3922. places on multiple hard disks to protect data in the case of a drive
  3923. failure. However, not all RAID levels provide redundancy.
  3924. 786.If the offset of the operand is stored in one of the index registers, then it is
  3925. Ans . a) based indexed addressing mode
  3926. b) relative based indexed addressing mode
  3927. c) indexed addressing mode
  3928. d) none of the mentioned
  3929. ans: c
  3930. 787.What’s the output of the following code?
  3931. var city = new Array("delhi", "agra", "akot", "aligarh");
  3932. city.push('palampur');
  3933. document.write(city);
  3934. Ans
  3935. 788.What happens when a pointer is deleted twice?
  3936. Ans. I know that a "deleting the same memory twice" error can happen when
  3937. twopointers address the same dynamically allocated object. If delete is applied to one of
  3938. the pointers, then the object's memory is returned to the free store. If we
  3939. subsequently delete the second pointer, then the free store may be corrupted.
  3940. 789.The local host and the remote host are defined using IP addresses. To define the processes,
  3941. we need second identifiers called
  3942. Ans.Port adddress
  3943. 790.Assume that a table R with 1000 records is to be joined with another table S with 10000
  3944. records. What is the maximum number of records that would result in if we join R with S and the
  3945. equi-join attribute of S is the primary key?
  3946. Ans
  3947. 793.Which of the following type casts will convert an Integer variable named amount to a
  3948. Double type?
  3949. Ans A. (double) amount
  3950. B. (int to double) amount
  3951. C. int to double(amount)
  3952. D. int (amount) to double
  3953. 794.Consider the following relation
  3954. Cinema (theater, address, capacity)
  3955. Which of the following options will be needed at the end of the SQL query
  3956. SELECT P1. address
  3957. FROM Cinema P1
  3958. Such that it always finds the addresses of theaters with maximum capacity?
  3959. Ans  all
  3960. 795.The ‘$’ present in the RegExp object is called a
  3961. Ans . a. character
  3962. b. matcher
  3963. c. metacharacter
  3964. d. metadata
  3965. Answer : c
  3966. Explanation : The ‘S’ is a special metacharacter that matches the end of a string.
  3967. 799.What should be used to point to a static class member?
  3968. Ans . a) Smart pointer
  3969. b) Dynamic pointer
  3970. c) Normal pointer
  3971. d) None of the mentioned
  3972. Ans: c
  3973. 800.Which cause a compiler error?
  3974. Ans. 1,2
  3975. 1. float[ ] f = new float(3);
  3976. 2. float f2[ ] = new float[ ];
  3977. 3. float[ ]f1 = new float[3];
  3978. 4. float f3[ ] = new float[3];
  3979. 5. float f5[ ] = {1.0f, 2.0f, 2.0f};
  3980. A.    2, 4
  3981. B.    3, 5
  3982. C.    4, 5
  3983. D.    1, 2
  3984. 802.The ......... protocol defines a set of messages sent over either User Datagram Protocol (UDP)
  3985. port53 or Transmission Control Protocol(TCP) port53.
  3986. Ans dns
  3987. 803.Consider the following statement containing regular expressions
  3988. var text = "testing: 1, 2, 3";
  3989. var pattern = /\d+/g;
  3990. In order to check if the pattern matches, the statement is
  3991. Ans pattern.text(text)
  3992. 805.The regular expression to match any one character, not between the brackets is
  3993. Ans . a. […] b. [^] c. [^…] d. [\D]
  3994. Ans: c
  3995. 807.Which of the following scan() statements is true?
  3996. Ans
  3997. 809.Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ
  3998. >, and sends it to Y, where it is d ecrypted. Which one of the following sequences of keys is used
  3999. for the operations?
  4000. Ans. (A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key
  4001. followed by Y’s public key
  4002. (B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key
  4003. followed by Y’s private key
  4004. (C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key
  4005. followed by X’s private key
  4006. (D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key
  4007. followed by X’s public key
  4008. Ans:d
  4009. 812.What does /[^(]* regular expression indicate ?
  4010. Ans. a. Match one or more characters that are not open paranthesis
  4011. b. Match zero or more characters that are open paranthesis
  4012. c. Match zero or more characters that are not open paranthesis
  4013. d. Match one or more characters that are open paranthesis
  4014. ans:c
  4015. 813.A variable P is called pointer if
  4016. Ans .P conatains the address of the element of the data
  4017. 814.Which of the following statement on the view concept in SQL is invalid?
  4018. Ans .The definition of a group should not have a groupby clause in it
  4019. 815.The function scanf() reads
  4020. Ans. A) double character
  4021. B) single character
  4022. C) multiple characters
  4023. D) no character
  4024. ans:c
  4025. 816.In SQL, testing whether a subquery is empty is done using
  4026. Ans .Exists
  4027. 819.What will be the result when non greedy repetition is used on the pattern /a+?b/ ?
  4028. Ans. a. Matches the letter b preceded by the fewest number of a’s possible
  4029. b. Matches the letter b preceded by any number of a
  4030. c. Matches letter a preceded by letter b, in the stack order
  4031. d. None of the mentioned
  4032. ans: a
  4033. 820.main() is an example of
  4034. Ans
  4035. 822.What does the subexpression /java(script)?/ result in ?
  4036. Ans . a. It matches “java” followed by the optional “script”
  4037. b. It matches “java” followed by any number of “script”
  4038. c. It matches “java” followed by a minimum of one “script”
  4039. d. None of the mentioned
  4040. View Answer: a
  4041. 823.Which type of error detection uses binary division?
  4042. Ans .CRC
  4043. 824.Which of the following is not a characteristic of a relational database model?
  4044. Ans .Treelike strructure
  4045. 826.A RAM chip has a capacity of 1024 words of 8 bits each (1K*8). The number of 2*4
  4046. decoders with enable line needed to construct a 16K*6 RAM from 1K*8 RAM is
  4047. Ans . (A) 4
  4048. (B) 5
  4049. (C) 6
  4050. (D) 7
  4051. 827.What is the most essential purpose of parantheses in regular expressions ?
  4052. Ans. Define pattern matching techniques
  4053. b. Define subpatterns within the complete pattern
  4054. c. Define portion of strings in the regular expression
  4055. d. All of the mentioned
  4056. ans: b
  4057. 829.An identifier in C
  4058. Ans An identifier is a string of alphanumeric characters that begins with
  4059. an alphabeticcharacter or an underscore character that are used to
  4060. represent variousprogramming elements such as variables, functions, arrays, structures,
  4061. unions and so on. Actually, an identifier is a user-defined word.
  4062. 831.Value of checksum must be recalculated regardless of
  4063. Ans .Fragmentation
  4064. 833.The method that performs the search-and-replace operation to strings for pattern matching is
  4065. Ans. a. searchandreplace()
  4066. b. add()
  4067. c. edit()
  4068. d. replace()
  4069. ans: d
  4070. 834.A variable whose size is determined at compile time and cannot be changed at run time is
  4071. Ans static
  4072. 835.Memory mapped displays
  4073. Ans . Memory-mapped I/O. ... So when an address is accessed by the CPU, it may refer to
  4074. a portion of physical RAM, but it can also refer to memory of the I/O device. Thus, the
  4075. CPU instructions used to access the memory can also be used for accessing devices
  4076. 836.Dotted-decimal notation of 10000001 00001011 00001011 11101111 would be
  4077. Ans 129.11.11.239
  4078. 838.A union that has no constructor can be initialized with another union of __________ type
  4079. Ans.
  4080. A.    different
  4081. Ans: B.    same
  4082. C.    virtual
  4083. D.    class
  4084. 839.What would be the result of the following statement in JavaScript using regular expression
  4085. methods ?
  4086. Ans. a. Returns [“123″”456″”789”] b. Returns [“123″,”456″,”789”] c. Returns [1,2,3,4,5,6,7,8,9] d.
  4087. Throws an exception
  4088. ans: b
  4089. 840.Which one of the following allows a user at one site to establish a connection to another site
  4090. and then pass keystrokes from local host to remote host?
  4091. Ans. a) HTTP
  4092. b) FTP
  4093. c) Telnet
  4094. d) None of the mentioned
  4095. Ans: c
  4096. 841.Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1
  4097. and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-tomany. R1 and R2 do not have any attributes of their own. What is the minimum number of tables
  4098. required to represent this situation in the relational model?
  4099. Ans. (a) s is subset of r
  4100. (b) r U s = r
  4101. (c) r is a subset of s
  4102. (d) r * s = s
  4103. ---------------------------
  4104. ans: c
  4105. 842.Structured programming involves
  4106. Ans.
  4107. A.    decentralisation of program activity
  4108. Ans: B.    functional modularisation
  4109. C.    localisation of errors
  4110. D.    All of the above
  4111. E.    None of the above
  4112. 843.Consider a computer system with 40-bit virtual addressing and page size of sixteen
  4113. kilobytes. If the computer system has a one-level page table per process and each page table
  4114. entry requires 48 bits, then the size of the per-process page table is __________ megabytes.
  4115. Ans. (A) 384  ans
  4116. (B) 48
  4117. (C) 192
  4118. (D) 96
  4119. 844.Consider the following code snippet. What purpose does exec() solve in the above code ?
  4120. var pattern = /Java/g;
  4121. var text = "JavaScript is more fun than Java!";
  4122. var result;
  4123. while ((result = pattern.exec(text)) != null)
  4124. {
  4125. alert("Matched '" + result[0] + "'" +" at position " + result.index +"; next search begins at " + patt
  4126. ern.lastIndex);
  4127. }
  4128. Ans. a. Returns the same kind of array whether or not the regular expression has the global g
  4129. flag.
  4130. b. Returns different arrays in the different turns of iterations
  4131. c. Both a and b
  4132. d. None of the mentioned
  4133. ans: a
  4134. 845.Select operation in SQL is equivalent to
  4135. Ans. A) the selection operation in relational algebra.
  4136. (B) the selection operation in relational algebra, except that SELECT in SQL retains
  4137. duplicates.
  4138. (C) the projection operation in relational algebra.
  4139. (D) the projection operation in relational algebra, except that SELECT in SQL retains
  4140. duplicates.
  4141. •ans: d
  4142. 847.Which function among the following lets to register a function to be invoked once?
  4143. Ans. a. setTimeout()
  4144. b. setTotaltime()
  4145. c. setInterval()
  4146. d. None of the mentioned
  4147. ans:; a
  4148. 848.By default, any real number in C is treated as
  4149. Ans.
  4150. A.    float
  4151. Ans: B.    double
  4152. C.    long double
  4153. D.    far double
  4154. SLOT  18 (851-900)
  4155. 851.
  4156. Grant and revoke are ....... statements
  4157. DCL
  4158. 852.
  4159. Which function among the following lets to register a function to be invoked repeatedly after a certain time?
  4160. setInterval()
  4161. 853.
  4162. Integer division in a C program results in
  4163. Truncation
  4164. 854.
  4165. .......... command can be used to modify a column in a table
  4166. SQL ALTER TABLE
  4167. 855.
  4168. The processed S/MIME along with security related data is called as ________.
  4169. public key cryptography standard(PKCS).
  4170. 856.
  4171. Which is the handler method used to invoke when uncaught JavaScript exceptions occur?
  4172. onerror
  4173. 857.The function f(x) = ab + a can be simplified as
  4174. ANS::A(1+b)= a(1)=a
  4175. 858.
  4176. For C Programming language,
  4177. 859.
  4178. ___________ Substitution is a process that accepts 48 bits from the XOR operation.
  4179. S-box(Substitution box)
  4180. 860.
  4181. Which property is used to obtain browser vendor and version information?
  4182. a) modal
  4183. b) version
  4184. c) browser
  4185. d) navigator
  4186. View Answer
  4187. Answer: d
  4188. Explanation: The navigator property is used to obtain browser vendor and version information.
  4189. 861.
  4190. The number of squares in K-map of n-variables is power of 2
  4191. 862.
  4192. Consider the C function given below.
  4193. int f(int j)
  4194. {
  4195.   static int i = 50;
  4196.   int k;
  4197.   if (i == j)
  4198.   {
  4199.     printf("something");
  4200.     k = f(i);
  4201.     return 0;
  4202.   }
  4203.   else return 0;
  4204. }
  4205. Run on IDE
  4206. Which one of the following is TRUE?
  4207. (A) The function returns 0 for all values of j.
  4208. (B) The function prints the string something for all values of j.
  4209. (C) The function returns 0 when j = 50.
  4210. (D) The function will exhaust the runtime stack or run into an infinite loop when j = 50
  4211. Answer: (D)
  4212. Explanation: When j is 50, the function would call itself again and again as neither i nor j is changed inside the recursion.
  4213. 863.
  4214. Data independence means It means we change the physical storage/level without affecting the conceptual or external view of the data. The new changes are absorbed by mapping techniques. Logical data independence is the ability to modify the logical schema without causing application program to be rewritten.
  4215. 864.
  4216. The output of combinational circuit depends on current combination of input values
  4217. 865.
  4218. Which method receives the return value of setInterval() to cancel future invocations?
  4219. clearInterval()
  4220. 866.
  4221. In …tunnel……………. Mode, the authentication header is inserted immediately after the IP header.
  4222. 867.
  4223. Consider the following code fragment:
  4224.   if (fork() == 0)
  4225.   { a = a + 5; printf(“%d,%d\n”, a, &a); }
  4226.   else { a = a –5; printf(“%d, %d\n”, a, &a); }
  4227. Let u, v be the values printed by the parent process, and x, y be the values printed by the child process. Which one of the following is TRUE?
  4228. (A) u = x + 10 and v = y
  4229. (B) u = x + 10 and v != y
  4230. (C) u + 10 = x and v = y
  4231. (D) u + 10 = x and v != y
  4232. Answer: (C)
  4233. 868.
  4234. DCL stands for data control language
  4235. 869.
  4236. _content-id________ uniquely identifies the MIME entities uniquely with reference to multiple contexts.
  4237. 870.
  4238. Which of the folloiwng is fully functional ?
  4239. 871.
  4240. Find the output of the following program?
  4241. #include
  4242. using namespace std;
  4243. typedef int * IntPtr;
  4244. int main()
  4245. {
  4246. IntPtr A, B, C;
  4247. int D,E;
  4248. A = new int(3);
  4249. B = new int(6);
  4250. C = new int(9);
  4251. D = 10;
  4252. E = 20;
  4253. *A = *B;
  4254. B = &E;
  4255. D = (*B)++;
  4256. *C= (*A)++ * (*B)--;
  4257. E= *C++ - *B--;
  4258. cout<<*A<<*B<<*C<<d<<e;
  4259. return 0;
  4260. }</d<<e;
  4261. 872.
  4262. .…constraint……………… is preferred method for enforcing data integrity
  4263. 873.
  4264. The setTimeout() belongs to which object?
  4265. window
  4266. 874.
  4267. Which one of the following is a cryptographic protocol used to secure HTTP connection?
  4268. Transport Layer Security (TLS)
  4269. 875.
  4270. The library function exit() causes an exit from the program in which it occurs
  4271. 876.
  4272. The alphabet are represented in which format inside the computer?  ASCII
  4273. 877.
  4274. Which of the following is not a binary operator in relational algebra?
  4275. Ans. A) Join
  4276. B) Semi-Join
  4277. C) Assignment
  4278. D) Project
  4279. ANS: D.Project
  4280. 878.
  4281. Which method receives the return value of setTimeout() to cancel future invocations?
  4282. clearTimeout()
  4283. 879.
  4284. What will happen if we call setTimeout() with a time of 0 ms?
  4285. Placed in queue
  4286. 880.
  4287. Electronic code book (ecb) is a mode of operation for a block cipher, with the characteristic that each possible block of plaintext has a defined corresponding ciphertext value and vice versa.
  4288. 881.
  4289. The number of bits to represent 128 sets in direct mapped cache is 7
  4290. 882.
  4291. Which of the following is/are  not a  DDL statements?
  4292. update
  4293. 883.
  4294. Which of the following statement is correct about destructors?
  4295. A destructor has no return type.
  4296. 884.
  4297. To which object does the location property belong?
  4298. window
  4299. 885.
  4300. The interrupts are serviced using which of the folloiwng
  4301. 886.
  4302. Which database level is closest to the users?
  4303. external
  4304. 887.
  4305.      Java package is a grouping mechanism with the purpose of
  4306. ANS: b. controlling the visibility of classes , interfaces and methods
  4307. 888.
  4308. A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no repeaters. The signal speed in the cable is 2 x 108  m/sec. The minimum frame size for this network should be
  4309. Ans . (A) 10000 bits
  4310. (B) 10000 bytes
  4311. (C) 5000 bits
  4312. (D) 5000 bytes
  4313. ANS: A
  4314. 889.
  4315. RAW data type can store unstructured data
  4316. 890.
  4317. What will be printed as the output of the following program?
  4318.                   public class testincr
  4319.                   {
  4320.                   public static void main(String args[])
  4321.                   {
  4322.                      int i = 0;
  4323.                      i = i++ + i;
  4324.                      System.out.println(" I = " +i);
  4325.                    }
  4326.                    }
  4327. Ans. (b) I = 1
  4328. 891.
  4329. What is the data structure used for executing interrupt service subroutine ?
  4330. Stack (LIFO)
  4331. 892.
  4332. What is the access point (AP) in wireless LAN?
  4333. a)    device that allows wireless devices to connect to a wired network
  4334. b) wireless devices itself
  4335. c) both (a) and (b)
  4336. d) none of the mentioned
  4337. ANS: A
  4338. It is a networking hardware device that allows a Wi-Fi device to connect to a wired network
  4339. 893.
  4340. What is the result of the following code snippet?
  4341. window.location === document.location
  4342. Ans. a. False
  4343. b. True
  4344. c. 0
  4345. d. 1
  4346. ANS:true
  4347. === checks for equal value and equal type
  4348. 894.
  4349. Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?
  4350. a) CDMA
  4351. b) CSMA/CA
  4352. c) ALOHA
  4353. d) None of the mentioned
  4354. ANS:Csma/ca
  4355. 895.
  4356. In which part does the form validation should occur?
  4357. server
  4358. 896.
  4359. The output in sequential circuit depends on which of the folloiwng?
  4360. Present as well as past inputs
  4361. 897.
  4362. To prevent any method from overriding, the method has to declared as final
  4363. 898.
  4364. A table can have only one primary key
  4365. 899.
  4366. The power consumed by full adder can be reduced by using which of the following?
  4367. ANS: scaling the supply and improving power delay
  4368. 900.
  4369. A 20 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs the "go back n ARQ" scheme with n set to 10. Assuming that each frame is 100 bytes long, what is the maximum data rate possible?
  4370. Ans: 10kbps
  4371. 901.
  4372. What is the output of the following program:
  4373.                        public class testmeth
  4374.                        {
  4375.                            static int i = 1;
  4376.                            public static void main(String args[])
  4377.                             {
  4378.                                  System.out.println(i+” , “);
  4379.                                  m(i);
  4380.                                  System.out.println(i);
  4381.                             }
  4382.                             public void m(int i)
  4383.                             {
  4384.                                i += 2;                             
  4385.                             }
  4386.                        }
  4387. ANSWER : 1,1
  4388. 902.
  4389. -------------------module of the DBMS controls access to DBMS information that is stored on disk, whether it is part of the database or the catalog
  4390. ANSWER : MANAGER MODULE
  4391. 903.
  4392. How to find the index of a particular string?
  4393. a.position()
  4394. b.index()
  4395. c.indexOf()
  4396. d.Noneofthementioned
  4397. Answer: C
  4398. Explanation : The indexOf() function can be used to find out the index of a particular character or a string.
  4399. 904.
  4400. Which of the following is the child object of the JavaScript navigator?
  4401. a.Navicat
  4402. b.Plugins
  4403. c.NetRight
  4404. d. None of the mentioned
  4405. Answer : b
  4406. Explanation : The JavaScript navigator object includes a child object called plugins.
  4407. 905.
  4408. The number of distinct symbols in radix-r is
  4409. Answer : ‘R’
  4410. 906.
  4411. ---------------- component of DBMS extracts DML commands from an application program written in a host programming language
  4412. ANSWER: The pre-compiler
  4413. 907.
  4414. A wireless network interface controller can work in
  4415. a) infrastructure mode
  4416. b) ad-hoc mode
  4417. c)both(a) and (b)
  4418. d) none of the mentioned
  4419. Answer: c
  4420. Explanation: In infrastructure mode WNIC needs access point but in ad-hoc mode access point is not required.
  4421. 908.
  4422. Given the code
  4423.               String s1 = “ VIT” ;
  4424.               String s2 = “ VIT “ ;
  4425.               String s3 = new String ( s1);
  4426.               Which of the following would equate to true?
  4427. (A) s1 == s2
  4428. (B) s1 = s2
  4429. (C) s3 == s1
  4430. (D) s1.equals(s2)
  4431. (E) s3.equals(s1)
  4432. • (A), (C) & (E)
  4433. • (A), (B) & (C)
  4434. • (C), (D) & (E)
  4435. • (D) & (E)
  4436. • (A), (D) & (E)
  4437. Answer: (A), (D) & (E)
  4438. 909.
  4439. Can a system have multiple DMA controllers?
  4440. ANS: NO
  4441. 910.
  4442. Which one of the following event is not possible in wireless LAN.
  4443. a) collision detection
  4444. b) acknowledgement of data frames
  4445. c) multi-mode data transmission
  4446. d) none of the mentioned
  4447. Answer: a
  4448. 911.
  4449. Which of the following are the properties of a plug-in entry?
  4450. a. name
  4451. b. filename
  4452. c. mimeTypes
  4453. d. All of the mentioned
  4454. View Answer
  4455. Answer : d
  4456. 912.
  4457. The runtime database processor of DBMS executes-----------
  4458. ANSWER: QUERY CODE
  4459. 913.
  4460. What is the sequence of major events in the life of an applet?
  4461. Answer: i) loading the applet ii) leaving and returning to the appltes page iii) reloading the applet iv) quitting the browser
  4462. 914.
  4463. What is the purpose of the mimeTypes property of a plug-in entry?
  4464. a. Contains MIME properties
  4465. b. Contains MIME sizes
  4466. c. Contains MIME types
  4467. d. None of the mentioned
  4468. Answer : c
  4469. 915.
  4470. What is the number of maxterms in a function of n variables?
  4471. ANS: 2^n
  4472. 916.
  4473. A relation R(A,B,C,D,E,H) has the following functional dependencies
  4474.     F= {{A→BC},{CD→E},{E→C}, {D→AEH}, {ABH→BD}, {DH→BC}}.
  4475. Find the Normal form of the relation
  4476. 917.
  4477. What is Wired Equivalent Privacy (WEP) ?
  4478. a) security algorithm for ethernet
  4479. b) security algorithm for wireless networks
  4480. c) security algorithm for usb communication
  4481. d) none of the mentioned
  4482. View Answer
  4483. Answer: b
  4484. 918.
  4485. Which of the following events will cause a thread to die?
  4486. ANSWER : D i.e when run() ends
  4487. 919.
  4488. A subset of a network that includes all the routers but contains no loops is called:
  4489. a) spanning tree
  4490. b) spider structure
  4491. c) spider tree
  4492. d) none of the mentioned
  4493. Answer: a
  4494. 920.
  4495. A method within a class is only accessible by classes that are defined within the same package as the class of the method. Which one of the following is used to enforce such restriction?
  4496. (a)   Declare the method with the keyword public
  4497. (b)   Declare the method with the keyword private
  4498. (c)   Declare the method with the keyword protected
  4499. (d)   Do not declare the method with any accessibility modifiers
  4500. (e)   Declare the method with the keyword public and private.
  4501. ANSWER: D
  4502. 921.
  4503. How many output lines are present in an encoder with 2^n input lines?
  4504. ANSWER: N
  4505. 922.
  4506. AJAX has become very commonly used because
  4507. 1.    it allows pages to be interactive without further communication with the server.
  4508. 2.    XML is a close relative of HTML.
  4509. 3.    it avoids the need for JavaScript.
  4510. 4.    it allows page content to be updated without requiring a full page reload.
  4511. ANSWER : 4
  4512. 923.
  4513. -------------index has an entry for every search key value (and hence every record) in the data file
  4514. ANSWER : A DENSE INDEX
  4515. 924.
  4516. If link transmits 4000 frames per second, and each slot has 8 bits,the transmission rate of circuit this TDM is
  4517. ANS: 32KBPS
  4518. 925.
  4519. Consider the following code.
  4520. static void nPrint(String message, int n) {
  4521.    while (n > 0) {
  4522.      System.out.print(message);
  4523.      n--;
  4524.    }
  4525. }
  4526. What is the printout of the call nPrint('a', 4)?
  4527. ANS: invalid call (because char 'a' cannot be passed to deal table)
  4528. 926.
  4529. More than one transaction can apply this lock on X for reading its value but no write lock can be applied on X by any other transaction. What is that lock?
  4530. Answer: shared/exclusive locks
  4531. 927.
  4532. Which of the following is not a reason XML gained popularity as a data interchange format for AJAX?
  4533. 1.    It has been around a while and libraries exist for many languages to work with it
  4534. 2.    It can be navigated using JavaScript DOM methods.
  4535. 3.    It is extensible, allowing it to be adapted to virtually any application.
  4536. 4.    It is concise and simple to use.
  4537. Answer : 4.
  4538. 928.
  4539. Which flip flop  has the characterstic function Q(next) = input
  4540. ANS: D Flip-flop
  4541. 929.
  4542. Which method must be defined by a class implementing the java.lang.Runnable   
  4543.         interface?
  4544. ANS: PUBLIC VOID RUN()
  4545. 930.
  4546. Which one of the following allows a user at one site to establish a connection to another site and then pass keystrokes from local host to remote host?
  4547. a) HTTP
  4548. b) FTP
  4549. c) telnet
  4550. d) none of the mentioned
  4551. Show Answer
  4552. Answer: c
  4553. 931.
  4554. The jQuery AJAX methods .get(), .post(), and .ajax() all require which parameter to be supplied?
  4555. ANS: url
  4556. 932.
  4557. The performance of cache memories is measured by
  4558. Answer: hit ratio
  4559. 933.
  4560. Lock manager uses -------------- to store the identify of transaction locking a data item, the data item, lock mode and pointer to the next data item locked.
  4561. Answer: lock table
  4562. 934.
  4563. The probability that a single bit will be in error on a typical public telephone line using 4800 bps modem is 10 to the power -3. If no error detection mechanism is used, the residual error rate for a communication line using 9-bit frames is approximately equal to
  4564. 935.
  4565. If an AJAX request made using jQuery fails,
  4566. 1.    the browser will automatically report the problem with an alert message.
  4567. 2.    an error message will be displayed in the browser window content area.
  4568. 3.    the programmer should arrange for it to be reported using the jQuery .fail() method.
  4569. 4.    there is no way to notify the user.
  4570. Answer: 3.
  4571. 936.
  4572. -------------is used to summarize information from multiple tuples into a single-tuple summary
  4573. Answer: Aggregate functions
  4574. 937.
  4575. In negative edge triggered flip flop, the transitions happen at
  4576. ANS “Clock” at the falling edge
  4577. 938.
  4578. 13.  Which of the following line of code is suitable to start a thread ?
  4579. A.
  4580. Thread t = new Thread(X);
  4581. B.
  4582. Thread t = new Thread(X); t.start();
  4583. C.
  4584. X run = new X(); Thread t = new Thread(run); t.start();
  4585. D.
  4586. Thread t = new Thread(); x.run();
  4587. Answer: Option C
  4588.     
  4589. 939.
  4590. Which method is used to call the base class methods from the subclass?  
  4591. ANS: Super method (to call the parent method)               
  4592. 940.
  4593. Nested documents in the HTML can be done using
  4594. Nested documents in the HTML can be done using
  4595. A. frame
  4596. B. nest
  4597. C. iframe
  4598. D. into
  4599. Answer: Option C
  4600. 941.
  4601. Frames from one LAN can be transmitted to another LAN via the device
  4602. A. Router
  4603. B. Bridge
  4604. C. Repeater
  4605. D. Modem
  4606. E. None of the above
  4607. Answer: Option B
  4608. ANS: BRIDGE
  4609. 942.
  4610. In ER- Relational Mapping, Binary 1:1 Relationship types are mapped to ----------
  4611. 943.
  4612. The race condition in RS flip flop is rectified in which flip flop
  4613. ANS: Master-slave
  4614. 944.
  4615. What does the command XCHG in 8085 do?
  4616. ANS: exchange
  4617. 945.
  4618. A new web browser window can be opened using which method of the Window object ?
  4619. a. createtab()
  4620. b. Window.open()
  4621. c. open()
  4622. d. All of the mentioned
  4623. Answer : b
  4624. 946.
  4625. --------------contains information such as the structure of each file, the type and storage format of each data item, and various constraints on the data
  4626. Answer: system Catalogue
  4627. 947.
  4628. You are working with a network that is 172.16.0.0 and would like to support 600 hosts per subnet. What subnet mask should you use?
  4629. A.
  4630. 255.255.192.0
  4631. B.
  4632. 255.255.224.0
  4633. C.
  4634. 255.255.240.0
  4635. D.
  4636. 255.255.248.0
  4637. E.
  4638. 255.255.252.0
  4639. Answer: Option E
  4640. 948.
  4641. Answer the following question based on the given table.
  4642. Package Name   Class Name
  4643. Lab.project.util   Date, Time
  4644. Lab.project.game   Car, Puzzle
  4645. What will be the access modifier if a method in Date class is inherited in the Puzzle class?
  4646. ANS: Public
  4647. 949.
  4648. Which of the following digits are known as the sub-address digits (for use by the user) of the Network User Address (NUA)?
  4649. A. 05-Jul
  4650. B. 01-Apr
  4651. C. 08-Dec
  4652. D. 13-14
  4653. E. None of the above
  4654. Answer: Option D
  4655. ANS: 13-14
  4656. 950.
  4657. What statement is used to execute stored procedure in Java JDBC
  4658. ANS:     .Executequery()    
  4659. 951.
  4660. Who is responsible for correlating the  different perspectives of distinct users?
  4661. ANS: Datbase admin or identity correlation
  4662. 952.
  4663. Which object serves as the global object at the top of the scope chain?
  4664. a.   Hash
  4665. b. Property
  4666. c. Element
  4667. d. Window
  4668. ANS: D
  4669. 953.
  4670. If the opearand of stack operation is register, the stack contents in 8085 store which of the following?
  4671. ANS: Stack segment Register
  4672. 954.
  4673. What does the location property represent?
  4674. a. Current DOM object (Document Object model)
  4675. b. Current URL
  4676. c. Both a and b
  4677. d. None of the mentioned
  4678. ANS: A
  4679. 955.
  4680. In 8085 subtraction is performed using which method?     by the 2's complement method
  4681. 956.
  4682. Data Model that provides ad-hoc queries is --------------
  4683. 957.
  4684. Consider following code.
  4685. public class Test {
  4686. public static void main(String[] args) {
  4687.   System.out.println(m(2));
  4688. }
  4689. public static int m(int num) {
  4690.   return num;
  4691. }
  4692. public static void m(int num) {
  4693.   System.out.println(num);
  4694. }
  4695. }
  4696. AnS:
  4697. a) The program has a syntax error because the two methods m have the
  4698. same signature
  4699. (b
  4700. )
  4701. The program has a syntax error because the second m method is defined, but
  4702. not invoked in the main method
  4703. (c
  4704. )
  4705. The program runs and prints 2 once
  4706. (d
  4707. )
  4708. The program runs and prints 2 twice
  4709. (e
  4710. )
  4711. The program runs and prints 2 thrice.
  4712. Answer : (a)
  4713. Reason : You cannot override the methods based on the type returned
  4714. 958.
  4715. A modulator converts a _____ signal to a(n) _____ signal.
  4716. A. FSK; PSK
  4717. B. PSK; FSK
  4718. C. analog; digital
  4719. D. digital; analog
  4720. E. None of the above
  4721. ANS D
  4722. 959.
  4723. Consider  the following code:
  4724. public class Test {
  4725. public static void main(String[] args) {
  4726.   int[] x = new int[5];
  4727.   int i;
  4728.   for (i = 0; i < x.length; i++)
  4729.     x[i] = i;
  4730.   System.out.println(x[i]);
  4731. }
  4732. }
  4733. The program has a runtime error because the last statement in the main method causes ArrayIndexOutOfBoundsException.
  4734. 960.
  4735. What is the number of distinct symbols in base-16 ?
  4736. Ans 6
  4737. 961.
  4738. What is the loopback address?  type of IP address that is used to test the communication or transportation medium on a local network card and/or for testing network applications. Special ip address 127.0.0.1
  4739. 962.
  4740. Which among the following is not a property of the Location object?
  4741. a. protocol
  4742. b. host
  4743. c. hostee
  4744. d. hostname
  4745. ANS C
  4746. 963.
  4747. A state that refers to the database when it is loaded is---------  INITIAL DATABASE STATE
  4748. 964.
  4749. A 4 KHz noise less channel with one sample ever 125 per sec is used to transmit digital signals. Differential PCM with 4 bit relative signal value is used. Then how many bits per second are actually sent?
  4750. .
  4751. 32 Kbps
  4752. B.
  4753. 64 Kbps
  4754. C.
  4755. 8 Kbps
  4756. D.
  4757. 128 Kbps.
  4758. ANS A
  4759. 965.
  4760. ------------------ is used to describe the structure and constraints for the whole database for a community of users hides the details of physical storage structures in three -schema architecture
  4761. 966.   
  4762. How many bits are present in registers A, B, C together in 8085? 24bit.. each 8 bit
  4763. 967.
  4764. What will be the value of c at the end of execution?
  4765. public static void main(String args[])
  4766. { int a = 10, b = 2,c=0,d=0;
  4767. int[] A = {1,2,3};
  4768. try   {    c=a/b;
  4769. try    {    d  = a/(a-a);   d= A[1]+1; }
  4770. catch(ArrayIndexOutOfBoundsException e)
  4771.   {    System.out.println("Array - unreachable element "+e);   }
  4772. Finally { System.out.println("Finally block inside "); }  }
  4773. catch(Exception e)
  4774. { System.out.println("Some Problem:"+e);  b  = 1; c = a/b; }  
  4775. finally             { System.out.println("Finally block  outside“) }
  4776. System.out.println("after try/catch blocks");
  4777. System.out.println("Ans = " +c); }
  4778. ERROR  two
  4779. 968.
  4780. What is the return type of the hash property?  A String
  4781. 969.
  4782. What does the instruction INX H perform in 8085 microprocessor? It means the location pointed by the HL pair is incremented by 1
  4783. 970.
  4784. Which is the method that removes the current document from the browsing history before laoding the new document?
  4785. modify()
  4786. assign()
  4787. replace()
  4788. remove()
  4789. ANS : Replace
  4790. 971.
  4791. What is the minimum number of wires required for sending data over a serial communications links?
  4792. A. 1
  4793. B. 2 (answer)
  4794. C. 4
  4795. D. 6
  4796. 972.
  4797. ----------------describes the the part of the database that a particular user group is interested in and hides the rest.
  4798. ANS: EXTERNAL SCHEMA
  4799. 973.
  4800. Which method is used for loading the driver in Java JDBC.
  4801. ANS
  4802. Class.forName("org.postgresql.Driver"); This will load the driver, and whileloading,
  4803. the driver will automatically register itself with JDBC
  4804. 973.
  4805. 1.   Which method is used for loading the driver in Java JDBC. Class.forName()
  4806. A.  
  4807. 974.
  4808. Why is the replace() method better than the assign() method?
  4809. ANS he replace() method replaces the current document with a new
  4810. one.
  4811. The difference between this method and assign(), is that replace()
  4812. removes the URL of the current document from the document history,
  4813. meaning that it is not possible to use the "back" button to navigate
  4814. back to the original document.
  4815. 975.
  4816. Which one is the first high level programming language
  4817. ANS Plankalkül, created by Konrad Zuse.
  4818. 976.
  4819. In cyclic redundancy checking, the divisor is _____ the CRC.
  4820. Answer:- One bit more than
  4821. 977.
  4822. The 8255 chip is an example of i/o chip
  4823. 978.
  4824. ------------ is used to define internal schema
  4825. 979.
  4826. What is the purpose of the assign() method? copy the values of all enumerable own properties from one or more source objects to a target object
  4827. 980.
  4828. An error-detecting code inserted as a field in a block of data to be transmitted is known as Frame check sequence
  4829. 981.
  4830. When a class extends the Thread class ,it should override ............ method of Thread class to start that thread. Run()
  4831. 982.
  4832. Centralized DBMS has----------  (NOT FOUND)
  4833. 983.
  4834. What is 8254 used for?  (NOT FOUND)
  4835. 984.
  4836. Which two are valid constructors for Thread?
  4837. a.) Thread(Runnable r, String name)
  4838. b.) Thread()
  4839. c.) Thread(int priority)
  4840. d.) Thread(Runnable r, ThreadGroup g)
  4841. e.) Thread(Runnable r, int priority)
  4842. ANS A and B
  4843. 985.
  4844. Working of the WAN generally involves
  4845. A. telephone lines
  4846. B. microwaves
  4847. C. satellites
  4848. D. All of the above
  4849. ANS D
  4850. 986.
  4851. 10.The history property belongs to which object?
  4852. a. Element
  4853. b. Window
  4854. c. History
  4855. d. Location
  4856. Ans c
  4857. 987.
  4858. How many modes are present in 8255 and what are they?
  4859. Two modes – set mode and io mode
  4860. 988.
  4861. An Employee entity of a company database can be a SECRETARY, TECHNICIAN or MANAGER.
  4862. What kind of participation constraint can be used for Employee and its job types?
  4863. 989.
  4864. If you configure the TCP/IP address and other TCP/IP parameters manually, you can always verify the configuration through which of the following? Select the best answer.
  4865. A.
  4866. Network Properties dialog box
  4867. B.
  4868. Server Services dialog box
  4869. C.
  4870. DHCPINFO command-line utility
  4871. D.
  4872. Advanced Properties tab of TCP/ IP Info.
  4873. E.
  4874. None of the above
  4875. Ans a
  4876. 990.
  4877. If we can determine exactly those entities that will become members of each subclass by a condition then such subclasses are called--------------
  4878. Answer:- predicate-defined
  4879. 991.
  4880. Which of the following is one of the fundamental features of JavaScript? Single-threaded
  4881. 992.
  4882. Which of the following is DMA controller?
  4883. 993.
  4884. public class MyRunnable implements Runnable
  4885. {
  4886. public void run()
  4887. {
  4888. // some code here
  4889. }
  4890. }
  4891. which of these will create and start this thread?
  4892. Answer:- new Thread(new MyRunnable()).start();
  4893. 994.
  4894. OOPs
  4895. Find the output of the following program?
  4896. #include
  4897. #define pow(x) (x)*(x)*(x)
  4898. using namespace std;
  4899. int main()
  4900. {
  4901. int a=3,b=3;
  4902. a=pow(b++)/b++;
  4903. cout<<a<<b;
  4904. return 0;
  4905. }</a<<b;
  4906. 995.
  4907. The expected size of the join result divided by the maximum size is called nR * nS leads to a ratio called join selectivity
  4908. _________________.
  4909. 996.
  4910. How many gate delays are present in efficient implementation of  XOR gate ?
  4911. 997.
  4912. Four bits are used for packet sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size?
  4913. Answer:- 15
  4914. 998.
  4915. Given the code
  4916. String s1 = ? VIT? ;
  4917. String s2 = ? VIT ? ;
  4918. String s3 = new String ( s1);
  4919. Which of the following would equate to true?
  4920. 999.
  4921. What is the output of the following program?
  4922. #include
  4923. using namespace std;
  4924. int main()
  4925. {
  4926. int x=20;
  4927. if(!(!x)&&x)
  4928. cout<<x;
  4929. else
  4930. {
  4931. x=10;
  4932. cout<<x;
  4933. return 0;
  4934. }}</x;
  4935. </x;
  4936. ANS 20
  4937. 1000.How many possible outcome values are present in boolean algebra?
  4938. ANS 2
  4939. Slot 21 – 1001 – 1048
  4940. 1001.
  4941. .       The attributes in foreign key and primary key have the same number of tuples.
  4942. 1002.
  4943. Error control is needed at the transport layer because of potential errors occurring in routers.
  4944. 1003.
  4945. What is the correct HTML for making a hyperlink?
  4946. <a href=http://websitename.com>websitename.com</a>
  4947. 1004.
  4948.    Naïve or parametric end users users work on canned transactions
  4949. 1005.
  4950. Determine the output of the following code?
  4951. #include
  4952. using namespace std;
  4953. void func_a(int *k)
  4954. {
  4955. *k += 20;
  4956. }
  4957. void func_b(int *x)
  4958. {
  4959. int m=*x,*n = &m;
  4960. *n+=10;
  4961. }
  4962. int main()
  4963. {
  4964. int var = 25,*varp=&var;
  4965. func_a(varp);
  4966. *varp += 10;
  4967. func_b(varp);
  4968. cout<<var<<*varp;
  4969. return 0;
  4970. }
  4971. OUTPUT – 55 55
  4972. 1006.
  4973. Data link layer retransmits the damaged frames in most networks. If the probability of a frame's being damaged is p, what is the mean number of transmissions required to send a frame if acknowledgements are never lost.
  4974. Answer – 1/(1-p)
  4975. 1007.
  4976. Which of the following input controls that cannot be placed using   tag?
  4977. 1008.
  4978. What does JSP stand for?
  4979. Java Server Pages
  4980. 1009.
  4981. If a hospital has to store the description of each visit of a patient according to date what attribute you will use in the patient entity type?
  4982. Composite
  4983. 1010.
  4984. What will be the output of the following program?
  4985. #include
  4986. using namespace std;
  4987. class x {
  4988. public:
  4989. int a;
  4990. x();
  4991. };
  4992. x::x() { a=10; cout<
  4993. class b:public x {
  4994. public:
  4995. b();
  4996. };
  4997. b::b() { a=20; cout<
  4998. int main ()
  4999. {
  5000. b temp;
  5001. return 0;
  5002. }
  5003. Output - 20
  5004. 1011.
  5005. Find the output of the following program?
  5006. #include
  5007. using namespace std;
  5008. void myFunction(int& x, int* y, int* z) {
  5009. static int temp=1;
  5010. temp += (temp + temp) - 1;
  5011. x += *(y++ + *z)+ temp - ++temp;
  5012. *y=x;
  5013. x=temp;
  5014. *z= x;
  5015. cout<<x<<*y<<*z<<temp;
  5016. }
  5017. int main() {
  5018. int i = 0;
  5019. int j[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
  5020. i=i++ - ++i;
  5021. myFunction(i, j, &i);
  5022. return 0;
  5023. }</x<<*y<<*z<<temp;
  5024. 1012.
  5025. The SQL statement SELECT SUBSTR('123456789', INSTR('abcabcabc','b'), 4) FROM EMP; prints
  5026. Output – 2345
  5027. 1013.
  5028. Selectors is used to define a special CSS style for a group of HTML elements
  5029. 1014.
  5030. JAVA PROGRAMMING
  5031. Java package is a grouping mechanism with the purpose of - packages in Java are simply a mechanism used to organize classes and prevent class name collisions
  5032. 1015.
  5033. In HTTP, which method gets the resource as specified in the URI - GET
  5034. 1016.
  5035. In SQL, which command is used to issue multiple CREATE TABLE, CREATE VIEW and GRANT statements in a single transaction?
  5036. CREATE SCHEMA
  5037. 1017.
  5038. Which one of these lists contains only Java programming language keywords?
  5039. 1018.
  5040. Which of the following is the right syntax for assertion?
  5041. Create assertion ‘assertion-name’ check ‘predicate’;
  5042. 1019.
  5043. Which of these is Server side technology?
  5044. 1020.
  5045. Which of these interface abstractes the output of messages from httpd?
  5046. LogMessage
  5047. 1021.
  5048. The C++ language is
  5049. 1022.
  5050. . Flash Memory is increasingly being used in server systems to improve performance by caching frequently used data, since it provides faster access than disk, with larger storage capacity than main memory.
  5051. 1023.
  5052. Passing the request from one schema to another in DBMS architecture is called as Mapping
  5053. 1024.
  5054. Where in an HTML document is the correct place to refer to an external style sheet?
  5055. In the <head> section
  5056. 1025.
  5057. Which method is used to remove the first element of an Array object?
  5058. shift()
  5059. 1026.
  5060. Changing the conceptual schema without having to change the external schema is called as Data Independency
  5061. 1027.
  5062. What does the following bit of JavaScript print out?
  5063. var a = [1,,3,4,5];
  5064. console.log([a[4], a[1], a[5]]);
  5065. Output - 5,null,indefined
  5066. 1028.
  5067.   Creating a B Tree index for your database has to specify in DDL.
  5068. 1029.
  5069. Which one of the following statements is NOT correct about HTTP cookies?
  5070. Answer - A cookies is a piece of code that has the potential to compromise the security of an Internet user
  5071. 1030.
  5072. The following HTML attribute is used to specify the URL of the html document to be opened when a hyperlink is clicked.
  5073. HREF
  5074. 1031.
  5075. HTTP is implemented over TCP
  5076. 1032.
  5077. If the directive session.cookie_lifetime is set to 3600, the cookie will live until 3600 seconds
  5078. 1033.
  5079. AJAX made popular by Google
  5080. 1034.
  5081. How to create a Date object in JavaScript?
  5082. dateObjectName = new Date([parameters])
  5083. 1035.
  5084. Output------?
  5085. 1036.
  5086. Choose the correct HTML tag to make a text italic
  5087. <i>
  5088. 1037.
  5089. table {color: blue;}
  5090. With the above code snippet in use, what happens to a table?
  5091. The text inside the table would be colored blue.
  5092. 1038.
  5093. What sever support AJAX ?
  5094. 1039.
  5095. What does the XMLHttpRequest object accomplish in Ajax?
  5096. It provides the ability to asynchronously exchange data between Web browsers and a Web server.
  5097. 1040.
  5098. Which Web browser is the least optimized for Microsoft's version of AJAX?
  5099. Safari
  5100. 1041.
  5101. Which one of these technologies is NOT used in AJAX?
  5102. Flash
  5103. 1042.
  5104. When a user views a page containing a JavaScript program, which machine actually executes the script?
  5105. The User’s machine running the web browser
  5106. 1043.
  5107. A graphical HTML browser resident at a network client machine Q accesses a static HTML webpage from a HTTP server S. The static HTML page has exactly one static embedded image which is also at S. Assuming no caching, which one of the following is correct about the HTML webpage loading (including the embedded image)?
  5108. Q needs to send at least 2 HTTP requests to S, but a single TCP connection to server S is sufficient
  5109. 1044.
  5110. How does servlet differ from CGI?
  5111. Light weight process
  5112. 1045.
  5113. What does JSP stand for?
  5114. Java Server Pages
  5115. 1046.
  5116. Which of these is a stand alone tag?
  5117. <img> <br>
  5118. 1047.
  5119. If you don’t want the frame windows to be resizeable, simply add what to the lines ?
  5120. noresize
  5121. 1048.
  5122. <a> and </a> are the tags used for ?
  5123. Adding links to your page