41. Match the following in Unix file system :
List – I List – II
(a) Boot block (i) Information about file system
(b) Super block (ii) Information about file
(c) Inode table (iii) Storage space
(d) Data block (iv) Code for making OS ready
Codes :
(a) (b) (c) (d)
(A) (iv) (i) (ii) (iii)
(B) (i) (iii) (ii) (iv)
(C) (iii) (i) (ii) (iv)
(D) (iv) (ii) (i) (iii)
Answer: A
- In an operating system, indivisibility of operation means :
(A) Operation is interruptable
(B) Race – condition may occur
(C) Processor can not be pre-empted
(D) All of the above
Answer: C
- A horn clause is ………………….
(A) A clause in which no variables occur in the expression
(B) A clause that has at least one negative literal
(C) A disjunction of a number of literals
(D) A clause that has at most one positive literal
Answer: D
- In Propositional Logic, given P and P→Q, we can infer ……………..
(A) ~Q (B) Q
(C) P∧Q (D) ~P∧Q
Answer: B
- Reasoning strategies used in expert systems include ……………
(A) Forward chaining, backward chaining and problem reduction
(B) Forward chaining, backward chaining and boundary mutation
(C) Forward chaining, backward chaining and back propagation
(D) Backward chaining, problem reduction and boundary mutation
Answer: A
- Language model used in LISP is ……………..
(A) Functional programming (B) Logic programming
(C) Object oriented programming (D) All of the above
Answer: A
- In constraint satisfaction problem, constraints can be stated as ……………….
(A) Arithmatic equations and inequalities that bind the values of variables
(B) Arithmatic equations and inequalities that doesn’t bind any restriction over variables
(C) Arithmatic equations that impose restrictions over variables
(D) Arithmatic equations that discard constraints over the given variables
Answer: A
- As compared to rental and leasing methods to acquire computer systems for a Management Information System (MIS), purchase method has following advantage :
(A) It has high level of flexibility
(B) It doesn’t require cash up-front
(C) It is a business investment
(D) Little risk of obsolescence
Answer: C
- Consider the conditional entropy and mutual information for the binary symmetric channel. The input source has alphabet X={0,1} and associated probabilities {1/2,1/2}. The channel matrix is
where p is the transition probability. Then the conditional entropy is given by :
(A) 1 (B) -plog(p)-(1-p)log(1-p)
(C) 1+plog(p)+(1-p)log(1-p) (D) 0
Answer: B
- Which of the following is not a lossy compression technique ?
(A) JPEG (B) MPEG
(C) FFT (D) Arithmetic coding
Answer: D
Explanation:
the type of compression we’ve been discussing here is called lossless compression, because it lets you recreate the original file exactly. All lossless compression is based on the idea of breaking a file into a “smaller” form for transmission or storage and then putting it back together on the other end so it can be used again.
Lossy compression works very differently. These programs simply eliminate “unnecessary” bits of information, tailoring the file so that it is smaller. This type of compression is used a lot for reducing the file size of bitmap pictures, which tend to be fairly bulky. To see how this works, let’s consider how your computer might compress a scanned photograph.
51. Blind image deconvolution is …………….
(A) Combination of blur identification and image restoration
(B) Combination of segmentation and classification
(C) Combination of blur and non-blur image
(D) None of the above
Answer: A
- A basic feasible solution of a linear programming problem is said to be …………… if at least one of the basic variable is zero.
(A) degenerate (B) non-degenerate
(C) infeasible (D) unbounded
Answer: A
Explanation:
In Linear Programming (LP) a basic feasible solution is one that also belong to the feasible region or problem area can be represented by a feasible solution in implementing the Simplex Method satisfying nonnegative conditions.
- Consider the following conditions :
(a) The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
(b) The number of positive allocations must be equal to m+n-1, where m is the number
of rows and n is the number of columns.
(c) All the positive allocations must be in independent positions.
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies :
Codes :
(A) (a) and (b) only (B) (a) and (c) only
(C) (b) and (c) only (D) (a), (b) and (c)
Answer: D
- Consider the following transportation problem :
The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is :
(A) 1450 (B) 1465
(C) 1480 (D) 1520
Answer: B
check solution in video for this question
- The character set used in Windows 2000 operating system is ……………
(A) 8 bit ASCII (B) Extended ASCII
(C) 16 bit UNICODE (D) 12 bit UNICODE
Answer: C
- In Unix, the command to enable execution permission for file “mylife” by all is …………….
(A) Chmod ugo+X myfile (B) Chmod a+X myfile
(C) Chmod +X myfile (D) All of the above
Answer: D
- What will be the output of the following Unix command ?
$rm chap0\[1 – 3\]
(A) Remove file chap0[1 – 3]
(B) Remove file chap01, chap02, chap03
(C) Remove file chap\[1 – 3\]
(D) None of the above
Answer: A
- Which of the following statements regarding the features of the object-oriented approach to databases are true ?
(a) The ability to develop more realistic models of the real world.
(b) The ability to represent the world in a non-geometric way.
(c) The ability to develop databases using natural language approaches.
(d) The need to split objects into their component parts.
(e) The ability to develop database models based on location rather than state and behaviour.
Codes :
(A) (a), (b) and (c) (B) (b), (c) and (d)
(C) (a), (d) and (e) (D) (c), (d) and (e)
Answer: A
- Consider the following database table :
Create table test(
one integer,
two integer,
primary key(one),
unique(two),
check(one≥1 and ≤10),
check(two≥1 and ≤5) );
How many data records/tuples atmost can this table contain ?
(A) 5 (B) 10
(C) 15 (D) 50
Answer: A
- Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 :
SQ1 : Select *
From R Full Join S
On R.B=S.B;
SQ2 : Select *
From R Inner Join S
On R.B=S.B;
The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by :
(A) 2 and 6 respectively (B) 6 and 2 respectively
(C) 2 and 4 respectively (D) 4 and 2 respectively
Answer: D