Mellanox technologies Interview Questions Answers, HR Interview Questions, Mellanox technologies Aptitude Test Questions, Mellanox technologies Campus Placements Exam Questions

List is like array, it can be used to store homogeneous as well as heterogeneous data type (It can store same data type as well as different data type). List are faster compared to array. Individual element of List data can be accessed using indexing & can be manipulated.
List Code Snippet:
list = [“Sarah”,29,30000.00]
for i in range (3):
print list[i]
——————
Output
Sarah
29
30000.0
Tuples are similar to lists, but there data can be changed once created throught the execution of program. Individual element of Tuples can be accessed using indexing.
Tuples Code Snippet: The Days
days = (“Sunday”, “Monday”, “Tuesday”, “Wednesday”, “Thursday”, “Friday”, “Saturday”)
print days
——————————
(‘Sunday’, ‘Mondays’, ‘Tuesday’, ‘Wednesday’, ‘Thursday’, ‘Friday’, ‘Saturday’)
Sets stores unordered values & have no index. And unlike Tuples and Lists, Sets can have no duplicate data, It is similar to Mathematical sets.
add() function can be used to add element to a set.
update() function can be used to add a group of elements to a set.
Copy() function can be used to create clone of set.
Set Code Snippet:
disneyLand = set ([‘Minnie Mouse’, ‘Donald Duck’, ‘Daisy Duck’, ‘Goofy’])
disneyLand.add(‘Pluto’)
print disneyLand
———————————————–
Output
set([‘Goofy’, ‘Daisy Duck’, ‘Donald Duck’, ‘Minnie Mouse’, ’Pluto’])
Dictionary are similar to what their name is. In a dictionary, In python, the word is called a ‘key’, and the definition a ‘value’. Dictionaries consist of pairs of keys and their corresponding values.
Dictionary Code Snippet:
>>> dict = {‘India’: ‘Bharat’, ‘Angel’: ‘Mother Teresa’, ‘Cartoon’: ‘Mickey’}
>>>print dict[India]
Bharat
>>>print dict[Angel]
Mother Teresa

#include
#include
#include
void create(); // For creating a graph
void dfs(); // For Deapth First Search(DFS) Traversal.
void bfs(); // For Breadth First Search(BFS) Traversal.
struct node // Structure for elements in the graph
{
int data,status;
struct node *next;
struct link *adj;
};
struct link // Structure for adjacency list
{
struct node *next;
struct link *adj;
};
struct node *start,*p,*q;
struct link *l,*k;
int main()
{
int choice;
clrscr();
create();
while(1)
{
cout<<"-----------------------nn"; cout<<"1: DFSnn2: BSFnn3: ExitnnEnter your choice: n"; cin>>choice;
switch(choice)
{
case 1:
dfs();
break;
case 2:
bfs();
break;
case 3:
exit(0);
break;
default:
cout<<"Incorrect choice!Re-enter your choice."; getch(); } } return 0; } void create() // Creating a graph { int dat,flag=0; start=NULL; cout<<"Enter the nodes in the graph(0 to end): "; while(1) { cin>>dat;
if(dat==0)
break;
p=new node;
p->data=dat;
p->status=0;
p->next=NULL;
p->adj=NULL;
if(flag==0)
{
start=p;
q=p;
flag++;
}
else
{
q->next=p;
q=p;
}
}
p=start;
while(p!=NULL)
{
cout<<"Enter the links to "<data<<" (0 to end) : "; flag=0; while(1) { cin>>dat;
if(dat==0)
break;
k=new link;
k->adj=NULL;
if(flag==0)
{
p->adj=k;
l=k;
flag++;
}
else
{
l->adj=k;
l=k;
}
q=start;
while(q!=NULL)
{
if(q->data==dat)
k->next=q;
q=q->next;
}
}
p=p->next;
}
cout<<"-------------------------"; return; } // Deapth First Search(DFS) Traversal. void bfs() { int qu[20],i=1,j=0; p=start; while(p!=NULL) { p->status=0;
p=p->next;
}
p=start;
qu[0]=p->data;
p->status=1;
while(1)
{
if(qu[j]==0)
break;
p=start;
while(p!=NULL)
{
if(p->data==qu[j])
break;
p=p->next;
}
k=p->adj;
while(k!=NULL)
{
q=k->next;
if(q->status==0)
{
qu[i]=q->data;
q->status=1;
qu[i+1]=0;
i++;
}
k=k->adj;
}
j++;
}
j=0;
cout<<"Breadth First Search Results"; cout<<"---------------------------"; while(qu[j]!=0) { cout<status=0;
p=p->next;
}
p=start;
stack[0]=0;
stack[top]=p->data;
p->status=1;
while(1)
{
if(stack[top]==0)
break;
p=start;
while(p!=NULL)
{
if(p->data==stack[top])
break;
p=p->next;
}
cout<adj;
while(k!=NULL)
{
q=k->next;
if(q->status==0)
{
top++;
stack[top]=q->data;
q->status=1;
}
k=k->adj;
}
}
getch();
return;
}

Paternal Grandmother