InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A recursive function h, is defined as follows :h(m) = k, if m = 0 = 1, if m = 1 = 2 h(m – 1) + 4h(m – 2), if m ≥ 2If the value of h(4) is 88 then the value of k is :(A) 0(B) 1(C) 2(D) -1 |
| Answer» None | |
| 2. |
Given the following two languages :L1 = {an bn | n ≥ 0, n ≠ 100}L2 = {w ∈ {a, b, c}*| na(w) = nb(w) = nc(w)}Which of the following options is correct ?(A) Both L1 and L2 are not context free language(B) Both L1 and L2 are context free language.(C) L1 is context free language, L2 is not context free language.(D) L1 is not context free language, L2 is context free language. |
| Answer» | |
| 3. |
Match the following for Unix file system:(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |
| 4. |
In RSA public key cryptosystem suppose n = p ∗ q where p and q are primes. (e, n) and (d, n) are public and private keys respectively. Let M be an integer such that o < M < n and φ(n) = (p – 1)(q – 1). Which of the following equations represent RSA public key cryptosystem ? I. C ≡ Me(mod n) M ≡ (C)d(mod n) II.ed ≡ 1(mod n) III.ed ≡ 1(mod φ(n)) IV. C ≡ Me(mod φ(n)) M ≡ Cd(mod φ(n))Codes :(A) I and II(B) I and III(C) II and III(D) I and IV |
| Answer» None | |
| 5. |
A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is _________ secs.(A) 1(B) 2(C) 3(D) 4 |
| Answer» None | |
| 6. |
The asymptotic upper bound solution of the recurrence relation given by(A) O(n2)(B) O(n lg n)(C) O(n lg lg n)(D) O(lg lg n) |
| Answer» None | |
| 7. |
Which of the following neural networks uses supervised learning ?(A) Multilayer perceptron(B) Self organizing feature map(C) Hopfield network(A) (A) only(B) (B) only(C) (A) and (B) only(D) (A) and (C) only |
| Answer» | |
| 8. |
Let R and S be two fuzzy relations defined as :Then, the resulting relation, T, which relates elements of universe x to the elements ofuniverse z using max-min composition is given by :(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» None | |
| 9. |
Which one is correct w.r.t. RDBMS ?(A) primary key ⊆ super key ⊆ candidate key(B) primary key ⊆ candidate key ⊆ super key(C) super key ⊆ candidate key ⊆ primary key(D) super key ⊆ primary key ⊆ candidate key |
| Answer» | |
| 10. |
Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows :(A) pk(R2) → pk(R1)(B) pk(R1) → pk(R2)(C) pk(R2) → R1 ∩ R2(D) pk(R1) → R1 ∩ R2 |
| Answer» | |
| 11. |
For a database relation R(A, B, C, D) where the domains of A, B, C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are :A → CB → DThe relation R is in _______.(A) First normal form but not in second normal form.(B) Both in first normal form as well as in second normal form.(C) Second normal form but not in third normal form.(D) Both in second normal form as well as in third normal form. |
| Answer» | |
| 12. |
Consider the following relation:Works (emp_name, company_name, salary)Here, emp_name is primary key.Consider the following SQL querySelect emp_nameFrom works Twhere salary > (select avg (salary) from works S where T.company _ name = S.company _ name)The above query is for following :(A) Find the highest paid employee who earns more than the average salary of all employees of his company.(B) Find the highest paid employee who earns more than the average salary of all the employees of all the companies.(C) Find all employees who earn more than the average salary of all employees of all the companies.(D) Find all employees who earn more than the average salary of all employees of their company. |
| Answer» None | |
| 13. |
A segment is any object described by GKS commands and data that start with CREATE SEGMENT and Terminates with CLOSE SEGMENT command. What functions can be performed on these segments ?(A) Translation and Rotation(B) Panning and Zooming(C) Scaling and Shearing(D) Translation, Rotation, Panning and Zooming |
| Answer» | |
| 14. |
Below are the few steps given for scan-converting a circle using Bresenham’s Algorithm. Which of the given steps is not correct ?(A) Compute d = 3 – 2r (where r is radius)(B) Stop if x > y(C) If d < 0, then d = 4x + 6 and x = x + 1(D) If d ≥ 0, then d = 4 ∗ (x – y) + 10, x = x + 1 and y = y + 1 |
| Answer» | |
| 15. |
If following sequence of keys are inserted in a B+ tree with K(=3) pointers:8, 5, 1, 7, 3, 12, 9, 6Which of the following shall be correct B+ tree?(1)(2)(3)(4)(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |
| 16. |
Which of the following statement(s) is/are correct ?(A) Persistence is the term used to describe the duration of phosphorescence.(B) The control electrode is used to turn the electron beam on and off.(C) The electron gun creates a source of electrons which are focussed into a narrow beam directed at the face of CRT.(D) All of the above |
| Answer» | |
| 17. |
Match the following:(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |
| 18. |
The first order logic (FOL) statement ((R ∨ Q) ∧ (P ∨ ¬Q)) is equivalent to which of the following ?(A) ((R ∨ ¬Q) ∧ (P ∨ ¬Q) ∧ (R ∨ P))(B) ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (R ∨ P))(C) ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ (R ∨ ¬P))(D) ((R ∨ Q) ∧ (P ∨ ¬Q) ∧ ( ¬R ∨ P)) |
| Answer» None | |
| 19. |
Which of the following is/are side effects of scan conversion ?a. Aliasingb. Unequal intensity of diagonal linesc. Overstriking in photographic applicationsd. Local or Global aliasing(A) a and b(B) a, b and c(C) a, c and d(D) a, b, c and d |
| Answer» | |
| 20. |
In Artificial Intelligence (AI), what is present in the planning graph?(A) Sequence of levels(B) Literals(C) Variables(D) Heuristic estimates |
| Answer» | |
| 21. |
Consider a disk queue with I/O requests on the following cylinders in their arriving order:6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is:(A) 172(B) 173(C) 227(D) 228 |
| Answer» | |
| 22. |
Consider the following AO graph:Which is the best node to expand next by AO* algorithm?(A) A(B) B(C) C(D) B and C |
| Answer» | |
| 23. |
Which statement is not correct about “init” process in Unix?(A) It is generally the parent of the login shell.(B) It has PID 1.(C) It is the first process in the system.(D) Init forks and execs a ‘getty’ process at every port connected to a terminal. |
| Answer» | |
| 24. |
Unix command to change the case of first three lines of file “shortlist” from lower to upper(A) $ tr ‘[a – z]’ ‘[A – Z]’ shortlist ¦ head-3(B) $ head-3 shortlist ¦ tr ‘[a – z]’ ‘[A – Z]’(C) $ tr head -3 shortlist ‘[A – Z]’ ‘[a – z]’(D) $ tr shortlist head -3 ‘[a – z]’ ‘[A – Z]’ |
| Answer» | |
| 25. |
From the given data below :a b b a a b b a a bwhich one of the following is not a word in the dictionary created by LZ-coding (the initial words are a, b)?(A) a b(B) b b(C) b a(D) b a a b |
| Answer» | |