DEV BHOOMI INSTITUTE OF TECHNOLOGY … · ... Data transfer & manipulations ... What is memory transfer? Explain the terms with ... A data communication links employs the character-controlled

DEV BHOOMI INSTITUTE OF

TECHNOLOGY

DEHRADUN

Department of Computer Science and Engg.

HAND BOOK

Session 2016-17

Class : 2nd

yr / 4th

sem

Unit-I

Register Transfer Language, Bus and Memory Transfers, Bus Architecture, Bus Arbitration, Arithmetic Logic, Shift

Micro operation, Arithmetic Logic Shift Unit, Design of Fast address, Arithmetic Algorithms (addition, subtraction,

Booth Multiplication), IEEE standard for Floating point numbers.

Unit-II

Control Design: Hardwired & Micro Programmed (Control Unit): Fundamental Concepts (Register Transfers,

performing of arithmetic or logical operations, fetching a word from memory, Storing a word in memory),

Execution of a complete instruction, Multiple-Bus organization, Hardwired Control, Micro programmed

control(Microinstruction, Micro program sequencing, Wide-Branch addressing, Microinstruction with Next-address

field, Pre-fetching Microinstruction).

Unit-III

Processor Design: Processor Organization: General register organization, Stack organization, Addressing mode,

Instruction format, Data transfer & manipulations, Program Control, Reduced Instruction Set Computer

Input-Output Organization: I/O Interface, Modes of transfer, Interrupts & Interrupt handling, Direct Memory access,

Input-Output processor, Serial Communication.

Unit-IV

Memory Organization: Memory Hierarchy, Main Memory (RAM and ROM Chips), organization of Cache Memory,

Auxiliary memory, Cache memory, Virtual Memory, Memory management hardware.

Unit – V

Parallel Processing & Pipelining: Arithmetic Pipelining, Instruction Pipelining, RISC Pipelining, Vector Processing,

Array Processor.

Multiprocessor: Characteristic of Multiprocessor, Interconnection Structure, Inter-processor Arbitration, Cache

Coherence

DEV BHOOMI INSTITUTE OF TECHNOLOGY, DEHRADUN

Syllabus

Course Name: Computer Organization

Course Code:TCS -401

Faculty :Ms. Preeti Raturi

Branch: CSE Semester:4th

DBIT/BTech/CSE/06

DBIT DEHRADUN

LESSON PLAN

SEMESTER/YEAR: 4th

/2nd

DEPARTMENT : CSE

COURSE: COMPUTER ORGANIZATION COURSE CODE : TCS-401

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

1. Register Transfer Language T1 1 Chalk

&Talk

2. Bus and Memory Transfers T1 1 Chalk

&Talk

3. Bus Architecture ,Bus Arbitration T1 & R1 1 Chalk

&Talk

4. Arithmetic Logic, Shift Microoperation T1 & R1

2 Chalk

&Talk

7. Arithmetic Logic Shift Unit, Design of Fast address T1 & R1 1 Chalk

&Talk

8. Arithmetic Algorithms (addition, subtraction, Booth Multiplication T1 & R1 2 Chalk

&Talk

9. IEEE standard for Floating point numbers. T1 & R1 1 Chalk

&Talk

10. Hardwired Control Unit T1 2 Chalk

&Talk

11. Micro Programmed Control Unit T1&R1 1 Chalk

&Talk

12.

Fundamental Concepts (Register Transfers performing of arithmetic

or logical operations fetching a word from memory, Storing a word

in memory)

T1 2

Chalk

&Talk

13. Execution of a complete instruction T1 1 Chalk

&Talk

14. Multiple-Bus organization T1 2 Chalk

&Talk

15. Hardwired Control Micro programmed control(Microinstruction T1 2 Chalk

&Talk

16. Microprogram sequencing T1 1 Chalk

&Talk

17. Wide-Branch addressing, Microinstruction with Next-address field T1 2 Chalk

&Talk

18. Processor Organization: General register organization T1 2 Chalk

&Talk

19. Stack organization T1 2 Chalk

&Talk

20. Addressing mode T1 2 Chalk

&Talk

21 Instruction format, Data transfer & manipulations T1 1 Chalk

&Talk

22. Program Control, Reduced Instruction Set

Computer.

R2 1 Chalk

&Talk

23. I/O Interface, Modes of transfer R2 1 Chalk

&Talk

24. Interrupts & Interrupt handling, Direct Memory access, Input-

Output processor

T1 2 Chalk

&Talk

25. Serial Communication T1 2 Chalk

&Talk

DBIT/BTech/CSE/06

26. Memory Hierarchy, Main Memory (RAM and ROM Chips T1 1 Chalk

&Talk

27. Organization of Cache Memory T1 1 Chalk

&Talk

28. Auxiliary memory, Cache memory T1 1 Chalk

&Talk

29. Virtual Memory, Memory management hardware. T1 1 Chalk

&Talk

30. Parallel Processing, Pipelining- Arithmetic Pipelining T1 2 Chalk

&Talk

31. Instruction Pipelining T1 2 Chalk

&Talk

32. RISC Pipelining T1 1 Chalk

&Talk

33 Vector Processing, Array Processor T1 1 Chalk

&Talk

34. Multiprocessor: Characteristic of Multiprocessor, T1 2 Chalk

&Talk

35. Interconnection Structure T1 1 Chalk

&Talk

36. Interprocessor Arbitration, Cache Coherence T1 2 Chalk

&Talk

Total Lectures: 50

REMARKS/RECOMMENDATIONS FOR FUTURE:

EXTRA CLASS TAKEN (IF ANY):

TEXT BOOKS:

[T1] Computer Organization, John P.Hayes, McGraw Hill, 3rd Edition.

[T2] Computer System Architecture, M. Mano, Pearson, 3rd Edition.

REFERENCE BOOK:

[R1] Computer Organization, Vravice, Zaky & Hamacher (TMH Publication)

[R2] Structured Computer Organization, Tannenbaum(PHI)

[R3] Computer Organization, Stallings(PHI)

[R4] R.S.Gaonkar - Microprocessor architecture – Programming and Application with 8085/8080A - Wiley Eastern

Limited.

Signature of HOD:__________

Date: __________

1. What is register transfer logic?

2. Explain the basic symbols sued in register transfer language.

3. Represent the following conditional control statement by two register transfer statements with

control functions:

If (P=1) then (R1<- R2) else if (Q=1) then (R1<- R3)

4. What is wrong with the following register transfer statements?

a. xT: AR<- AR , AR<-0

b. yT: R1<- R2, R1<-R3

c. zT: PC<- Ar, PC<- PC+1

5. Multiply the numbers using booth multiplication: (11)*(-5)


ASSIGNMENT SHEET

Course Name: Computer Organization Assignment No. 1

Course Code: TCS-401Faculty :Ms. Preeti Raturi

Branch: CSE Semester: IV

Unit 1: Introduction to Computer Organization Date of Issue: Date of Submission:

1. What is a control unit? What are the functions of a control unit?

2. Explain with the block diagram for fetching a word from memory in hardwired control unit.

3. Explain with the block diagram for storing a word in memory in hardwired control unit

4. What is micro programmed control unit? Explain with block diagram.

5. Differentiate between hardwired and micro programmed control unit.

6. Define the following:

a) Control memory

b) control word

c) sequencer

d) pipeline register

e) control address registers


ASSIGNMENT SHEET




Unit 2 : Addressing, Register Transfer Language Date of Issue: Date of Submission:

1. What is processor organization? What are the major components of a computer system?

2. A stack is organized such that SP always points at the next empty location on the stack. This

means that SP can be initiated to 4000 and the first item in the stack is stored in location 4000.

List the micro operations for the push and pop operations.

3. Convert the following numerical arithmetic expression into reverse polish notation an show

the stack operations for calculating the numerical result.

a. (3+4)[10(2+6) +8]

4. How many times does the control unit refers to memory when it fetches and executes an

indirect addressing mode instruction if the instruction is (A) a computational type requiring an

operand from memory (B) a branch type.

5. What must the address field of an indexed addressing mode instruction be to make it the same

as a register indirect mode instruction?


ASSIGNMENT SHEET




Unit 3 : Processor Organization Date of Issue: Date of Submission:

1. Explain the memory hierarchy of computer system.

2. Explain the chip set selection in RAM chip.

3. Explain the concept of virtual memory.

4. Explain the memory mapping methods in cache memory.

5. Explain instruction set Architecture? Give examples.

6. a. How many 128× 8 RAM chips are needed to provide a memory capacity of 2048

bytes?

b. How many lines of the address bus must be used to access 2048 bytes of memory?

How many of these lines will be common to all chips?

c. How many lines must be decoded for chip select? Specify the size of the decoders.


ASSIGNMENT SHEET




Unit/Title: IV/ Memory Organization Date of Issue: Date of Submission:

1. What are the various stages in a Pipeline execution?

2. What are the types of pipeline hazards?

3. Define structural, data, and control hazard.

4. List two conditions when processor can stall.

5. List the types of data hazards.

6. Explain the function of six segment pipeline and draw a space diagram for six segment

pipeline solving the time it takes to process eight tables.


ASSIGNMENT SHEET




Unit/Title: V/ Instruction Pipelining Date of Issue: Date of Submission:

1. Explain the concept of normalization in floating point representation.

2. What is register transfer? Give examples.

3. Give the block diagram for bus system for four registers.

4. For a given bus system, what is the method of bus selection?

5. What is memory transfer? Explain the terms with reference to memory transfer:

i. Memory read

ii. Memory write

iii. DR←M[AR]

6. What are logic micro operations? Give few examples of micro operations with

syntax.

7. What are shift micro operations? Give few examples of shift micro operations with

syntax.


TUTORIAL SHEET

Course Name:Computer Organization Tutorial Sheet No. 1

Course Code: TCS 401

Faculty : Ms. Preeti Raturi


Unit/Title: UNIT 1 Date of Discussion:

1. What are instruction codes and operation codes? Give examples.

2. Give block diagrams for the working of direct and indirect address. Also example the

calculation of effective address.

3. What are the different types of registers used in computer system? Give their functions

and sizes.

4. Explain the basic computer instruction formats. Also give their instruction formats.

5. What is a control unit? Differentiate between hardwired and micro programmed

control unit.

6. Explain with a block diagram for fetching a word from memory in a hardwired control

unit.

7. Give the control timing signal for hardwired control unit.


TUTORIAL SHEET





Unit/Title: Unit-2 Date of Discussion:

1. What is processer organization? Give a block diagram of the basic components of

computer organization.

2. Explain the creation of a control word in general register organization of 7 registers.

3. What is control word? Give the encoding of register selection fields.

4. Explain the block diagram of 64 word stack. Also give the algorithm for following stack

operations:

i. PUSH

ii. POP

5. Write a program to evaluate the expression:

𝑋 = 𝐴 ∗ 𝐵 + 𝐴 ∗ (𝐵 ∗ 𝐷 + 𝐶 ∗ 𝐸)

a. Using an accumulator type computer with one address register.


TUTORIAL SHEET






1. Draw a space-time diagram for a six segment pipeline showing takes to process eight

tasks.

2. Give an example that uses delayed load with the three-segment pipeline.

3. Give an example of a program that will cause a branch penalty in the three-segment

pipeline..

4. Formulate a six-segment instruction pipeline for a computer operation to be performed in

each segment.

5. What are vector processors and array processors? Give examples and applications.


TUTORIAL SHEET






1. What are the differences between electromechanical and electromagnetic peripheral devices?

2. Why does DMA have priority over the CPU when both request transfer?

3. What is the minimum number of bits that a frame must have in the bit-oriented protocol?

4. A data communication links employs the character-controlled protocol with data

transparency using the DLE character. The text message that the transmits sends between

STX and ETX is as follows:

DLE STX DLE DLE ETX DLE DLE ETX DLE ETX

What is the binary value of the transparent text data?


TUTORIAL SHEET





Unit/Title: Unit 5 Date of Discussion:

1. Explain memory hierarchy in a computer system

2. A computer’s memory is composed of 8K words of 32 bits each. How many bits are

required for memory address if the smallest addressable memory unit is a word?

3. 32 processes are currently running. If the OS permitted each process to use the

maximum possible address space, how many page table entries are required.

