Download 5th semester paper of uiet kanpur university and more Exams Database Management Systems (DBMS) in PDF only on Docsity!
END SEM (ODD SEM) EXAMINATION 2021- oPERATING SYSTEM (DIT-S309) IT (5th SEM) UNIVERSITY INSTITUTE OF ENGINEERING & TECHNOL.OGY CSJM UNIVERSITY, KANPUR
Roll No. ... Name^ ..^ .. Max Marks 40 Time^ 3:00^ Hrs.
Section A
- Attempt any FIVE of the following: (5^ X3-15)
(a) Explain layered architecture^ of^ operating^ system.^ Also^ state^ its (^) advantages and
disadvantages. (b) Differentiate^ between^ SMP^ and^ ASMP. (c) Write^ short^ notes^ on:
) Interrupt handling
(ii) Subroutine
(ii) Spooling
(d) What is the^ importance^ of^ Reentrant^ Kernel in (^) operating system?
e) Semaphore^ can^ be^ used^ to^
solve critical section^ problem. Justify?
(1) Explain^ any^ two^ IPC^ schemes.
SectionB
(5 X 3-15)
- Attempt any FIVE of the following:
aFor the following^ table^ find^ out^ average^ waiting^
time and^ average turn^ around^ time^ for
non (^) preemptive priority scheduling^ algorihm^ and^ round^ robin (^) scheduling algorithm with^ time
quantum 2 ms.
Process Arrival^ Time^ Burst^ Time^ Priority
(ms) (ms) Po 0 4 P Pa^4 Ps 7
END (^) SEM (^) (ODD SEM) (^) EXAMINATION (^) 2021- INTRODUCTION To (^) COMPILER (DIT-S311) IT (5th SEM) UNIVERSITY (^) INSTITUTE OF ENGINEERING & (^) TECHNOLOGY CS.JM UNIVERSITY, KANPUR
Roll No. ..
Max Marks 50 Name
Time3:00 Hrs. Section A
- (^) Attempt (^) any FIVE of (^) the following: (a) (5X3-15) Explain (^) applications of (^) compiler. (b) What (^) is (^) the (^) need of compiler? (^) Explain with^ an (^) example c) (^) Operator (^) precedence (^) parser can provide solution^ for (^) ambiguous (^) grammar. (^) Explain with an example.
(d) (^) Explain (^) parser (^) generator tool (YACC). Also^ explain its (^) working with (^) LEX. (e) (^) Differentiate (^) between (^) synthesized attribute and (^) inherited attributes (^) with the (^) help of (^) SDD based grammar.
(e) What^ are the (^) problems (^) in (^) top dowr (^) parsing?
Section B
- (^) Attempt any FIVE of (^) the (^) following: (5 X 3=15) Ja) What^ is^ the^ significance (^) of symbol table in (^) compiler? b) (^) Explain the^ role^ of (^) Assembler, Loader and (^) Linker in compiler. L Parse^ the^ input (^) string "10201" (^) using shift reduce parser for^ the^ following (^) grammar. S0S0/1S1/
Ad) What^ are^ the basic (^) steps for (^) construction of (^) recursive (^) decent parser? (e) Find^ LEADING and (^) TRAILING of the (^) grammar: S aAB /bA /¬
A> aAb/a B bB /¬
() Automata is (^) the basis of (^) compiler. How?
DEPARTMENT OF
INFORMATION TECHNOLOGY
UIET, CS.JM UNIVERSITY
Design and^ Analysis of
Algorithms (DIT-S 305)
Semester: 5th Semn End Semester Examination Year:^ 3rd^ Year Time: 3 h
Total Marks: 50
SECTION-A
What are the
applications of^ shortest (^) path (^) problem? Describe (^) different shortest (^) path problem in detail. types of 141 9 Consider^ the^ recurrence T (^) (n) =^ 3T (n/4) +^ cn'^ and^ solve it^ through Recursion method, show each (^) of (^) the step to (^) calculate (^) Time Complexity.
tree 4]
Consider the recurrence T^ (n) =2T (n/2)) +n and solve it
method, show each of through^ Substitution the (^) step till (^) the (^) Time (^) Complexity found.
Q
Q4. Write^ the (^) Selection sort (^) Algorithm and (^) analyze it (^) based on each Cost^ and^ Time^ taken^ by step. (^) Compute the^ Time^ Complexity for the Worst (^) Case. [
Consider the given graph and apply the prim's Algorithm to find out minimum
spanning tree. (^41)
9
a
C
SECTION-B
Write down the (^) Binary search^ Algorithm^ and^ Compute^ the^ time^ complexity^
of
Binary search^ Algorithm using^ substitution^ method.
Q6.
[P.T.O
DEPARTMENT OF^ INFORMATION (^) TECHNOLOGY UIET, CS.JM UNIVERSITY Database (^) Management (^) System (DIT-S
Semester: 5th Sem
Year: 3rd Year
End Semester Examination
Time 3h (^) Total Marks: 40
SECTION-A
. (^) By (^) considering the (^) given table writes down the (^) SQL query and shows the (^) output.
Empid Deptid Name DI D
Job (^) Salary Contact 50000 23434353 Delhi
40000 43434344 Delhi
City EL E
S. ahmad Anand
Sales manager Sr.manager Account manager45000 34343553 Delhi 3500054545454 | Delhi 45454534 Noida ISO0086867656 Noida 53564673 Gurgaon 45654733 Gurgaon 75686779 Gurgaon
E E ES
D | D
Aruna Alpesh Moniza
Accountant DI (^) Incharge 25000 E6 DI (^) Harish Salesman Incharge Worker Worker
20000 17000
E7 (^) D2 7.ain D D
Nilesh Raja
E
E
Find the (^) departments for^ which^ its^ employees average^ salary^ is^ more^ than^ or^ equal^ to
Find details^ of^ employees who^ are^ living^ in^ the^ same^ city^ as^ Anand lives.
A. For^ each^ department^ find^ the^ average^ salary^
of (^) employees. Retrieve detail of^ employees whose^ name^ start^ with^ character A and names (^) length is^ not
less than 5 characters.
Q2. Explain^ the^ syntax^ of^ adding^ and (^) dropping primary key^ constraint^ into^ an^ existing^
table. (^) [
Q3. Design a^ generalization-specialization^
hierarchy for^ a^ motor^ vehicle^ company.^ The
company sells^ motorcycles,^ cars,^
vans and^ buses.^ Justify^ your^ placement^
of attributes^ at^ each
level of the hierarchy.
Constraint- the vehicle^ may be^ commercial^
or non^ commercial.^12
and full outer^ Join, Explain^ these^ with^ the (^) help of^ two^ tables^ and^ write (^) SQL query for^ each 13
4What do^ you^ mean^ by^ Joining^
of tables^ such^ as^ Equi^ join,^ left^ outer (^) join, Right outer^ join
of one.
P.T.O Q5. Given^ relation^ R^ (A,^ B,^ C,^ D, E) with^ their^
functional dependencies
F{AB (^) C, CD >^ E,^
DE 9 B}
MID (^) SEM (^) (ODD SEM) EXAMINATION (^) 2021- INTRODUCTION TO^ cOMPILERS (^) (DIT-S311) IT (^) (5th (^) SEM) 2K BATCH UNIVERSITY (^) INSTITUTE OF ENGINEERING & CSJM UNIVERSITY, KANPUR TECHNOLOGY
Roll No. .... Max Marks-30 (^) Name Note: (^) Attempt all Time^ -^ 1:30 Hrs. questions.
Section A
- What (^) are the (^) properties of compiler?
- (^) Differentiate (3) between (^) intermediate (^) code (^) generation and (^) code optimization. (^) (3)
- (^) Explain (^) tokens, (^) pattern and (^) lexemes
Find a (^) regular (^) expression (^) corresponding to each of the following subset^ [0,1]: (^) (4)
The language of all strings containing at least two 0's.
(i) The language of all strings containing at most two 0's. Gi) The language of all strings endingg with 1 and do not contain 00. (iv) The language of all strings in which both the number of 0's and number of 1's are odd.
What is the significance of bootstrapping in compiler? 3)
Secrion B
6Consider the following^ CFG^ and^ check^ whether^ this^ grammar^
is (^) LL1) or^ not:
S L)/a
L L,S /S
. Do^ left^ factoring^ in^ the^ following^ grammar:
E eET/^ eE^ /e
T T/t
(5)
8/ Consider^ the (^) following grammar^ and^ perform^ rightmost derivation^ for^ the^ string^
aaabbabbba;
SaB/ bA Aa /aS/bAA B b/bS/aBB
DEPARTMENT OF (^) INFORMATION (^) TECHNOLOGY UIET, CSJM UNIVERSITY Database (^) Management System (^) (DIT-S (^) 307)
Semester: 5th (^) Year: 3rd (^) Year (2K18) Mid Semester Examination
Time: 1.5 h Total Marks: 20
SECTION-AA
Q1. What do you mean by Traditional data model, Describe Hierarchical,^ network^ and Relational data^ model^ in^ brief?^ 3]
The DBMS have a 3 level architecture; describe the concept behind this architecture.
Explain the difference between internal, logical and external schemas, how are these
different schema layer related to the concept of logical and physical data
independence?
What is the difference between Database schema and Database state, explain it with
the example?
Q3. [
SECTION-B
Q4. Create^ a^ table^ client^ with^ the^ following^ constraints- (
Column 1.^ Client_no - entered^ value^ must^ be^ start^ with^ c Column 2. Name^ entered^ value^ must^ be^ in^ upper^ case Column 3. City- in only delhi, Kanpur
Column 4. Address^ - not^ null
Column 5. Mobile - unique
Column 6. Salesid -foreign key
Q5. Explain the^ syntax^ of^ adding^ and (^) droppinglconstraint at^ the^ time^ of
1. Creation^ of^ table.
2. Alteration^ of^ table
And apply these on constraints type Primary key Unique Show it with the help of example.
2
Q6. Consider^ the^ following^ table:^ [P.T.O
MID SEM (ODD SEM) EXAMINATION 2021-
OPERATING SYSTEMS (DIT-S309) IT (5h SEM) 2K19 BATCH
UNIVERSITY INSTITUTE OF ENGINEERING & TECHNOLOGY
CSJM UNIVERSITY, KANPUR
Roll No. ...J 93 **°°^ Name..
Max Marks - 20 Time 1:30 Hrs.
Note:-Atempt all questions
Section A
() Operating system acts as a resource manager. Justify your answer. (^) (2)
) Differentiate between multiprogramming operating system and multitasking operating system. ()
Which type of kernel can suffer from race condition? Explain with a suitable example. (^) 3)
Explain critical section? What are the possible solutions to solve the critical section problem? 3)
Section B
(5) What^ are^ the^ advantages^ of^ reentrant^ kernel?^ (2) (6 How can dinning philosopher problem can suffer from deadlock and what are the solutions for it?
(7 Explain semaphore and write the modification in traditional definition of wait () and signal () function
to avoid busy waiting. (^) (3)
(8) What do you mean by process synchronization? Explain with an example. (^) (2)
Department of^ Information UIET, CSJM Technology University, (^) Kanpur Theory Of (^) Computation Semester:5h Sema (DIT-S303) Mid Semester Examination Year:^ 3rd^ Year
Time: 1.5 hour
Maximum Marks: 30 Section A (All (^) questions are (^) compulsory)
- (^) Find a (^) Regular Expressions for^ each^ of (^) the (^) following
- (^) Li = {w ¬ *: (^) lwl O14- is (^) odd.}
- (^) L = {w e (^) D: w (^) has odd (^) number of (^) a's.}
- (^) La = {w e (^) : uw (^) contains (^) atleast two a's (^) or (^) exactly two (^) b's.}
- (^) L4= (^) {w e 2* (^) : (^) w ends in^ double^ letter.}A string contains a (^) double (^) letter if it aa or bb as substring. contains
- (^) Obtain (^) DFA for the (^) given languages (02*2-04]
- (^) Ls = (^) {(ab) : (^) n20}
- (^) Le = (^) {(ab)" : (^) n (^2) 1}
- (^) Draw the (^) NFA with (^) four state for all (^) string over {0,1} in^ which third^ symbol from^ right end is 0. (^) Check the (^) given string 010010 and 1110010 is (^) accepied or not. (02*2- Section B (All questions are compulsory)
- Set of all string over input {a, b} is not divisible by 3 (02 3-
1. Construct FA and language.
2. Construct Reversal of above FA.
3. Construct Complement of above FA.
- Consider the following two language over the alphabet E = {a +b},
L = (^) {a"|n2 1}, La = {8" (^) | n2 1}
Describe the language as per the set notation as(using DFA/NFA): [L.54-
A. L^ =Li1 B.^ L=L C.^ L=Li^ ULa D.^ L^ = (^) LinLa
02*3-06]
- Construct^ DFA^ for^ given regular expression^ (01^ +0)(00+^ 11)
