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

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

by

1 Answer

Answer :

(D) 2MN

by

Related questions

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

Description : 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

Last Answer : (B) n / 8 MB

The Excess-3 decimal code is a self-complementing code because (A) The binary sum of a code and its 9’s complement is equal to 9. (B) It is a weighted code. (C) Complement can be generated by inverting each bit pattern. (D) The binary sum of a code and its 10’s complement is equal to 9.

Description : The Excess-3 decimal code is a self-complementing code because (A) The binary sum of a code and its 9’s complement is equal to 9. (B) It is a weighted code. (C) Complement can be generated by inverting each bit pattern. (D) The binary sum of a code and its 10’s complement is equal to 9.

Last Answer : Answer: A, C

The redundancy in images stems from: (A) pixel decorrelation (B) pixel correlation (C) pixel quantization (D) image size

Description : The redundancy in images stems from: (A) pixel decorrelation (B) pixel correlation (C) pixel quantization (D) image size

Last Answer : (B) pixel correlation

Consider the following ER diagram: Image The minimum number of tables required to represent M, N, P, R1, R2 is (A) 2 (B) 3 (C) 4 (D) 5

Description : Consider the following ER diagram:  The minimum number of tables required to represent M, N, P, R1, R2 is (A) 2 (B) 3 (C) 4 (D) 5

Last Answer : (A) 2 

A t-error correcting q-nary linear code must satisfy: Image Where M is the number of code words and X is (1) qn (2) qt (3) q-n (4) q-t

Description : A t-error correcting q-nary linear code must satisfy:  Where M is the number of code words and X is (1) qn (2) qt (3) q-n (4) q-t

Last Answer : (1) qn 

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Last Answer : (C) (n-1)/2

Consider the following binary search tree: Image If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16

Description : Consider the following binary search tree: If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16

Last Answer : (D) 16

In the redox reaction, `2MnO_(4)^(-)+5C_(2)O_(4)^(2-)+16H^(+) to 2Mn^(2+)+10CO_(2)+8H_(2)O` 20mL of 0.1 M `KMnO_(4)` reacts quantitatively with :

Description : In the redox reaction, `2MnO_(4)^(-)+5C_(2)O_(4)^(2-)+16H^(+) to 2Mn^(2+)+10CO_(2)+8H_(2)O` 20mL of 0.1 M `KMnO_(4)` reacts quantitatively with :

Last Answer : In the redox reaction, `2MnO_(4)^(-)+5C_(2)O_(4)^(2-)+16H^(+) to 2Mn^(2+)+10CO_(2)+8H_(2)O` 20mL ... 50 mL of 0.25 M oxalate D. 50 mL of 0.1 M oxalate

In a flywheel the safe stress is 25.2MN/m 2 and the density is 7 g/cm 3 . Then what is the maximum peripheral velocity ? 1. 30m/s 2. 45m/s 3. 60m/s 4. 120m/s

Description : In a flywheel the safe stress is 25.2MN/m 2 and the density is 7 g/cm 3 . Then what is the maximum peripheral velocity ? 1. 30m/s 2. 45m/s 3. 60m/s 4. 120m/s

Last Answer : 3. 60m/s

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

A full binary tree with n leaves contains (A) n nodes (B) log2 n nodes (C) 2n –1 nodes (D) 2n nodes

Description : A full binary tree with n leaves contains (A) n nodes (B) log2 n nodes (C) 2n –1 nodes (D) 2n nodes

Last Answer : (C) 2n –1 nodes 

The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 )

Description : The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 ) 

Last Answer : (C) O(n) 

Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student e where e course='5' and e marks ≥ s marks) Q.2. Select S.stuid From student S Where s.marks > any (select distinct marks from student S where s.couse = 5) (A) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Description : Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student ... ) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Last Answer : (B) Q.2 Explanation: First query gives stuid of students whose marks are greater than all students taking course 5. Second query gives stuid of students whose marks are greater than any student taking ... comparison is between maximum of marks by any student in course 5. So the answer is option D.

