comprehensive 1.pdf

COMPREHENSIVE 1-19 Answer: 3 end with 00 If the strings beginning with 0 and 1 are 01 and 11 respectively, then the DFA doesn’t accept these( because it doesn’t reach to the final terminating/accepting state). Hence not option A. If the string ending with 0 is 10,...

COMPREHENSIVE 1-19 Answer: 3 end with 00 If the strings beginning with 0 and 1 are 01 and 11 respectively, then the DFA doesn’t accept these( because it doesn’t reach to the final terminating/accepting state). Hence not option A. If the string ending with 0 is 10, then the DFA doesn’t accept this also. Hence not option B. If the string which contains substring 00 is 1001, then the DFA doesn’t accept this also. Hence, not option D. Answer: 1 15 Answer: 4 12 et(p*q)=(p-1)*(q-1) (26)=(13)*(2) et(26)=et(13*2)=(13-1)*(2-1)=12*1=12 Answer: 1 (41,17,209) Answer: 2 1088 Answer: 1 0 (1) Θ(n + b) Object based data models are used in describing the abstraction at 1. Physical level 2. Both conceptual and view level 3. Both Physical and conceptual level 4. All the 3 Levels ( Physical, Conceptual and View ) Suppose that a bus has 16 data lines and requires 4 cycles of 250 ns 1. 1Megabyte/sec each to transfer data. The bandwidth of this bus would be 2 2. 4Megabytes/sec Megabytes/sec. If the cycle time of the bus was reduced to 125 ns 3. 8Megabytes/sec and the number of cycles required for transfer stayed the same what 4. 2Megabytes/sec would the bandwidth of the bus? The relation scheme student performance (name, courseNo, 1. 2 NF rollNo, grade) has the following functional dependencies: 2. 3 NF 3. BCNF name, courseNo --> grade 4. 4 NF Rol INo, courseNo —> grade name —> rollNo rollNo —> name The highest normal form of this relation scheme is: The solution of the recurrence T(n) = T(n − 1) + log n is 1. O(n) 2. O(n^2 logn) 3. O(nlogn) 4. O(logn)  After log(n!) We all know; n!=n(n-1)(n-2).... n!=n.n.n.n.... (because if we consider only highest term then it's n so...) n!=n^n Now put it to our question so, T(n)=1+log(n!) T(n)=1+log(n^n) T(n)=1+n(log(n)) (According log property) What is the function used in R to create a simple linear 1. regressor? lm() function 2. lr() function 3. slr() function 4. slm() function Which map are extremely popular and the most common 1. thematic map in use today. Flow map 2. Choropleth map 3. Cartogram 4. Heat map Which of the following data structures is most efficient in terms 1. of both space and time to reverse a string of characters? queue 2. array 3. linked list 4. stack Which of the following operations is performed more efficiently 1. by doubly linked list than by a singly linked list? Searching an unsorted list for a given item 2. Inserting a node after the node with a given location 3. Traversing the list to process each node 4. Deleting a node whose location is given Which of the following search uses the problem-specific 1. knowledge outside the definition of the problem Informed search 2. Depth-first search 3. Breadth-first search 4. Uninformed search (a+b)(cd)*(a+b) denotes the following set 1. {a(cd)^nb|n>=1} 2. {a(cd)^n>=1}U{b(cd)^n|n>=1 } 3. {a(cd)^na|n>=0}U{a(cd)^nb|n >=0}U{b(cd)^na|n>=0}U{b(cd )^nb|n>=0} 4. {ac^nd^nb|n>=1}. Match the following. 1. P-4. Q-1, R-2, S-3 List-I List-II 2. P. Regular expression 1. Lexical analysis P-1, Q-3, R-4, S-2 Q. Pushdown automata 2. Code generation 3. R. Dataflow analysis 3. Syntax analysis P-3, Q-4, R-1, S-2 S. Register allocation 4. Code optimization 4. P-2, Q-1, R-4, S-3 Relations that are generated from the ER model will always 1. be in 1NF 2. 2NF 3. 3NF 4. 4NF Which one of the following is not mandatory in a symmetric 1. key cryptosystem? a. Plain text 2. a. Cipher text 3. a. Secret key 4. a. Session key 1. In Data Encryption Standard, the encryption algorithm 1. generates 16 different ____ subkeys, one for each of 16-bit the 16 encryption rounds 2. 24-bit 3. 32-bit 4. 48-bit 1. Match the following where ‘n’ is the number of 1. elements in the list. 1-b, 2-c,3-a,4-d 1. Sorting a. O(1) 2. 1-c,2-b,3-a,4-d 2. Binary search b. O(nlogn) 3. 3. Linear search c. O(logn) 1-b,2-c,3-d, 4-a 4. Search in a hash table d. O(n) 4. 1-a, 2-c,3-b,4-d 1. What is the output of the following recursive function 1. when cal(2,4) is called? Output is 6 int func(int x, int y) 2. { Output is 4 if (y==2) 3. return 1; Output is 2 else return x * func(x,y-1); 4. } Output is 5 Find the time complexity of the code segment below. 1. O(n) 2. function daa(A, n, T) O(n!) L := 0 3. R := n − 1 O(log n) while L ≤ R do 4. O(nlog n) m := floor((L + R) / 2) if A[m] < T then L := m + 1 else if A[m] > T then Binary Search R := m − 1 else: return m return unsuccessful Given the following three points in 2D-space, find the 1. orientation of P3 P5 with P4 Clockwise 2. Counter Clockwise 3. Collinear 4. Cannot be determined. k=(q.y - p.y)*(r.x - q.x)-(q.x - p.x) * (r.y - q.y); if(k==0): They are all colinear if(k>0) : They are all clockwise https://stackoverflow.com/questions/17592800/how-to-find-th if(k