Technical Questions

TST 7.5 is a raising edge-triggering interrupt.

Cloud computing :: 

Cloud computing is an information technology (IT) paradigm that enables ubiquitous access to shared pools of configurable system resources and higher-level services that can be rapidly provisioned with minimal management effort, often over the Internet.

Server virtualization :

Server virtualization is a virtualization technique that involves partitioning a physical server into a number of small, virtual servers with the help of virtualization software. In server virtualization, each virtual server runs multiple operating system instances at the same time.

Server virtualization is more for a good reason. It offers the potential to dramatically save space and improve server efficiency. Vendors are in fierce competition to offer the most advanced tools that they hope will earn them the virtualization crown.

Hence, the given statement that 'Cloud computing uses Server virtualization.' is TRUE.

#include "string.h"

#include "stdlib.h"

struct stud

{

       int rollno;

       int marks;

       char name[30];

};

int sort_m (struct stud *, struct stud *);

int sort_name (struct stud *, struct stud *);

int sort_marks (struct stud *, struct stud *);

main()

{

static struct stud ss[] = {

                                            { 15, 96, "Akshay" },

                                            { 2, 97, "Madhuri" },

                                            { 8, 85, "Aishvarya" },

                                            { 10, 80, "Sushmita" }

                                   };

int x,w;

clrscr();

w = sizeof (struct stud);

printf ('\nIn order of roll numbers:");

qsort (ss, 4, w, sort_rn);

for(x=0; x<4;x++)

     printf ("\n%d%s%d", ss[x].rollno, ss[x].name,ss[x].marks);

printf("\n\nIn order of names:");

qsort(ss, 4, sort_name);

for (x=0; x<4;x++)

      printf("\n%d%s%d",ss[x].rollno, ss[x].name,ss[x].marks);

printf("\n\nIn order of marks:");

qsort(ss,4,w,sort_marks);

for (x=0;x<4;x++)

      printf ("\n%d%s%d",ss[x].rollno,ss[x].name,ss[x].marks);

}

int sort_rn (struct stud *t1, struct stud *t2)

{

     return (t1->rollno-t2->rollno);

}

int sort_name (struct stud *t1, struct stud *t2)

{

     return (strcmp(t1->name,t2->name));

}

int sort_marks (struct stud *t1, struct stud *t2)

{

     return (t2->marks-t1->marks);

}

It is an authentication service developed at the Massachusetts Institute of Technology. Kerberos uses encryption to prevent intruders from discovering passwords and gaining unauthorized access to files.

A SIPO and AND gate circuit can detect this sequence.The output of SIPO is connected to a four input AND gate ,the third SIPO output should be connected through a NOT gate.When the 1101 sequence is loaded in to the SIPO the AND output goes HIGH otherwise keeps LOW.

It is a set of rules defining a very simple virtual terminal interaction. The NVT is used in the start of a Telnet session.

A relational database is a digital database based on the relational model of data, a database structured to recognize relations between stored items of information. A software system used to maintain relational databases is a relational database management system.

Computer database in which all data is stored in Relations which (to the user) are tables with rows and columns. Each table is composed of records (called Tuples) and each record is identified by a field (attribute) containing a unique value. Every table shares at least one field with another table in 'one to one,' 'one to many,' or 'many to many' relationships. These relationships allow the database user to access the data in almost an unlimited number of ways, and to combine the tables as building blocks to create complex and very large databases.

The perfect paging size varies from system to system, so there is no single best when it reaches to page size. There are several factors to consider in order to come up with a fitting page size, such as paging time, page table, and its effect on the total performance of the operating system.