NCE.4 £2.0.-2018 yeaa duct sider :16 Number of Pages in Booklet : 16 wf duct at den: 120 No. of Questions in Booklet : 120 Paper Code : 13 Sub: Computer Engg. wre: 3.00 Te ‘Time : 3.00 Hours Paper - HI atrees, OF ‘Question Paper Booklet No. Crom Dole = 23.02.01 7175789 afer aa : 200 Maximum Marks : 200 there reac ferent uel sre uaa & dae ete /aiferea dn ai lewd we whhenell ae Affe we A Re TA wea—us gfe oe afl wea—wa yfeet dem sifeea @ si sat caw we siftea eI gad wig farm at at flare ares A gee wea rem we S| Ger fatter wed AY Peart stew A eet | On opening the paper seal/polythene bag of the Question Paper Booklet the candidate should ensure | that Question Paper Booklet No. of the Question Paper Booklet and Answer Sheet must be same. If any difference, candidate must obtain another Question Paper Booklet from In Candidate himself shall be responsible for ensuring this. C were & fare Peer anit oe & ar fer ani oot & te aa E ke oe a aes ew A sae A | a. ea er ane 8c nes ra ere TET Sacto tate ae fe EP ee: 1. 2, 4: Ra en 1 et eh at Fe ge baer niet ae ae wt Te eT Ee er cenfe t & weT E | Jeon see wae sai err are ce 1 aT ve oot ate ah eT ore, at STE Foret saps ae te ge OS Fee 1 sess ss eves fe aT 1/3 MOTTE 1 ‘ore 8 red agg ae rem fre ow a aw cae aE Rah a er athe et ser oe ET see et a eT 1 stent aceon weg so a ht wt te oer aie 81 aie fred area ora Oe if ale aT Fett & ot wee Rr are grr Prager reer et smi Jo. pom aren te eae sie are ore we aera ee eet ae ape et aE EE § aes at anton wet er fier: omre it sean om we est ore Fa I TE a att seep we wd ac bah anal Pree rs sre eo ak Fie Feat ae eet wh rae eh Rr te toe 3B hf oh ren en & fae wr are 1 Warn ‘material INSTRUCTIONS FOR CANDIDATES. ‘Answer all questions All questions carry equal marks. ‘Only ome answer ist be given for each question more than one answers are marked, it would be treated as wronganewer [Each question has four sllemative responses marked serially 1 1, 2,3, 4. You have to darken only one circle or bubble Indicating the corret srswer on the Answor Sheet using BLUE. BALLPOINT PEN, The OMR Answer Sheet is inside this Test Booklet. When you are direeted t0 open the Test Booklet, take out the ect and fill inthe particulars eareflly wth blue ¢ pen only: 4 of the mark(s) of each question will be deducted for each wrong answer. A wrong answer means fan incorrect answer of more than one answers for any ‘qusstion. Leaving al dhe relevant circles or bubbles of any ‘qveston blank will not be considered as wrong answer, Mobile Phone or any other electronic gadget in the ‘examination hall is strictly prohibited. A eandidate found ‘vith any of such objectionable material with hiner will be striclly dealt as per rules Please correctly fill your Roll Number in OMAR. Sheet §5 Marks can be deducted fr filing wrong or incomplete Rell Number If a candidate is found copying rif any unauthorized found in hisher possession, FR. would be lodged ‘gainsthimver inthe Police Station and he'she would liable tobe prosecuted, Department may also debar him/her permanently from all future examinations, 13-0 IIIa Let a table R have three candidate keys A, B and (C, D). Which of the following must not be correct ? (i) A+BC Q) B>aD @) C>AB (@) A+D ‘A relation is in which of the form if it is BCNF and also has no multivalued dependencies (1) Second normal form 2) Third normal form (3) Fourth normal form (4) Domain normal form in which normal depedeney removed ? (1). First normal form (2) Second normal form (3) Third normal form (@)_BCNF form — partial Which of the following creates a virtual relation for storing the query ? (1) Function 2) View (3) Procedure (4) None of these Which of the join operations do not preserve non matched tuples ? (1) Left Outer Join (2) Right Outer Join (3) Inner Join (4) Full Outer Join Which of the following is a procedural language ? (1) tuple relational calculus (2) domain relational calculus (3) ‘relational algebra (4) None of these 10. i. The content of the data dictionary is (1) DML Commands (2) DDL Commands (3)_ Indexes to user data (4) Metadata Consider the relations rl (A, B, C), 12 (C, D, E) and 13 (E, F), with primary keys A, Cand E, respectively, Assume that rl has 50 tuples, 12 has 15 tuple and 13 has 75 tuples. What is the size ofr par2par3? (1) 56250 @) 15 (2) 50 (4) 75 A B+ tree index is to be built on the attribute of the relation with length 8 bytes, The disk blocks are of size 512 bytes and index pointer is of size 4 bytes. What could be the optimal degree of the B+ tree ? a) 43 @) 15 @) 17 @) 18 ‘What is the constraint the leads to fifth normal form? (1) General Constraints 2) Multivated dependencies (3) Functional dependency (4) Join Dependency Which of the following is false about statie member functions ? () static member functions can access not static members of class. (2) static member functions belong to class, (3) static member functions cannot be called using class object. (4) static member functions cannot be overloaded. 32. 13. 14. 15. 16. 3 The algorithm design technique used in the Quick sort algorithm is (1) Dynamic programing Q) Backtracking (3) Divide and Conquer (4) Greedy Method What will be output by the following code segment ? int sum=0; int count=5; while (count>1) {sum=sum+count; count=count-2; } Print£("8d\n”, sum)? @ 5 @) 6 @G) 7 8 What will be the time complexity of optimally calculating a? ? (2) O() @) O(b/2) (3) Oogb) @) O(b) Which algorithm is used to find the minimal distance from one node to all other nodes in a weighted graph ? (1) Dijkstra’s algorithm (2) Prim’s algorithm (3) Keuskal’s algorithm (4) Allof these Post-order traversal of a binary tree is fa, c, d, b, e} and pre-order traversal of the tree is {e, a, b, ¢, d}. What is the in-order traversal of the binary tree ? () {abcde} @) feb.dae} @) faec.b,d} @) thdcae} 17. 18, 19% | 20. lan. Head An AVL tree is a height balanced binary search tree. Why do we need to balance the height of the AVL tree ? (1) itsaves memory (2) ithelps to avoid skew tress (3) is simplifies storage (4) ithetps in faster memory access A destructor can be (1). virtual (3). static (2) volatile (4) None of these Can operator overloading change the operation performed by an operator ? (1) No (2) Yes (3) Conditionally (4) With restrictions ‘Object slicing can be resolved using (1) Pointer (2) References (3) Abstract class (4) All of these Given a linked list L with head pointing to the first node of L, shown below : Li al} bow What is the output when the following sequence of operations applied on the given list ? P is anode pointer (i) P=head — next -> next; (ii) head — next = P: (ii) printf(“%d", head + next > next — data); (1) 20 @) 30 @) 40 4) 5022. 24, The below code retums decimal value of binary linked list. Identify the code to be replaced with XYZ. int val(struct Node *head) { struct Node *p = head: int val2 while (p! = NULL) { XYZ? p = ponext; ) return val2; Q@) val = (val << 1) + head+data; @) val = (wal2 << 1) + podata; @) val2 = (val2 << 1) + podata; (@) val2 = (val << 1) + headsdata; Consider inserting the keys 11, 23, 32, 5, 16, 29, 18, 89, 60 using open addressing technique into a hash table of length m = 8, with hash function h(K) = K mod 8. What is the number of collisions ? qa) 5 (3) 2 Q) 3 @) 0 Input buffer is cleared and reset by function of istream class. (1) syne() (2) clear() 3) reset( ) (4) None of these 27. Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each array can be stored either in row- major or column-major order _in contiguous memory locations. The time complexity of an algorithm to compute M1 x M2 will be (1) best if A is in row-major, and B is in column-major order (2) best if both are in row-major order best if both are in column-major order independent of the storage scheme @B) ) wi following ? (1) Kruskal’s algorithm is multiple source technique for finding MST. Kruskal’s algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV) Both Kruskal’s multiple source finding MST and Kurskal’s algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV) Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best ‘Tree edge) when the graph has relatively few edges true statement in the Q) 3) algorithm is technique for @) The class NP is the set of all decision problems that : (1) Can be solved by polynomial- time algorithms, (2) Cannot be solved by polynomial- time algorithms. (3) Have polynomial-time algorithms. that can verify potential solutions. (4) Allof these 2B28. 29. 30. 31. 32. 3B Sequential search has atime complexity of O(n), and binary search has a time complexity of O(log (n)), What difference in worst case will it make when the size n is 1000? (1) You would not notice much difference because computers run very fast anyway (2) As n is 1000, binary search is twiee as fast as sequential search (3) As nis 1000, binary search is 10 times as fast as sequential search ‘As nis 1000, binary search is 100 times as fast as sequential search @ In a graph if e = (u,v), Then u and v are called (1) endpoints of (2) adjacent nodes (3) neighbours (4) All of these In symmetric key cryptography, for enerypting and decrypting the message, the key is (2) private (2). public (3) different —(4)__same In selective repeat, the size of the sender and receiver window should be at most (if m is the size of sequence numbers fields in bits) : ay 2 Q) 2 @) 2" (4) 2m If network part of Class B address would have used 21 bits instead of 16 bits. How many class B networks would have been possible ? qa 2 @ 216 @) 29 @) 23 In the slow start phase of the TCP congestion control algorithm, the size of the congestion window a Q) (3) increases quadratically (4) does not increase increases linearly increase exponentially Encryption and decryption provide secrecy, or confidentiality, but not (1) Authentication (2) Integrity (3) Frames (4) Allof these In the TCP/IP Protocol suite which one of the following is NOT part of the IP header ? (1) Fragment Offset (2) Source IP address (3) Destination TP address (A) Destination port number Match the following : OSI Layer Responsibilities 1. Network p. Encoding & layer Translation 2. Transport gq. Feedback layer Messaging 3. Data Link r. Transmission layer modes 4, Sessions. Segmentation layer and Reassembly 5. Presentation t. Dialogue layer control 6. Physical uw. Access layer Control 1-8, 2-4, 3-u, 41, 5-p, 6-4 . 28, 3-u, 444, Sep, 6-137. 38. 39. 40. DES and public key algorithm are combined (@ to speed up encrypted message transmission (ii) to ensure higher security by using different key foreach transmission Gi) as a combination is always better than individual system (iv) as it is required in e-Commerce () @and Gi) 2) Gi) and Git) (3) (iii)and (iv) (4) (i) and (iv) Which one of the following routing algorithms can be used for network layer design ? (1). shortest path algorithm (2) distance vector routing (3) link state routing (4) all of the mentioned Which of the following devices runs all seven layers of the OSI model reference ? (1) Router and Gateway 2) Bridge (3) Repeater (4) Hub Shifi reduce parsers are (1) Bottom Up parser (2) Top down Parser | (3) May be Bottom up or Top down | (4) None of the mentioned | A language is regular if and only if (1) Accepted by Pushdown Automata (2) Accepted by Non-deterministic finite Automata (3) Accepted by Deterministic finite Automata, (4) Accepted by Turing machine If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said tobe under an operation op. (1) Open (2) Closed (3) Decidable (4) None of the mentioned Which normal form amongst the following does not have left recursions (1). Greibach Normal Form (GNF) (2) Chomsky Normal Form (CNF) (3) Backus Naur Form (BNF) (4) None of these Which of the regular expressions corresponds to this grammar ? S— AB/AS, A> a/aA, Bb (1) aatbt Q) aatb (3) atb* (4) atab)* Output of a lexical analyzer is: (1) Parse tree (2) List of tokens (3) Intermediate code (4) Machine code 2416. 47. 48, B Which one of the following is a top- down parser ? (1) Recursive descent parser (2) Operator precedence parser (3) An LR(K) parser (4) An LALR(s) parser Consider the following statements regarding deterministic PDA (DPDA) and nondeterministic PDA (NPDA). st : In both DPDA and NPDA, dead configuration is allowed. $2: In NPDA, two transitions can have same constraints. $3 : Number of sates in DPDA <= NPDA Which option is correct ? (1) Only $1 and $3 (2) Only $3 (3) Allaretrue (4) Only $1 and $2 Identify the correct statement when LR parsers are compared using any particular grammar. (2) If LR (0) has no conflict, then SLR (1) may have conflict. 2) If SLR (1) has no conflict, then LR (0) never contain any conflict (3) If LALR (1) has no conflict CLR (1) never contain any conflict, (4) If CLR (1) has no conflict then LALR (1) may have conflict 49, a 51. 53. Consider the following about the Turing machine : (i) It can be represented using instantaneous description Gi) In one move, the Turing machine can write a symbol on the cell being scanned statements (ii) It can be represented using transition table Which of the above statement(s) is/are true? (1) Only (ii) (2) (ii) and (3) @. Gi) and Gii) (4) @ and ii) ‘The power set of infinite countable set is (1) Countable (2) Not Countable (3) Sometimes Countable (4) None of these Which one is informed search ? (1) Depth First Search (2) Breadth First Search (3) Bi-Directional Search (4) Heuristic Search ‘What is function for A* algorithm ? G) flo) = hay (4) f(a) <= he) A. compound proposition that is always true, no matter what the truth valucs of the propositional variable that is called (1) Tautology (3) Contingency (2) Contradiction (4) None of these54. 55. 57. 58. Give the predicate logic statement for : “Wonder is a name of a dog” (1) dog-wonder (2) dog (wonder) (3) wonder (dog)b (4) wonder-dog Methods are specified in the language by: (1) Syntax (2) Semantics (3) Inference (4) None Which search is similar to minimax search ? (1) Hill-climbing search (2) Depth-first search (3). Breadth-first search (4) All of these What is an example for blind search ? (1) Bidirectional Search (2) Depth-Limited Search (3) Uniform Cost Search (4) All of these What is the Nature of Satisfiability (SAT) problem ? | (1) NP-Hard | 62. (2) NP | @ P | (4) NP—Complete i s | 59. Here are two sentences in the language of first-order logic : A: Wray @2y) B : 3y xv > y) x y over natural numbers 0, 1, (i) Ais true Gi) Bisnottue (ii) A logically entails B (iv) B logically doesn’t entail A Which of the above statement are true ? (1) @and (i) 2) Gi) and iii) (3) @and Git) 4) Only (i) What is the worst-case time complexity of BFS to find the node at depth don 2 uniform tree with n successors to each node except leaf nodes ? @) 0") 2) om @G) Of") (4) 9(@") The operating system keeps the information of files in a table called (1) File Folder Table (FFT) (2) File Index Table (FIT) (3) File Number Table (FNT) (4) File Allocation Table (FAT) When a thread waits indefinitely for some resource, but other threads are actually using it is called (1) Segmentation (2) Demand Paging (3) Starvation 4) All of them 3B63. 64, 65. B What hole will allocate in “Worst-Fit” algorithm of memory management ? (1) It allocates the smaller hole than required memory hole (2) Itallocates the smallest hole from the available memory holes (3) It allocates the exact same size memory hole (4) It allocates the largest hole from the available memory holes Which of the following is advantage of virtual memory ? (1) Faster access to memory on an average, (2) Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory @) (4) Programs larger than the physical memory size ean be run In which one of the following p: replacement —_polic Belady’s anomaly may occur ? () FIFO (2) Optimal (3) LRU (@) MRU Metadata contains atleast : (1) the structure of the data. (2) the algorithms used for summarization (3) the mapping from the operational environment to the data warehouse. (4) All of these 68. 69. 70. Consider the following four processes, with the length of CPU Burst time in milliseconds : Process | Arrival Burst Time PI 0 lg 4 2 P2 1 |4 of P3 2 9 8 3 Pa 3 5 | Using the Round Robin scheduling algorithm, when time quantum is 2 units, the Average Waiting Time (1) 12.15 1.75 (3) 12.50 (4) None In which of the following states, process will be in secondary memory ? (1) New, Ready, Wait/Block (2) New, Wail/Block, Suspend Wait, Suspend Ready (3) WaivBlock, Suspend Wait, Suspend Ready (4) New, Suspend Wait, Suspend Ready Which of the following changes permission to deny write permission to group and others ? (1) Chmod go — w filex (2) Chmod go w filex (3) Chmod go = w filex (4) None of these Indicate which commands syntactically correct (i) Istdatb* (ii) Is-4-datb* (iii) 1s-1-datb* (iv) Is-la*-d b* (1) (and (ii) (3) (@ and (ii) are. 2) Gi) and (iii) (4) Gi) and (iv)1. 2. RB. 74. Which of the following are validation activities + (i) Code Review re (iii) System Testing (iv) Document Verification (v) Boundary Value Testing @) @.@) Q) @.Gv) G) Gi), Gi), (v) @_Allof these Stress Testing Fishbone Diagram is also known as (1) Pareto Diagram (2) Scatter Plot Diagram (3) Line Diagram (4) Ishikawa Diagram Which of the following cyclomatic complexity value range is preferred among the following : (1) 1to 10 Q) 101020 (3) 20t040 (4) Greater than 40 A Software Requirements Specification (SRS) document should avoid discussing which one of the following? (1). User Interface issues (2) Non-functional requirements (3) Design specification (4) Interfaces with third party software Which one is not right in the reference of Black Box Testing ? (1) Intemal workings of an application are not required. (2) Also known = as_— clear box/structural testing. This can only be done by trial and error method. Also known as closed box/data driven testing. @) @) | 10 8. ry | 76. The final form of testing COTS software is? (1) Unit (2) Integration (3) Alpha (4) Beta 77. Match the following : ‘A. Maintainability (ij) Must be usable by the users for which it was designed B. Dependability (ii) Ability to meet the changing needs of customers C. Efficiency ii) Optimal use of resources D. Acceptability (iv) Ability to withstand the events of system failure Matches : A BC D w Gd @ ty) Gi) @ di) dv) Gi) @ 8 @ dy) Gi) Gi) @ Gd) @ Gi ty The system design process does not include (1) modularity (3) coupling (2) cohesion (4) None of these COCOMO (COnstructive COst MOdel) is used to estimate (1) effort and duration based on the size of the software (2) size and duration based on the effort of the software (3) effort and cost based on the duration of the software size, effort and duration based on the cost of the software «480. 81. 82. B ‘The ability of the system to handle incorrect inputs is called as (2) Reliability (4) Robustness (1) Accuracy (3) Correctness Maich the following = List 1 A. Version (i) An instance of a system which is distributed to users outside of the development team B. Release (ii) An instance of a system which is functionally identical bbut non-funetionally distinct from other instances of system. C. Variant (iii) An instance of a system which is functionally distinct in some way from other system instances Mathes : A BoC Q) @ Gi) @ 2 gd @ Gd GB) Gi) @ @) Gi) ) Which transformation is used for undoing the applied transformation : (1) Reverse transformation (2) Rotation transformation (B) Reflection transformation (4) Inverse transformation | a 83. 84. 85. When 8-way symmetry is used to obtain a full circle from pixel coordinates generated for the 0 to 45 degree octant, some pixels are set or plotted twice. This phenomenon is sometimes referred to as : (1) Interlacing (3) Overstrike (2) Antialiasing (4) Aliasing A cubic Bezier curve segment is described by control points PO, 2), PIG, 8), P28, 8) and P39, 5). Another curve segment is deseribed by QO, b), QI(e, 2), Q2(15, 2) and Q3(18, 2). Determine the values a, b and c so that the two curve segments join smoothly. (1) a=9,b=5 and 2) a=5,b=9ande (3) a=2,b=9 and (4) a=2,b=Sando=9 When the centre of projection is at infinity along the z direction and the plane of projection is the principle plane, itis called (1)_ perspective projection (2) oblique projection (3) orthographic projection (4) diametric projection Which of the following is true for a DCT transform ? (1) As DCT is unitary transform, the energy is conserved (2) DCT has _ excellent energy compaction for highly correlated data (3) Cosine transform is not real part of unitary DCT (4) Allof these87. 88. 89. 90. In image processing, Noise suppression operators are (2) Averaging functions (2) Histogram functions (3) Derivative functions (4) Subtractive functions If a histogram of the image is concentrated on the lower side of the gray scale, then the image is (1) Very Bright (2) Very Dark (3) Equallized (4) White image JPEG is an standard developed by the image compression (1) Joint Photo Editing Group (2) Joint Photographic Experts Group (3) Joint Photo Encapsulation Group (4) Joint Photo Encoding Group Consider a homogenous coordinate system with three coordinates x, y and z All the points in the system with z coordinate zero are called as (1). Cartesian points (2) Parallel points (3) Origin points (4) Points at infinity i | 2 oO. 92. Match the following : A. Cavalier (i) Projection by Projection aligning ——_the projection plane so that it intersects each coordinate axis at the same distance from the origin. B. Cabinet (ii) Projection of, Projection points. —_ along parallel lines that are not perpendicular to the projection plane. C. Isometric (ii) All lines Projection perpendicular to the viewing surface are projected at one~ half their length. D. Oblique (iv) All lines Projection perpendicular to the projection plane are projected with no change in length. Matches : A BC D a ww Gi) © 2 di) Gi) @ Gy) e @) dd @ @ @ @ di Gi) Gy) Consider coordinates of clipping window : x-max = 300; y-max = 200; x-min = 100 and y-min = 100. ‘What are the clipping points for the line Joining (150, 150) and (400, 300) ? (1) (150, 150) and (233, 200) (2) (170, 150) and (233, 200) (3) (150, 150) and (250, 300) (4) (150, 160) and (255, 150)93. 94. 95, 96. 97. B Which algorithm can be used to fill the interior parts of the curved objects ? (@_Scan-line fill algorithm Gi). Scan-tine algorithm (ii) Boundary-fill algorithm (iv) Flood-fill algorithm (Q) @, Gi) and (iv) only (2) Gili) and Gv) only (3) Gand (iv) only ) Allof these The boundary of an image represented by (2) Quad Tree (3) Polygons (2) Projections (4) Chain codes Which of the following is a video compression technique ? () TIF (2) PEG (3) BMP (4) MPEG ‘The parameters of periodic noise are estimated by (1)_ Inspecting the Foi (2) Visual Analysis (3) Patches of intensity (4) All of these ‘er spectrum the — background Given an image of size 1024 x 1024 pixels and the size of each pixel is an 8-bit quality. It requires of storage space if the image is not compressed. (1) One Terabyte (2) One Megabyte @G) SMegabytes (4) 8 Terabytes | | i 1 | i | 98. 99, 100. 101. Which one is not the transformation function ? intensity (1) Log Transformations (2) Image Neg: 3) Gamma Transformations (4) Translation Transformations Most techniques are : (1) Differential coding and Huffman coding common entropy encoding (2) Huffman coding and Arithmetic coding (3) Arithmetic coding and Differential coding (4) Differential coding and Vector coding Which of the following are methods for supervised classification ? (1) Decision tree, K-means (2) Naive Bayes, Decision tree @) K-means Hierarchal (4) Hierarchal, Naive Bayes A distance metric used in cluster analysis must have the following properties = ay 2 @) Always positive Distance from x to x is zero Distance from x to y is same as y tox @) All of these102. 103. 104. Data scrubbing is defined as (1) a process to reject data from the data warehouse and to create the necessary indexes. @) a process to load the data in the data warehouse and to create the necessary indexes (3) aprocess to upgrade the quality of data afier it is moved into a data warehouse. (4) a process to upgrade the quality of data before it is moved into a data warehouse. Match the following A. Enterprise (i) Collection of the Warehouse information about different subjects B, Data Mart (ii) Set of views over operational databases C. Virtual iii) Data that is of Warehouse value to a specific group of users A BC © @® @ Gi 2 Gi) @ @ 6) di) @ a4 @ Gi) Gd) Consider a data set D with n numt attributes and D number of training tuples. What is the worst-case complexity of growing a decision tree ? (1) Of@x Dx log(D)) Q) O(log (n) x D) G) O(n x log(D)) (4) Ox D) | 10s. 107. 108. 109. Match the following = A. Classification (i) Prediction of categorical data B. Regression (ii) Analysis of data objects C. Clustering (iii) Identification of distribution trends A BC @ @ Gi) Gi) 2 dd Gi @ QB) di) @ @ @ @ Gi) Gi) . Identify odd one out (1) K~Mean method (2) Self organising feature map method (3) K~nearest neighbour method (4) Agglomerative method Which approach is used for data clustering ? (1). Single layer perception (2) Selforganisation map (3) Multilayer perception (4) Radial basis function The data can be stored, ret updated in (1) OLAP 2) OLTP (3) SMTP (4) FTP Which of the following step is not involved in data mining ? (1) Knowledge extraction (2) Data archaeology (3) Data exploration (4) Data transformation B110. A Device driver is required by which UL. 112. 113. 14. FE of the following ? (1) Disk @) Cache (@) RAM (4) Register Consider a 4-way set associative cache consisting of 128 lines with a line size of 64 words. The CPU generat 20-bit address of a word in main memory. The number of bits in the TAG, LINE and WORD field are respectively. () 96,5 Q 1.76 @) 75,8 (4) 9,5,6 Which algorithm is used to remove and place new contents into the cache ? (1). Renewal algorithm (2) Updation (3). Replacement algorithm (4) None of these What is the product of maxterms for Boolean function F=xy +3'2? () r0,247 2 7O.24,6) @) 20,3.4,6) @) 2 (0.2.4.5) Consider a multiplier circuit that multiplies a binary number represented by 4 bits by a number represented by 3 bits and produces a 7-bit result. How many AND gates and 4-bit adders are needed to design the circuit ? (1) Wand 4 2) 12and3 (3) 12and2 (4) Gand3 115. 116. 117. 118. 119. 120. ‘A computer uses a memory unit with 256 K words of 32 bits each. A binary instruction code is stored in one word of memory. The instruction has four parts : an indirect bit, an opcode a register code part to specify one of 64 registers, and an address part. What is the size of opcode in number of bits ? @ 6 @7 3) 8 (4) 9 Which of the following is an instruction in pseudo code ? (1) BEGIN @) END (3) Both BEGIN and END (4) None of these What is the size of decoder to select row of the chip with size 128 x 8 RAM, each to address 2048 byte of memory? (1) 4x16 Q) 6x12 Q) 4x12 (4) 8x16 In vectored interrupt, branch address i supplied by (a) CPU (2) Peripheral interrupted (3) WO Service routine (4) None of these ‘The register used by the CPU as working area is called (1) Program counter (2) Accumulator (3)_ Instruction register (4) Index register SQL provides a number of special aggregate functions. Which of the following is not included in SQL ? (@) Count (2) Median @) Min (4) Sum13 ewer & fare SIFT / SPACE FOR ROUGH WORK 16