What is a relationship called when it is maintained between two entities? (A) Unary (B) Binary (C) Ternary (D) Quaternary

What is a relationship called when it is maintained between two entities? (A) Unary (B) Binary
(C) Ternary (D) Quaternary
by

1 Answer

Answer :

(B) Binary
by

Related questions

Cartesian product in relational algebra is (A) a Unary operator. (B) a Binary operator. (C) a Ternary operator. (D) not defined.

Description : Cartesian product in relational algebra is (A) a Unary operator. (B) a Binary operator. (C) a Ternary operator. (D) not defined.

Last Answer : (B) a Binary operator.

Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two relationship types are linked by either Event-Precedent sequence or Condition-Precedent sequence (C) Conceptual model is not accurate representation of "Universe of interest". (D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Description : Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two ... Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Last Answer : (C) Conceptual model is not accurate representation of "Universe of interest".

………………. Is a directed tree in which outdegree of each node is less than or equal to two. A) Unary tree B) Binary tree C) Dinary tree D) Both B and C

Description : ………………. Is a directed tree in which outdegree of each node is less than or equal to two. A) Unary tree B) Binary tree C) Dinary tree D) Both B and C

Last Answer : B) Binary tree

Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to represent M, N, R1 and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Description : Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to ... and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Last Answer : Answer: 4

Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity. (C) A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included. (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : C) i-False, ii-True

Write a difference between Unary and Binary Operator

Description : Write a difference between Unary and Binary Operator

Last Answer : Ans. Operators that acts on one operand are referred to as Unary Operators while Binary Operators acts upon two operand Unary + or Unary – , increment/decrement are the example of Unary operator While binary operator +,-,*,/ and % are the example of binary operators , (+) adds values of its operands

An Azeotropic mixture is a __________ mixture. (A) Binary (B) Ternary (C) Constant boiling point (D) None of these

Description : An Azeotropic mixture is a __________ mixture. (A) Binary (B) Ternary (C) Constant boiling point (D) None of these

Last Answer : (C) Constant boiling point

Sides of equilateral-triangular co-ordinates (on which ternary liquid system is plotted) represent (A) A pure component (B) A binary mixture (C) A ternary mixture (D) Partially miscible ternary system

Description : Sides of equilateral-triangular co-ordinates (on which ternary liquid system is plotted) represent (A) A pure component (B) A binary mixture (C) A ternary mixture (D) Partially miscible ternary system

Last Answer : (B) A binary mixture

The apex of an equilateral-triangular coordinate (in ternary liquidsystem) represents a/an(A) Pure component(B) Binary mixture(C) Ternary mixture(D) Insoluble binary system

Description : The apex of an equilateral-triangular coordinate (in ternary liquidsystem) represents a/an (A) Pure component (B) Binary mixture (C) Ternary mixture (D) Insoluble binary system

Last Answer : (A) Pure component

For a ternary mixture, in which equilateral triangular co-ordinate is used in leaching and extraction, a __________ of the equilateral triangular co-ordinates. (A) Binary mixture is represented by the apex (B) Binary mixture is represented by any point inside (C) Ternary mixture is represented by the sides (D) Pure component is represented by the apex

Description : For a ternary mixture, in which equilateral triangular co-ordinate is used in leaching and extraction, a __________ of the equilateral triangular co-ordinates. (A) Binary mixture is ... Ternary mixture is represented by the sides (D) Pure component is represented by the apex

Last Answer : (D) Pure component is represented by the apex

Van Laar equation deals with the activity co-efficients in (A) Binary solutions (B) Ternary solutions (C) Azeotropic mixture only (D) None of these

Description : Van Laar equation deals with the activity co-efficients in (A) Binary solutions (B) Ternary solutions (C) Azeotropic mixture only (D) None of these

Last Answer : (A) Binary solutions

In facsimile transmission, a page is scanned and converted into a sequence of a. Binary sequence b. Ternary sequence c. black or white pixels d. alphanumeric sequence

Description : In facsimile transmission, a page is scanned and converted into a sequence of a. Binary sequence b. Ternary sequence c. black or white pixels d. alphanumeric sequence

Last Answer : c. black or white pixels

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 attributes of their own. How many minimum number of tables are required to represent this situation in the Relational Model? (A) 4 (B) 3 (C) 2 (D) 1

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 

External Entities may be a A) Source of input data only B) Source of input data or destination of results C) Destination of results only D) Repository of data

Description : External Entities may be a A) Source of input data only B) Source of input data or destination of results C) Destination of results only D) Repository of data

Last Answer : B) Source of input data or destination of results

In a DFD external entities are represented by a A) Rectangle B) Ellipse C) Diamond shaped box D) Circle

Description : In a DFD external entities are represented by a A) Rectangle B) Ellipse C) Diamond shaped box D) Circle

Last Answer : A) Rectangle

In RDBMS, Data is presented as a collection of ............ A) Table B) Attributes C) Relations D) Entities

Description : In RDBMS, Data is presented as a collection of ............ A) Table B) Attributes C) Relations D) Entities

Last Answer : C) Relations

A ………………. Does not have a distinguishing attribute if its own and mostly are dependent entities, which are part of some another entity. A) Weak entity B) Strong entity C) Non attributes entity D) Dependent entity

Description : A ………………. Does not have a distinguishing attribute if its own and mostly are dependent entities, which are part of some another entity. A) Weak entity B) Strong entity C) Non attributes entity D) Dependent entity

Last Answer : A) Weak entity

The different types of tables maintained by the operating system are ............. A) memory, logical , I/O file B) memory, I/O, file, physical C) memory, I/O, file, process D) memory, logical, I/O, physical