(i) Conventional page tables

(ii) Inverted page tables

4. Draw a diagram showing how the bits of a virtual address are used to generate a 32-

bit physical address.


TUTORIAL SHEET





Unit/Title: Unit- 3 and 4 Date of Discussion:

1. Determine the number of clock cycles that it takes to process 200 tasks in a six segment

pipeline.

2. Explain the organization of virtual memory

3. A no pipeline system takes 50 ns to process a task. The same task can be processed in 6

segment pipeline with a clock cycle of 10 ns. Determine the speedup ratio of pipeline for

100 tasks. What is maximum speedup ratio?

4. Explain the following:

i. Functions of peripherals interface

ii. Modes of transfer in DMA

iii. Speedup ratio

iv. Divide overflow

v. Difference between RISC & CISC

5. An instruction is stored at location 300 with its address field at location 301. The address

field at location 301. The address field has the value 400. A processor register R1 contains

the number 200. Evaluate the effective address if the addressing mode of the instruction is

i. Direct

ii. Immediate

iii. Relative

iv. Register indirect

v. Index with R1 as the index register

TUTORIAL SHEET




Branch: CSE Semester: 4th

Unit/Title: Unit 4 and 5(Collection) Date of Discussion:


SHORT QUESTIONS

1. Define the term Computer Architecture.

2. Define Multiprocessing.

3. What is meant by instruction?

4. What is Bus? Draw the single bus structure.

5. Define Pipeline processing.

6. Draw the basic functional units of a computer.

7. Briefly explain Primary storage and secondary storage.

8. What is register?

9. Define RAM.

10. Give short notes on system software.

11. Write down the operation of control unit?

12. Define Memory address register.

13. What is stack & queue?

14. Define Addressing modes.

15. Write the basic performance equation?

16. Define clock rate.

17. List out the various addressing techniques.

18. Draw the flow of Instruction cycle.

19. Suggest about Program counter.

20. List out the types in displacement addressing.

21. What is meant by stack addressing?

22. Define carry propagation delay.

23. Draw a diagram to implement manual multiplication algorithm.

24. Perform the 2’s complement subtraction of smaller number(101011) from larger

number(111001).

PART-B

1. Write briefly about computer fundamental system?

2. Explain memory unit functions.

3. Explain memory locations and addresses.

4. Explain Software interface.

5. Explain instruction set Architecture? Give examples.

6. What is bus explain it in detail?


QUESTION BANK


Course Code: TCS-401



Unit 1: 1 & 2

7. Explain briefly about performance evaluation by using various bench marks. List out the types

of bench marks and mention its advantage and disadvantage.

8. Explain the operations of stacks and queues.

9. Discuss about different types of addressing modes.

10. Explain in detail about different instruction types and instruction sequencing.

11. Explain Fixed point representation.

12. How floating point addition is implemented. Explain briefly with a neat diagram.

13. Give the difference between RISC and CISC.

14. Write an algorithm for the division of floating point number and illustrate with an example.

PART-A

1. What are the basic operations performed by the processor?

2. Define Data path.

3. Define Processor clock.

4. Define Latency and throughput.

5. Discuss the principle operation of micro programmed control unit.

6. What are the differences between hardwired and micro programmed control units?

7. Define nanoprogramming.

8. What is control store?

9. What are the advantages of multiple bus organization over a single bus organization?

10. Write control sequencing for the executing the instruction. Add R4,R5,R6.

11. What is nano control memory?

12. What is the nano instruction format of Qm-1?

13. What is the capacity of nano control memory?

14. Define micro routine.

15. What is meant by hardwired control?

16. What are the types of micro instruction?

17. Name the methods for generating the control signals.

PART-B

1. Draw and explain typical hardware control unit.

2. Draw and explain about micro program control unit.

3. Write short notes on

(i)Micro instruction format (ii) Symbolic micro instruction.

4. Explain multiple bus organization in detail.

Unit 3


QUESTION BANK





PART-A

1. What is Pipelining?

2. What are the major characteristics of a Pipeline?

3. What are the various stages in a Pipeline execution?

4. What are the types of pipeline hazards?

5. Define structural, data, and control hazard.

6. List two conditions when processor can stall.

7. List the types of data hazards.

8. List the techniques used for overcoming hazard.

9. What is instruction level parallelism?

10. What are the types of dependencies?

11. What is delayed branching?

12. Define deadlock.

13. Draw the hardware organization of two stage pipeline.

14. What is branch prediction?

15. Give two examples for instruction hazard.

16. List the various pipelined processors.

17. Why we need an instruction buffer in a pipelined CPU?

18. What are the problems faced in instruction pipeline?

19. Write down the expression for speedup factor in a pipelined architecture.

PART-B

1. Explain different types of hazards that occur in a pipeline.

2. Explain various approaches used to deal with conditional branching.

3. Explain the basic concepts of pipelining and compare it with sequence processing with a neat

diagram.

4. Explain instruction pipelining.

5. What is branch hazard? Describe the method for dealing with the branch hazard?

6. What is data hazard? Explain the methods for dealing with data hazard?

7. Explain the function of six segment pipeline and draw a space diagram for six segment

pipeline solving the time it takes to process eight tables.

8. Explain the influence of instruction sets.

9. Draw and explain data path modified for pipelined execution.

10. Explain about various exceptions.


QUESTION BANK






QUESTION BANK





Unit 4

PART- A

1. What is Memory system?

2. Give classification of memory.

3. Define cache.

4. What is Read Access Time?

5. Define Random Access Memory.

6. What are PROMS?

7. Define Memory refreshing.

8. What is SRAM and DRAM?

9. What is volatile memory?

10. Define data transfer or band width.

11. What is flash memory?

12. What is multi level memories?

13. What is address translation page fault routine, page fault and demand paging?

14. What is associate memory?

15. Define Seek time and latency time.

16. What is TLB?

17. Define Magneto Optical disk.

18. Define Virtual memory.

19. What are the enhancements used in the memory management?

20. Define the term LRU and LFU.

21. Define memory cycle time.

22. What is static memories?

23. What is locality of reference?

24. Define set associative cache.

25. What is meant by block replacement?

26. List the advantages of write through cache.

27. Give formula to calculate average memory access time.

28. Define conflict.

29. What is memory interleaving?

30. What is DVD?

31. Give the features of ROM cell.

32. List the difference between static RAM and dynamic RAM.

33. What is disk controller?

34. How a data is organized in the disk?


QUESTION BANK





Unit 5

PART-B

1. Illustrate the characteristics of some common memory technologies.

2. Describe in detail about associative memory.

3. Discuss the concept of Memory interleaving and give its advantages.

4. Discuss the different mapping techniques used in cache memories and their relative merits and

demerits.

5. Comparing paging and segmentation mechanisms for implementing the virtual memory.

6. What do you mean by virtual memory? Discuss how paging helps in implementing virtual

memory.

7. Discuss any six ways of improving the cache performance.

8. Explain the virtual memory translation and TLB with necessary diagram.

9. Explain the organization of magnetic disk and magnetic tape in detail.

Unit I

Introduction to defining language, Kleene closures, Arithmetic expressions, defining grammar, Chomsky hierarchy,

Finite Automata (FA), Transition graph, generalized transition graph.

Unit II

Nondeterministic finite Automata (NFA), Deterministic finite Automata (DFA), Construction of DFA from NFA

and optimization, FA with output: Moore machine, Mealy machine and Equivalence, Applications and Limitation of

FA.

Unit III

Arden Theorem, Pumping Lemma for regular expressions, Myhill-Nerode theorem, Context free grammar:

Ambiguity, Simplification of CFGs, Normal forms for CFGs, Pumping lemma for CFLs, Decidability of CFGs,

Ambiguous to Unambiguous CFG.

Unit IV

Push Down Automata (PDA): Description and definition, Working of PDA, Acceptance of a string by PDA, PDA

and CFG, Introduction to auxiliary PDA and Two stack PDA.

Unit V

Turing machines (TM): Basic model, definition and representation, Language acceptance by TM, TM and Type – 0

grammar, Halting problem of TM, Modifications in TM, Universal TM, Properties of recursive and recursively

enumerable languages, unsolvable decision problem, undecidability of Post correspondence problem, Church’s

Thesis, Recursive function theory.

Text Books: 1. Hopcroft, Ullman, “Introduction to Automata Theory, Language and Computation”, Nerosa

Publishing House, 3rd Edition

2. K.L.P. Mishra and N.Chandrasekaran, “Theory of Computer Science(Automata, Languages and Computation)”,

PHI, 3rd Edition

Reference Books: 1. Martin J. C., “Introduction to Languages and Theory of Computations”, TMH 2.

Papadimitrou, C. and Lewis, C.L., “Elements of theory of Computations”, PHI 3.Cohen D. I. A., “Introduction to

Computer theory”, John Wiley & Sons 4. Kumar Rajendra, “Theory of Automata (Languages and Computation)”,

PPM


Syllabus

Course Name: Theory of Automata and

Formal Language

Course Code:TCS -403

Faculty :Mr. Dhajvir Singh Rai



LESSON PLAN

SEMESTER/YEAR: 4th

/2nd

DEPARTMENT: CSE

COURSE: THEORY OF AUTOMATA & FORMAL LANGUAGES CODE: TCS-403

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

UNIT-1

1. Introduction to defining language T1,R1 1 Chalk & Talk

2. Kleene closures, Arithmetic expressions, T1,R1 1 Chalk & Talk

3. defining grammar, T1,T2 1 Chalk & Talk

4. Chomsky hierarchy, T1,R1 1 Chalk & Talk

5. Finite Automata (FA) T1,R1 2 Chalk & Talk

6. Transition graph T1,T2 1 Chalk & Talk

7. generalized transition graph T1,R1 2 Chalk & Talk

8. Exercise T1,R1 1 Chalk & Talk

UNIT-2

9. Nondeterministic finite Automata (NFA) T1,R1 2 Chalk & Talk

10. Deterministic finite Automata (DFA) T1,R1 2 Chalk & Talk

11. Construction of DFA from NFA and optimization T1,R1 2 Chalk & Talk

12 FA with output: Moore machine and Equivalence T1,R1 1 Chalk & Talk

13. Mealy machine and Equivalence T1,R1 1 Chalk & Talk

14. and Limitation of FA T1,T2 2 Chalk & Talk

Unit-3 15. Arden Theorem T1,R1 2 Chalk & Talk

16. Pumping Lemma for regular expressions T1,R1 2 Chalk & Talk

17. Myhill-Nerode theorem T1,R1 1 Chalk & Talk

18. Context free grammar T1,R1 2 Chalk & Talk

19. Ambiguity T2,R1 1 Chalk & Talk

20. Simplification of CFGs T2 1 Chalk & Talk

21. Normal forms for CFGs T2,R1 1 Chalk & Talk

22. Pumping lemma for CFLs T2 2 Chalk & Talk

23. Decidability of CFGs T2,R1 1 Chalk & Talk

24. Ambiguous to Unambiguous CFG T2 1 Chalk & Talk

Unit-4 25. Push Down Automata (PDA): Description and definition T2,R1 1 Chalk & Talk

26. Working of PDA T2 2 Chalk & Talk

27. Acceptance of a string by PDA T1 2 Chalk & Talk

28. PDA and CFG 1 Chalk & Talk

29. Introduction to auxiliary PDA T1,T2 1 Chalk & Talk

30. Two stack PDA T2 2 Chalk & Talk

Unit-5 31. Turing machines (TM): Basic model, definition and

representation

T1 1 Chalk & Talk

32. Language acceptance by TM, TM and Type – 0 grammar T1,R1 2 Chalk & Talk

33. Halting problem of TM, Modifications in TM T1,R1 1 Chalk & Talk

34. Universal TM, Properties of recursive and recursively

enumerable languages

T1 2 Chalk & Talk

35. unsolvable decision problem, undecidability of Post

correspondence problem

T2 1 Chalk & Talk

36. Church’s Thesis T2 1 Chalk & Talk

37. Recursive function theory T1,R1 1 Chalk & Talk

Total Lectures: 52



TEXT BOOKS:

[T1] Aho, Sethi & Ullman, "Compiler Design", Addision Wesley/ Pearson

