3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56




Название3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56
страница9/10
Дата05.10.2012
Размер0.65 Mb.
ТипДокументы
1   2   3   4   5   6   7   8   9   10
Part - A

1. Implement the data link layer framing methods such as character, character stuffing and bit stuffing.

2. Implement on a data set of characters the three CRC polynomials – CRC 12, CRC 16 and CRC CCIP .

3. Implement Dijkstra ‘s algorithm to compute the Shortest path thru a graph.

4. Take an example subnet graph with weights indicating delay between nodes. Now obtain Routing table art each node using distance vector routing algorithm

5. Take an example subnet of hosts . Obtain broadcast tree for it.

6. Take a 64 bit playing text and encrypt the same using DES algorithm .

7. Write a program to break the above DES coding

8. Using RSA algorithm Encrypt a text data and Decrypt the same .


Part - B

1. The student should take up the case study of Unified Library application which is mentioned in the theory, and Model it in different views i.e Use case view, logical view, component view, Deployment view, Database design, forward and Reverse Engineering, and Generation of documentation of

the project.

2. Student has to take up another case study of his/her own interest and do the same what ever mentioned in first problem. Some of the ideas regarding case studies are given in reference books which were mentioned in theory syllabus can be referred for some idea.

Note : The analysis, design, coding, documentation, database design of mini project which will be carried out in 4th year should be done in object-oriented approach using UML and by using appropriate software which supports UML, otherwise the mini project will not be evaluated.


JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY

HYDERABAD

III Year B.Tech. CSE -II Sem T P C

0 3 2

OPERATING SYSTEMS AND COMPILER DESIGN LAB


Objective :

  • To provide an understanding of the language translation peculiarities by designing a complete translator for a mini language.

  • To provide an understanding of the design aspects of operating system


Recommended Systems/Software Requirements:

  • Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space

  • C++ complier and JDK kit


Part - A

1. Simulate the following CPU scheduling algorithms

a) Round Robin b) SJF c) FCFS d) Priority

2. Simulate all file allocation strategies

a) Sequentialb) Indexed c) Linked

3. Simulate MVT and MFT

4. Simulate all File Organization Techniques

a) Single level directory b) Two level c) Hierarchical d) DAG

5. Simulate Bankers Algorithm for Dead Lock Avoidance

6. Simulate Bankers Algorithm for Dead Lock Prevention

7. Simulate all page replacement algorithms

a) FIFO b) LRU c) LFU Etc. …

8. Simulate Paging Technique of memory management.


PART - B

Consider the following mini Language, a simple procedural high-level language, only operating on integer

data, with a syntax looking vaguely like a simple C crossed with Pascal. The syntax of the language is

defined by the following BNF grammar:


::=

::= { }

| { }

::= int ;

::= | ,

::= | [ ]

::= | ;

::= | |

| |
|

::= =

| [ ] =

::= if then else endif

| if then endif

::= while do enddo


::= print ( )

::= | |

::=

::= < | <= | == | >= | > | !=

::= + | -

::= |

::= * | /

::= | | [ ]

| ( )

::= |

::= |

::= |

::= a|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z

::= 0|1|2|3|4|5|6|7|8|9

has the obvious meaning

Comments (zero or more characters enclosed between the standard C/Java-style comment brackets /

*...*/) can be inserted. The language has rudimentary support for 1-dimensional arrays. The declaration

int a[3] declares an array of three elements, referenced as a[0], a[1] and a[2]. Note also that you should

worry about the scoping of names.

A simple program written in this language is:

{ int a[3],t1,t2;

t1=2;

a[0]=1; a[1]=2; a[t1]=3;

t2=-(a[2]+t1*6)/(a[2]-t1);


if t2>5 then

print(t2);

else {

int t3;

t3=99;

t2=-25;

print(-t1+t2*t3); /* this is a comment

on 2 lines */

} endif }


1. Design a Lexical analyzer for the above language. The lexical analyzer should ignore redundant

spaces, tabs and newlines. It should also ignore comments. Although the syntax specification

states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value.

2. Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.

3. Design Predictive parser for the given language

4. Design LALR bottom up parser for the above language.