How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ? (A) 16 (B) 17 (C) 18 (D) 19

Description : How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ? (A) 16 (B) 17 (C) 18 (D) 19

Last Answer : (D) 19

What error will be generated if a space is given between the logical AND operator (&&)? Will it be a compile-time or a run-time error?

Description : What error will be generated if a space is given between the logical AND operator (&&)? Will it be a compile-time or a run-time error?

Last Answer : Example: if(5>2 & & 6

................ allows individual row operation to be performed on a given result set or on the generated by a selected by a selected statement. A) Procedure B) Trigger C) Curser D) None of above

Description : ................ allows individual row operation to be performed on a given result set or on the generated by a selected by a selected statement. A) Procedure B) Trigger C) Curser D) None of above

Last Answer : C) Curser

Pick out the wrong statement. (A) In the McCabe-Thiele diagram for binary distillation, vertical feed line represents saturated liquid feed and horizontal feed line represents saturated vapour feed (B) In small columns, local efficiency is larger than Murphree efficiency; in large columns local efficiency is smaller than Murphree efficiency (C) For Laminar flow over a plate of length L, the local mass transfer co￾efficient at a distance L from the leading edge is 1.5 × 10 -2m/s. Then the average mass transfer co-efficient for the plate is 2 × 10 -2m/s (D) The concentration and hydrodynamic boundary layers over a flat plate are of equal thickness, if Schmidt number is equal to unity

Description : Pick out the wrong statement. (A) In the McCabe-Thiele diagram for binary distillation, vertical feed line represents saturated liquid feed and horizontal feed line represents saturated vapour feed (B) In ... layers over a flat plate are of equal thickness, if Schmidt number is equal to unity

Last Answer : (C) For Laminar flow over a plate of length L, the local mass transfer co￾efficient at a distance L from the leading edge is 1.5 × 10 -2m/s. Then the average mass transfer co-efficient for the plate is 2 × 10 -2m/s

Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Last Answer :  (D) m + n – 1

For clear distinct vision, images of obstructions should fall on the retina with a cone of (A) 2° (B) 3° (C) 4° (D) 5°

Description : For clear distinct vision, images of obstructions should fall on the retina with a cone of (A) 2° (B) 3° (C) 4° (D) 5°

Last Answer : Answer: Option D

The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty

Description : The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty

Last Answer : D) The right subtree can be empty

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called A) AVL tree B) Red-black tree C) Lemma tree D) None of the above

Description : A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called A) AVL tree B) Red-black tree C) Lemma tree D) None of the above

Last Answer : A) AVL tree

A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15. A. Binary B. Decimal C. Hexadecimal D. Hepadeximal

Description : A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15. A. Binary B. Decimal C. Hexadecimal D. Hepadeximal

Last Answer : A. Binary

`5H_(2)C_(2)O_(4)(aq)+2MnO_(4)(aq)+6H^(+)(aq) to 2Mn^(2+)(aq)+10CO_(2)(g)+8H_(2)O(l)` Oxalic acid, `H_(2)C_(2)O_(2)` , reacts with permanganate ion ac

Description : `5H_(2)C_(2)O_(4)(aq)+2MnO_(4)(aq)+6H^(+)(aq) to 2Mn^(2+)(aq)+10CO_(2)(g)+8H_(2)O(l)` Oxalic acid, `H_(2)C_(2)O_(2)` , reacts with permanganate ion ac