[T2] O. G. Kakde; Compiler Design,4/e; Universities Press (2008)

REFERENCE BOOKS:

[R1] Chattopadhyay Santanu; Compiler Design; Phi Learning (2009)


Date: __________

1. What is automaton? Explain DFA and NDFA with examples.

2. What are the limitations of FSM?

3. “Let L be a set accepted by accepted by a Non-deterministic finite Automaton – then there exists

a deterministic finite automaton that accepts L.” Prove it.

4. Find a regular expression corresponding to the language of all strings containing exactly two 0’s

for {0, 1}*.

5. Find a regular expression corresponding to the language of all strings in which number of 0’s is

even for {0, 1}*.

6. What is linear bounded automaton? Explain with the help on an example.

7. What is context sensitive language? Explain is detail.

8. Construct a finite automaton which will accept those strings of binary number which are

di4thsible by 3.

9. Write and explain the algorithm for minimizing the number of states of a DFA.

10. What do you mean by substitution and homomorphism? Prove that the class of regular sets is

closed under homomorphism and inverse homomorphism.


ASSIGNMENT SHEET

Course Name: THEORY OF AUTOMATA & FORMAL

LANGUAGES

Assignment No.1

Course Code:TCS-403


Branch:CSE Semester: 4th

Unit/Title: I/Introduction to defining language

Date of Issue: Date of Submission:

Q.1 What are Mealy and Moore machines? Let M1 = {θ, ∑, Δ, S, α, q0 } be a Mealy machine. Show

that there is a Moore machine M2 equivalent to M1.

Q.2 Convert Moore machine to equivalent Mealy M/c. Given:

Present state Next state Output

q1 q1, q2 0

q2 q1, q3 0

q3 q1, q3 1

Q.3 Show by an example that fir some regular language L, any FA recognizing L must have more

than one accepting states. Characterize those regular languages for which this is true.

Q.4 Write the Arden’s method to convert an NFA to DFA. Illustrate with some example.

Q.5 What are the properties of FSM?

Q.6 Explain the method how to find equivalence of Moore and Mealy machines.

Q.7 What is the difference in between Moore and Mealy machines?

Q.8 What are the advantages of representing states using FSM?

Q.9 Design any Mealy machine and convert it to Moore machine.

Q.10 Design any Moore machine and convert it to Mealy machine.


ASSIGNMENT SHEET


LANGUAGES

Assignment No.2

Course Code:TCS-403



Unit/Title: II/ Nondeterministic finite Automata (NFA)


Q1. Prove that (aa*bb*)* = ^+a(a+b)*b.

Q2. What do you mean by Pumping lemma? Using concept of Pumping Lemma prove that the

language L = {anb

n | n>1} is not regular.

Q3. Prove that (aaa*)* = (aa + aaa)*.

Q4. State and prove Myhill-Nerode Theorem for minimization of finite Automaton.

Q.5 Discuss halting problem of Turing machine.

Q.6 Using concept of Pumping Lemma prove that the set L = {ap | p is a prime number} is not

regular.

Q.7 Explain two types acceptance by push down automata.

Q.8 State and prove pumping lemma for regular sets.

Q.9 Show that if there are strings x and y in the language L so that x is a prefix of y and x not equal to

y, then no DPDA can accept L by empty stack.

Q10. Prove that every CFL, L without є-production can be generated by a grammar for which every

production can be generated by a grammar for which every production is of the form A → aα

where A is a variable, a is a terminal and α is a (possibly empty) string of variables. Convert the

following grammar to GNF:

G = ({A1, A2, A3}, {a, b}, P, A1)

where P consists of following productions:

A1 → A2A3

A2 → A3A1/b

A3 → A1A2/a


ASSIGNMENT SHEET


LANGUAGES

Assignment No. 3

Course Code:TCS-403



Unit/Title: III/ Pumping Lemma for regular expressions


Q1. Let G be the grammar S → aS | aSbS | є: epsilon

Prove that L(G) = {x | each prefix of x has at least as many a’s as b’s}.

Q.2 Let G be the grammar

S → aB | bA

A → a | aS | bAA

B → b | bS | aBB

For the string aaabbabbba find i) leftmost derivation ii) parse tree.

Q3. Find CSG generating the language:

{ SS/S є {a, b}+ }.

Q4. What are the differences in between context free and context sensitive grammar?

Q5. What is Griebach normal form?

Q6. Let G be S → AB, A → a, B → C|b, C → D, D → E and E → a. Eliminate unit productions and

get an equivalent grammar.

Q7. Convert the following grammar to GNF:

S → AB, A → BS|b, B→SA|a.

Q.8 Convert the following grammar to Chomsky’s normal form:

S → aAD, A → aB | bAB, B → b, D → d.

Q.9 What is Chomsky’s normal form? Explain with the help of example.Write the unrestricted

grammar for generating the language L = { aib

ic

i | i>= 1}


ASSIGNMENT SHEET


LANGUAGES

Assignment No. 4

Course Code:TCS-403



Unit/Title: IV/ Push Down Automata (PDA)



Q1. Design a PDA which accepts the language:

L = { wcwt /w є (a, b)* }

Q2. Design a Turing machine which accepts the language L = { ww/w є (a, b)* }.

Q3. What are universal Turing machines?

Q4. Explain Chomsky hierarchy of grammar. What is relation between languages of classes?

Q.5 Prove the equivalence of type O grammars and Turing machines.

Q.6 Show that Fibonacci numbers are generated by a primitive recursive function.

Q.8 Show that the function f(x,y) = x*y is primitive recursive.

Q.9 Write a short note on PCP problem.

Q.10 Design a TM for accepting the set of strings with an equal number of 0as and 1

as.

ASSIGNMENT SHEET


LANGUAGES

Assignment No. 5

Course Code:TCS-403



Unit/Title: V/Turing machines (TM)


1. If L is accepted by an NFA with ε-transition then show that L is accepted by an NFA without ε-transition.

2. Construct a DFA equivalent to the NFA. M=({p,q,r},{0,1}, δ,p,{q,s}) Where δis defined in the following table.

0 1P {q,s} {q}Q {r} {q,r}R {s} {p}S - {p}

3. Show that the set L={an bn/n>=1} is not a regular. (6) b)Construct a DFA equivalent to the NFA given below: (10)

0 1P {q,q} {p}Q {r} rR {s} -S {s} {s}

4. Check whether the language L=(0n1n / n>=1) is regular or not? Justify your answer.5. Let L be a set accepted by a NFA then show that there exists aDFA that accepts L.


TUTORIAL SHEET


LANGUAGES

Tutorial Sheet No. 1

Course Code:TCS-403Faculty :Mr. Dhajvir Singh Rai


Unit/Title: 1/ Introduction to defining language Date of Discussion:

1. Convert the following NFA to a DFA. Discuss on the relation between DFA and minimal DFA

2. Construct a NDFA accepting all string in {a, b} with either two consecutive a‟s or two Consecutive b‟s.

3. Give the DFA accepting the following language Set of all strings beginning with a 1 that when interpreted as a binary integer is a Multiple of 5.

4. Draw the NFA to accept the following languages.(i) Set of Strings over alphabet {0, 1,…….9} such that the final digit has appeared before.(ii)Set of strings of 0‟s and 1‟s such that there are two 0‟s separated by a number of

positions that is a multiple of 4.

5. Let L be a set accepted by an NFA. Then prove that there exists a deterministic finiteautomaton that accepts L.Is the converse true? Justify your answer. (10)


TUTORIAL SHEET


LANGUAGES




Unit/Title: II/ Nondeterministic finite Automata (NFA), Date of Discussion:

1. a. What are the closure properties of CFL? State the proof for any two properties.

b. Construct a CFG representing the set of palindromes over (0+1)*.

2. a. if G is the grammar S ‡SbS | a show that G is ambiguous.

b. Let G= (V,T, P,S) be a CFG. If the recursive inference procedure tells that terminalstring w is in the language of variable A, then there is a parse tree with root A and yield w.

3. Discuss in detail about ambiguous grammar and remoIVng ambiguity from grammar.

4. Prove that if G is a CFG whose language contains at least one string other than €, then there is a grammar G1 in Chomsky Normal Form such that L(G1) = L(G) –{€}.

5. Consider the grammar

E‡E + E | E*E | (E) | I

I ‡ a+b

Show that the grammar is ambiguous and remove the ambiguity.


TUTORIAL SHEET


LANGUAGES




sUnit/Title: III/ Context free grammar Date of Discussion:

1. If L is Context free language then prove that there exists PDA M such that L=N(M).

2. Explain different types of acceptance of a PDA.Are they equivalent in sense of language

acceptance? Justify your answer.

3. Construct a PDA accepting {an bm an/ m, n>=1} by empty stack. Also construct the

corresponding context-free grammar accepting the same set.

4. Prove that L is L(M2 ) for some PDA M2 if and only if L is N(M1) for some PDA M.

5. Define Deterministic Push Down Automata DPDA. Is it true that DPDA and PDA are

equivalent in the sense of language acceptance is concern? Justify Your answer.


TUTORIAL SHEET


LANGUAGES




Unit/Title: IV/ Context free grammar Date of Discussion:

1. Define a PDA. Give an Example for a language accepted byPDA by empty stack.


3. Explain different types of acceptance of a PDA. Are they equivalent in sense of language

acceptance? Justify your answer

4. Construct the grammar for the following PDA. M=({q0, q1},{0,1},{X,z0},δ,q0,Z0,Φ) and

where δis given by δ(q0,0,z0)={(q0,XZ0)}, δ(q0,0,X)={(q0,XX)},δ(q0,1,X)={(q1, ε)},

δ(q1,1,X)={(q1, ε)},δ(q1, ε,X)={(q1, ε)}, δ(q1, ε, Z0 )={(q1, ε)}. (12)b) Prove that if L is

N(M1) for some PDA M1 then L is L(M2 ) for some PDA M2.

5. Construct a PDA that recognizes the language {ai bj ck| i,j,k>0 and i=j or i=k}.

6. Discuss about PDA acceptance

1)From empty Stack to final state.

2)From Final state to Empty Stack.


TUTORIAL SHEET


LANGUAGES




Unit/Title: V/ Push Down Automata (PDA) Date of Discussion:


2. Explain different types of acceptance of a PDA. Are they equivalent in sense of language

acceptance? Justify your answer

3. a)Construct the grammar for the following PDA.

M=({q0, q1},{0,1},{X,z0},δ,q0,Z0,Φ) and where δis given by δ(q0,0,z0)={(q0,XZ0)},

δ(q0,0,X)={(q0,XX)},δ(q0,1,X)={(q1, ε)},δ(q1,1,X)={(q1, ε)},δ(q1, ε,X)={(q1, ε)}, δ(q1, ε,

Z0 )={(q1, ε)}. (12)

b) Prove that if L is N(M1) for some PDA M1 then L is L(M2 ) for some PDA M2.

4. Construct a PDA that recognizes the language {ai bj ck| i,j,k>0 and i=j or i=k}.

5. Construct a Context free grammar G which accepts N(M), where

M=({q0,q1},{a,b},{z0,z},δ,q0,z0,Φ) and where δis given by

δ(q0,b,z0)={(q0,zz0)}

δ(q0, ε,z0)={(q0, ε)}

δ(q0,b,z)={(q0,zz)}

δ(q0,a,z)={(q1,z)}

