All categories

3 years ago

)When a linke chain contain nodes that reference both the next node and the previous node it is called a(n)

Computers and Technology

1 answer:

sergij07 [2.7K]3 years ago

4 0

Answer:

The correct answer for the given question is option(D)

Explanation:

The doubly linked list or chain contains both the reference next node and the previous node .

following are the structure of doubly linked chain

struct doubly1

{

struct doubly1 * next;

struct doubly1 *prev;

int num;

};

Here the node contain two field "next and prev". The next pointer points the next address of the structure doubly1 and prev pointer points the previous address of the structure doubly1 and num is data field .

You might be interested in

A company accidentally sends a newsletter with a mistyped website address. The address points to a website that has been spoofed

Thepotemich [5.8K]

Answer:

Option (A) is the right answer.

Explanation:

The following terms can be described as :

Phishing: Phishing can be described as the concept of stealing personal data i.e. credit card, bank account information, etc. of customers by sending fraud emails or by making fraud webpages on the name of a reputed company.

Tailgating: tailgating can be defined as the concept of getting entry with the authorized person in a restricted zone.

Baiting: baiting can be described as the term of stealing personal data by giving greed to customers by telling them fraud offers.

Quid pro quo: quid pro quo can be defined as the concept where the attacker takes the access of the system.

According to the scenario, the most appropriate answer is option (A) because the company sends a wrong web address which is used by hackers to collect user's personal data which comes under phishing.

3 0

3 years ago

Can Anyone Send Me The Correct Code To This ?<br><br> ITS JAVA

scoundrel [369]

Answer:

whta u mean by code?

Explanation:

8 0

3 years ago

Ms. Troy would like you to make a copy of an outfit that she owns and really likes—a sleeveless dress with a short-sleeve jacket

Contact [7]

3.d
5.c
8.a
9.b
10.b

just took the exam ... hope it helps

3 0

3 years ago

Read 2 more answers

Assume you have 100 values that are all different, and use equal width discretization with 10 bins.

zepelin [54]

Answer:

a) 10

b) 1

C) 10

D) 1

E) 20

F) 10

Explanation:

a) The largest number of records that could appear in one bin

= 10

B) The smallest number of records that could appear in one bin

= 1

C) The largest number of records that cab appear in one bin

= 10

d) smallest number

= 1

e) With frequency = 20. the largest number of records that could appear in one bin with equal width discretization (10 bins)

= 20

f ) with equal height discretization

= 10

6 0

3 years ago

write an expression taht evaluated to true if and only if the variable s does not contain the string 'end'

natima [27]

Answer:

//check which string is greater

if(strcmp(name1,name2)>0)

//assign name1 to first, if the

//name1 is greater than name2

first=name1;

else

//assign name2 to first, if the

//name2 is greater than name1

first=name2;

//compare name1 and name2

if(strcmp(name1,name2)>0)

//compare name1 and name3

if(strcmp(name1,name3)>0)

//assign name1 to max, becuase

//name1 is greater than name2 and name3

max=name1;

Explanation:

7 0

3 years ago