jarvisalbert
BAN USER- 0of 0 votes
AnswersFrom the following options, select the OOP mechanism, that allows treatment of the derived class members just like the members of their parent class.
- jarvisalbert in India
Abstraction
Polymorphism
Decoupling
Encapsulation| Report Duplicate | Flag | PURGE
Oracle Software Engineer / Developer Object Oriented Design - 0of 0 votes
AnswersYou have two relation variables: RelV1 and RelV2. They are NOT necessarily distinct. You
- jarvisalbert in India
have a set K as a key for RelV1. Consider that FK is a subset of the heading of RelV2 that
involves exactly the same attributes as K.
From the following options, select the option that correctly depicts a scenario where FK can be
considered as a foreign key.
-Every tuple in RelV1 has a K value that is equal to the FK value in some tuple in RelV2
-Every tuple in RelV1 has a FK value that is equal to the K value in some tuple in RelV2
-Every tuple in RelV2 has a K value that is equal to the FK value in some tuple in RelV1
-Every tuple in RelV2 has a FK value that is equal to the K value in some tuple in RelV1| Report Duplicate | Flag | PURGE
Oracle Software Engineer / Developer Database - 0of 0 votes
AnswersSelect the option that correctly describes the database replication concept where two or more
- jarvisalbert in India
replicas synchronize each other through a transaction identifier.
-Quorum
-Multimasterslave
-Master-Slave
-Multimaster| Report Duplicate | Flag | PURGE
Oracle Software Engineer / Developer Database - 0of 0 votes
AnswersSuppose you have the following code:
void InsertNode(tNode** node, int i){ if(*node == NULL){ *node = new tNode; (*node)->pLeft = NULL; (*node)->data = i; (*node)->pRight = NULL; SetRootNode(node); return; } else { if(i < (*node)->data) InsertNode(&((*node)->pLeft), i); if(i > (*node)->data) InsertNode(&((*node)->pRight), i); return; } } void Func(tNode **node){ if(*node!=NULL){ Func(&(*node)->pLeft); tNode *temp; temp = (*node)->pLeft; (*node)->pLeft= (*node)->pRight; (*node)->pRight = temp; Func(&(*node)->pRight); } } void traverse(tNode** nd){ if(*nd!=NULL){ traverse(&((*nd)->pLeft)); traverse(&((*nd)->pRight)); std::cout<<(*nd)->data<<std::endl; } }
Let the input given be
98,15,100,10,78,120,5,12,96,110
What would be the output of the following code snippet?int main(void) { tree *bT = new tree; int i = 10; int data; while(i--){ std::cout<<"Enter the node"<<std::endl; std::cin>>data; bT->InsertNode(bT->GetRootNode(), data); } bT->Func(bT->GetRootNode()); bT->InsertNode(bT->GetRootNode(), 99); bT->Func(bT->GetRootNode()); bT->traverse(bT->GetRootNode()); }
Options
- jarvisalbert in United States
-5,10,12,15,78,96,98,99,100,1
10,120
-5,12,10,99,96,78,15,110,120,
100,98
-5,10,12,15,78,96,99,98,100,1
10,120
-98,100,120,110,15,78,96,99,1
0,12,5| Report Duplicate | Flag | PURGE
Oracle Software Engineer / Developer Algorithm