Draw the Architecture diagram of Iterative Waterfall Model. 5 Marks
b) What do you mean by phase containment of error?
Given an app.js file and a database file twitterClone.db consisting of five tables user, follower, tweet, reply, and like.
Write APIs to perform operations on the tables user, follower, tweet, reply, and like containing the following columns,
User Table
Column Type
user_id INTEGER
name TEXT
username TEXT
password TEXT
gender TEXT
Follower Table
Column Type
follower_id INTEGER
follower_user_id INTEGER
following_user_id INTEGER
Here, if user1 follows user2 then,
follower_user_id is the user ID of user1 and following_user_id is the user ID of user2.
Column Type
tweet_id INTEGER
tweet TEXT
user_id INTEGER
date_time DATETIME
Reply Table
Column Type
reply_id INTEGER
tweet_id INTEGER
reply TEXT
user_id INTEGER
date_time DATETIME
Like Table
Column Type
like_id INTEGER
tweet_id INTEGER
user_id INTEGER
date_time DATETIME
Sample Valid User Credentials
API 1
API 2
Authentication with JWT Token
API 3
API 4
API 5
API 6
API 7
API 8
API 9
API 10
API 11
For this question
Add two polynomials
Given two polynomials A and B, write a program that adds the given two polynomials A and B.
if the in puts are
4
0 5
1 0
2 10
3 6
4
0 -5
1 0
2 -10
3 -6
then the result is 0 but it is not showing the result from the code of Question #175894
Experiment with the C/C++ implementations of the various sorting and searching algorithms in a
single program with time complexity:
Bubble sort
Insertion sort
Radix sort
Linear search
Binary search
Considering the following functions have been made
1)void Print_Reverse_List(List* node)
2)void Insert_Element(List** head, int data)
3)void PrinList(List* node)
4)void search_Element(List *node, int x)
5)int Length(List *node)
Your task is to create the following functions for the given code:
1)Insert_Element_at(int x)
2)bool is_Empty()
3)bool Delete_Element(int x)
4)void Empty_List()
5)void Copy_List(...)
make menu for the five functions
class List{
public:
int item;
int pos;
List* nextNode
};
List* linkList=NULL;
int ch=-1;
int number;
int position;
while(ch!=6){
cout<<"1. Insert Element\n";
cout<<"2. Print List\n";
cout<<"3. Search Element\n";
cout<<"4. Display Length of List\n";
cout<<"5. Print Reverse List\n";
cout<<"6. Exit\n";
cout<<"Your choice: ";
cin>>ch;
cout<<"\n";
switch(ch){
case 1:
}
Convert the expression into postfix notation and then verify if it is correct or not,direct answers for both 5conversion are not allowed for verification take dummy values for eachvariable.
a+b*(c/d-e)%(f+g*h)-i
what will be the output of the following code? Rough work must be done as well.
int[] values={1,3,5,7,9,11,13,15,17,19};
Stack s=new Stack();
for(int i=0;i<values.length;i++)
{
s.push(values[i]);
}
int n=25;
for(int i=0;i<4;i++)
{
n+=s.pop();
}
for(int i=0;i<2;i++)
{
n-=s.pop();
}
cout<<"\n"<<endl;