Last Answer : `5H_(2)C_(2)O_(4)(aq)+2MnO_(4)(aq)+6H^(+)(aq) to 2Mn^(2+)(aq)+10CO_(2)(g)+8H_(2)O(l)` Oxalic acid, `H_ ... A. 13.5 mL B. 18.5 mL C. 33.8 mL D. 84.4 mL

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Last Answer : (D) (a), (b) , (c) and (d)

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 reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) D

Description : 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) ... used to find the components of a graph. (1) A (2) B (3) C (4) D 

Last Answer : Answer: 2

If (log x)/(l + m - 2n) = (log y)/(m + n - 2l) = (log z)/(n + l - 2m), then xyz is equal to : -Maths 9th

Description : If (log x)/(l + m - 2n) = (log y)/(m + n - 2l) = (log z)/(n + l - 2m), then xyz is equal to : -Maths 9th

Last Answer : Let l+m−2nlogx​=m+n−2llogy​=n+l−2mlogz​=k(say) So, we get logx=k(l+m−2n) ....... (i) logy=k(m+n−2l) ....... (ii) logz=k(n+l−2m) ....... (iii) ∴logx+logy+logz=k(l+m−2n)+k(m+n−2l)+k(n+l−2m) ⇒logx+logy+logz=kl+km−2kn+km+kn−2kl+kn+kl−2km ⇒log(xyz)=0 ⇒logxyz=log1 ⇒xyz=1

If (log x)/(l + m - 2n) = (log y)/(m + n - 2l) = (log z)/(n + l - 2m), then xyz is equal to : -Maths 9th

Description : If (log x)/(l + m - 2n) = (log y)/(m + n - 2l) = (log z)/(n + l - 2m), then xyz is equal to : -Maths 9th

Last Answer : (b) 1Let \(rac{ ext{log}\,x}{l+m-2n}\) = \(rac{ ext{log}\,y}{m+n-2l}\) = \(rac{ ext{log}\,z}{n+l-2m}\) = k. Thenlog x = k(l + m – 2n), log y = k(m + n – 2l); log z = k(n + l – 2m) ⇒ log x + log y + log z = k(l + m – 2n) + k(m + n – 2l) + k(n + l – 2m)⇒ log(xyz) = 0 ⇒ log(xyz) = log 1 ⇒ xyz = 1.

A 600kg hammer of a pile driver is lilted 2m the pilling head. What is the change of potential energy? If the hammer is realest. What will be its velocity and the instant if it sticks the pilling?  a. 10,772 N-m and 5.26m/s  b. 13,200 N-m and 5.26m/s  c. 11,772 N-m and 6.26m/s  d. 11,77 2N-m and5.26m/s ∫PE = mgo(∫Z)/gc

Description : A 600kg hammer of a pile driver is lilted 2m the pilling head. What is the change of potential energy? If the hammer is realest. What will be its velocity and the instant if it sticks the pilling?  a. 10,772 N-m and 5.26m/s ...  c. 11,772 N-m and 6.26m/s  d. 11,77 2N-m and5.26m/s ∫PE = mgo(∫Z)/gc

Last Answer : 11,772 N-m and 6.26m/s

A cantilever of length 3m carries a uniformly distributed load of 15KN/m over a length of 2m from the free end.If I= 108 mm4 and E= 2×105 N/mm2,find the slope at the free end? a.0.00326 rad b.0.00578 rad c.0.00677 rad d.0.00786 rad

Description : A cantilever of length 3m carries a uniformly distributed load of 15KN/m over a length of 2m from the free end.If I= 108 mm4 and E= 2×105 N/mm2,find the slope at the free end? a.0.00326 rad b.0.00578 rad c.0.00677 rad d.0.00786 rad

Last Answer : a.0.00326 rad

A cantilever beam of length of 2m carries a U.D.L. of 150 N/m over its whole span. The maximum shear force in the beam will be (a) 150 N (b) 300 N (c) 150 N-m (d) 600 N-m

Description : A cantilever beam of length of 2m carries a U.D.L. of 150 N/m over its whole span. The maximum shear force in the beam will be (a) 150 N (b) 300 N (c) 150 N-m (d) 600 N-m

Last Answer : (b) 300 N

Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Description : Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Last Answer : (B) 38

Given that x=7.5, j=-1.0, n=1.0, m=2.0 the value of --x+j == x>n>=m is: (A) 0 (B) 1 (C) 2 (D) 3

Description : Given that x=7.5, j=-1.0, n=1.0, m=2.0 the value of --x+j == x>n>=m is: (A) 0 (B) 1 (C) 2 (D) 3

Last Answer : (A) 0 

In process control terminology values which can change without distinct increments, such as temperature, pressure, or level are called ____________. A. binary values B. digital values C. bumpless values D. analog values

Description : In process control terminology values which can change without distinct increments, such as temperature, pressure, or level are called ____________. A. binary values B. digital values C. bumpless values D. analog values

Last Answer : Answer: D

Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Description : Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Last Answer : (B) 1.75 bits per symbol

Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The Bezier curves lies entirely within the convex hull of its control points. IV. The degree of Bezier curve does not depend on the number of control points. (A) I, II and IV only (B) II and III only (C) I and II only (D) I, II and III only

Description : Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The ... (B) II and III only (C) I and II only (D) I, II and III only

Last Answer : (D) I, II and III only

The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Last Answer : (D) 12

The number of strings of length 4 that are generated by the regular expression (0+1 +|2+3 + )*, where | is an alternation character and {+, *} are quantification characters, is: (A) 08 (B) 09 (C) 10 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0+1 +|2+3 + )*, where | is an alternation character and {+, *} are quantification characters, is: (A) 08 (B) 09 (C) 10 (D) 12

Last Answer : (C) 10

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3 

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

Description : 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

Last Answer : (C) 30 ns

The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Description : The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Last Answer : (C) 16 bits Explanation: VirtualAddress = 32 bits PageSize = 4KB = 12 bits therefore : VPNTag = 20 bits, OffsetTag = 12 bits TLBEntryLength = VPNTag = 20 bits TotalTLBEntries = 64, 4-way implies ... therefore : TLBIndex = 4 bits TLBTag = TLBEntryLength - TLBIndex = 20 - 4 = 16 bits

The output generated by the LINUX command : $ seq 1 2 10 will be (A) 1 2 10 (B) 1 2 3 4 5 6 7 8 9 10 (C) 1 3 5 7 9 (D) 1 5 10

Description : The output generated by the LINUX command : $ seq 1 2 10 will be (A) 1 2 10 (B) 1 2 3 4 5 6 7 8 9 10 (C) 1 3 5 7 9 (D) 1 5 10

Last Answer : (C) 1 3 5 7 9

In a two-pass assembler, symbol table is (A) Generated in first pass (B) Generated in second pass (C) Not generated at all (D) Generated and used only in second pass

Description : In a two-pass assembler, symbol table is (A) Generated in first pass (B) Generated in second pass (C) Not generated at all (D) Generated and used only in second pass

Last Answer : (A) Generated in first pass

The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Description : The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Last Answer : (C) Four Explanation:

The transformation matrix required for conversion of CMY colour model to RGB colour model is given as Image

Description : The transformation matrix required for conversion of CMY colour model to RGB colour model is given as

Last Answer : Answer: C

Given the following statements : S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2. S2 : The set-partition problem takes as input a set S of numbers and asks whether the numbers can be partitioned into two sets A Image Which of the following is true ? (A) S1 is NP problem and S2 is P problem. (B) S1 is NP problem and S2 is NP problem. (C) S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Description : Given the following statements :  S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2.  S2 : The set-partition problem takes as input a set S of numbers and ... S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Last Answer : (B) S1 is NP problem and S2 is NP problem.

Given an image of size 1024 × 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires ............... of storage space if the image is not compressed. (A) one Terabyte (B) one Megabyte (C) 8 Megabytes (D) 8 Terabytes

Description : Given an image of size 1024 × 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires ............... of storage space if the image is not compressed. (A) one Terabyte (B) one Megabyte (C) 8 Megabytes (D) 8 Terabytes

Last Answer : (B) one Megabyte