SQL: SQL stands for “Structured Query Language”. The current version of SQL is “ANSI SQL – 92”. It contains constructs which are used to define and process database . They are executed using DBMS-supplied command prompt. SQL is not a programming language. It is text-based and it is also called as data sublanguage. In order to get SQL as a complete programming language, it should be included in scripting languages like Java, C#, and so on. DROP TABLE statement: “DROP TABLE” statement comes under Data Definition Language. It is used to delete the information and to delete the structure of the table. The syntax to drop a table is as follows. Syntax: DROP TABLE table_Name; ALTER TABLE Statement: “ALTER TABLE” statement comes under Data Definition Language. It is used to modify column, add constraints, add column(s), drop column, rename column name and table name, drop constraints, and so on. Syntax: Syntax to drop constraint is as follows: ALTER TABLE table_Name DROP CONSTRAINT constraintName;

Question

Want to see the full answer?

Answer 1

Question

Chapter 3, Problem 3.13RQ

Program Plan Intro

SQL:

SQL stands for “Structured Query Language”.

The current version of SQL is “ANSI SQL – 92”.

It contains constructs which are used to define and process database. They are executed using DBMS-supplied command prompt.

SQL is not a programming language. It is text-based and it is also called as data sublanguage. In order to get SQL as a complete programming language, it should be included in scripting languages like Java, C#, and so on.

DROP TABLE statement:

“DROP TABLE” statement comes under Data Definition Language. It is used to delete the information and to delete the structure of the table. The syntax to drop a table is as follows.

Syntax:

DROP TABLE table_Name;

ALTER TABLE Statement:

“ALTER TABLE” statement comes under Data Definition Language. It is used to modify column, add constraints, add column(s), drop column, rename column name and table name, drop constraints, and so on.

Syntax:

Syntax to drop constraint is as follows:

ALTER TABLE table_Name DROP CONSTRAINT constraintName;

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Design a dynamic programming algorithm for the Longest Alternating Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest subsequence where the numbers alternate between being larger and smaller than their predecessor The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4] Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4]) Example 2: Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8] Output: 8 ([4, 7, 2, 5, 3, 8, 0,4]) (Take your time with this for the subproblem for this one)

Design a dynamic programming algorithm for the Coin-change problem described below: Input: An amount of money C and a set of n possible coin values with an unlimited supply of each kind of coin. Output: The smallest number of coins that add up to C exactly, or output that no such set exists. The algorithm must take O(n C) time. You must also write and explain the recurrence. Example 1: Input: C24, Coin values = = [1, 5, 10, 25, 50] Output: 6 (since 24 = 10+ 10+1+1 +1 + 1) Example 2: Input: C = 86, Coin values = [1, 5, 6, 23, 35, 46, 50] Output: 2 (since 86 = 46+35+5)

Design a dynamic programming algorithm for the Longest Common Subsequence problem de- scribed below Input: Two strings x = x1x2 xm and y = Y1Y2... Yn Output: The length of the longest subsequence that is common to both x and y. . The algorithm must take O(m n) time. You must also write and explain the recurrence. (I want the largest k such that there are 1 ≤ i₁ < ... < ik ≤ m and 1 ≤ j₁ < ... < jk ≤ n such that Xi₁ Xi2 Xik = Yj1Yj2 ··· Yjk) Example 1: Input: x = 'abcdefghijklmnopqrst' and y = 'ygrhnodsh ftw' Output: 6 ('ghnost' is the longest common subsequence to both strings) Example 2: Input: x = 'ahshku' and y = ‘asu' Output: 3 ('asu' is the longest common subsequence to both strings)