5. Convert the BNF rules into Yacc form and write code to generate abstract syntax tree.

6. Write program to generate machine code from the abstract syntax tree generated by the parser. The following instruction set may be considered as target code.

The following is a simple register-based machine, supporting a total of 17 instructions. It has three distinct internal storage areas. The first is the set of 8 registers, used by the individual instructions as detailed below, the second is an area used for the storage of variables and the third is an area used

for the storage of program. The instructions can be preceded by a label. This consists of an integer in the range 1 to 9999 and the label is followed by a colon to separate it from the rest of the instruction. The numerical label can be used as the argument to a jump instruction, as detailed below.

In the description of the individual instructions below, instruction argument types are specified as follows :

R

specifies a register in the form R0, R1, R2, R3, R4, R5, R6 or R7 (or r0, r1, etc.).

L

specifies a numerical label (in the range 1 to 9999).

V

specifies a “variable location” (a variable number, or a variable location pointed to by a register - see

below).

A

specifies a constant value, a variable location, a register or a variable location pointed to by a register (an indirect address). Constant values are specified as an integer value, optionally preceded by a minus sign, preceded by a # symbol. An indirect address is specified by an @ followed by a register.

So, for example, an A-type argument could have the form 4 (variable number 4), #4 (the constant value 4), r4 (register 4) or @r4 (the contents of register 4 identifies the variable location to be accessed).

The instruction set is defined as follows:

LOAD A,R

loads the integer value specified by A into register R.

STORE R,V

stores the value in register R to variable V.

OUT R

outputs the value in register R.

NEG R

negates the value in register R.

ADD A,R

adds the value specified by A to register R, leaving the result in register R.

SUB A,R

subtracts the value specified by A from register R, leaving the result in register R.

MUL A,R

multiplies the value specified by A by register R, leaving the result in register R.

DIV A,R

divides register R by the value specified by A, leaving the result in register R.

JMP L

causes an unconditional jump to the instruction with the label L.

JEQ R,L

jumps to the instruction with the label L if the value in register R is zero.

JNE R,L

jumps to the instruction with the label L if the value in register R is not zero.

JGE R,L

jumps to the instruction with the label L if the value in register R is greater than or equal to zero.

JGT R,L

jumps to the instruction with the label L if the value in register R is greater than zero.

JLE R,L

jumps to the instruction with the label L if the value in register R is less than or equal to zero.

JLT R,L

jumps to the instruction with the label L if the value in register R is less than zero.

NOP

is an instruction with no effect. It can be tagged by a label.

STOP

stops execution of the machine. All programs should terminate by executing a STOP instruction.


JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY

HYDERABAD

IV Year B.Tech. CSE -I Sem T P C

4+1* 0 4

NETWORK PROGRAMMING


UNIT-I

Introduction to Network Programming: OSI model, Unix standards, TCP and UDP & TCP connection establishment and Format, Buffer sizes and limitation, standard internet services, Protocol usage by common internet application.
1   2   3   4   5   6   7   8   9   10

Похожие:

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 iconThis lab is designed for the A&S 500 Neurophysiology lab. Starting Spring 2013, Dept of Biology, Univ of Ky., Usa

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 iconLab Topic Martini pcc lab

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 icon5. Scanning Tunneling Microscopy Lab Suzanne Amador Kane 3/13/06 (parts of this manual were adapted from the Burleigh Instruments istm manual, and the Physics 407 Lab manual from University of Wisconsin) Introduction

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 iconLab #10 Sheet Rolling

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 icon1 Long course title Microbiology Lab

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 iconBaird spring 03 Lecture M& w 9: 00- 9: 50 a m. Lab R 12-2

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 iconStephen (Steve) Brandt, M. D. Lab

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 iconMeets w 11 am-1: 55 pm in lab room C208

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 iconLab: Science Building #033 telephone

3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communications Skills Lab 3 4 it work-Shop 3 4 Total 25 15 56 iconThe Managerial mba: Classroom Lab Experience

Разместите кнопку на своём сайте:
Библиотека


База данных защищена авторским правом ©lib.znate.ru 2014
обратиться к администрации
Библиотека
Главная страница