SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY

Size: px

Start display at page:

Download "SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY"

Mercy Beryl Burke
5 years ago
Views:

1 Enroll. No. SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY SUBJECT: SYSTEM PROGRAMMING ( ) (CE/IT) DATE: TIME:2:00 pm to 3:30 pm TOTAL MARKS:40 Instructions: 1. All the questions are compulsory. Q.1 (a) 1. Define: Semantic gap 2. Problem oriented languages have small specification gap (yes or no)? Justify. 3. In context of symbol table data structures, what is the probability for a successful search in sequential search organization for N occupied entries? 4. What do you mean by LC processing? 5. What are the three errors that can be generated in Pass-1? Explain in brief design of a Single Pass Assembler. Q.2 (a) Explain the various stages of the life cycle of a source program with a neat diagram. Explain language processing activities. List various phase of a language processor. Explain roles of phases of language processor. Also explain symbol table. Q.2 (a) What is Symbol table? Explain how one can organize Symbol table using Linear Data Structure? Explain lexical analysis of a language processor. State the differences between system software and application software. Q.3 (a) For the below code: (i) Show the contents of the symbol table and opcode table at the end of Pass I. (ii) Explain the significance of EQU and IGIN statement in the program and explain how they are processed by the assembler. (iii) Show the intermediate code generated for the program using Variant-1.

2 START 200 X DS 4 L1 MOVER AREG,Y SUB AREG,Z MOVEM AREG,W W EQU X+2 L2 PRINT W IGIN X-5' Z DC '9' IGIN L2+1 STOP Y DC '7' END Explain use of various data structures (tables) needed in PASS I of the assembler. Also give details of their fields. Explain various suitable data structures for the symbol table. Write a brief note on different assembly language statements. Q.3 (a) Consider following assembly language program: Show (i) Contents of Symbol Table (ii) Intermediate codes using Variant-2 representation. START 101 READ N MOVER BREG,ONE MOVEM BREG,TERM AGAIN MULT BREG,TERM MOVER CREG,TERM ADD CREG,ONE MOVEM CREG,TERM COMP CREG,N BC LE,AGAIN MOVEM BREG,AGAIN PRINT RESULT STOP N DS 1 RESULT DS 1 ONE DC '1' TERM DS 1 END Instruction opcode: STOP 00, ADD 01, MULT 03, MOVER 04, MOVEM 05, COMP 06, BC 07,READ 09, PRINT 10, LE 02 Assembler directives: START 01, END 02 Write a note on advanced assembler directives. Define forward references. How it can be solved using back- patching? Explain with example....

3 SUBJECT: ANALYSIS AND DESIGN OF ALGITHMS ( ) (CE\IT) DATE: 09/08/2017 TIME: 02:00PM TO 03:30PM Instructions: 1. All the questions are compulsory. Q.1 (a) Define following terms (i) Quantifier (ii) Algorithm (iii) Set (iv) Relation (v) Function Explain different asymptotic notations in brief. Q.2 (a) Sort the following data using Heap Sort Algorithm: 30, 75, 90, 20, 50, 60, 25, 10, and 40. Derive the time complexity of Insertion Sort in best case, worst case and average case analysis. Write down an algorithm of Heap Sort. Q.2 (a) Sort the following data using Bubble Sort Algorithm: 25, 50, 40, 75, 90, 20, 60, 10, and 30. Derive the time complexity of Selection Sort in best case, worst case and average case analysis. Write down an algorithm for Bubble Sort. Q.3 (a) Write an algorithm for Radix sort. Sort the following data 100, 45, 70, 50, 140, 20, 60, 80, 105, 30, 90, 175. Among giving sorting algorithms (Heap Sort, Bucket Sort, Shell Sort), Which algorithms has better time complexity? Justify your answer. List out all the recurrence method. Explain anyone method with an appropriate example. Q.3 (a) What is recurrence? Solve recurrence equation T (n) =T (n-1) + n for all n>1 What is an amortized analysis? Explain aggregate method of amortized analysis using simple example. What do you mean by instance of a problem? List out the criteria that all algorithms must satisfy.

4 ADITYA SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY BE - SEMESTER VII MID SEMESTER-I EXAMINATION WINTER 2017 SUBJECT: COMPUTER GRAPHICS ( ) (IT) DATE: TIME: 2.00 PM TO 3.30 PM Instructions: 1. All the questions are compulsory. Q.1 (a) Define the following terms: 1. Persistence 2. Frame Buffer 3.Rotation 4.Clip Window 5. Scan Conversion Write the difference between random scan display and raster scan display Q.2 (a) Explain Bresenham s algorithm to draw line for any kind of slope. Input coordinates A (2, 3) and B (12, 8) are given solve using DDA algorithm with graph. Explain working of Cathode Ray Tube with diagram. Q.2 (a) Explain boundary fill algorithm for 4 connected and 8 connected pixels. Explain non-zero winding number with diagrams. Explain applications of computer graphics. Q.3 (a) Explain Cohen Sutherland Subdivision line clipping algorithm. Apply the shearing transformation to square with A(0,0) B(1,0) C(1,1) And D(0,1) as given below A) Shear parameter value of 0.5 relative to the line Yref= -1. B) Shear parameter value of 0.5 relative to the line Xref= -1. Explain rotation in 2D transformation. Q.3 (a) How Nicholl-Lee-Nicholl line clipping algorithm reduce the computation of unnecessary intersection point. What is homogeneous coordinate? Why is it required? Write short note on: Rotation about on arbitrary point.

5 SUBJECT: OBJECT IENTED PROGRAMMING USING JAVA ( ) DATE: (CE/IT) TIME:02:00 PM to 03:30 PM Instructions: 1. All the questions are compulsory. Q.1 (a) Define Following terms (i) Bytecode (ii) JVM (iii) Link (iv) Association (v) Synergy Explain features of Java Q.2 (a) What is constructor? What are the rules for creating constructor in java? Explain constructor overloading using example. What is visibility modifier? Explain all with example. Compare String and StringBuffer. Q.2 (a) Write a program to find that given number or string is palindrome or not.(take String from command line) Write a program that creates and initializes a four integer element array. Calculate and display the average of its values. What is Wrapper class in Java? Explain with examples. Q.3 (a) Define the term object-orientation? Briefly discuss the characteristics of object oriented approach. Draw use case diagram for Library Management System. Compare Object oriented programming with sequential programming. Q.3 (a) Draw class diagram for ATM.(Make necessary assumption) List out the steps of preparing domain class model. What are the criteria for identifying right classes? List symbols and relationship used in Use Case diagram.explain with example.

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 Enroll. No. SUBJECT: ANALYSIS AND DESIGN OF ALGITHMS (2150703) (CE\IT) DATE: 08/08/2018 TIME: 2:00