Q1➡| Engineering Mathematics Consider a sequence F 00 defined as : F00 (0) = 1, F00 (1) = 1 F00 (n) = ((10 ∗ F00 (n – 1) + 100)/ F00 (n – 2)) for n ≥ 2 Then what shall be the set of values of the sequence F00 ?
Q3➡| Engineering Mathematics The functions mapping R into R are defined as : f(x) = x3 – 4x, g(x) = 1/(x 2 + 1) and h(x) = x4 . Then find the value of the following composite functions : hog(x) and hogof(x)
Q5➡| Engineering Mathematics Consider a Hamiltonian Graph G with no loops or parallel edges and with |V(G)| = n ≥ 3. Then which of the following is true ?
i ➥deg(v) ≥n/2 for each vertex v.
ii ➥ |E(G)| ≥1/2(n – 1) (n – 2) + 2
iii ➥ deg (v) + deg(w) ≥ n whenever v and w are not connected by an edge
Q7➡| Digital Logic Design ECL is the fastest of all logic families. High speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into __.
Q8➡ |Digital Logic Design A binary 3 bit down counter uses J-K flip-flops, FFi with inputs Ji , Ki and outputs Qi , i=0,1,2 respectively. The minimized expression for the input from following, is I. J0 = K0 = 0 II. J0 = K0 = 1 III. J1 = K1 = Q0 IV. J1 = K1 =Q’0 V. J2 = K2 = Q1 Q0 VI. J2 = K2 = Q’1 Q’0
Q16➡| Database Management System An attribute A of data type varchar (20) has value ‘Ram’ and the attribute B of data type char (20) has value ‘Sita’ in oracle. The attribute A has memory spaces and B has memory spaces.
Q17➡| Database Management System Integrity constraints ensure that changes made to the database by authorized users do not result into loss of data consistency. Which of the following statement(s) is (are) true w.r.t. the examples of integrity constraints ? (A) An instructor Id. No. cannot be null, provided Instructor Id No. being primary key. (B) No two citizens have same Adhar-Id. (C) Budget of a company must be zero.
Q18➡| Database Management System Let M and N be two entities in an E-R diagram with simple single value attributes. R1 and R2 are two relationship between M and N, where as R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to represent M, N, R1 and R2 in the relational model are ________.
Q19➡| Database Management System Consider a schema R(MNPQ) and functional dependencies M → N, P → Q. Then the decomposition of R into R1(MN) and R2(PQ) is________.
i ➥Dependency preserving but not lossless join
ii ➥ Dependency preserving and lossless join
iii ➥ Lossless join but not dependency preserving
iv ➥Neither dependency preserving nor lossless join.
Q20➡| Database Management System The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ____________.
i ➥16
ii ➥ 63
iii ➥64
iv ➥68
Show Answer With Best Explanation
Answer: None of the above Explanation: Upload Soon
Q21➡| Data Structure Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array ?
i ➥Insertion – 0(1), Deletion – 0(1), Maximum – 0(1), Minimum – 0(l)
ii ➥ Insertion – 0(1), Deletion – 0(1), Maximum – 0(n), Minimum – 0(n)
iii ➥Insertion – 0(n), Deletion – 0(n), Maximum – 0(1), Minimum – 0(1)
iv ➥Insertion – 0(n), Deletion – 0(n), Maximum – 0(n), Minimum – 0(n)
Q22➡| Data Structure The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue.Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is __.
Q24➡| Data Structure If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key x is less than _________.
Q25➡| Data Structure Which of the following statements is false ? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) Given the prefix and postfix walks of a binary tree, the tree cannot be re-constructed uniquely. (D) Depth-first-search can be used to find the connected components of a graph.
Q29➡| Computer Network Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated _______.
i ➥Automatically
ii ➥ by server
iii ➥by exchanging information with neighbour nodes
Q31➡| Theory of Computation Which of the following strings would match the regular expression : p+ [3 – 5]∗ [xyz]? I. p443y II. p6y III. 3xyz IV. p35z V. p353535x VI. ppp5
Q32➡| Computer Architecture Consider the following assembly language instructions : mov al, 15 mov ah, 15 xor al, al mov cl, 3 shr ax, cl add al, 90H adc ah, 0 What is the value in ax register after execution of above instructions ?
Q33➡| Theory of Computation, Complier Design Consider the following statements related to compiler construction : I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct ?
Q34➡| Computer Architecture The contents of Register (BL) and Register (AL) of 8085 microprocessor are 49H and 3AH respectively. The contents of AL, the status of carry flag (CF) and sign flag (SF) after executing ‘SUB AL, BL’ assembly language instruction, are
Q35➡| Compiler Design Which of the following statement(s) regarding a linker software is/are true ? I A function of a linker is to combine several object modules into a single load module. II A function of a linker is to replace absolute references in an object module by symbolic references to locations in other modules.
Q36➡| Operating System There are three processes P1 , P2 and P3 sharing a semaphore for synchronizing a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order : (a) P2 needs to access (b) P1 needs to access (c) P3 needs to access (d) P2 exits critical section (e) P1 exits critical section The final value of semaphore will be :
Q37➡| Computer Architecture In a paging system, it takes 30 ns to search translation Lookaside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is :
Q39➡| Operating System Which of the following scheduling algorithms may cause starvation ? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first
Q43➡| Software Engineering Which of the following statement(s) is/are true with respect to software architecture ? S1 : Coupling is a measure of how well the things grouped together in a module belong together logically. S2 : Cohesion is a measure of the degree of interaction between software modules. S3 : If coupling is low and cohesion is high then it is easier to change one module without affecting others.
Q48➡| Computer Network Which of the following is/are true w.r.t. applications of mobile computing ? (A) Travelling of salesman (B) Location awareness services
Q50➡| Database Management System Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP) ? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is inexpensive to implement
