Consider the formula in image processing

RD = 1 - (1/CR) Where CR = n1/n2

CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set.

(A) Data Compression (B) Data Redundancy

(C) Data Relation (D) Data Representation


1 Answer

Answer :

(B) Data Redundancy

Related questions

Description : Which of the following is used to determine the specificity of requirements ? (A) n1/n2 (B) n2/n1 (C) n1+n2 (D) n1–n2 Where n1 is the number of requirements for which all reviewers have identical interpretations, n2 is number of requirements in a specification.

Last Answer : (A) n1/n2 

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

Last Answer : (C) Scripts 

Description : In the second system of pulleys, if there are two pulley blocks having 'n1' and 'n2' pulleys in the first and second pulley blocks respectively, then the velocity ratio of the whole system will be equal to a.2n1 + n2 b.n1 - n2 c.107 dynes d.2n1 + 2n2 e.n1 + n2

Last Answer : b. n1 - n2

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

Last Answer : (B) pixel correlation

Description : 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: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Last Answer : Answer: 2

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 

Description : The one guideline to be followed while designing the database is A) A database design may be ambiguous. B) Unrelated data should be in the same table so that updating the data will be easy. C) It should avoid/reduce the redundancy. D) An entity should not have attributes.

Last Answer : C) It should avoid/reduce the redundancy.

Description : The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Last Answer : (3) O(n log log n) 

Description : Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) ... could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced. 

Last Answer : reducing the number of joins required to satisfy a query.

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

Description : ………….. gives defining the flow of the data through and organization or a company or series of tasks that may or may not represent computerized processing. A) System process B) System flowchart C) System design D) Structured System

Last Answer : B) System flowchart

Description : In the reaction `A^(-n2)+xe^(-)rarrA^(-n1)` . Here, x will be :

Last Answer : In the reaction `A^(-n2)+xe^(-)rarrA^(-n1)` . Here, x will be : A. `n_(1)+n_(2)` B. `n_(2)-n_(1)` C. `n_(1)-n_(2)` D. `n_(1).n_(2)`

Description : The coefficient of fluctuation of speed of Flywheel is given by 1. (N1-N2)/N 2. (N1+N2)/N 3. (N1-N2) x N

Last Answer : 1. (N1-N2)/N

Description : The Snell’s law is given by a) N1 sin θi = N2 sin θt b) N2 sin θi = N1 sin θt c) sin θi = sin θt d) N1 cos θi = N2 cos θt

Last Answer : a) N1 sin θi = N2 sin θt

Description : The Brewster angle is expressed as a) Tan -1 (n) b) Tan -1 (n1/n2) c) Tan -1 (n2/n1) d) Tan (n)

Last Answer : c) Tan -1 (n2/n1)

Description : For total internal reflection to occur, which condition must be satisfied? a) N1 = N2 b) N1 > N2 c) N1 < N2 d) N1 x N2=1

Last Answer : b) N1 > N2

Description : Multimode step-index fibers have a core and cladding of constant refractive index n1 and n2, respectively. Which refractive index, the core or cladding, is lower?

Last Answer : Cladding.

Description : Medium 1 is a glass (n1 = 1.5) and medium 2 is an ethyl alcohol (n2 = 1.36). For an angle of incidence of 30 degrees, determine the angle of refraction. ∙ A. 44.5 degrees ∙ B. 14.56 degrees ∙ C. 33.47 degrees ∙ D. 75 degrees

Last Answer : C. 33.47 degrees

Description : Identify the criteria for designing database from the point of view of user A) No redundancy B) No inapplicable attributes C) Uniformity in naming & definitions of the data items D) All of the above

Last Answer : D) All of the above

Description : Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems (a) Data redundancy and inconsistency (b) Difficulty in accessing Data (c) Data isolation (d) Integrity problems (A) (a) (B) ... d) (C) (a), (b) and (c) (D) (a), (b), (c) and (d)

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

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

Last Answer : (C) Convex 

