GeeksforGeeks

Which one of the following is NOT a referential integrity issue in a relational database where the DEPT column of the EMPLOYEE table is designated as a foreign key into the DEPARTMENT table?

Inserting a new row into DEPARTMENT with a primary key that is not the value of the DEPT column of any row in EMPLOYEE

Deleting a row of DEPARTMENT

Updating the value of DEPT in a row of EMPLOYEE with a value that is not the primary key of any of the rows in DEPARTMENT

Insertin...

There are 2 tables with 16 and 60 tuples respectively. Column A in table 1 is its primary key, whereas Column A in table 2 is the foreign key referring to table 1. Now find out the Minimum and Maximum number of tuples that are possible due to a natural join.

what is the function pointer? In which situation we need to use function pointer?

What is MAC Address? How many bits does it consists of?

Write an sql query to sort a table according to the amounts in a row and find the second largest amount.

What is the functionality of a top command?

A SQL query was given and was asked to find out what it does.

describe the difference between final, finally and finalize in java

What is diff b/w Abstraction and Encapsulation?

What is VLSI, MSI, SSI. What is the Moore's law.

What are the main differences between IPv4 and IPv6.

What is the difference between a router and gateway?

Difference between Hub and switch and which layer each one belongs to

What is global IP Address and Network Adress Translation ?

what do u mean by integrity constraint?

For any string s ∈ (0 + 1)*, let d(s) denote the decimal value of s
(eg: d(101) = 5, d(011) = 3).
Let L = {s ∈ (0+1)* | d(s) mod 5 = 2 and d(s) mod 7 = 4}. Which of the
following statements is true?
a) L is recursively enumerable, but not recursive
b) L is is recursive, but not context-free
c) L is context-free, but not regular
d) L is regular

Which of the following languages over {0, 1} is regular?
a) 0i1j such that i ≤ j
b) 0iw1j such that w ∈ {0, 1}∗ and i ≥ 0
c) All strings of 0s and 1s such that every pth character is 0 where p
is prime
d) None of the above