δ(q1,b,z)={(q1, ε)

δ(q1,a,z0)={(q0,z0)}


TUTORIAL SHEET


LANGUAGES




Unit/Title: V/ Push Down Automata (PDA) Date of Discussion:

1. Explain in detail notes on Turing Machine with example.

2. Consider the language L={a,b}*{aba}{a,b}*={x ε{a,b}*|x containing the substring aba}.

L is the regular language, and we can draw an FA recognizing L.

3. Design a Turing Machine M to implement the function “multiplication” using the subroutine

„copy‟.

4. Explain how a Turing Machine with the multiple tracks of the tape can be used to determine

the given number is prime or not.

5. Design a Turing Machine to compute f(m+n)=m+n, V m,n>=0 and simulate their action on the

input 0100.


TUTORIAL SHEET


LANGUAGES




Unit/Title: Turing machines (TM) Date of Discussion:

1. Define Turing machine for computing f(m, n)=m-n ( proper subtraction).

2. Explain how the multiple tracks in a Turing Machine can be used for testing given positive

integer is a prime or not.

3. Explain in detail” The Turing Machine as a Computer of integer functions”.

4. Design a Turing Machine to accept the language L={0n 1n/n>=1}

5. Construct a Turing Machine that recognizes the language {wcw / w € {a, b} + }


TUTORIAL SHEET


LANGUAGES




Unit/Title: Turing machines (TM) Date of Discussion:

1. Define finite automata.

2. Write the difference between the + closure and * closure.

3. Define alphabet, string, powers of an alphabet and concatenation of strings.

4. Define language and Grammar give an example.

5. What is a transition table and transition graph?


Question Bank

Course Name: THEORY OF AUTOMATA & FORMAL LANGUAGES

Course Code:TCS-403



Unit/Title: I/Introduction toFINITE AUTOMATA

1. Give the DFA accepting the language over the alphabet 0, 1 that has the set of allstrings

beginning with 101.

2. Give the DFA accepting the language over the alphabet 0,1 that have the set of allstrings that

either begins or end(or both) with 01.

3. Define NFA.

4. Difference between DFA and NFA.

5. Write the notations of DFA.

6. Define ε-NFA.

7. Define the language of NFA.

8. Is it true that the language accepted by any NFA is different from the regularlanguage? Justify

your Answer.

9. Define Regular Expression.

10. List the operators of Regular Expressions

11. State pumping lemma for regular languages

12. Construct a finite automaton for the regular expression 0*1*.

13. List out the applications of the pumping lemma.

14. Define Epsilon –Closures.

20. State minimization of DFA.


Question Bank


Course Code:TCS-403



Unit/Title: I/ Nondeterministic Finite Automata

1. Define CFG.

2. Define production rule.

3. Define terminal and non terminal symbols.

4. Write about the types of grammars.

5. What is ambiguity?

6. Define sentential form.

7. Define parse tree.

8. What is a derivation?

9. What is a useless symbol and mention its types.

10. What is null production and unit production?

11. What are the two normal forms of CFG?

12. State Greibach normal form of CFG.

13. Mention the application of CFG.

14. Construct a CFG for the language of palindrome string over {a, b}.Write the CFGfor the

language, L=(anbn | ≥n).

15. Construct a derivation tree for the string 0011000 using the grammar

S->A0S |0 | SS , A-> S1A | 10.

16. Show that id+id*id can be generated by two distinct leftmost derivation in thegrammar E-

>E+E | E*E | (E) | id .


Question Bank


Course Code:TCS-403



Unit/Title: Context Free Grammars

17. Let G be the grammar S->aB/bA,A->a/aS/bAA,B->b/bS/aBB.obtain parse tree for the string

aaabbabbba.

18. Find L(G)where G=({S},{0,1},{S->0S1,S->ε},S).

19. construct a context free Grammar for the given expression (a+b) (a+b+0+1)*

20. Let the production of the grammar be S-> 0B | 1A, A-> 0 | 0S | 1AA, B-> 1|1S |0BB.for the

string 0110 find the right most derivation

1. Give an example of PDA.

2. Define the acceptance of a PDA by empty stack. Is it true that the language accept by a PDA

by empty stack or by that of final state is different languages?

3. What is additional feature PDA has when compared with NFA? Is PDA superior over NFA in

the sense of language acceptance? Justify your answer.

4. Explain what actions take place in the PDA by the transitions (moves)

a. δ(q,a,Z)={(p1,γ1),(p2, γ2),…..(pm, γm)} and δ(q, ε,Z)={(p1,γ1),(p2, γ2),…..(pm,γm)}.

b. What are the different ways in which a PDA accepts the language? Define them. Is a true

that non deterministic PDA is more powerful than that of deterministic PDA? Justify your

answer.

5. Explain acceptance of PDA with empty stack.

6. Is it true that deterministic push down automata and non deterministic push a. Down automata

are equivalent in the sense of language of acceptances? Justify your answer.

7. Define instantaneous description of a PDA.

8. Give the formal definition of a PDA.

9. Define the languages generated by a PDA using final state of the PDA and empty stack of that

PDA.

10. Define the language generated by a PDA using the two methods of accepting a language.

11. Define the language recognized by the PDA using empty stack.

12. For the Grammar G defined by the productions


Question Bank


Course Code:TCS-403



Unit/Title: Pushdown Automata

S → A/ B

A → 0A/ ε

B → 0B/ 1B/ ε

Find the parse tree for the yields (i) 1001 (ii) 00101

13. Construct the Grammar with the productions

E → E+E

E→ id Check whether the yield id + id + id is having the parse tree with root E or not.

14. What is ambiguous and unambiguous Grammar?

15. Show that E→E+E/E*E/( E ) / id is ambiguous.

16. S→aS/ aSbS/ ε is ambiguous and find the un ambiguous grammar.

17. Define the Instantaneous Descriptions ( ID )

18. List out the applications of the pumping lemma for CFG.

19. State the pumping lemma for context-free languages.

20. Use the CFL pumping lemma to show each of these languages not to be context-free { aibjck|

i<j<k}

1. Define a Turing Machine.

2. Define multi tape Turing Machine.

3. Explain the Basic Turing Machine model and explain in one move. What are the actions take

place in TM?

4. Explain how a Turing Machine can be regarded as a computing device to compute integer

functions.

5. Describe the non deterministic Turing Machine model. Is it true the non deterministic.

6. Turing Machine models are more powerful than the basic Turing Machines? (In the sense of

language Acceptance).

7. Explain the multi tape Turing Machine mode. Is it more power than the basic turing machine?

Justify your answer.

8. Using Pumping lemma Show that the language L={anbncn |n>=1} is not a CFL.

9. What is meant by a Turing Machine with two way infinite tape.

10. Define instantaneous description of a Turing Machine.

11. What is the class of language for which the TM has both accepting and rejecting

configuration? Can this be called a Context free Language?

12. The binary equivalent of a positive integer is stored in a tape. Write the necessary transition

to multiply that integer by 2.

13. What i s the role of checking off symbols in a Turing Machine?

14. Mention any two problems which can only be solved by TM.

15. Draw a transition diagram for a Turing machine to compute n mod 2.


Question Bank


Course Code:TCS-403



Unit/Title: Turing Machines

16. Difference between multi head and multi tape Turing machine.

17. Define Halting Problem.

18. Define LBA.

19. List out the hierarchy summarized in the Chomsky hierarchy.

20. DD raw a transition diagram for a Turing machine accepting of the following languages

DATABASE MANAGEMENT SYSTEM

Introduction: An overview of database management system, database system Vs file system,Database

system concepts and architecture, data models schema and instances, dataindependence and data base

language and interfaces, Data definitions language, DML, OverallDatabase Structure.

Data modeling using the Entity Relationship Model:

ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of SuperKey,

Candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams totables, Extended

ER model, relationships of higher degree.

Relational data Model and Language: Relational data model concepts, integrity constraints:entity

integrity, referential integrity, Keys constraints, Domain constraints, relational algebra,relational calculus,

tuple and domain calculus.

Introduction to SQL: Characteristics of SQL. Advantage of SQL.SQL data types and literals.Types of

SQL commands.SQL operators and their procedure. Tables, views, Queries and subqueries. Aggregate

functions. Insert, update and delete operations. Joins, Unions, Intersection,Minus, Cursors in SQL.

Data Base Design & Normalization:

Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusiondependences,

loss less join decompositions, normalization using FD, MVD, and JDs, alternativeapproaches to database

design.

Transaction Processing Concepts: Transaction system, Testing of serializability,Serializability of

schedules, conflict & view serializable schedule, recoverability, Recoveryfrom transaction failures, log

based recovery, checkpoints, deadlock handling.

Concurrency Control Techniques: Concurrency control, locking Techniques for concurrencycontrol,

Time stamping protocols for concurrency control, validation based protocol, multiplegranularity, Multi

version schemes, Recovery with concurrent transaction.

Text Books:

1 Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill, 5th Edition

2 Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley,5thedition

References:

1 Date C J, “An Introduction To Database System”, Pearson, 8th Edition.

2 Bipin C. Desai, “An introduction to Database Systems”, Galgotia Publication

3 Leon & Leon, “Database Management System”, Vikas Publishing House.

4 Majumdar& Bhattacharya, “Database Management System”, TMH

5 Ramakrishnan, Gehrke, “Database Management System”, McGraw Hill

6 Kroenke, “Database Processing: Fundamentals, Design and Implementation”, Pear


SYLLABUS

Subject Name : Data Base Management System

Subject Code : TCS-404

Faculty :Mr. Saurabh Singh



LESSON PLAN

SEMESTER/YEAR : 4th

/2nd

DEPARTMENT : CSE

COURSE: Database Management System COURSE CODE : TCS-404

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectur

es

Delivery

Method

Remarks

1. An overview of database management system, database

system Vs file system

T1,T2 1 Chalk &Talk

2. Database system concepts and architecture T1,T2 2 Discussion &

PPT

3. Data models schema and instances, data independence

and data base language and interfaces,

T2 3 PPT

4. Data definitions language, DML, Overall Database

Structure.

T1,T2 2 PPT

7. ER model concepts, notation for ER diagram T1 2 Chalk &Talk

8. Mapping constraints, keys, Concepts of Super Key,

Candidate key, primary key

T1 2 Chalk &Talk

9. Generalization, aggregation, reduction of an ER

diagrams to tables

T1 2 Chalk &Talk

10. Extended ER model, relationships of higher degree. T1,R1 2 Chalk &Talk

11. Relational data model concepts T1 1 Chalk &Talk

12. Integrity constraints: entity integrity, referential integrity T1,R1 2 Chalk &Talk

13. Keys constraints, Domain constraints T1 1 Chalk &Talk

14. Relational algebra, relational calculus, tuple and domain

calculus.

T1 2 Chalk &Talk

15. Characteristics of SQL, Advantage of SQL, SQL data

types and literals.

T1,R1 2 Chalk &Talk

16. Types of SQL commands. SQL operators and their

procedure.

T1 1 PPT

17. Tables, views, Queries and sub queries. T1 2 PPT

18. Aggregate functions. Insert, update and delete

operations.

T1, R1 2 PPT

19. Joins, Unions, Intersection, Minus, Cursors in SQL. R1 2 Chalk &Talk

20. Data Base Design & Normalization: Functional

dependencies

R1 1 PPT

21. Normal forms, first, second, third normal forms T1,R1 3 PPT

23. BCNF, inclusion dependences, loss less join

decompositions

T1 3 PPT

24. Normalization using FD, MVD, and JDs T1 ,R1 1 Chalk &Talk

25. Alternative approaches to database design. T1 1 Chalk &Talk

26. Transaction Processing Concepts: Transaction system T1,T2 1 PPT

27. Testing of Serializability T1,R2 1 PPT

28. Serializability of schedules T1,R1 1 Chalk &Talk

29. Conflict & view serializable schedule T1,T2 2 Chalk &Talk

30. Recoverability, Recovery from transaction failures T1,R3 1 Chalk &Talk

31. Log based recovery, checkpoints T1 2 Chalk &Talk

32. Deadlock handling T1,T2 1 Chalk &Talk

33. Concurrency Control Techniques: Concurrency control T1 1 Chalk &Talk

34. Locking Techniques for concurrency control T2,R2 1 Chalk &Talk

35. Time stamping protocols for concurrency control T2 2 PPT

36. Validation based protocol, multiple granularity T2 2 Chalk &Talk

37. Multi version schemes T2,R4 2 Chalk &Talk

38. Recovery with concurrent transaction. T2 1 PPT

Total Lectures: 60



TEXT BOOKS:

[T1] Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill, 5th Edition

[T2] Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley,5th edition

REFERENCE BOOKS:

[R1] Date C J, “An Introduction To Database System”, Pearson, 8th Edition.

[R2] Bipin C. Desai, “An introduction to Database Systems”, Galgotia Publication

[R3] Majumdar & Bhattacharya, “Database Management System”, TMH

[R4] Ramakrishnan, Gehrke, “Database Management System”, McGraw Hill


Date: __________

Question 1 : Olympic Database.

We want to design a database for storing the information of U.S. athletes and their participations in

Olympic games.

1. An athlete has his/her SSN, the name, and the birth date.

2. Each Olympiad has the year, the country, and the city. For example, the 2008 Olympic game was

held in Beijing, China.

3. An athlete can participate in several sports in an Olympiad. For example, Michael Armstrong

participated in the swimming, diving, and water polo events.

4. Every athlete in our database participated in at least one Olympiad. Every Olympiad has at least

one athlete (and actually, several thousands).

Q1.1 Draw an ER diagram for this database. Make sure to indicate primary keys, cardinality constraints,

weak entities (if any), and participation constraints.

Q1.2 Turn the ER diagram into tables: give SQL statements to create the tables. Make sure to indicate

primary keys, foreign keys, if any. Specify the appropriate integrity constraints to enforce the total/partial

coverage, and overlap constraints, if any.

Question 2 : Cuisine Database

The student administrator of the Mini University wants to design a database for profiling students’

preferences for the nearby restaurants and the dishes. For example, the student Jack Smith likes the “rib

eye steak” at the “TGI Fridays”, not the “rib eye steak” at the “Olive Garden”, while the student Nancy

Graham likes the Italian spaghetti at the “Union Grill”. 1. Each student has his/her SSN, the name, and the department.

2. Each restaurant has its name, and the mailing address.

3. The name of a restaurant may not be unique, but the mailing address is unique.

4. Each dish has the name and the price.

5. The price of a dish might differ on different restaurants. For example, “rib eye steak” is $15 at

“TGI Fridays”, but $20 at the “Olive Garden”.

6. The name of a dish is unique within a restaurant. Two restaurants may have the same dish name.

7. A dish is offered by at least one restaurant, and a restaurant offers at least a dish.

Q2.1 Draw an ER diagram for this database. Make sure to indicate primary keys, cardinality constraints,

weak entities (if any), and participation constraints.


ASSIGNMENT SHEET

Course Name: DBMS Assignment No. 1

Course Code:TCS-404



Unit/Title: 1/E.R Diagram and Formal Query Language


Description of table is given below. Kindly study the data before providing solution to the queries.

movies (mid, title, year, num_ratings, rating)

play_in (mid, name, cast_position)

In the table movies, mid is the unique identifier for each movie, title is the movie’s title, and year is the

movie’s year-of-release. Each movie receives a total number of num_ratings ratings from users, and the

average rating is rating on a scale of 0.0-10.0. The table play_in contains the main cast of movies. name is

the actor’s name (assume each actor has an unique name). cast_position is the order of the actor where

he/she appears on the movie cast list (For example, in the movie Titanic, the cast_positions of Leonardo

DiCaprio and Kate Winslet are 1 and 2, respectively).

Queries

Write SQL queries for the following:

Q1 – Actor Pool] Find the total number of distinct actors in the database.