Description : Which of the following are the principles tasks of the linker? I. Resolve external references among separately compiled program units. II. Translate assembly language to machine code. III. Relocate code and data relative to the beginning of ... (A) I and II (B) I and III (C) II and III (D) I and IV

Last Answer : (B) I and III

Description : Which of the following is used for the boundary representation of an image object? (A) Quad Tree (B) Projections (C) Run length coding (D) Chain codes

Last Answer : (D) Chain codes

Description : A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Last Answer : (C) S→0|0S|1SS|S1S|SS1 

Description : The difference between the original and reconstructed data, which we will refer to as the ______in the reconstructed data. a. Redundancy b. Compression c. loss d. Distortion

Last Answer : d. Distortion

Description : Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ... diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Last Answer : (A) I only

Description : Consider a sequence F00 defined as: Then what shall be the set of values of the sequence F00? (1) (1, 110, 1200) (2) (1, 110, 600, 1200) (3) (1, 2, 55, 110, 600, 1200) (4) (1, 55, 110, 600, 1200)

Last Answer : Answer: 1 Explanation: We have given, F00(0) = 1, F00(1) = 1 F00(2) = (10*F00(1) + 100)/F00(0) = 110 F00(3) = (10*F00(2) + 100)/F00(1) = 1200 F00(4) = (10*F00(3) + ... (2) = 110 Since the values repeats after the first three values, the set of values of F00 will be (1,110,1200).

Description : Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the ... the front node of the linked list. (D) Deletion of the last node of the linked list.

Last Answer : (D) Deletion of the last node of the linked list. 

Description : Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any ... are required to represent this situation in the Relational Model? (A) 4 (B) 3 (C) 2 (D) 1

Last Answer : (B) 3 

Description : Which command is used to remove a directory? A. rd B. rmdir C. dldir D. rdir E. None of the above

Last Answer : B. rmdir

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

Description : 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 ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

Description : . Costs for a computer based information system include the salaries of the system analysts and computer programmers. costs for a computer based information system include the ... ) Development, Development B) Development, Operating C) Operating, Development C) Operating, Operating

Last Answer : B) Development, Operating

Description : 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 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

Description : Consider the following two commands C1 and C2 on the relation R from an SQL database:  C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 ... R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Last Answer : (C) II and III only

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

Description : What is Synonymy relation? a) A is part of B b) A denotes same as B c) A is a kind of B d) A is superordinate of B

Last Answer : b) A denotes same as B

Description : Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height ... number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Last Answer : (C) 10

Description : Consider a project with the following functional units : Number of user inputs = 50 Number of user outputs = 40 Number of user enquiries = 35 Number of user files = 06 Number of external interfaces = 04 ... average, the function points for the project will be (A) 135 (B) 722 (C) 675 (D) 672

Last Answer : (D) 672

Description : In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)

Last Answer : (B) (~P∨Q)∧(~Q∨P)

Description : Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B ... Object-oriented databases store more types of data than relational databases and access that data faster.

Last Answer : (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases.

Description : Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further, Shx and Shy are shearing factors in x and y directions. If we perform the y-direction shear relative to x=xref then the transformed point is given by ............ 

Last Answer : (C) x’ = x y’ = Shy(x - xref) + y

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

Description : Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Last Answer : b) Selection sort

Description : Which of the following arguments are not valid? (a) If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he ... and (c) (B) (b) and (c) (C) (a), (b) and (c) (D) (a) and (b)

Last Answer : Answer: B Explanation: (a) P: Gora gets the job  Q: Gora works hard  R: Gora gets promotion  S: Gora will be happy The argument can bet written as  (P˄Q)→R  R→S  ¬S ... also be written as: ((P˅Q)˄¬P)→Q where P, and Q are propositions expressed in some formal system.

Description : Consider the Graph shown below : This graph is a ............... (A) Complete Graph (B) Bipartite Graph (C) Hamiltonian Graph (D) All of the above

Last Answer : (C) Hamiltonian Graph