BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: MICROPROCESS & INTERFACING (2150707) (CE) DATE: 10-08-2018 TIME: 02:00pm to 03:30 pm TOTAL MARKS: 40 Q.1 (a) Write an ALP to add two 16 bit numbers Assume that the answer does not generate [03] carry. (b) What do you understand by the term Addressing Modes? Explain, giving suitable [03] example, all the addressing modes supported by 8085. (c) Explain de multiplexing of buses. Q.2 (a) Design an 8085 microprocessor system such that it should contain 16KByte of EPROM and 4KByte of RAM with starting addresses 0000H and 4000H respectively. Use two 8KByte of EPROMs (2764) and two 2KByte of RAMs (6116) for this system. [06] (b) Draw pin diagram of 8085 & explain functions of any 3 pins. (c) Draw timing diagram of INR M with each machine cycle. Q.2 (a) Write a detailed note on Memory Classification. [06] (b) Draw architectural block diagram of 8085. (c) Draw timing diagram of SUI, 32 H with each machine cycle. Q.3 (a) An array of twenty data bytes is stored on memory locations 2000H onwards. Write [06] an 8085 assembly language program to count the number of zeros, positive numbers and negative numbers and store them on memory locations 3000H, 3001H and 3002H, respectively. (b) Draw and explain programming model of 8085 microprocessor. (c) Write an 8085 program to copy block of five numbers starting from location 2001 H to locations starting from 3001 H. Q.3 (a) Write an 8085 assembly language program to count the number of bytes that are [06] greater than 25 10 and lesser than 65 10 from an array of twenty bytes stored on memory locations 2000H onwards. Store such numbers on memory locations 2100H onwards. (b) Explain I/O writes machine cycle. (c) An array of Ten numbers is stored from memory location 2000 H onwards. Write an 8085 assembly language program to separate out and store the EVEN and ODD numbers on new arrays from 2100 H and 2200 H, respectively.
BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: OBJECT IENTED PROGRAMMING USING JAVA (2150704) (CE/IT) DATE: 11-08-2018 TIME:02:00 pm to 03:30 pm TOTAL MARKS:40 Q.1 (a) Why is Java platform independent? [03] (b) Explain Wrapper classes in java. [03] (c) Explain various steps required for class design. Q.2 (a) Explain features of Java in detail. [06] (b) Explain garbage collection and finalize method in JAVA. (c) Explain following with example: (i)super (ii)final (iii)static (iv)this Q.2 (a) What is visibility modifier? Explain all with example [public, private, [06] protected, default] (b) Differentiate between Compile time polymorphism and Run time polymorphism (c) Write a program to take two float value as command line arguments and display its addition and multiplication. Q.3 (a) What is constructor? What are the rules for creating constructor in java? [06] Explain constructor overloading using example. (b) Explain activity diagram with the help of an example. (c) Compare String and StringBuffer Q.3 (a) Describe Inheritance and its type with suitable example. [06] (b) Explain sequence diagram with the help of book issue process of library. (c) Write a program to find whether the given string is palindrome or not.
BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: SYSTEM PROGRAMMING (2150708) (CE/IT) DATE: 09-08-2018 TIME: 02:00 pm to 03:30 pm TOTAL MARKS: 40 Q.1 (a) Define Following terms: [03] 1. Language Processor 2. Semantic Gap 3. Forward Reference (b) How constant differs from literal in assembly language? [03] (c) Consider the grammar: S->AA A->aA A->b Parse the string: abaab and check whether the grammar is ambiguous or not. Q.2 (a) Explain the various stages of the life cycle of a source program with a neat diagram. [06] (b) What is Symbol table? Explain how one can organize Symbol table using Linear Data Structure. (c) Explain types of grammars. Q.2 (a) List various phases of a language processor. Explain roles of phases of language [06] processor. Also explain symbol table. (b) Explain left recursion. Remove left recursion from below grammar and rewrite it. A -> A+B A-B B B -> B*C B/C C C-> (A) id (c) State differences between System Software and Application Software Q.3 (a) Explain use of various data structures (tables) needed in PASS I of the assembler. Also [06] give details of their fields. Explain various suitable data structures for the symbol table. (b) Explain & compare various intermediate code forms (Re- presentations) for an assembler. (c) What is macro-preprocessor? Explain steps of macro-preprocessor design. Q.3 (a) Which are the different assembly language statements? Explain each of them [06] with suitable example. (b) For the given assembly language code: (a) Show the contents of the symbol table at the end of Pass I. (b) Show the intermediate code generated for the program using Variant-1 representation. Instruction Opcode: STOP 00, MOVER 04, MOVEM 05, MULT-03 PRINT 10 Assembler directives: START 01, END 02 EQU -04
Declaration statements: DC 01, DS 02 Register code: BREG 02 START 100 P DS 4 L1 MOVER BREG, Q MULT BREG, S MOVEM BREG, R R EQU P+2 L2 PRINT R IGIN P-5 S DC 9 IGIN L2+1 STOP Q DC 7 END (c) Explain macro expansion in detail.
Enroll. No. BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: ANALYSIS AND DESIGN OF ALGITHMS (2150703) (CE\IT) DATE: 08/08/2018 TIME: 2:00 PM TO 3:30 PM TOTAL MARKS: 40 Q.1 (a) Explain the following terms: 1. Set 2. Relation 3. Function [3] (b) What is an algorithm? Explain various properties of an algorithm. [3] (c) What do you mean by linear inequalities and linear equation? [4] Q.2 (a) Explain all the asymptotic notations in detail. (b) Write an algorithm for merge sort with divide and conquer strategy. Sort the following data: 4,8,6,3,5,1,7,2,9. (c) Sort the following data with Max Heap Sort: 98,74, 32, 151, 27, 85, 66, 123, 13, 57. [4] Q.2 (a) What is an amortized analysis? Explain aggregate method of amortized analysis using simple example. (b) Write an algorithm for quick sort with divide and conquer strategy. Sort the following data: 4,8,6,3,5,1,7,2,9 (c) Sort the following data with Radix Sort: 98,74, 32, 151, 27, 85, 66, 123, 13, 57. [4] Q.3 (a) i) Solve recurrence equation T (n) =T (n-1) + n using forward substitution method. ii) Solve recurrence equation T(n)= 9T(n/3) + n using Master Theorem. (b) What is principle of optimality? Compute Binomial Co-efficient for C(6,4) using dynamic Programming. (c) Explain Selection Sort Algorithm and drive its best case, worst case and average case Complexity. Q.3 (a) i) Solve recurrence equation T (n) =T (n-1) + n using backward substitution method. ii) Solve recurrence equation T(n) = 2T(n/3)+1 using Master Theorem. (b) i) Write down difference between Divide and conquer & Dynamic Programming. ii) Write the algorithm of Binary Search. (c) Explain Insertion Sort Algorithm and drive its best case, worst case and average case Complexity. [4] [4]