Bh.Questionbanks  COMPUTER 
Brainheaters Questionbanks (Semester Exam) is the collection of handpicked set of questions which are mostly repeated, important and recommended. Learning this set of questions can easily help you top or even just clear the exams. Given below are Expected Questionbanks for semester.
Semester 5cn
MODULE1
MODULE2
MODULE3
MODULE4
MODULE5
MODULE6
dbms
MODULE1
Works(eid, cid,salary ) Company( eid, cname, city ) Create an ER diagram for the same and Specify the SQL queries for each of the following statements given below. 1) Modify database so that John now lives in Mumbai , assuming the database entry has John staying in Delhi. 2) Find Employees who live in the same city as the company for which they work. 3) Give all employees of” AZ Corporation “ whose salary has increased by 15% in the year 201819. 4) Find the names of all employees, company name and city of residence such that Employee name begins with 'I' 5) Delete all tuples in works relation for employees of small bank corporation. (10M)
MODULE5
mp
MODULE1
tcs
MODULE1 1. Differentiate DFA and NFA. (5M) 2. Write the Numerical for Design a DFA to accept string (Given) (5M) 3. Write the Numerical for Design NFA for recognizing the strings (Given) NFA to DFA. (10M) 4. Design a Finite State Machine to determine whether ternary number (Given) (10M) 6. Write the Numerical for Convert (Given) into NFA with Emoves and obtain DFA. (10M) 7. Construct Moore and Mealy Machine to convert (Given) (10M) 8. Write a short note on Moore and Mealy Machine (5M) MODULE2 1. Explain the applications of Regular Expressions. (5M) 2. Write the Numerical for Obtain a regular expression for the FA. (10M) 3. Write the Numerical for Define Regular Expression and give regular expression (Given) (5M) 4. Write the Numerical for Give and Explain formal definition of Pumping Lemma for Regular Language and prove that (Given) (10M) 5. Write a short note on Applications of Regular expressions and Finite automata (5M) MODULE3 1. Write the Numerical for State and explain pumping Lemma for Context Free Languages. Find out whether the language (given) (10M) 2. Write the Numerical for Convert the following Grammar to Chomsky normal form (CNF). (10M) 3. Explain Chomsky Hierarchy. (5M) 4. Write the Numerical for Consider the following grammar (Given) (10M) 5. Write the Numerical for Convert following CFG to CNF (Given) (10M) 6. Write a short note on Closure properties of Context Free Language. (5M) MODULE4 1. Write the Numerical for Design PDA for the language (Given) (10M) 2. Differentiate between PDA and NPDA. (5M) MODULE5 1. Explain the types of Turing machine in detail. (10M) 2. Write the Numerical for Design a Turing machine that computes a function (Given) (10M) 3. Construct TM to check well formedness of parenthesis. (10M) 4. Universal Turing Machine (5M) MODULE6 1. What are Recursive and Recursively Enumerable Languages? (5M) 2. Write a detailed note on i) Post Correspondence Problem ii) Halting Problem. iii) Rice's Theorem. (10M) MMS
MODULE1
MODULE2
MODULE3
MODULE4
MODULE5
MODULE6
AA
MODULE1
MODULE5
Semester 6SE
MODULE1
1) Product perspective 2) Scope and objective 3) Functional requirements 4) Nonfunctional requirements  Module no.2  (20M)
SPCC
MODULE1
CSS
MODULE1
2) What is the trap door in this? 3) Give Public key and Private Key. 4) Describe security in this system.  (10M)
ii) Need for expansion permutation iii) Avalanche and completeness effects iv) Weak keys and semiweak key v) Role of Sbox
iii) Key generation in IDEA and Blowfish  (5M)
ii) Denial of Service attack iii) SQL injection attack iv) Crosssite scripting attack
DWM
MODULE1
Consider two measures i) Count i) Charge where charge is the fee that the doctor charges a patient for a visit. For the above example create a cube and illustrate the following OLAP operations: 1) Rollup 2) Drill down 3)Slice 4) Dice 5) Pivot.  (10M)

You loved it ?
Do you think team brainheaters efforts transformed your studies to a smarter version ? Share your ratings with us ! #studyroom
