If the adjacency matrix of the graph is non symmetric then definitely graph is directed,because in undirected graph if there is a path from vertex A to vertex B then there will definitely a path from vertex B to vertex A,and hence the adjacency matrix of undirected graph will be symmetric.

Let radix be ‘b’.
For the quadratic equation
ax² + bx + c
Product of roots is = c/a
So from question the quadratic equation given is,
x² - 10 + 31 = 0
and the roots given are
5, 8

Agile software development is a group of software development methodologies based on iterative and incremental development, where requirements and solutions evolve through collaboration between self-organizing, cross-functional teams. The Agile Manifesto introduced the term in 2001.

Option B is the correct SQL query.
Option A is wrong because the subquery contains School schema instead of Dept schema.
Option C is wrong because in question it is clearly said “more than 10” and not “more than or equal to 10”.

There are following six phases in every Software development life cycle model:
* Requirement gathering and analysis.
* Design.
* Implementation or coding.
* Testing.
* Deployment.
* Maintenance.

In software engineering, a software design pattern is a general, reusable solution to a commonly occurring problem within a given context in software design. It is not a finished design that can be transformed directly into source or machine code. Rather, it is a description or template for how to solve a problem that can be used in many different situations. Design patterns are formalized best practices that the programmer can use to solve common problems when designing an application or system.

Data items grouped together for storage purposes are called records.

Testing an application as a whole for the modification in any module or functionality is termed as Regression Testing. It is difficult to cover all the systems in Regression Testing, so typically Automation Testing Tools are used for these types of testing.

In DBMS, two files may be joined into a third file, if they have a field in common

Pseudo code for towers of hanoi is
TOH(n, x, y, z)
{
if (n >= 1)
{
TOH((n-1), x, z, y)
move:x→ y
TOH((n-1), z, y, x)
}
}
Recurrence relation for computing the time-complexity of Towers of Hanoi problem is
T(n)=2T(n-1) + 1

The resources that are depleted after the use by a process. Examples include Hardware interrupts, Unix signals, pthread_cond_signal calls, messages, and information in I/O buffers.

We cant the change the address of ‘a’ because it is mnemonic and not any variable.

The following code swaps the values of ‘a’ and ‘b’. Take some examples of ‘a’ and ‘b’.

The transition from wait to run state is generally not allowed in operating system. But transition from wait to ready state and then from ready to run state is allowed.

Void functions are created and used just like value-returning functions except they do not return a value after the function executes.