Q2 – Best Rated Motion Pictures] Among all the movies rated for at least 10,000 times, select the

top-10 movies (mid, title, and rating) which receive the highest average rating.

Q3 – Largest Crew] Return the movie (mid, title) that employed the largest number of actors. If there

is a tie, sort the mid’s in ascending order.

Q4 – Active Actor Pool] Return the total number of active actors in the database. An active actor is

one whose most recent movie is released after the year 2006 (i.e. year>2006).

Q5 – Working with Cruise] Return the actors (name) who has collaborated with Tom Cruise the most

of times. If there is a tie, sort the name in ascending order.

Q6 – Working with the New Couple] Return the actors (name) who have collaborated with both Tom

Cruise and Katie Holmes. Sort the output on ascending order of name.


ASSIGNMENT SHEET


Course Code:TCS-404



Unit/Title: II/SQL


Question 1: Functional dependency examples

Consider the relation shown in the following table:

X Y Z

x1 y1 z1

x2 y1 z2

x1 y2 z2

x2 y1 z2

List all the functional dependencies that this relation instances satisfy.

Question 2: Functional dependency deductions [24 points] Consider the following set S of

functional dependencies:

A -> C (F1)

BD -> A (F2)

C -> B (F3)

For each of the following dependencies, if it can be deduced from S, give the rigorous proof; if

not, give a counter-example with 3 tuples or less.

[Q2.1] CD -> A [8 points]

[Q2.2] BC -> A [8 points]

[Q2.3] AD -> B [8 points]


ASSIGNMENT SHEET


Course Code:TCS-404



Unit/Title: III/Functional Dependency


BCNF and 3NF

Consider the relation schema R(A, B, C, D) with functional dependencies A->B, BC->A and B-

>D, which is the minimum cover itself.

1. Find all the candidate key(s) of R.

2. Is relation R in BCNF? Is it in 3NF? Justify your answers.

3. Decompose the relation R(A, B, C, D) into a collection of BCNF relations, so that the

decomposition is lossless. Is the decomposition dependency-preserving?

4.Decompose the relation R(A, B, C, D) into a collection of 3NF relations, so that the

decomposition is both lossless and dependency-preserving.


ASSIGNMENT SHEET


Course Code:TCS-404



Unit/Title: III/Normalization


Question 1: Serializability

Consider the following schedules.

The actions are listed in the order they are scheduled, and prefixed with the transaction name.

S1: T2:R(B), T2:W(B), T1:W(A), T1:R(B), T3:R(A), T1:W(B), T2:W(A)

S2: T1:R(B), T3:R(A), T3:W(A), T2:R(B), T2:W(A), T3:W(C), T1:R(A), T2:R(C)

Q1.1Is the schedule S1 serial?

Q1.2 Draw the dependency graph for S1.

Q1.3 Is S1 conflict serializable? If so, what is the conflict equivalent serial schedule?

Q1.4 Is the schedule S2 serial?

Q1.5Draw the dependency graph for S2.

Q1.6 Is S2 conflict serializable? If so, what is the conflict equivalent serial schedule?


ASSIGNMENT SHEET


Course Code:TCS-404



Unit/Title: V/Concurrency Control


1. What is Database Management System? Why do we need a DBMS?

2. List any two advantages of database systems.

3. Define Data Model and its types.

4. Explain the role and functions of the database administrator (DB Manager).

5. Give the limitations of E-R model? How do you overcome this?


TUTORIAL SHEET

Subject Name: DBMS Tutorial Sheet No. 1

Course Code:TCS-404

Faculty-Mr. Saurabh Singh

Branch: CSE Semester:IV

Unit/Title: I/ Introduction Date of Discussion:

1. What are the limitations of file system?

2. What is logical data Independency?

3. Define DML? Define Data Dictionary?

4. Define Data independence. With a relevant example explain Ternary Relationship.

5. Describe the File system. What are the advantages of DBMS over file system?


TUTORIAL SHEET


Course Code:TCS-404



Unit/Title: I/ Introduction Date of Discussion:

1. Define query language. Give the classification of query language.

2. What are three characteristics of a Relational Database System?

3. State the differences between Security and Integrity?

4. What are the pitfalls in relational database design?

5. Distinguish between primary key and candidate key.


TUTORIAL SHEET


Course Code:TCS-404



Unit/Title: II / Relational Data Model Date of Discussion:

1. Give the reasons why Null values might be introduces into the database.

2. What is static SQL? How does it differ from dynamic SQL?

3. What are the different types of integrity constraints used in designing a relational

database? With an example explain a weak entity in an ER diagram.

4. What is referential integrity? What is domain integrity? Give example.

5. Consider the following relations.

Empno(Eno,Name,Date_of_Birth,Sex,Date_Of_Joining,Basic_Pay,Dept)

Develop an SQL query that will find and display the Dept and Average Basic_Pay in eac

Dept.


TUTORIAL SHEET


Course Code:TCS-404




1. Define a distributed database management system.

2. List the SQL statements used for Transaction control. What is a nested relation?

3. Name the different types of joins supported in SQL. Define the terms fragmentation and

replication, in terms of where data is stored.

4. Define the terms

i) Entity set ii) Relationship set Entity set iii) Single valued and multivalued

attributes iv)Single valued attributes

5. What are stored and derived attributes? What are composite attributes?


TUTORIAL SHEET


Course Code:TCS-404




1. With an example explain a Functional Dependency. Define Normalization?

2. Justify the need for normalization. Why it is necessary to decompose a relation?

3. What is decomposition and how does it address redundancy?

4. Give the comparison between BCNF and 3NF. Explain trivial dependency?

5. Explain the desirable properties of decomposition. What is 2NF?


TUTORIAL SHEET


Course Code:TCS-404




1. Define Boyce codd normal form. What is meant by computing the closure of a set of

functional dependency?

2. Why certain Functional dependencies are called trivial dependency? What is multi

valued dependency?

3. What are the goals of normalization? How would you find the extraneous attribute?

4. What do you mean by lossless join decomposition? Give the uses of Multivalued

dependency?


TUTORIAL SHEET


Course Code:TCS-404



Unit/Title: III / Normalization Date of Discussion:

1. What is ACID property in DBMS? Explain it with the real life example.

2. Describe the serializability. Explain Conflict serializability in details.

3. What do you mean by schedule? Explain the recoverability in DBMS.

4. Explain the Deadlock handling. Discuss the prevention from the deadlock.


TUTORIAL SHEET


Course Code:TCS-404



Unit/Title: IV / Transaction Processing Concepts Date of Discussion:

1. What do you mean by Concurrency Control technique?

2. Explain the locking technique for the concurrency control technique.

3. Describe the time stamp ordering protocol with details.

4. Describe the Validation based protocol with details.


TUTORIAL SHEET


Course Code:TCS-404



Unit/Title: V / Concurrency Control Techniques Date of Discussion:

Q1) Who is a DBA? What are the responsibilities of a DBA?

Q2) What is a data model? List the types of data model used.

Q3) Define database management system?

Q4) Explain and list any eight applications of DBMS.

Q5)What are the disadvantages of file processing system?

Q6) What are the advantages of using a DBMS?

Q7) Give the levels of data abstraction?

Q8) Define instance and schema?

Q9) Define the terms

1) Physical schema

2) logical schema.

Q10) Mention the actors on scene.

Q11) What is the purpose of storage manager?

Q12) Define single valued and multivalued attributes.

Q13) What is meant by the degree of relationship set?

Q14) What does the cardinality ratio specify?

Q15) What is meant by lossless-join decomposition?

Q16) Differentiate between database system and file system?

Q17) Expain the two types of participation constraints. Q18) Differentaite between generalization and aggregation?


QUESTION BANK

Course Name: DBMS Question Bank No. 1

Course Code:TCS-404



Unit/Title: 1/E.R Diagram and Formal Query Language

Q1)What is embedded SQL? What are its advantages?

Q2) Explain integrity constant.

Q3) What is the significance of relational algebra in SQL?

Q4) What are aggregate functions? Explain each with an SQL query?

Q5) Write short notes on relational model.

Q6) Explain and list Key Constrains.

Q7) Write short notes on tuple relational calculus.

Q8) What is foreign key? Explain

Q9) What are the categories of SQL command?

Q10)What is the use of group by clause and sub-quries?

Q11) List the SQL domain Types?

Q12)Expain types of join.

Q13) What are the characterstics of SQL ?

Q14)Expain the difference between a weak and a strong entity set.

Q15) Consider the relation.

1. Suppliers(SID, Sname, Rating)

2. Parts(PID, Pname, Color)

3. Catalog( SID, PID, Cost)

Qa) Retrieve SIDs of Suppliers whose rating > 10.

Qb) Retrieve SIDs of Suppliers who supplied red parts.

Qc) Retrieve Sname of Suppliers who supplied red parts.

Q16) What is meant by functional dependency?


QUESTION BANK


Course Code:TCS-404



Unit/Title: II/SQL

Q1) What is normalization?

Q2) What are Armstrong rules? How do we say that they are complete and/or sound

Q3) Explain the codd’s rules for relational database design.

Q4) Explain Functional dependency and Trivial functional dependency with examples.

Q5) (a) Differentiate BCNF with 3rd normal form.

(b) Explain about denormalization.

Q6) (a) Explain the following with suitable example:

i)non-loss decomposition

ii) prime attributes

(b) If R={ A,B,C,D,E } and FD’s 5M F={ A C, AC D, E AD, EH} List all the candidate

keys.

Q7) (a) What is redundancy? What are the problems caused by the redundancy?