Description : The different types of tables maintained by the operating system are ............. A) memory, logical , I/O file B) memory, I/O, file, physical C) memory, I/O, file, process D) memory, logical, I/O, physical

Last Answer : C) memory, I/O, file, process

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

Category of data transmission if the binary pulse is maintained for the entire bit time?

Description : Category of data transmission if the binary pulse is maintained for the entire bit time?

Last Answer : Return to zero

Assertion : Birds have metanephric kidney and no urinary bladder. Reason : South American ostrich has unary bladder .

Description : Assertion : Birds have metanephric kidney and no urinary bladder. Reason : South American ostrich has unary bladder .

Last Answer : Assertion : Birds have metanephric kidney and no urinary bladder. Reason : South American ostrich has ... D. If both Assertion and Reason are false.

Which operation use one operand or unary operations: a. Arithmetic b. Logical c. Both d. None

Description : Which operation use one operand or unary operations: a. Arithmetic b. Logical c. Both d. None

Last Answer : c. Both

What are the unary operations in Relational Algebra?

Description : What are the unary operations in Relational Algebra?

Last Answer : PROJECTION and SELECTION.

Write a program for overloading of ++unary operator for inch to feet conversion. 12 inch = 1 feet.

Description : Write a program for overloading of ++unary operator for inch to feet conversion. 12 inch = 1 feet.

Last Answer : #include #include class abc { int i,f; public: abc(int f1,int i1) { f=f1; i=i1; } void operator ++() {  while(i>11)  {  f++;  i=i-12;  }  cout

Use the concept of operator overloading to overload unary ‘-‘ operator to negate value of variables.

Description : Use the concept of operator overloading to overload unary ‘-‘ operator to negate value of variables.

Last Answer : # include <iostream.h> #include<conio.h> class unary { int x, y, z; public: void getdata (int a, int , int c); void display (void); void operator - (); // overload unary minus. }; ... u. display ( ) ; -u; cout<< " u : " ; u. display ( ) ; }

Write a program to overload the ‘—’ unary operator to negate the values.

Description : Write a program to overload the ‘—’ unary operator to negate the values.

Last Answer : #include<iostream.h> #include<conio.h> #include<string.h> class Number { int x,y; public: Number (int a, int b) { a =x; b =y; } void display() { cout<< ... ; -N1; cout<<"\n After negation:"; N1. display (); getch (); }

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

What is the difference between linear and binary search?

Description : What is the difference between linear and binary search?

Last Answer : A: Linear search does not require the array to be sorted, whereas, binary search requires that the array be sorted. Linear search checks for the search item in a linear fashion from the beginning cell till the end, ... tell what is control variable in your loop. So if your loop is for(int i = 1; i

When does Binary search fail?

Description : When does Binary search fail?

Last Answer : A: When the array is not sorted.

The command javac A) Converts a java program into binary code B) Converts a java program into bytecode C) Converts a java program into machine language D) None of the above.

Description : The command javac A) Converts a java program into binary code B) Converts a java program into bytecode C) Converts a java program into machine language D) None of the above.

Last Answer : B) Converts a java program into bytecode

State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Description : State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

Description : In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

Last Answer : D) [log2n]+1

State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Last Answer : D) True, True

In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search

Description : In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search

Last Answer : A) Linear search

State true or false. i) An empty tree is also a binary tree. ii) In strictly binary tree, the outdegree of every node is either o or 2. A) True, False B) False, True C) True, True D) False, False

Description : State true or false. i) An empty tree is also a binary tree. ii) In strictly binary tree, the outdegree of every node is either o or 2. A) True, False B) False, True C) True, True D) False, False

Last Answer : C) True, True

Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project

Description : Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project

Last Answer : D) Project

Binary code "0" means ............ A) State of absence B) State of presence C) State of Negative D) State of Positive

Description : Binary code "0" means ............ A) State of absence B) State of presence C) State of Negative D) State of Positive

Last Answer : B) State of presence

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

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

Last Answer : (D) 2MN

Binary symmetric channel uses (A) Half duplex protocol (B) Full duplex protocol (C) Bit oriented protocol (D) None of the above

Description : Binary symmetric channel uses (A) Half duplex protocol (B) Full duplex protocol (C) Bit oriented protocol (D) None of the above

Last Answer : (A) Half duplex protocol

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

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

Last Answer : (B) - 22

Active X controls are Pentium binary programs that can be embedded in ............... (A) Word pages (B) URL pages (C) Script pages (D) Web pages

Description : Active X controls are Pentium binary programs that can be embedded in ............... (A) Word pages (B) URL pages (C) Script pages (D) Web pages

Last Answer : (D) Web pages

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

In a binary Hamming code the number of check digits is r then number of message digits is equal to: (A) 2r-1 (B) 2r-r-1 (C) 2r-r+1 (D) 2r+r-1

Description : In a binary Hamming code the number of check digits is r then number of message digits is equal to: (A) 2r-1 (B) 2r-r-1 (C) 2r-r+1 (D) 2r+r-1

Last Answer : (B) 2r-r-1

The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is ............ (A) dbefacg (B) debfagc (C) dbefcga (D) debfgca

Description : The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is ............ (A) dbefacg (B) debfagc (C) dbefcga (D) debfgca

Last Answer : (D) debfgca

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)

Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, 259, 363, 364 (B) 3, 400, 388, 220, 267, 383, 382, 279, 364 (C) 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364

Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364 

Last Answer : (C) 926, 203, 912, 241, 913, 246, 364