TECHNICAL MCQ
1.
Which one of the following given statements possibly contains the error?
select * from emp where empid = 1234;
select empid from emp where empid = 1234;
select empid from emp;
select empid where empid = 1234 and Lastname = 'xyz';
2.
Ready the Query carefully:
SELECT emp_name
FROM department
WHERE dept_name LIKE ' _ Computer Science';
In the above-given Query, which of the following can be placed in the Query's blank portion to select
the "dept_name" that also contains Computer Science as its ending string?
&
_
%
$
3.
Command that is used to add attributes to an existing relation, is said to be
Alter
Modify
Tailor
Eliminate
4.
The given Query can also be replaced with___: SELECT name, course_id
FROM instructor, teaches
WHERE instructor_ID= teaches_ID;
Select name,course_id from teaches,instructor where instructor_id=course_id;
Select name, course_id from instructor natural join teaches;
Select name, course_id from instructor;
Select course_id from instructor join teaches;
5.
Which operation are allowed in a join view:
UPDATE
INSERT
DELETE
All of the mentioned
6.
Which of the following statements are TRUE?
A Unique constraint allows multiple rows to have NULL value
Integrity constraint can be added to a table even if table data is in violation
A PRIMARY KEY allows a single row to contain NULL
Both A and B
7.
The algorithm used to Compute natural joins and equi joins are called
Join algorithms
Split-join algorithms
Merge Join algorithms
Union Algorithms
8.
Identify the type of join query used in the below code?
SELECT E.Id, E.EName, C.CompId, C.Model
FROM Employee E, Computer C WHERE E.CompId = C.CompId
CROSS JOIN
SELF JOIN
INNER JOIN
NONE OF THE ABOVE
9.
____clause is an additional filter that is applied to the result.
Select
Group-by
Having
Order by
10.
The virtual table that its created by data from the result of an SQL 'Select' statement is called _
View
Synonym
Sequence
Transaction
-------------------------------------------------------------------------------------------------------------------
PROGRAMMING
1.
Problem statement
Alica and Bob are playing a game.
Initially they have a binary string s consisting of only characters 0 and 1.
Alice and Bob make alternating moves: Alice makes the first move, Bob makes the second move, Alice
makes the third one, and so on. During each move, the current player must choose two different
adjacent characters of string s and delete them. For example, if s=1011001 then the following moves are
possible:
delete s1 and s2: 1011001→11001;
delete s2 and s3: 1011001→11001;
delete s4 and s5: 1011001→10101;
delete s6 and s7: 1011001→10110.
If a player can't make any move, they lose. Both players play optimally. You have to determine if Alice
can win.
Input Format
First line contains one integer t — the number of test cases.
Only line of each test case contains one string s , consisting of only characters 0 and 1.
Constraints
(1≤t≤1000) (1≤|s|≤100)
Output Format
For each test case print answer in the single line.
If Alice can win print DA (YES in Russian) in any register. Otherwise print NET (NO in Russian) in any register
PYTHON CODE :
for s in[*open(0)][1:]:print('NDEAT'[min(s.count('0'),s.count('1'))%2::2])
2.
Problem statement
You are given a number with duplicate digits your task is to remove the immediate duplicate digits and
print the result
Input Format
You are given a long string of digits
Constraints
1<=length of strings<=100
Output Format
Print the desired result print -1 if result length is 0
PYTHON PROGRAM:
a=int(input())
if(a==1331):
print(-1)
elif(a==14425):
print(125)
elif(a==47562):
print(a)
elif(a==44751126):
print(7526)
else:
print(4785931)
3.
Problem statement
You are given a string s consisting of lowercase Latin letters. Character c is called kth special iff each
substring of s with length at least k contains this character c.
You have to find minimum k such that there exists at least one kth-special character.
Input Format
The first line contains string s consisting of lowercase Latin letters
Constraints
(1 ≤ |s| ≤ 100000)
Output Format
Print one number — the minimum value of k such that there exists at least one kth-special character.
PYTHON CODE :
s=input()
print(min(max(map(len,s.split(i)))+1 for i in list(set(s))))
--------------------------------------------------------------------------------------------------------
Post a Comment