(b) Compute canonical cover Fc for the R={A,B,C,D} and FD’s= { ABC, BC, AB , ABC,

ACD}.

Q8) (a) Prove that a relation which is in 4NF must be in BCNF.

b) Define and explain 4NF with suitable example.

Q9) (a) Define BCNF. How does BCNF differ from 3NF? Explain with example.

(b) Explain 3NF. Give one example.

Q10) (a) Explain about Full functional dependency and Partial dependency

(b) If R= {A, B, C, G, H, I} and FD’s are F= {AB, BHI, CGH} Why R is not in 4NF?

Q11) Define normalization.List and Explain different normal forms with examples.

Q12) Explain about schema refinement in database design.

Q13) (a) What is meant by multivalued dependency? Explain with example.

(b) Write about problems related to decomposition.

Q14) (a) What is meant by attribute closure? Explain.

(b) Explain the classification of functional dependency.

(c) List and Explain the properties of decomposition.

(d) Prove that any relation schema with two attributes is BCNF.

(e) Discuss about super key and candidate key in functional dependency with example.


QUESTION BANK


Course Code:TCS-404



Unit/Title: III/Functional Dependency

Q1) What are the ACID properties?

Q2) What are the two statements regarding transaction?

Q3) What is recovery management component?

Q4) When is a transaction rolled back?

Q5) What is a shadow copy scheme?

Q6) Give the reasons for allowing concurrency?

Q7)What is average response time?

Q8) Define lock. What are the different modes of lock?

Q9) Define deadlock. What are the two methods for dealing deadlock problem?

Q10) What are the two types of errors? Explain

Q11) Give the reasons for allowing concurrency?

Q12) Explain log based recovery.

Q13) Explain testing of serializability.

Q14) What are the two types of errors in TPC?

Q15) Explain how can we use checkpoints while working with Database?


QUESTION BANK

Course Name: DBMS Question Bank Unit No. 4

Course Code:TCS-404



Unit/Title: IV/Transaction Processing Concept

Q1) What is difference between conflict equivalence and view equivalence?

Q2) Explain transaction states using state transition diagram.

Q3) Explain locking techniques for concurrency control.

Q4) Write a note on Timestamp Ordering.

Q5) Discuss the actions taken by the read_item and write_item operations on a database.

Q6) Why are many nulls in a relation considered bad?

Q7) Explain Serial and Non-serial schedules with examples.

Q8) What do you mean by concurrent execution of database transactions in a multi-user system?

Discuss why concurrence control is needed, and give informal examples.

Q9) What is a transaction? Explain with an example.

Q10) Discuss the different types of transaction failures. What is meant by catastrophic failure?

Q11) List and explain the desirable properties of transactions.

Q12) What is meant by transaction rollback? Why is it necessary to check for cascading

rollback? Which recovery techniques do not require rollback?

Q13) Describe the shadow paging recovery technique. Under what circumstances it does not

require a log?

Q14) What is meant by catastrophic failure and how recovery is handled?

Q15) Explain recovery based on immediate update techniques.

Q16) What do understand by serializability of schedules? Explain.

Q17) Which are the various reasons for a transaction to fail?

Q18) Explain multi version and optimistic concurrency control techniques.

Q19) Discuss the problems of deadlock and starvation in transaction processing and the different

approaches to deal with these problems

Q20 Explain the database recovery techniques based on deferred update. 10 21. Explain how

strict 2-phase locking is implemented. Show them with an example.

Q22) What are three properties of a transaction specified in SQL for locking? Define each of

them.


QUESTION BANK


Course Code:TCS-404



Unit/Title: V/Concurrency Control

MICROPROCESSOR

Introduction – Microprocessors Evolution and types (Intel 4004 – Pentium IV and road maps),Overview

of 8085, 8086, 80286, 80386, 80486, Pentium processors and Micontrollers.

Architecture of 8086 – Register Organization, Execution unit, Bus Interface Unit, SignalDescription,

Physical Memory Organization, General Bus Operation, I/O addressingcapabilities, Minimum mode and

maximum mode timing diagrams, Comparison with 8088

8086 programming – Assembly language program development tools (editor, linker, loader,locator,

Assembler, emulator and Debugger), Addressing modes, Instruction set descriptions,

Assembler directives and operators,Procedures and Macros. (Writing programs for use with anassembler

MASM),8086 Interfacing – Interfacing 8086 with semiconductor memory, 8255,8254/ 8243, 8251, 8279.

A/D and D/A converters, Numeric processor 8087, I/O processor 8089, Bus Interface( USB,PCI).

Text Books:

1. D.V. Hall, “Microprocessors and Interfacing”, TMH, 2 Ed. 1991.

2. Barry B Brey, “INTEL Microprocessors”, Prentice-Hall.

References:

1. Y.-C. Liu and G. A. Gibson, “Microprocessor Systems: The 8086/8088 family

Architecture, Programming & Design”, PHI, 2000.


SYLLABUS

Subject Name : Microprocessor


Faculty :Ms. Jaya Jindal


DEVBHOOMI INSTITUTE OF TECHNOLOGY, DEHRADUN

LESSON PLAN

SEMESTER/YEAR: 4th/2nd

DEPARTMENT: CSE

COURSE: Microprocessor CODE: TCS-405

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

1. Microprocessor Evolution & types

T1,R1 2 Chalk & Talk

2. Overview of 8085


3. Overview of 8086 microprocessor

T1,T2 2 Chalk & Talk







7. Pentium and controllers T1,R1 2 Chalk & Talk

8. Register Organization T1,R1 1 Chalk & Talk

9. Execution Unit


10. Bus interface unit


11. Signal description


12 General Bus Operation


13. General Bus Operation


14. Physical Memory Organization


15. I/O Addressing Capability


16. Minimum mode and maximum mode timing

diagram


17. Comparison with 8088 T1,R1 1 Chalk & Talk

18. Assembly Language program development tools

introducation


19. Editor


20. Linker

T2 2 Chalk & Talk

21. Loader, Locator


22. Assembler

Emulator

Debugger

T2 2 Chalk & Talk

23. Addressing Modes


24. Instruction set Description

T2 2 Chalk & Talk

25. Assembler directives and Operators


26. Procedures and Macros

T2 2 Chalk & Talk

27. 8086 interfacing with semiconductor memory

T1 2 Chalk & Talk

28. 8255


29. 8254/8243


30. 8251

T2 2 Chalk & Talk

31. 8279 T1 2 Chalk & Talk

32. A/D and D/A converters


33. Numeric processor 8087


34. I/O Processor 8089


35. Bus interface T1,R1 1 Chalk & Talk

Minimum Lectures Required:60



Approved By


Date: __________

1) Write down the microprocessor applications in daily life? Explain the functioning of

microprocessor?

2) Why the speed of 8085 is less in comparison to today’s microprocessor?

3) Write down the two advance microprocessor name with their features?

4) Name of technology used in first microprocessor?

5) Why demultiplexing of address/data pin is necessary?

6) Access time is faster for

a) ROM b) SRAM c) DRAM

7) For the most Static RAM the write pulse width should be at least

a)10ns b)60ns c) 300ns d) 1µs

8)Explain the need of segmentation?

9)Explain watch dog timer? Write down the application of watch dog timer

10) Why addressing modes are used?


ASSIGNMENT SHEET

Course Name: Microprocessor Assignment No. 1

Course Code:TCS-405



Unit/Title: 1/8085 Microprocessor


1) What is memory mapping?

2) What is the function of address decoding?

3) 8086 is interfaced to two 8259s (Programmable interrupt controllers). If 8259s are in master

slave configuration the number of interrupts available to the 8086 microprocessor is

a) 8 b) 16 c) 15 d) 64

3) The 8279 normally provides a maximum of _____ seven segment display interface with CPU.

a) 8 b) 16 c) 32 d) 18

4) What is machine cycle and T-states cycle?

5) Explain the function of Execution unit in 8086?

6) What do you mean by pipelining in 8086?

7) What is the purpose of segment registers in 8086?

8) Discuss the function of instruction queue in 8086?

9) What is the maximum memory size that can be addressed by 8086?

10) List the various addressing modes present in 8086?

11) How single stepping can be done in 8086?


ASSIGNMENT SHEET

Course Name: Microprocessor Assignment No. 2

Course Code:TCS-405



Unit/Title: II/8086 Microprocessor


1) What are the basic modes of operation of 8255? 8. Write the features of mode 0 in 8255?

2) What are the features used mode 1 and mode 2 in 8255?

3) What are the signals used in input control signal & output control signal?

4) What are the different types of write operations used in 8253?

5) What are the modes of operations used in 8253?

6) Give the different types of command words used in 8259a?

7) Give the operating modes of 8259a? 16. Define scan counter?

8) What are the modes used in display modes?

9) What is the use of modem control unit in 8251?


ASSIGNMENT SHEET

Course Name: Microprocessor AssignmentNo. 3

Course Code:TCS-405

Faculty :Ms.Jaya Jindal


Unit/Title: III Date of Issue: Date of Submission:


ASSIGNMENT SHEET

Course Name:Microprocessor AssignmentNo. 3

Course Code:TCS-405



Unit/Title: III Date of Issue: Date of Submission:


1) Explain briefly about synchronous and asynchronous communication?

2) What is the use of stepper motor?

3) Why are drivers bused in between RS232 and microcontroller?

4) How will you double the baud rate in 8051?

5) Assess the use of SFR in 8051?

6) What is LED? Explain the interfacing of microcontroller with LCD?

7) Explain the different wave generation?

8) Explain the different latch connection?

9) Explain the 7 segment interfacing with 8051 microcontroller with diagram and programming?

10) Explain the timer in 8051 microcontroller?


ASSIGNMENT SHEET

Course Name: Microprocessor AssignmentNo. 4

Course Code:TCS-405



Unit/Title: IV/ Date of Issue: Date of Submission:

1. Write a Program to Perform the following functions and verify the output steps:

a. Load the number 5CH in register D

b. Load the number 9E H in register

c. C. Increment the Contents of register C by one.

d. Add the contents of register C and D and Display the sum at output port1

2. Write an assembly language program to find out the largest number from a given

unordered array of 8 bit numbers, stored in the locations starting from a known address?

3. Write an 8085 ALP to convert the hexadecimal value to decimal value?

4. What is demultiplexing of address/data pin?

5. Write the program for 8085 microprocessor 8 bit data addition and subtraction?


TUTORIAL SHEET

Course Name:Microprocessor Tutorial Sheet No. 1

Course Code:TCS-405



Unit/Title: 1/ Date of Discussion:

1. Write an ALP to find factorial of number for 8086?

2. The 8 data bytes are stored from memory location E000H to E007H?

3. Write 8086 ALP to transfer the block of data to new location B001H to B008H?

4. Write a program to multiply 2 numbers (16-bit data) for 8086?

5. Sum of series of 10 numbers and store result in memory location total?


TUTORIAL SHEET


Course Code:TCS-405



Unit/Title: II/ Basic Parsing Techniques Date of Discussion:

1. Write a delay routine for 1 millisecond using timer 0 of 8051 for 12 MHz crystal

frequency?

2. Draw and explain the timing diagram of memory read cycle. Draw and explain the

timing diagram of memory write cycle with example.

3. Draw and explain the timing diagram of memory write cycle with example.

4. Write program in 8051 to find the largest number from the array of ten numbers stored in

external RAM memory.

5. Assume XTAL = 122 Mhz. write a program to generate a square wave on P1.2 pin. Find

the lowest frequency that can be generated using mode 1.


TUTORIAL SHEET


Course Code:TCS-405



Unit/Title: III/ Syntax-directed Translation Date of Discussion:

1) What is the result of the following code & where it is kept?

MOV R4,#25H

MOV A,#1FH

ADD A,R4

2) Find the content of register A after the execution of the following code?

CLR A

ORA A,#99H

CPL A

3) Explain the instruction MUL available in 8051?

4) What is the error in the following code?

MOV P1, #0FH

CPL P1

5) Write a program to get an 8 bit binary number from PORT-B, convert it to ASCII, and save

the result if the input is packed BCD of 00-0x99.Assume that PORT-B has 10001001 binary as

input?


TUTORIAL SHEET


Course Code:TCS-405



