I honestly think it is better to be a failure at something you love than to be a success at something you hate.
1. COCOMO stands for
(A) COmposite COst MOdel
(B) COnstructive COst MOdel
(C) COnstructive COmposite MOdel
(D) COmprehensive COnstruction MOdel
View/Hide Ans
Correct Answer is B
2. Match the following:
Codes:
List I
List II
a. Good quality
i. Program does not fail for a specified time in a given environment
b. Correctness
ii. Meets the functional requirements
c. Predictable
iii. Meets both functional and non-functional requirements
d. Reliable
iv. Process is under statistical control
(A) a-iii b-ii c-iv d-i
(B) a-ii b-iii c-iv d-i
(C) a-i b-ii c-iv d-iii
(D) a-i b-ii c-iii d-iv
View/Hide Ans
Correct Answer is A
3. While estimating the cost of software, Lines of Code (LOC) and Function Points (FP) are used to measure which one of the following?
(A) Length of code
(B) Size of software
(C) Functionality of software
(D) None of the above
View/Hide Ans
Correct Answer is B
4. A good software design must have
(A) High module coupling, High module cohesion
(B) High module coupling, Low module cohesion
(C) Low module coupling, High module cohesion
(D) Low module coupling, Low module cohesion
View/Hide Ans
Correct Answer is C
5. Cyclometric complexity of a flow graph G with n vertices and e edges is
(A) V(G) = e+n-2
(B) V(G) = e-n+2
(C) V(G) = e+n+2
(D) V(G) = e-n-2
View/Hide Ans
Correct Answer is B
6. When the following code is executed what will be the value of x and y?
int x = 1, y=0;
y = x++;
(A) 2, 1
(B) 2, 2
(C) 1, 1
(D) 1, 2
View/Hide Ans
Correct Answer is A
7. How many values can be held by an array A(-1,m;1 ,m) ?
(A) m
(B) m2
(C) m(m+l)
(D) m(m+2)
View/Hide Ans
Correct Answer is D
8. What is the result of the expression: (1&2)+(3/4) ?
(A) 1
(B) 2
(C) 3
(D) 0
View/Hide Ans
Correct Answer is D
9. How many times the word 'print' shall be printed by the following program segment?
for(i=1, i<=2, i++)
for(j=1, j<=2, j++)
for(k=1, k<=2, k++)
printf("print/n")
(A) 1
(B) 3
(C) 6
(D) 8
View/Hide Ans
Correct Answer is D
10. Which of the following is not a type of Database Management System?
(A) Hierarchical
(B) Network
(C) Relational
(D) Sequential
View/Hide Ans
Correct Answer is D
11. Manager's salary details are to be hidden from Employee Table. This Technique is called as
(A) Conceptual level Datahiding
(B) Physical level Datahiding
(C) External level Datahiding
(D) Logical level Datahiding
View/Hide Ans
Correct Answer is C
12. A Network Schema
(A) restricts to one to many relationship
(B) permits many to many relationship
(C) stores Data in a Database
(D) stores Data in a Relation
View/Hide Ans
Correct Answer is B
13. Which normal form is considered as adequate for usual database design?
(A) 2NF
(B) 3NF
(C) 4NF
(D) 5NF
View/Hide Ans
Correct Answer is B
14. If D1, D2,.... Dn are domains in a relational model, then the relation is a table, which is a subset of
(A) D1+D2+.... +Dn
(B) D1x D2x... xDn
(C) D1U D2U....UDn
(D) D1-D2-....-Dn
View/Hide Ans
Correct Answer is B
15. Which of the following addresses is used to deliver a message to the correct application program running on a host?
(A) Port
(B) IP
(C) Logical
(D) Physical
View/Hide Ans
Correct Answer is A
16. In substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text.
(A) polyalphabetic
(B) monoalphabetic
(C) transpositional
(D) multialphabetic
View/Hide Ans
Correct Answer is B
17. In classful addressing, the IP address 190.255.254.254 belongs to
(A) Class A
(B) Class B
(C) Class C
(D) Class D
View/Hide Ans
Correct Answer is B
18. In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy?
(A) 10 clusters, 24 regions and 20 routers
(B) 12 clusters, 20 regions and 20 routers
(C) 16 clusters, 12 regions and 25 routers
(D) 15 clusters, 16 regions and 20 routers
View/Hide Ans
Correct Answer is D
19. In IPv4 header, the field is needed to allow the destination host to determine which datagram a newly arrived fragment belongs to.
(A) identification
(B) fragment offset
(C) time to live
(D) header checksum
View/Hide Ans
Correct Answer is A
20. Given L1 = L(a*baa*) and L2 = L(ab*).
The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
(A) a*b
(B) a*baa*
(C) a*ba*
(D) None of the above
View/Hide Ans
Correct Answer is C
21. Given the production rules of a grammar G1 as
S1→AB|aaB
A→a|Aa
B→b
and the production rules of a grammar G2 as
S2→aS2bS2|bS2aS2|λ
Which of the following is correct statement?
(A) G1 is ambiguous and G2 is not ambiguous.
(B) G1 is ambiguous and G2 is ambiguous.
(C) G1 is not ambiguous and G2 is ambiguous.
(D) G1 is not ambiguous and G2 is not ambiguous.
View/Hide Ans
Correct Answer is B
22. Given a grammar :
S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc.
Thus, SaSbc is a right sentential form, and its handle is
(A) SaS
(B) be
(C) Sbe
(D) aSb
View/Hide Ans
Correct Answer is D
23. The equivalent production rules corresponding to the production rules
S→S∝1|S∝2|ß1|ß2 is
(A) S→ß1 | 2, A→∝1A | ∝2A | λ
(B) S→ß1 | ß2 | ß1A | ß2A,
A→∝1A | ∝2A
(C) S→ß1 | ß2, A→∝1A | ∝2A
(D) S→ß1 | ß2 | ß1A | ß2A,
A→∝1A | ∝2A | λ
View/Hide Ans
Correct Answer is D
24. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below
25. Which is the correct statement(s) for Non Recursive predictive parser?
S1: First(∝) = {t | ∝ => *t ß for some string ß } => *tß
S2: Follow(X) = { ∝ | S => *∝X∝ ß for some strings ∝ and ß }
(A) Both statements S1 and S2 are incorrect.
(B) S1 is incorrect and S2 is correct.
(C) S1 is correct and S2 is incorrect.
(D) Both statements S1 and S2 are correct.
View/Hide Ans
Correct Answer is D
26. Given an open address hash table with load factor ∝ < 1, the expected number of probes in a successful search is
View/Hide Ans
Correct Answer is B
27. For a B-tree of height h and degree t, the total CPU time used to insert a node is
(A) O(h log t)
(B) O(t log h)
(C) O(t2h)
(D) O(th)
View/Hide Ans
Correct Answer is D
28. The time complexity to build a heap with a list of n numbers is
(A) O(log n)
(B) O(n)
(C) O(n log n)
(D) O(n2)
View/Hide Ans
Correct Answer is B
29. The value of postfix expression:
8 3 4 + - 3 8 2 / + * 2 $ 3+ is
(A) 17
(B) 131
(C) 64
(D) 52
View/Hide Ans
Correct Answer is D
30. Consider the following statements for priority queue:
S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
S2: The elements of a priority queue may be complex structures that are ordered on one or several fields.
Which of the following is correct?
(A) Both S1 and S2 are incorrect.
(B) S1 is correct and S2 is incorrect.
(C) S1 is incorrect and S2 is correct.
(D) Both S1 and S2 are correct.
View/Hide Ans
Correct Answer is D
31. Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as
(A) Data mining
(B) Meta data
(C) Data warehousing
(D) Database
View/Hide Ans
Correct Answer is C
32. The task of correcting and pre processing data is called as
(A) Data streaming
(B) Data cleaning
(C) Data mining
(D) Data storming
View/Hide Ans
Correct Answer is B
33. Using data p=3, q=11, n=pq, d=7 in RSA algorithm, find the cipher text of the given plain text SUZANNE
(A) BUTAEEZ
(B) SUZANNE
(C) XYZABCD
(D) ABCDXYZ
View/Hide Ans
Correct Answer is A
34. The relation "divides" on a set of positive integers is ..................
(A) Symmetric and transitive
(B) Anti symmetric and transitive
(C) Symmetric only
(D) Transitive only
View/Hide Ans
Correct Answer is B
35. Give as good a big-Q estimate as possible for the following functions:
(nlogn+n2)(n3+2) and
(n!+2n)(n3+log(n2+ 1))
(A) O(n5+2n2) & O(n3*n!)
(B) O(n5) & O(n3*2n)
(C) O(n5) & O(n3*n!)
(D) O(n5+2n2) & O(n3*2n)
View/Hide Ans
Correct Answer is C
36. A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.
(A) 100P2
(B) 100C2
(C) 2100
(D) 3100
View/Hide Ans
Correct Answer is D
37. Which of the following connected simple graph has exactly one spanning tree?
(A) Complete graph
(B) Hamiltonian graph
(C) Euler graph
(D) None of the above
View/Hide Ans
Correct Answer is D
38. How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?
(A) M+N-C
(B) M-N-C
(C) M-N+C
(D) M+N+C
View/Hide Ans
Correct Answer is C
39. Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise?
(A) (p∨q∧∼r) ∨ (p∧q∧r) ? (∼p∧q∨r)
(B) (p∧q∨r) ∧ (p∧q∧r) ∨ (∼q∧∼p∧∼r)
(C) (p∧q∧∼r) ∨ (p∧∼q∧r) ∨ (∼p∧q∧r)
(D) (p∨r∧q) ∨ (p∧q∧r) ∨ (∼p∧q∧r)
View/Hide Ans
Correct Answer is C
40. The truth value of the statements:
∃!xP(x)→∃xP(x) and ∃!x∼ P(x)→∼ ∀xP(x), (where the notation ∃!xP(x) denotes the proposition "There exists a unique x such that P(x) is true") are:
(A) True and False
(B) False and True
(C) False and False
(D) True and True
View/Hide Ans
Correct Answer is D
41. How many different Boolean functions of degree 4 are there?
(A) 24
(B) 28
(C) 212
(D) 216
View/Hide Ans
Correct Answer is D
42. A Boolean operator ? is defined as follows:
1Θ1=1, 1Θ0=0, 0Θ1=0 and 0Θ0=1
What will be the truth value of the expression (xΘy)Θz = xΘ(yΘz)?
(A) Always false
(B) Always true
(C) Sometimes true
(D) True when x, y, z are all true
View/Hide Ans
Correct Answer is B
43. Which one of the following is decimal value of a signed binary number 1101010, if it is in 2's complement form?
(A) -42
(B) - 22
(C) -21
(D) -106
View/Hide Ans
Correct Answer is B
44. A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is
P1 || P2 || P3 || ..... || Pk if and only if:
(A) Pi || Pj for all i ≠ j
(B) Pi || Pj for all i = j+1
(C) Pi || Pj for all i ≤ j
(D) Pi || Pj for all i ≥ j
View/Hide Ans
Correct Answer is A
45. When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as.................
(A) handoff
(B) mobile switching
(C) mobile routing
(D) cell switching
View/Hide Ans
Correct Answer is A
46. A virtual memory based memory management algorithm partially swaps out a process. This is an example of
(A) short term scheduling
(B) long term scheduling
(C) medium term scheduling
(D) mutual exclusion
View/Hide Ans
Correct Answer is C
47. Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are
98, 37, 14, 124, 65, 67:
(A) 310
(B) 324
(C) 320
(D) 321
View/Hide Ans
Correct Answer is D
48. Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory?
(A) 21 ns
(B) 23 ns
(C) 30 ns
(D) 35 ns
View/Hide Ans
Correct Answer is C
49. Consider the following UNIX command:
sort
Which of the following functions shall be performed by this command?
(A) Sort, taking the input from "temp", prints 30 lines from temp and delete the file temp
(B) Sort the file "temp", removes 30 lines from temp and delete the file temp
(C) Sort, taking the input from "in" and writing the output to "temp" then prints 30 lines from temp on terminal. Finally "temp" is removed.
(D) Sort, taking the input from 'temp" and then prints 30 lines from "temp" on terminal. Finally "temp" is removed.
View/Hide Ans
Correct Answer is C
50. The mv command changes
(A) the inode
(B) the inode-number
(C) the directory entry
(D) both the directory entry and the inode
View/Hide Ans
Correct Answer is C
1. The Software Maturity Index (SMI) is defined as
SMI = [Mf - (Fa + Fc + Fd)] / Mf
Where
Mf = the number of modules in the current release.
Fa = the number of modules in the current release that have been added.
Fc = the number of modules in the current release that have been changed.
Fd = the number of modules in the current release that have been deleted.
The product begins to stabilize when
(A) SMI approaches 1
(B) SMI approaches 0
(C) SMI approaches -1
(D) None of the above
View/Hide Ans
Correct Answer is A
2. Match the following:
Codes:
List I
List II
a. Watson-Felix model
i. Failure intensity
b. Quick-Fix model
ii. Cost estimation
c. Putnam resource allocation model
iii. Project planning
d. Logarithmetic- Poisson Model
iv. Maintenance
(A) a-ii b-i c-iv c-iii
(B) a-i b-ii c-iv c-iii
(C) a-ii b-i c-iii c-iv
(D) a-ii b-iv c-iii c-i
View/Hide Ans
Correct Answer is D
3. ............... is a process model that removes defects before they can precipitate serious hazards.
(A) Incremental model
(B) Spiral model
(C) Cleanroom software engineering
(D) Agile model
View/Hide Ans
Correct Answer is C
4. Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived.
(A) White-box testing
(B) Black-box testing
(C) Orthogonal array testing
(D) Stress testing
View/Hide Ans
Correct Answer is B
5. The following three golden rules:
(i) Place the user in control
(ii) Reduce the user’s memory load
(iii) Make the interface consistent are for
(A) User satisfaction
(B) Good interface design
(C) Saving system’s resources
(D) None of these
View/Hide Ans
Correct Answer is B
6. Software safety is a ................... activity that focuses on the identification and assessment of potential hazards that may affect software negatively and cause an entire system to fail.
(A) Risk mitigation, monitoring and management
(B) Software quality assurance
(C) Software cost estimation
(D) Defect removal efficiency
View/Hide Ans
Correct Answer is B
7. The “PROJECT” operator of a relational algebra creates a new table that has always
(A) More columns than columns in original table
(B) More rows than original table
(C) Same number of rows as the original table
(D) Same number of columns as the original table
View/Hide Ans
Correct Answer is C
8. The employee information of an Organization is stored in the relation:
Employee (name, sex, salary, deptname)
Consider the following SQL query
Select deptname
From Employee
Where sex = ‘M’
Group by deptname
Having avg (salary) > {Select avg(salary) From Employee}
Output of the given query corresponds to
(A) Average salary of employee more than average salary of the organization.
(B) Average salary less than average salary of the organization.
(C) Average salary of employee equal to average salary of the organization.
(D) Average salary of male employees in a department is more than average salary of the organization.
View/Hide Ans
Correct Answer is D
9. For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation
(A) In 1NF not in 2NF
(B) In 2NF not in 3NF
(C) In 3NF
(D) In 1NF
View/Hide Ans
Correct Answer is A
10. Match the following:
Codes:
List I
List II
a. RAID-0
i. Bit interleaved parity
b. RAID-1
ii. Non redundant stripping
c. RAID-2
iii. Mirrored disks
d. RAID-3
iv. Error correcting codes
(A) a-iv b-i c-ii d-iii
(B) a-iii b-iv c-i d-ii
(C) a-iii b-i c-iv d-ii
(D) a-iii b-ii c-iv d-i
View/Hide Ans
Correct Answer is X
11. The golden ratio φ and its conjugate φ’ both satisfy the equation
(A) x3 - x - 1 = 0
(B) x3 + x - 1 = 0
(C) x2 - x - 1 = 0
(D) x2 + x - 1 = 0
View/Hide Ans
Correct Answer is C
12. The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is
(A) O(n log log logn)
(B) O(n log logn)
(C) O(log logn)
(D) O(logn log logn)
View/Hide Ans
Correct Answer is D
13. In any n-element heap, the number of nodes of height h is
(A) less than equal to [n/2h]
(B) greater than [n/2h]
(C) greater than [n/2h+1]
(D) less than equal to [n/2h+1]
View/Hide Ans
Correct Answer is D
14. A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table:
15. A vertex cover of an undirected graph G(V, E) is a subset V1⊆V vertices such that
(A) Each pair of vertices in V1 is connected by an edge
(B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1
(C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1
(D) All pairs of vertices in V1 are not connected by an edge
View/Hide Ans
Correct Answer is C
16. In a fully connected mesh network with n devices, there are ................ physical channels to link all devices.
(A) n(n-1)/2
(B) n(n+1)/2
(C) 2n
(D) 2n+1
View/Hide Ans
Correct Answer is A
17. The baud rate of a signal is 600 baud/second. If each signal unit carries 6 bits, then the bit rate of a signal is .................
(A) 3600
(B) 100
(C) 6/600
(D) None of the above
View/Hide Ans
Correct Answer is A
18. Match the following:
Codes:
List I
List II
a. Data link layer
i. Flow control
b. Network layer
ii. Node to node delivery
c. Transport layer
iii. Mail services
d. Application layer
iv. Routing
(A) a-ii b-i c-iv d-iii
(B) a-ii b-iv c-i d-iii
(C) a-ii b-i c-iii d-iv
(D) a-ii b-iv c-iii d-i
View/Hide Ans
Correct Answer is B
19. An image is 1024*800 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it take to transmit it over a 10-Mbps Ethernet ?
(A) 196.6 seconds
(B) 19.66 seconds
(C) 1.966 seconds
(D) 0.1966 seconds
View/Hide Ans
Correct Answer is C
20. The .............. measures the relative strengths of two signals or a signal at two different points.
(A) frequency
(B) attenuation
(C) throughput
(D) decibel
View/Hide Ans
Correct Answer is D
21. Which one of the following media is multidrop?
(A) Shielded Twisted pair cable
(B) Unshielded Twisted pair cable
(C) Thick Coaxial cable
(D) Fiber Optic cable
View/Hide Ans
Correct Answer is C
22. What is the baud rate of the standard 10 Mbps Ethernet ?
(A) 10 megabaud
(B) 20 megabaud
(C) 30 megabaud
(D) 40 megabaud
View/Hide Ans
Correct Answer is B
23. At any iteration of simplex method, if Δj (Zj - Cj) corresponding to any non-basic variable Xj is obtained as zero, the solution under the test is
(A) Degenerate solution
(B) Unbounded solution
(C) Alternative solution
(D) Optimal solution
View/Hide Ans
Correct Answer is C
24. A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1.
(A) degenerate
(B) non-degenerate
(C) unbounded
(D) unbalanced
View/Hide Ans
Correct Answer is A
25. The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is
26. An actor in an animation is a small program invoked ............... per frame to determine the characteristics of some object in the animation.
(A) once
(B) twice
(C) 30 times
(D) 60 times
View/Hide Ans
Correct Answer is A
27. Bresenham line drawing algorithm is attractive because it uses
(A) Real arithmetic only
(B) Integer arithmetic only
(C) Floating point arithmetic
(D) Real and integer arithmetic
View/Hide Ans
Correct Answer is B
28. The refresh rate above which a picture stops flickering and fuses into a steady image is called ..................
(A) Crucial fusion frequency
(B) Current frequency fusion
(C) Critical fusion frequency
(D) Critically diffused frequency
View/Hide Ans
Correct Answer is C
29. In homogenous coordinate system (x, y, z) the points with z = 0 are called
(A) Cartesian points
(B) Parallel points
(C) Origin point
(D) Point at infinity
View/Hide Ans
Correct Answer is D
30. If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is
(A) 40 line-pairs per inch
(B) 80 line-pairs per inch
(C) 1600 lines per inch
(D) 40 lines per inch
View/Hide Ans
Correct Answer is A
31. Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is
(A) n × 8 MB
(B) n / 8 MB
(C) (1024 × 1024) / 8 MB
(D) 1024 MB
View/Hide Ans
Correct Answer is B
32. Arrays in C language can have ................. with reference to memory representation.
(A) n-subscripts
(B) two-subscripts
(C) only one subscript
(D) three subscripts only
View/Hide Ans
Correct Answer is C
33. Refer the points as listed below:
(a) What are the operator precedence rules ?
(b) What are the operator associativity rules ?
(c) What is the order of operand evaluation ?
(d) Are there restrictions on operand evaluation side effects ?
Which of the above must be considered as primary design issues for arithmetic expressions ?
(A) (a), (b) and (c)
(B) (a), (c) and (d)
(C) (a), (b) and (d)
(D) (a), (b), (c) and (d)
View/Hide Ans
Correct Answer is D
34. Horn clauses are special kinds of propositions which can be described as
(A) Single atomic proposition on left side.
(B) Single or multiple atomic proposition on left side.
(C) A single atomic proposition on left side and a single atomic proposition on right side.
(D) A single atomic proposition on left side or an empty left side.
View/Hide Ans
Correct Answer is D
35. Which of the following is/are the fundamental semantic model(s) of parameter passing?
(A) in mode
(B) out mode
(C) in-out mode
(D) all of the above
View/Hide Ans
Correct Answer is D
36. The grammar with production rules S ? aSb |SS|? generates language L given by:
(A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w}
(B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w}
(C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w}
(D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}
View/Hide Ans
Correct Answer is A
37. A pushdown automation M = (Q, ∑, Γ,δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ ∑ ∪ {λ} and b ∈ Γ
(s1) δ(q, a, b) contains at most one element
(s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ ∑
(A) only s1
(B) only s2
(C) both s1 and s2
(D) neither s1 nor s2
View/Hide Ans
Correct Answer is C
38. For every context free grammar (G) there exists an algorithm that passes any w ? L(G) in number
(A) ln|w|
(B) |w|
(C) |w|2
(D) |w|3
View/Hide Ans
Correct Answer is D
39. Match the following:
Codes:
List I
List II
a. Context sensitive language
i. Deterministic finite automation
b. Regular grammar
ii. Recursive enumerable
c. Context free grammar
iii. Recursive language
d. Unrestricted grammar
iv. Pushdown automation
(A) a-ii b-i c-iv d-iii
(B) a-iii b-iv c-i d-ii
(C) a-iii b-i c-iv d-ii
(D) a-ii b-iv c-i d-iii
View/Hide Ans
Correct Answer is C
40. The statements s1 and s2 are given as:
s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism.
s2: Context free languages are closed under complementation, substitution and homomorphism.
Which of the following is correct statement?
(A) Both s1 and s2 are correct.
(B) s1 is correct and s2 is not correct.
(C) s1 is not correct and s2 is correct.
(D) Both s1 and s2 are not correct.
View/Hide Ans
Correct Answer is B
41. Which one of the following is not an addressing mode?
(A) Register indirect
(B) Auto increment
(C) Relative indexed
(D) Immediate operand
View/Hide Ans
Correct Answer is C
42. Computers can have instruction formats with
(A) only two address and three address instructions
(B) only one address and two address instructions
(C) only one address, two address and three address instructions
(D) zero address, one address, two address and three address instructions
View/Hide Ans
Correct Answer is D
43. Which is not a typical program control instruction?
(A) BR
(B) JMP
(C) SHL
(D) TST
View/Hide Ans
Correct Answer is C
44. Interrupt which arises from illegal or erroneous use of an instruction or data is
(A) Software interrupt
(B) Internal interrupt
(C) External interrupt
(D) All of the above
View/Hide Ans
Correct Answer is B
45. The simplified function in product of sums of Boolean function
F(W, X, Y, Z) = ∑(0, 1, 2, 5, 8, 9, 10) is
(A) (W' + X') (Y' + Z') (X' + Z)
(B) (W' + X') (Y' + Z') (X' + Z')
(C) (W' + X') (Y' + Z) (X' + Z)
(D) (W' + X') (Y + Z') (X' + Z)
View/Hide Ans
Correct Answer is A
46. Match the following:
Codes:
List I
List II
a. TTL
i. High component density
b. ECL
ii. Low power consumption
c. MOS
iii. Evolution of “diodetransistor- logic”
d. CMOS
iv. High speed digital circuits
(A) a-iii b-ii c-i d-iv
(B) a-i b-iv c-iii d-ii
(C) a-iii b-iv c-i d-ii
(D) a-i b-ii c-iii d-iv
View/Hide Ans
Correct Answer is C
47. Match the following:
Codes:
List I
List II
a. Foreign keys
i. Domain constraint
b. Private key
ii. Referential integrity
c. Event control action model
iii. Encryption
d. Data security
iv. Trigger
(A) a-iii b-ii c-i d-iv
(B) a-ii b-i c-iv d-iii
(C) a-iii b-iv c-i d-ii
(D) a-i b-ii c-iii d-iv
View/Hide Ans
Correct Answer is B
48. When an array is passed as a parameter to a function which of the following statements is correct?
(A) The function can change values in the original array.
(B) The function cannot change values in the original array.
(C) Results in compilation error.
(D) Results in runtime error.
View/Hide Ans
Correct Answer is A
49. Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation?
(A) Circular linked list
(B) Doubly linked list
(C) Linked list
(D) Dequeue
View/Hide Ans
Correct Answer is B
50. What will be the output of the following segment of the program?
main( )
{
char *s = "hello world";
int i = 7;
printf("%, *s", i, s);
}
(A) Syntax error
(B) hello w
(C) hello
(D) o world
View/Hide Ans
Correct Answer is X
51. Trace the error:
void main( )
{
int *b, &a;
*b = 20
printf("%d, %d", a, *b)
}
(A) No error
(B) Logical error
(C) Syntax error
(D) Semantic error
View/Hide Ans
Correct Answer is C
52. Match the following:
Codes:
List I
List II
a. calloc()
i. Frees previously allocated space
b. free()
ii. Modifies previously allocated space
c. malloc()
iii. Allocates space for array
d. realloc()
iv. Allocates requested size of space
(A) a-iii b-i c-iv d-ii
(B) a-iii b-ii c-i d-iv
(C) a-iii b-iv c-i d-ii
(D) a-iv b-ii c-iii d-i
View/Hide Ans
Correct Answer is A
53. Binary symmetric channel uses
(A) Half duplex protocol
(B) Full duplex protocol
(C) Bit oriented protocol
(D) None of the above
View/Hide Ans
Correct Answer is A
54. Hamming distance between 100101000110 and 110111101101 is
(A) 3
(B) 4
(C) 5
(D) 6
View/Hide Ans
Correct Answer is D
55. Given code word 1110001010 is to be transmitted with even parity check bit. The encoded word to be transmitted for this code is
(A) 11100010101
(B) 11100010100
(C) 1110001010
(D) 111000101
View/Hide Ans
Correct Answer is A
56. The number of distinct binary images which can be generated from a given binary image of right M × N are
(A) M + N
(B) M × N
(C) 2M + N
(D) 2MN
View/Hide Ans
Correct Answer is D
57. If f(x, y) is a digital image, then x, y and amplitude values of f are
(A) Finite
(B) Infinite
(C) Neither finite nor infinite
(D) None of the above
View/Hide Ans
Correct Answer is A
58. Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored):
The average turn around time of these processes will be
Process
A
B
C
D
Arrival time
0
1
2
3
CPU cycle
8
4
9
5
(A) 19.25 milliseconds
(B) 18.25 milliseconds
(C) 19.5 milliseconds
(D) 18.5 milliseconds
View/Hide Ans
Correct Answer is B
59. A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD
Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are
(A) 9 and 7
(B) 7 and 6
(C) 9 and 8
(D) 8 and 6
View/Hide Ans
Correct Answer is C
60. Suppose S and Q are two semaphores initialized to 1. P1 and P2 are two processes which are sharing resources.
Their execution may sometimes lead to an undesirable situation called
P1 has statements
P2 has statements
wait(S);
wait(Q);
wait(Q);
wait(S);
critical section 1;
critical section 2;
signal(S);
signal(Q);
signal(Q);
signal(S);
(A) Starvation
(B) Race condition
(C) Multithreading
(D) Deadlock
View/Hide Ans
Correct Answer is D
61. An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of allocation of devices as follows:
Which of the following is correct?
State 1
Processes
P1
P2
P3
Devices allocated
2
3
4
State 2
Processes
P1
P2
P3
Devices allocated
0
2
4
(A) State 1 is unsafe and state 2 is safe.
(B) State 1 is safe and state 2 is unsafe.
(C) Both, state 1 and state 2 are safe.
(D) Both, state 1 and state 2 are unsafe.
View/Hide Ans
Correct Answer is A
62. Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct?
(A) T1 < T2
(B) T1 > T2
(C) T1 = T2
(D) Nothing can be said about the relation between T1 and T2.
View/Hide Ans
Correct Answer is A
63. Working set model is used in memory management to implement the concept of
(A) Swapping
(B) Principal of Locality
(C) Segmentation
(D) Thrashing
View/Hide Ans
Correct Answer is B
64. A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry?
(A) 30 GB
(B) 64 GB
(C) 16 GB
(D) 1 GB
View/Hide Ans
Correct Answer is C
65. A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct?
(A) OS maintains only scheduling and accounting information for each thread.
(B) OS maintains only CPU registers for each thread.
(C) OS does not maintain a separate stack for each thread.
(D) OS does not maintain virtual memory state for each thread.
View/Hide Ans
Correct Answer is B
66. The versions of windows operating system like windows XP and window Vista uses following file system:
(A) FAT-16
(B) FAT-32
(C) NTFS (NT File System)
(D) All of the above
View/Hide Ans
Correct Answer is D
67. Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ?
(A) not(G):- !, call(G), fail. not(G).
(B) not(G):- call(G), !, fail. not(G).
(C) not(G):- call(G), fail, !. not(G).
(D) not(G):- call(G), fail. not(G):- !.
View/Hide Ans
Correct Answer is B
68. Which one of the following is not an informed search technique?
(A) Hill climbing search
(B) Best first search
(C) A* search
(D) Depth first search
View/Hide Ans
Correct Answer is D
69. If we convert
∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to
∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x)))
This process is known as
(A) Simplification (B) Unification
(C) Skolemization (D) Resolution
View/Hide Ans
Correct Answer is C
70. Given two jugs of capacities 5 litres and 3 litres with no measuring markers on them. Assume that there is endless supply of water. Then the minimum number of states to measure 4 litres water will be
(A) 3
(B) 4
(C) 5
(D) 7
View/Hide Ans
Correct Answer is D
71. The map colouring problem can be solved using which of the following technique?
(A) Means-end analysis
(B) Constraint satisfaction
(C) AO* search
(D) Breadth first search
View/Hide Ans
Correct Answer is B
72. Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation?
(A) Semantic network
(B) Frames
(C) Scripts
(D) Conceptual Dependency
View/Hide Ans
Correct Answer is C
73. A fuzzy set A on R is ................. iff A(λx1 + (1 - λ)x2) ≥ min [A(x1), A(x2)]
for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator.
(A) Support
(B) ∝-cut
(C) Convex
(D) Concave
View/Hide Ans
Correct Answer is C
74. If A and B are two fuzzy sets with membership functions
µA(x) = {0.6, 0.5, 0.1, 0.7, 0.8}
µB(x) = {0.9, 0.2, 0.6, 0.8, 0.5}
Then the value of µ(A∪B)'(x) will be
(A) {0.9, 0.5, 0.6, 0.8, 0.8}
(B) {0.6, 0.2, 0.1, 0.7, 0.5}
(C) {0.1, 0.5, 0.4, 0.2, 0.2}
(D) {0.1, 0.5, 0.4, 0.2, 0.3}
View/Hide Ans
Correct Answer is C
75. Consider a single perception with weights as given in the following figure:
The above perception can solve
(A) OR problem
(B) AND problem
(C) XOR problem
(D) All of the above
View/Hide Ans
Correct Answer is B
© 2022. All Rights Reserved | Copyright | Terms of Use & Privacy Policy