include ? Header (8) Sidebar ‘ (C) Article slitting the epee (D) Footer 70. Let R=(A, B,C, D, B) having followi FDs. F=(A-BC, CDE, BD, EA} Which of the following is not a Candidate key ? () a ° w. 000 Oo D © & yoot ! 0 volvo } t 3 oN ° ° In Java, the C.) ev th Pregl ity are iow A) Vectors Qe too \ (D) BC‘A 26-bit address bus has ma, accessible memory capacity its of ocedures structions + operating + documentation + hardware manuals ion of upto 5 errors inimum Hamming | 79. sk code must be asin ion nea be ean i (ay Atree is 8 graph (B) A graph isa tree ‘Tree can have a cycle’ (p) Tree is a DAG y \ £ 2 G a ee (on the re . The number of ins the aor the Porta C/C++ sarees ee enh er mote PRC Neh, t= se is mon a geass Sy machine code * analysis cannot otherwise be, optimization ion from the D) the information (Py feenot otherwise be tseg ‘optimization * (©) the information £70m day, toy ly 84. A program P reads in 500 Integers ing, range [0,.100] representing the secon, y 500 students. It then prints the freuen of each score above 50. What woyis the best way for P to store the frequencies ? $60) 140) (A) An array of 50 numbers (B) An array of 100 numbers (QC) An array of 500 numbers (D) A dynamically allocated array of 53) numbers. 85. Which of the followinjg ; of overloading in Java? NPS (A) Overloading and ji ae (B) Overriding and jinki (9) Reusability and data. ay a) Overloading and Overicing®SRD stands for Software Requirements Definition Structured Requirements. Definition Software Requirements Diagram, tured Requirements Diagram ox Software Testing method focuses condition of the software tructure of the software User Interface only Complexity LR(O) techniques ar se of left most se of right most 90), You have a network 1D of ai ‘atleast 25 host Tria haan: one nraeet jimount of subnets a . subnet mask should you ‘assign ? % (A) 255.255.255.192 Se ee (B) 255.255.255.224 es (C) 235.255.255.240 wt ppgp-298285.248 & ™ be With the following syntax INSERTINTO table ((column {,coltmn...)] VALUES (value (, value...); you can + fp Insert one row at a time. (B) Insert multiple rows at a time. () (D) Insert multiple columns ata time. Insert one column at a time. Which flip-flop is used to make all types of shift registers ? (A)_ JK flip-flop D flip-flop (CQ) T flip-flop (D) All the options 92. e Domain constraints, functional dependency and referential integrity are special forms of / , GF Foreign key (B) Primary key 93.ie Onitains 10 white balls at A ball is dlrawry from the ted, This ball is put bi x 3 more bulls of the Mt in from the: stata that the Arst piven that the second 101. 98. When we bi array. The tree BO! (A) Heap trae (B) Almost =i traversigy m in one on Lense DINAEY tree 99. Why does congestion a" (A) Because the Fourer® And switey,, have tables Because the FOULS ANd sivitche, have queues Because the inal and switches (B) () B 100. Adding the style attributes in HT), elements, is known to (A) (B) © (P) have cross None of the options Internal Inline Outline External Assembly line scheduling and Longest Common Subsequence Problems are an example of (A) Dynamic Programming (B) Greedy Algorithms Greedy Algorithms and ‘Dynamic Programming. Tespectively and Tound epee ope ‘STAWhat is meant by the following gebra statement : STUDENT con pute the natural j join be STUDENT and couse” te the left outer join be STUDENT and COURSE te the cartesian Product the STUDENT and | relations \¢ outer join between the \d COURSE relations g is a correct time “the 0/1 knapsack w represents the city of knapsack (A), oad “~ (CG) cannot be determined 6 107, When retrieving data in a particular table ‘vertices, it in : a undir In an mairscted graph, if we ede the (D) always n+4, where n is number of nodes : 3 uw 106. Type of conflicts that can arise in LR(0) techniques are (A) Shift-reduce conflict (B) Shift Shift conflict (C)_Both “Shift-reduce conflict” & “Shift-Shift conflict” (D) None of the options in PostgreSQL, we use the statement. (A) \dt (8) ORDER BY (© SELECT FROM106.4 computer lic ae Sad WN MeMOr: han 4 80 nw accel Lt waiter p caste with 0 06 tise aid ae hu tate he cor we aceon time (A) 2.8 nw 07 nw ine? None of the options rf 5 on 0° the following is correct mt worst case of QuickSort ? 4) 4T(n-2)+0(1) $i “B 1) + T(0) +O(n) 4) 112, a oo 0 111, What fo the outpat OF E Propraey » sec 5 bi ata an uen Or Prac atten nt morro a ible wile op ‘pment ini ABO cg ) | ‘an Demat exten i public int sumortwotine ns. It nyc wOl) mumnunttounes i tnt pumOrThreaok HRI At Me. ay ; oo num +iumd¢nuen public static void main(String argsl || ‘Sum abj = new DemoAbstract( System out printin(obj.sumOFT wo, 7), System.out.printin(objsumOFTI ree \ 9. \ ‘obj lisp( ): ' @ Ae 0 fA) ae Method of cass Sam (8) 26 10 x Method of class Sum of © Method of class Sum io a6 0 . (D) Erogg ab t a gost Given r= ieee value ois 0 le 05 and tay = 0.8, the (A) 0.47 (B) 040 © 0.74 (D) 0.64What is tho proiuct of sing Si ‘ mat ‘ ior matrix multip atice As bie it © yy = 80; C1207 Cay = 18; Co 5g yy = 8B; Cy. 26; Co, 10; Cy a gg Cyy = 18; yg 07; Coy 80; Coy m gg © yy = 26) yg 10; Cay = 82; Cy mag 1 r Aw A) @) © g the location of the clement with a value is : _ Traversal ‘Search — ay is arr = (1,2,4,3). Bubble to sort the array elements. ses will be done to sort the oes 17, Priority queue is implemented bby + (A) Doubly link list (8) Graph Pad Heap (p) Stack 118, In the following addressing mode, which of them performs better for accessing array ? (A) Register addressing mode (B) Direct addressing mode (©) Displacement addressing mode | SBP Index addressing mode 119, Assume that the SLR parser for a grammar Ghas ni states and the LALR parser for G has n2 states. The relationship between nl and n2 is: (A) ni is necessarily less than m2 ZB (B) nil is necessarily equal to n2 @ (©C)_ nt is necessarily greater than n2 wel none of the options 120. The field in IPv4 datagram is not related to fragmentation. (A) Flag (B) Offset TOS (D) Identifier