Unit/Title: V/ Introduction to code optimization Date of Discussion:

1) Program to find 2’s complement of a number.?

2) Write an 8085 ALP to convert the hexadecimal value to decimal value?

3) Write a 8086 ALP to convert an 8 bit binary number into equivalent gray code?

4) Interface a 8K RAM consecutively with microprocessor 8085, starting with ROM

interfacing at address 8000 H?

5) Write a delay routine for 1 millisecond using timer 0 of 8051 for 12 MHz crystal

frequency?


TUTORIAL SHEET

Course Name:Microprocessor Tutorial Sheet No.5

Course Code:TCS-405



Unit/Title: 5 Date of Discussion:

1) Write a program to get an 8 bit binary number from PORT-B, convert it to ASCII, and

save the result if the input is packed BCD of 00-0x99.Assume that PORT-B has

10001001 binary as input?

2) Program Timer-1 to be an event counter .Use 16 bit mode, and display the binary count

on Port-B and Port-D continuously, set the initial count to 20000?

3) What value should be loaded into timer register so as to have a time delay of 5 ms? Write

a program to create a pulse width of 5 ms on pin P2.3.Assume crystal frequency to be

11.0592MHz?

4) Write 8051 ALP to generate a square wave of 400Hz in port pinP1.4 by using timer1

overflow interrupt?

5) Write a program to generate a square of 10KHz using Timer 1. Assume XTAL=20MHz.

6) Add 25H and 70H and find the contents of AC, CY flags?

7) Write an 8085 ALP to convert the hexadecimal value to decimal value


TUTORIAL SHEET


Course Code:TCS-405



Unit/Title: 4 & 5 Date of Discussion:

1. What you mean by pipelining in 8086 processor?

3. What are the advantages of using memory segmentation 8086?

4. What is the macro & when it is used?

5. What is the assembler directive?

6. Define OFFSET address.

7. What are the versions of 8086?

8. What are the functions of segment register?

9. What are the functions of general purpose register?

10. What is the need for segmentation?

11. a. Explain the addressing modes of 8086 with the help of examples?

b. Write short notes on macro?

12. Explain the instruction set 8086?


QUESTION BANK

Course Name: Microprocessor Question Bank No. 1

Course Code:TCS-405


Branch: ECE Semester: IV

Unit/Title: 1/ I

1. a. Explain the Maximum mode of operation of 8086.

b. Write short notes on addressing memory.

2. a. Explain the minimum mode of operation of 8086. b.Write notes on addressing input and output devices?

3. Explain the various multiprocessor configurations.

4. a. Discuss in detail the various signal of 8086.

b. Explain in detail about 8086 memory banks and associated signals for byte and Word operations.

5. Write a Program to Perform the following functions and verify the output steps: a. Load the

number 5CH in register D b. Load the number 9E H in register C . Increment the Contents of

register C by one. d. Add the contents of register C and D and Display the sum at output port1.

6. Write an assembly language program to find out the largest number from a given unordered

array of 8 bit numbers, stored in the locations starting from a known address.

7. Explain the function of Execution unit in 8086?

8. What do you mean by pipelining in 8086?


QUESTION BANK


Course Code:TCS-405



Unit/Title: 1/ II


Objective question

1. Explain the bi-functionality of AX register.

2. Explain the bi-functionality of BX register.

3. Explain the bi-functionality of CX register.

4. Explain the bi-functionality of DX register.

5. How does CPU identify between 8-bit and 16-bit operation?

6. What is difference between the respective shifts and rotate instructions?

7. How will you enter the single step mode of 8086?

8. What determines whether the microprocessor is an 8-bit, 16-bit or 32-bit microprocessor?

9. What is the size of 8086-address bus?

10. What do you mean by pipelining?

11. What are the uses of flags?

12. What are the main differences between the general-purpose registers, index and pointer

registers?

Subjective question

1. What do you mean by assembler directives? Explain few of them with suitable example.

2. Write a program to separate out even and odd numbers from a given series of 16-bit

hexadecimal numbers.

3. Write a program to separate out even and odd parity numbers from a given series of 16-

bit hexadecimal numbers.

4. What is the use of BIU and EU? Describe function of each unit?

5. What is the use of Instruction Queue? What are its uses and advantages?

6. Why are the microprocessor general-purpose registers preferred for use of temporary data

storage over the 8086 memory?

7. What are the different Data Transfer Instructions?

8. Explain the need of segmentation.

9. List the internal registers in 8086 Microprocessor

10. Explain the roles of BIU and EU.


QUESTION BANK


Course Code:TCS-405



Unit/Title: 1/ III


11. What are the advantages of pipelining?

12. Explain all the flags in 8086.

13. Explain AAA, AAD, AAM, AAS instructions with examples.

14. Explain DAA, DAS instructions with examples.

15. Explain the instructions related to the fixed and variable ports.

16. Explain the instructions related to arithmetic and logical shift.

17. How REP instruction is used along with string instructions.

18. Explain different types of CALL instructions

19. Write an algorithm to convert BCD to Binary numbers. Write 8086 assembly

i. program to convert two digits BCD number to hexadecimal number

20. Write an algorithm to convert Binary number to BCD number. Write 8086

i. Assembly program to convert one byte Binary number to BCD.

21. Write an algorithm to evaluate a factorial of an integer number N. Write an

i. Assembly program using recursive procedure.

1.What is the use of PCON register?

2.State the function of RS0 and RS1 bits of PSW?

3. Give the interrupt priorities of 8051.

4. List the addressing modes of 8051. 5. What is the use of TCON register?

6. What is the RAM size of 8051? 7. What is the ROM size of 8051?

8. What is the use of B-register in 8051? 9.Describe the architecture of 8051 with a neat diagram.

10.Explain the interrupt structure, SFR and timers of 8051.

11.List out the salient features of 8051 Microcontroller.

12.Explain the following instructions of 8051 with examples.


QUESTION BANK


Course Code:TCS-405



Unit/Title: IV



Q1. Differentiate between microprocessor and microcontroller?

Q2. What is an instruction queue? Explain?

Q3. What is REP prefix? How it functions for string instructions?

Q4. Explain the instructions (i) LDS (ii) PUSHF (iii) TEST (iv) CLD

Q5. What is stack? Explain the use and operation of stack and stack pointer?

Q6. What are the flags in 8086?

Q7. What are the various interrupts in 8086? Explain.

Q8. Which interrupts are generally used for critical events?

Q9. What is the effect of executing the instruction?

MOV CX, [SOURCE_MEM]

Where SOURCE_MEM equal to 2016 is a memory location offset relative to the current

data segment starting at address 1A00016

Q10. The original contents of AX, BL, word-sized memory location SUM, and carry flag

CF are 1234H, ABH, 00CDH, and 0H, respectively. Describe the results of

executing the following sequence of instructions:

ADD AX, [SUM]

ADC BL, 05H

INC WORD PTR [SUM]


QUESTION BANK


Course Code:TCS-405



Unit/Title: V

Q11. The 2’s complement signed data contents of AL equal -1 and the contents of CL are

-2. What result is produced in AX by executing the following instructions?

i) MUL CL ii) IMUL CL

Q12. Explain different types of registers in 8086 microprocessor arch.

SOFTWARE ENGINEERING

Unit-I: Introduction (5L)

Introduction to Software Engineering, Software Characteristics, Software Crisis, SoftwareEngineering Processes,

Software Development Life Cycle (SDLC) Models: Water Fall Model,Prototype Model, Spiral Model, Evolutionary

Development Models, Iterative EnhancementModels.

Unit-II: Software Requirement Specifications (SRS) (5L)

Requirement Engineering Process: Elicitation, Analysis, Documentation, Review andManagement of User Needs,

Feasibility Study, Information Modeling, Data Flow Diagrams,Entity Relationship Diagrams, Decision Tables, SRS

Document, IEEE Standards for SRS.Software Quality Assurance (SQA),SEI-CMM Model.

Unit-III: Software Design (7L)

Basic Concept of Software Design, Architectural Design, Low Level Design: Modularization,Design Structure

Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, DesignStrategies: Function Oriented Design,

Object Oriented Design, Top-Down and Bottom-UpDesign.Software Measurement and Metrics: Various Size

Oriented Measures: Halestead’sSoftware Science, Function Point (FP) Based Measures, Cyclomatic Complexity

Measures:Control Flow Graphs.

Unit-IV: Coding, Testing & Software Maintenance (7L)

Top-Down and Bottom –Up programming, structured programming, Compliance with Designand Coding

Standards.Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing, Regression Testing,Top-Down

and Bottom-Up Testing Strategies: Test Drivers and Test Stubs, Structural Testing(White Box Testing), Functional

Testing (Black Box Testing),Corrective and Perfective Maintenance, Cost of Maintenance, Software Re-

Engineering,Reverse Engineering. Constructive Cost Models (COCOMO),

Text Books:

1. Rajib Mall, Fundamentals of Software Engineering, PHI Publication, 3rd Edition.

2. Pankaj Jalote, Software Engineering, Narosa Publication, 3rd Edition

3. K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age International Publishers,

3rd Edition.

Reference Books:

1. R. S. Pressman, Software Engineering: A Practitioners Approach, McGraw Hill, 6th Edition.

2. Ian Sommerville, Software Engineering, Addison Wesley, 8th Edition.

3. Carlo Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHIPublication


SYLLABUS

Subject Name : Software Engineering


Faculty :Ms. Priyanka Rekhi


DEVBHOOMI INSTITUTE OF TECHNOLOGY, DEHRADUN

LESSON PLAN

SEMESTER/YEAR: 4th /2nd DEPARTMENT: CSE

COURSE: Software Engineering COURSE CODE: TCS-406

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

1. Introduction to Software Engineering, Software Characteristics,

Software Crisis T1, R1 2 Discussion

2. Software Engineering Processes, Software Development Life

Cycle (SDLC)

T2 ,R2 1 Presentation

3. Water Fall Model T2, R1 1 Presentation

4. Prototype Model T2, R1 1 Presentation

5. Spiral Model T1,R2 1 Presentation

6. Evolutionary Development Models T1,R2 1 Presentation

7. Iterative Enhancement Models. T1,R1 1 Presentation

8. Requirement Engineering Process: Elicitation, Analysis

Documentation

T1,R2 1 Chalk &Talk

9. Review and Management of User Needs T1,R2 1 Chalk &Talk

10. Feasibility Study, Information Modeling T2,R1 1 Chalk &Talk

11. Data Flow Diagrams,

Entity Relationship Diagrams

T2,R2 2 Presentation

12. Decision Tables T2,R2 1 Presentation

13. SRS Document, IEEE Standards for SRS T1,R1 1 Chalk &Talk

14. Software Quality Assurance (SQA) T2,R2 1 Discussion

15. SEI-CMM Model T2,R2 1 Discussion

16. Basic Concept of Software Design, Architectural Design T2,R2 1 Chalk &Talk

17. Low Level Design: Modularization T2,R2 1 Chalk &Talk

18. Design Structure Charts, Pseudo Codes, Flow Charts, T1,R2 2 Presentation

19. Coupling and Cohesion Measures T1,R2 2 Presentation

20. Design Strategies: Function Oriented Design, T2, R1 1 Chalk &Talk

21. Object Oriented Design, Top-Down and Bottom-Up

Design

T1,R2 1 Chalk &Talk

22. Software Measurement and Metrics: Various Size Oriented

Measures

T2,R3 1 Chalk &Talk

23. Halestead‟s Software Science T1,R1 1 Presentation

24. Function Point (FP) Based Measures T1,R1 1 Presentation

25. Cyclomatic Complexity Measures: Control Flow Graphs. T2,R2 2 Presentation

26. Top-Down and Bottom –Up programming, structured

programming, Compliance with Design and Coding Standards

T1,R3 2 Chalk &Talk

27. Testing Objectives, Unit Testing, Integration Testing T2,R2 1 Presentation

28. Acceptance Testing, Regression Testing, Top-Down and

Bottom-Up Testing Strategies


29. Test Drivers and Test Stubs T2,R3 1 Chalk &Talk

30. Structural Testing (White Box Testing), Functional Testing

(Black Box Testing),


31. Corrective and Perfective Maintenance, Cost of Maintenance T1,R2 1 Chalk &Talk

32. Software Re-Engineering, Reverse Engineering. T2,R3 1 Presentation

33. Constructive Cost Models (COCOMO), T2,R3 2 Chalk &Talk

Total Lectures: 41



TEXT BOOKS:

[T1] Rajib Mall, Fundamentals of Software Engineering, PHI Publication, 3rd Edition.

[T2] Pankaj Jalote, Software Engineering, Narosa Publication, 3rd Edition

REFERENCE BOOKS:

[R1] K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age International Publishers,3rd Edition.

[R2] R. S. Pressman, Software Engineering: A Practitioners Approach, McGraw Hill, 6th

Edition.

[R3] Ian Sommerville, Software Engineering, Addison Wesley, 8th Edition


Date: __________

1. Suggest some ways to detect software errors in the early phases of the project

when code is not yet available.

2. What is prototype? Explain the process prototype development with diagram.

3. Elaborate on spiral model in detail.

4. Should a development organization adapt a single process model for all its

software development? Discuss the pros and cons?

5. What special kinds of problems are presented when specifying the requirements

of real time systems?

6. Write down major characteristics of software. Illustrate with a diagram that the

Software does not wear-out.

7. What is software requirement Specification (SRS) ? List the characteristics of

SRS standards? Why is SRS known as black box specification of a system?

8. Describe the various steps in software development life cycle? Explain the Spiral

Model in details.

9. Give software requirement document (IEEE standard).

10. Discuss the prototyping model and compare it with waterfall model.

11. Describe at least five major characteristics of a software process.


ASSIGNMENT SHEET

CourseName:SoftwareEngineering Assignment No.1

CourseCode:TCS 406

Faculty :Ms.PriyankaRekhi


Unit/Title: Unit 1 Date of Issue: Date of Submission:

1. Discuss SEI-Capability Maturity Model in details with key process areas. Compare CMM

model with ISO 9000.

2. Explain IEEE standards for SRS in detail

3. Differentiate DFD & entity relationship diagram.

4. What is goal of coding? List some of the general rules to be used for writing simple and

readable codes.

5. Describe three principle activities involved in software quality management.

6. What are the important activities carried out during feasibility study phase?

7. Discuss the need for software Requirement specification(SRS)

8. Differentiate between verification and validation?

9. What is difference between a coding standard and a coding guide line? Write down five

important coding standards and coding guidelines that you would recommend.


ASSIGNMENT SHEET

Course Name: Software Engineering Assignment No. 2

CourseCode:TCS 406




1. How can you compute the cyclomatic complexity of a program? Explain with the help of

example. How is cyclomatic complexity useful in progress testing? Justify.

2. Define software architecture. Explain why it may be necessary to design the system

architecture before the specifications written with example.

3. What do you mean by terms cohesion and coupling in the context of system design? How

are the concepts of cohesion and coupling useful in arriving at good software design?

4. What do you mean by terms cohesion and coupling in context of software design? How

are concepts of cohesion design? How are concepts of cohesion and coupling useful in arriving

at good software design?

5. What do you understand by the term functional independence in the context of software

design? What is the advantage of functional independence and how can you achieve functional

independence in a software design?

6. Explain at least four requirement elicitation techniques.

7. What is good software design? Explain in detail.


ASSIGNMENT SHEET


CourseCode:TCS 406




1. What do you mean by information hiding? Why a design approach based on the

information hiding principle is likely to lead to a re usable and maintainable design?

2. What do you mean by Construction Cost estimation Model (COCOMO). Explain all

three level i.e basic, intermediate and complete.

3. What is testing and why it is used? Differentiate between verification and validation?

4. What is control flow graph? Explain with example?

5. Explain the role of software requirement phase.What is the output of software

requirement phase? Give the general format of requirement document.

6. How is testing different from debugging?

7. Using a schematic diagram and suitable example show the order in which the following

are estimated in the COCOMO estimation techniques: cost, duration, size.


ASSIGNMENT SHEET


CourseCode:TCS 406



Unit/Title: Unit 3&4 Date of Issue: Date of Submission:

1. Explain: Cost of Maintenance, Software Re-Engineering, Reverse Engineering.

2. What did you mean by maintenance? What is the need of maintenance? Explain the

Preventive, Corrective and Perfective Maintenance.

3. Show, using a small example, why it is practically impossible to exhaustively test a

program

4. Explain the terms CASE and CASE Environment .What are main advantages of using

CASE Tools? Describe some of important features that a future generation CASE Tool should

support.

5. Distinguish between error and failure.

6. Which of the two is detected by testing? Justify.

7. Differentiate between

I. white box & black box testing

II. alpha& beta testing

III.testing& debugging

IV.time dependent & time independent reliability models

8. Whatare CASE tools? What are building blocks for CASE?

9. What is the difference between white box and black box testing?

10. Explain all the levels of testing.


ASSIGNMENT SHEET

Course Name: Software Engineering Assignment No.5

Course Code:TCS 406




1. When you know programming, what is the need to learn software engineering concepts?

2. A company needs to develop a strategy for software product development for which it

has a choice of two programming languages L1 and L2. The number of lines of code

(LOC) developed using L2 is estimated to be twice the LOC developed with Ll. The

product will have to be maintained for five years. Various parameters for the company

are given in the table below.

Parameter Language L1 Language L2

Man years needed for development LOC/10000 LOC/10000

Development cost per man year Rs. 10,00,000 Rs. 7,50,000

Maintenance time 5 years 5 years

Cost of maintenance per year Rs. 1,00,000 Rs. 50,000

Total cost of the project includes cost of development and maintenance. What is the LOC for L1

for which the cost of the project using L1 is equal to the cost of the project using L2?


TUTORIAL SHEET

Course Name:Software engineering Tutorial Sheet No. 1


Faculty :Ms Priyanka Rekhi


Unit/Title: UNIT 1 Date of Discussion:

1. List some problems that will come up if the methods you currently use for developing

small software are used for developing large software systems.

2. Draw the complete DFD of a banking system.

3. A system to be designed for a departmental store dealing in consumer items. Members

enjoy credit facility and can purchase items as and when he or she needs them. Store has

several counters and one can almost get all kinds of consumer items after visiting these

counters. He becomes member by paying initial membership amount and get the credit

cards. He has to pay his outstanding on quarterly basis. System generate alert to these

members. Defaulters are not allowed to purchase items until the default amount is

cleared. Consider the different aspects of the above problem and model them

appropriately.

i. Draw 1st

level DFD.

ii. Draw Databases of the Departmental store.

iii. Draw bill and Membership From.


TUTORIAL SHEET





Unit/Title: unit 2 Date of Discussion:

1. An application has 10 low external inputs , 12 high external inputs ,20 low internal logical files,

15 high external interface files, 12 average external inquiries, and a value of complexity

adjustment factor of 1.10 . Evaluate unadjusted and adjusted function point counts?

2. Compute the function point value for a project with the following information domain characteristics.

Number of user input : 32

Number of user output : 60

Number of user inquiries : 24

Number of files : 8

Number of external interfaces : 2

Assume that all complexity adjustment values are average. Assume that 14 algorithm have been

counted. Compute the features point value under the same conditions

3. Consider the following C function named sort.

Void sort (int A [], int n) {

Inti, j;

For (i=0; i<n-1; i++)

For (j=i+1; j<1; j++

)

{

Temp=A[i];

A[i] =A[j];

A[j] =temp;

}}

Determine:-cyclomatic complexity, for this function?

4. Draw the control flow graph for the following code & also determine its cyclomatic complexity.

Intcompute_gcd(x, y)

Int x, y;

{

While(x! =y) {

If(x>y)

X=x-y;

Else

Y=y-x;

}

Return x;}


TUTORIAL SHEET






1. Assume that the size of an organic type software product has been estimated to be 32,000 lines of

source code. Assume that the average salary of software engineers be Rs. 15,000/- per month.

Determine the effort required to develop the software product and the nominal development time.

2.Suppose that a project was estimated to be 400 KLOC.. Calculate the effort and development time

for each of the three modes i.e organic, semidetached and embedded.

3.A project size of 200 KLOC is to be developed. Software development teams have average

experience on similar type of projects. The project schedule is not very tight. Calculate the effort,

development time, average staff size and productivity of the project.

4.Suppose it is required to build a Web Development system consisting of 25,000 lines of code. How

many person months of effort would this take using just this equation if:

1-The project size was relatively small

2-The project size was considered large


TUTORIAL SHEET






1. What are problems occur during the software development?

2. Define the term software. Describe its various characteristics.

3. Should a development organization adapt a single process model for all its software

development? Discuss the pros and cons?

4. Write down major characteristics of software. Illustrate with a diagram that the Software

does not wear-out. (UTU- 2011)

5. What is conventional process for software development? Enumerate the differences

between exploratory style &modern software development practices.

6. What is difference between software engineering and conventional engineering?

7. Explain the Spiral Model in details.

8. What is a prototype? Draw the diagram of prototype model and discuss its phases in

brief?

9. Define software crisis. What are possible solutions to the present software crisis?

10. Explain software development life cycle. Discuss various activities during SDLC.

11. “Software does not ware out” explain this statement.

12. Explain evolutionary model with its advantages?

13. What do you understand by software characteristics? Define different types of software.

14. Give the various application areas of the software?


Question Bank

Course Name::SOFTWARE ENGINEERING


Faculty : MS. PRIYANKA REKHI

Branch:CSE Semester: IV

Unit/Title: 1

1. What do you mean by software quality assurance (SQA)? Explain in detail.

2. What do you mean by software quality? Explain Software Quality Frameworks

3. List five desirable characteristics of good SRS document. Discuss the relative advantage

of formal and informal requirement specification.

4. Describe the major software quality assurance activity and indicate their importance.

5. Explain IEEE standards for SRS in detail

6. Differentiate DFD & entity relationship diagram.

7. Write short notes on: ROCOF, MTTF, MTTR, MTBF, and PODOF.

8. Write down the shortcomings of ISO 9ooo certification over the SEI CMM model.

9. Compare ISO and SEI-CMM models.

10. Describe three principle activities involved in software quality management.

11. What are the important activities carried out during feasibility study phase?

12. What is requirement gathering, requirement specification?

13. Who should be involved in a requirement review? Draw a process model showing how a

requirements review might be organized?

14. Differentiate between verification and validation?

15. What is decision tree, decision table? Why they are used?

16. Discuss SEI-Capability Maturity Model in details with key process areas. Compare CMM

model with ISO 9000.


Question Bank





Unit/Title: 2

1. How can you compute the cyclomatic complexity of a program? Explain with the help of

example. How is cyclomatic complexity useful in progress testing? Justify. (UTU- 2011)

2. What do you understand by the term top down decomposing in the function oriented design?

3. Differentiate between structure analysis designs in the context of function oriented design?

4. What do you mean by cohesion and coupling in the context of software design?

5. What do you mean by information hiding? Why a design approach based on the information

hiding principle is likely to lead to a re usable and maintainable design?

6. Compare the advantages of object oriented and function oriented design approaches?

7.What is control flow graph? Explain with example?


Question Bank





Unit/Title: 3

1. What do you mean by Construction Cost estimation Model (COCOMO). Explain all

three level i.e basic, intermediate and complete.

2. What is testing and why it is used? Differentiate between verification and validation?

3. What is white box testing (structural testing)? Explain with example?

4. .What is black box testing (functional testing)? Explain with example?

5. Using a schematic diagram and suitable example show the order in which the following

are estimated in the COCOMO estimation techniques: cost, duration, size.

6. Discuss the difference between black box and structural testing and suggest how they can

be used together in the defect testing and suggest how they can be used together in the defect

testing process.

7. Explain: regression testing clean room testing, code inspection, code walkthrough.

8. What do you understand by the Software Maintenance? Explain your answer in detail.

9. Explain: Cost of Maintenance, Software Re-Engineering, Reverse Engineering

10. Show, using a small example, why it is practically impossible to exhaustively test a

program

11. Distinguish between error and failure.Which of the two is detected by testing? Justify.


Question Bank





Unit/Title: 4

Documents

DEV BHOOMI INSTITUTE OF TECHNOLOGY … · ... Data transfer & manipulations ... What is memory transfer? Explain the terms with ... A data communication links employs the character-controlled