SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY
|
|
- Osborn Norman
- 5 years ago
- Views:
Transcription
1 BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: MICROPROCESS & INTERFACING ( ) (CE) DATE: 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 (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 (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 and lesser than 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.
2 BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: OBJECT IENTED PROGRAMMING USING JAVA ( ) (CE/IT) DATE: 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.
3 BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: SYSTEM PROGRAMMING ( ) (CE/IT) DATE: 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
4 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.
5 Enroll. No. BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: ANALYSIS AND DESIGN OF ALGITHMS ( ) (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]
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
More informationSILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY
Enroll. No. SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY SUBJECT: SYSTEM PROGRAMMING (2150708) (CE/IT) DATE: 08-08-2017 TIME:2:00 pm to 3:30 pm TOTAL MARKS:40 Instructions: 1. All the questions are compulsory.
More informationQUESTION BANK CHAPTER 1 : OVERVIEW OF SYSTEM SOFTWARE. CHAPTER 2: Overview of Language Processors. CHAPTER 3: Assemblers
QUESTION BANK CHAPTER 1 : OVERVIEW OF SYSTEM SOFTWARE 1) Explain Analysis-synthesis model/fron end backend model of compiler 2) Explain various phases of compiler and symbol table. Consider the statement
More informationGUJARAT TECHNOLOGICAL UNIVERSITY
Type of course: System Programming GUJARAT TECHNOLOGICAL UNIVERSITY SYSTEM PROGRAMMING SUBJECT CODE: 21508 B.E. 5 th SEMESTER Prerequisite: Data Structures and Operating Systems Rationale: NA Teaching
More informationIII) EXAMINATION, 2015 CS 331 : SYSTEM PROGRAMMING AND OPERATING SYSTEM I
Total No. of Questions 4] [Total No. of Printed Pages 4 Seat No. [4718]-31 T.Y. B.Sc. (Computer Science) (Semester III) EXAMINATION, 2015 CS 331 : SYSTEM PROGRAMMING AND OPERATING SYSTEM I Paper I (2008
More information2. (a) Explain the concept of virtual functions in C++ with suitable examples. (b) Explain the concept of operator overloading in C++.
Code No: R059211201 Set No. 1 1. (a) What is a friend function? Explain the advantages and disadvantages of it? (b) What is static member function? Explain it s limitations. [8+8] 2. (a) Explain the concept
More informationCS 445: Data Structures Final Examination: Study Guide
CS 445: Data Structures Final Examination: Study Guide Java prerequisites Classes, objects, and references Access modifiers Arguments and parameters Garbage collection Self-test questions: Appendix C Designing
More informationCode No: Set No. 1
Code No: 2320404 Set No. 1 1. a) Draw the architectural diagram of 8085 and explain the function of each block in detail b) Discuss about Multiplexing in 8086 microprocessor [10+6] 2. a) Explain in detail
More informationInformation and Network Security
Silver Oak College of Engineering and Technology Information Technology Department Mid Semester 1 Syllabus (Winter-2018) 7 th IT Subject Code 2170709 2170710 Subject Name Information and Network Security
More informationSix Marks Questions: ( ) 3) Find the value of the derivative of f (z) = at z = i. r r r r. ( ) where C: z-a = r. (p). f ( z)
Bapatla Engineering College:: Bapatla (Autonomous) Department of Information Technology Assignment-I Question Paper - IV Sem Class: 2/4 B.Tech 2017-18 Section: B Sub: EM-IV (14MA401) Section: A & B Date:
More informationGujarat Technological University Sankalchand Patel College of Engineering, Visnagar B.E. Semester VII (CE) July-Nov Compiler Design (170701)
Gujarat Technological University Sankalchand Patel College of Engineering, Visnagar B.E. Semester VII (CE) July-Nov 2014 Compiler Design (170701) Question Bank / Assignment Unit 1: INTRODUCTION TO COMPILING
More informationKINGS DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK. Subject Name: Microprocessors and Microcontrollers UNIT-I 8085 MICROPROCESSOR
KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK Subject Name: Microprocessors and Microcontrollers Year/Sem: II/IV UNIT-I 8085 MICROPROCESSOR PART-A (2 MARKS) 1. Name the
More informationPROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a
More informationB.Sc II Year Computer Science (Optional)
Swami Ramanand Teerth Marathwad University, Nanded B.Sc II Year Computer Science (Optional) (Semester Pattern) ( W.E.F. June 2010) Paper No VI VII Paper Title Digital Electronics & 8085 Microprocessor
More informationShort Notes of CS201
#includes: Short Notes of CS201 The #include directive instructs the preprocessor to read and include a file into a source code file. The file name is typically enclosed with < and > if the file is a system
More informationCS201 - Introduction to Programming Glossary By
CS201 - Introduction to Programming Glossary By #include : The #include directive instructs the preprocessor to read and include a file into a source code file. The file name is typically enclosed with
More informationSYED AMMAL ENGINEERING COLLEGE (An ISO 9001:2008 Certified Institution) Dr. E.M. Abdullah Campus, Ramanathapuram
CS6660 COMPILER DESIGN Question Bank UNIT I-INTRODUCTION TO COMPILERS 1. Define compiler. 2. Differentiate compiler and interpreter. 3. What is a language processing system? 4. List four software tools
More information2) Save the Macro definition:- The processor must store the macro instruction definitions which it will need for expanding macro calls.
Subject Code: 17517 Model Answer Page: 1/ 21 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationD.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1.
D.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1. DESIGN AND ANALYSIS OF ALGORITHM UNIT- I SECTION-A 2 MARKS 1. Define an algorithm? 2. Specify the criteria of algorithm? 3. What is Computational Procedure?
More information(Following Paper ID and Roll No. to be filled by the student in the Answer Book)
F:/Academic/27 Refer/WI/ACAD/10 SHRI RAMSWAROOP MEMORIAL COLLEGE OF ENGG. & MANAGEMENT PAPER ID: 1602 (Following Paper ID and Roll No. to be filled by the student in the Answer Book) Roll No. B.Tech. SEM
More informationCOE428 Lecture Notes Week 1 (Week of January 9, 2017)
COE428 Lecture Notes: Week 1 1 of 10 COE428 Lecture Notes Week 1 (Week of January 9, 2017) Table of Contents COE428 Lecture Notes Week 1 (Week of January 9, 2017)...1 Announcements...1 Topics...1 Informal
More informationWeek. Lecture Topic day (including assignment/test) 1 st 1 st Introduction to Module 1 st. Practical
Name of faculty: Gaurav Gambhir Discipline: Computer Science Semester: 6 th Subject: CSE 304 N - Essentials of Information Technology Lesson Plan Duration: 15 Weeks (from January, 2018 to April, 2018)
More informationQuestion Paper Code : 97044
Reg. No. : Question Paper Code : 97044 B.E./B.Tech. DEGREE EXAMINATION NOVEMBER/DECEMBER 2014 Third Semester Computer Science and Engineering CS 6301 PROGRAMMING AND DATA STRUCTURES-II (Regulation 2013)
More informationLECTURE NOTES ON COMPILER DESIGN P a g e 2
LECTURE NOTES ON COMPILER DESIGN P a g e 1 (PCCS4305) COMPILER DESIGN KISHORE KUMAR SAHU SR. LECTURER, DEPARTMENT OF INFORMATION TECHNOLOGY ROLAND INSTITUTE OF TECHNOLOGY, BERHAMPUR LECTURE NOTES ON COMPILER
More informationIntroduction to Programming Using Java (98-388)
Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;
More informationAbout the Authors... iii Introduction... xvii. Chapter 1: System Software... 1
Table of Contents About the Authors... iii Introduction... xvii Chapter 1: System Software... 1 1.1 Concept of System Software... 2 Types of Software Programs... 2 Software Programs and the Computing Machine...
More informationObject Oriented Programming: In this course we began an introduction to programming from an object-oriented approach.
CMSC 131: Chapter 28 Final Review: What you learned this semester The Big Picture Object Oriented Programming: In this course we began an introduction to programming from an object-oriented approach. Java
More informationCSE 332 Autumn 2013: Midterm Exam (closed book, closed notes, no calculators)
Name: Email address: Quiz Section: CSE 332 Autumn 2013: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will
More informationDIVIDE & CONQUER. Problem of size n. Solution to sub problem 1
DIVIDE & CONQUER Definition: Divide & conquer is a general algorithm design strategy with a general plan as follows: 1. DIVIDE: A problem s instance is divided into several smaller instances of the same
More informationAbout this exam review
Final Exam Review About this exam review I ve prepared an outline of the material covered in class May not be totally complete! Exam may ask about things that were covered in class but not in this review
More informationAP Computer Science A Course Syllabus
AP Computer Science A Course Syllabus Textbook: Litvin, Maria and Litvin, Gary. Java Methods: Object-Oriented Programming and Data Structures. Skylight Publishing, 2011 http://www.skylit.com Course Description:
More informationHiroki Yasuga, Elisabeth Kolp, Andreas Lang. 25th September 2014, Scientific Programming
Hiroki Yasuga, Elisabeth Kolp, Andreas Lang 25th September 2014, Scientific Programming What is sorting and complexity? Big O notation Sorting algorithms: Merge sort Quick sort Comparison: Merge sort &
More informationCode No: R Set No. 1
Code No: R05010106 Set No. 1 1. (a) Draw a Flowchart for the following The average score for 3 tests has to be greater than 80 for a candidate to qualify for the interview. Representing the conditional
More information1. (a) What are the closure properties of Regular sets? Explain. (b) Briefly explain the logical phases of a compiler model. [8+8]
Code No: R05311201 Set No. 1 1. (a) What are the closure properties of Regular sets? Explain. (b) Briefly explain the logical phases of a compiler model. [8+8] 2. Compute the FIRST and FOLLOW sets of each
More informationCSE548, AMS542: Analysis of Algorithms, Fall 2012 Date: October 16. In-Class Midterm. ( 11:35 AM 12:50 PM : 75 Minutes )
CSE548, AMS542: Analysis of Algorithms, Fall 2012 Date: October 16 In-Class Midterm ( 11:35 AM 12:50 PM : 75 Minutes ) This exam will account for either 15% or 30% of your overall grade depending on your
More informationKLiC C Programming. (KLiC Certificate in C Programming)
KLiC C Programming (KLiC Certificate in C Programming) Turbo C Skills: The C Character Set, Constants, Variables and Keywords, Types of C Constants, Types of C Variables, C Keywords, Receiving Input, Integer
More informationWrite the function of following in Windows Operating System:
Assignment - I (Lessons 1-6) 1. Answer any two of the following questions. Differentiate between RAM and EPROM? Describe major components of a computer. Differentiate between Inkjet Printer and Laser Printer?
More informationCS606- compiler instruction Solved MCQS From Midterm Papers
CS606- compiler instruction Solved MCQS From Midterm Papers March 06,2014 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 Final Term MCQ s and Quizzes CS606- compiler instruction If X is a
More informationPSD1C SYSTEM SOFTWAE UNIT: I - V PSD1C SYSTEM SOFTWARE
PSD1C SYSTEM SOFTWAE UNIT: I - V 1 Syllabus Unit-I Language Processors Types of Language Processors Language Processing Activities Fundamentals of Language Processing Language Specification Data Structures
More informationPaytm Programming Sample paper: 1) A copy constructor is called. a. when an object is returned by value
Paytm Programming Sample paper: 1) A copy constructor is called a. when an object is returned by value b. when an object is passed by value as an argument c. when compiler generates a temporary object
More informationEND-TERM EXAMINATION
(Please Write your Exam Roll No. immediately) Exam. Roll No... END-TERM EXAMINATION Paper Code : MCA-205 DECEMBER 2006 Subject: Design and analysis of algorithm Time: 3 Hours Maximum Marks: 60 Note: Attempt
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) WINTER-15 EXAMINATION Model Answer Paper
Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in themodel answer scheme. 2) The model answer and the answer written by candidate may
More informationIntroduction to Algorithms October 12, 2005 Massachusetts Institute of Technology Professors Erik D. Demaine and Charles E. Leiserson Quiz 1.
Introduction to Algorithms October 12, 2005 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik D. Demaine and Charles E. Leiserson Quiz 1 Quiz 1 Do not open this quiz booklet until you
More informationCLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION
CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION 1. What is performance measurement? 2. What is an algorithm? 3. How the algorithm is good? 4. What are the
More informationDivide and Conquer 4-0
Divide and Conquer 4-0 Divide-and-Conquer The most-well known algorithm design strategy: 1. Divide instance of problem into two or more smaller instances 2. Solve smaller instances recursively 3. Obtain
More information4. (a) With a neat sketch explain 8237 DMA controller and its operation? (b) With the help of basic cell explain SRAM and DRAM?
Code No: R05220504 Set No. 1 II B.Tech II Semester Regular Examinations, Apr/May 2008 MICROPROCESSORS AND INTERFACING ( Common to Computer Science & Engineering, Information Technology and Computer Science
More informationJava 2. Course Outcome Summary. Western Technical College. Course Information. Course History. Course Competencies
Western Technical College 10152155 Java 2 Course Outcome Summary Course Information Description Career Cluster Instructional Level Total Credits 4.00 Total Hours 90.00 The goal as programmers, is to create
More informationSyllabi of the Comprehensive Examination in Computer Science
Syllabi of the Comprehensive Examination in Computer Science The material of the comprehensive examination is drawn mostly from the undergraduate curriculum at Kuwait University and is updated to reflect
More informationObject Oriented Programming. Solved MCQs - Part 2
Object Oriented Programming Solved MCQs - Part 2 Object Oriented Programming Solved MCQs - Part 2 It is possible to declare as a friend A member function A global function A class All of the above What
More informationAPJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)
D B3D042 Pages: 2 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 Max. Marks: 100 CS205: DATA STRUCTURES (CS, IT) PART A Answer all questions.
More informationObject Orientated Analysis and Design. Benjamin Kenwright
Notation Part 2 Object Orientated Analysis and Design Benjamin Kenwright Outline Review What do we mean by Notation and UML? Types of UML View Continue UML Diagram Types Conclusion and Discussion Summary
More informationContents. 1 Introduction. 2 Searching and Traversal Techniques. Preface... (vii) Acknowledgements... (ix)
Contents Preface... (vii) Acknowledgements... (ix) 1 Introduction 1.1 Algorithm 1 1.2 Life Cycle of Design and Analysis of Algorithm 2 1.3 Pseudo-Code for Expressing Algorithms 5 1.4 Recursive Algorithms
More informationCMSC330 Fall 2016 Midterm #2 2:00pm/3:30pm
CMSC330 Fall 2016 Midterm #2 2:00pm/3:30pm Gradescope ID: (Gradescope ID is the First letter of your last name and last 5 digits of your UID) (If you write your name on the test, or your gradescope ID
More informationReg. No. : Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, JANUARY First Semester GE 6151 COMPUTER PROGRAMMING
wss Reg. No. : Question Paper Code : 37007 B.E./B.Tech. DEGREE EXAMINATION, JANUARY 2014. First Semester Civil Engineering GE 6151 COMPUTER PROGRAMMING (Common to all branches) (Regulation 2013) Time :
More informationThis page intentionally left blank
This page intentionally left blank arting Out with Java: From Control Structures through Objects International Edition - PDF - PDF - PDF Cover Contents Preface Chapter 1 Introduction to Computers and Java
More informationTest 1 Summer 2014 Multiple Choice. Write your answer to the LEFT of each problem. 5 points each 1. Preprocessor macros are associated with: A. C B.
CSE 3302 Test 1 1. Preprocessor macros are associated with: A. C B. Java C. JavaScript D. Pascal 2. (define x (lambda (y z) (+ y z))) is an example of: A. Applying an anonymous function B. Defining a function
More informationMerge Sort. Run time typically depends on: Insertion sort can be faster than merge sort. Fast, able to handle any data
Run time typically depends on: How long things take to set up How many operations there are in each step How many steps there are Insertion sort can be faster than merge sort One array, one operation per
More informationCS 4240: Compilers and Interpreters Project Phase 1: Scanner and Parser Due Date: October 4 th 2015 (11:59 pm) (via T-square)
CS 4240: Compilers and Interpreters Project Phase 1: Scanner and Parser Due Date: October 4 th 2015 (11:59 pm) (via T-square) Introduction This semester, through a project split into 3 phases, we are going
More informationJana Kosecka. Linear Time Sorting, Median, Order Statistics. Many slides here are based on E. Demaine, D. Luebke slides
Jana Kosecka Linear Time Sorting, Median, Order Statistics Many slides here are based on E. Demaine, D. Luebke slides Insertion sort: Easy to code Fast on small inputs (less than ~50 elements) Fast on
More informationThe Limits of Sorting Divide-and-Conquer Comparison Sorts II
The Limits of Sorting Divide-and-Conquer Comparison Sorts II CS 311 Data Structures and Algorithms Lecture Slides Monday, October 12, 2009 Glenn G. Chappell Department of Computer Science University of
More informationMyProgram m i ng Lab. get with the programming. Through the power of practice and immediate personalized
get with the programming Through the power of practice and immediate personalized feedback, MyProgrammingLab improves your performance. MyProgram m i ng Lab Learn more at www.myprogramminglab.com Preface
More informationReg. No. : Question Paper Code : 27157
WK 3 Reg. No. : Question Paper Code : 27157 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Time : Three hours Second Semester Computer Science and Engineering CS 6202 PROGRAMMING AND DATA STRUCTURES
More informationWe can use a max-heap to sort data.
Sorting 7B N log N Sorts 1 Heap Sort We can use a max-heap to sort data. Convert an array to a max-heap. Remove the root from the heap and store it in its proper position in the same array. Repeat until
More informationCPSC 311: Analysis of Algorithms (Honors) Exam 1 October 11, 2002
CPSC 311: Analysis of Algorithms (Honors) Exam 1 October 11, 2002 Name: Instructions: 1. This is a closed book exam. Do not use any notes or books, other than your 8.5-by-11 inch review sheet. Do not confer
More informationSai Nath University. Assignment For BCA 3 RD Sem.
1 Sai Nath University Assignment For BCA 3 RD Sem. The Assignment will consist of two parts, A and B. will have 5 short answer questions(40-60 words) of 4 marks each. will have 4 long answer questions
More informationCS 411 Analysis of Algorithms, Fall 2012 Midterm Exam Solutions. The Midterm Exam was given in class on Wednesday, October 17, 2012.
CS 411 Analysis of Algorithms, Fall 2012 Midterm Exam Solutions The Midterm Exam was given in class on Wednesday, October 17, 2012. A1. Time Complexity. In each part, indicate the (time) order of a fast
More information5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register
General Concepts 1. (a) What are combinational circuits? (b) Perform the following: (i) Convert (0.5625) 10 = ( ) 2 (ii) (010010) 2 (100011) 2 = ( ) 2 2. (a) Using truth table prove that A B= A+ B (b)
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More informationMaster of Computer Application (MCA) Semester 4 MC0076 Management and Information Systems 4 Credits
MC0076 Management and Information Systems 4 Credits (Book ID: B0901) Each question carries TEN marks 1. What do you understand by Information processes data? 2. How do you retrieve information from manual
More informationGUJARAT TECHNOLOGICAL UNIVERSITY
Type of course: Core GUJARAT TECHNOLOGICAL UNIVERSITY SUBJECT NAME: Compiler Design SUBJECT CODE: 21701 B.E. 7 th SEMESTER Prerequisite: Data Structures and Algorithms, Theory of Computation, Rationale:
More informationCore Java - SCJP. Q2Technologies, Rajajinagar. Course content
Core Java - SCJP Course content NOTE: For exam objectives refer to the SCJP 1.6 objectives. 1. Declarations and Access Control Java Refresher Identifiers & JavaBeans Legal Identifiers. Sun's Java Code
More informationAbout Codefrux While the current trends around the world are based on the internet, mobile and its applications, we try to make the most out of it. As for us, we are a well established IT professionals
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK B.E. - Electrical and Electronics Engineering IV SEMESTER CS6456 - OBJECT ORIENTED
More informationADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM II BTech (CSE) I Semester BTCSE301 DIGITAL LOGIC DESIGN MODEL QUESTION PAPER
ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM BTCSE301 DIGITAL LOGIC DESIGN 1. a) List out the Basic Theorems and Properties of Boolean Algebra. Justify with the Proof b) Explain how 1's complement and
More informationContents. Figures. Tables. Examples. Foreword. Preface. 1 Basics of Java Programming 1. xix. xxi. xxiii. xxvii. xxix
PGJC4_JSE8_OCA.book Page ix Monday, June 20, 2016 2:31 PM Contents Figures Tables Examples Foreword Preface xix xxi xxiii xxvii xxix 1 Basics of Java Programming 1 1.1 Introduction 2 1.2 Classes 2 Declaring
More informationEXPERIMENT NO : M/C Lenovo Think center M700 Ci3,6100,6th Gen. H81, 4GB RAM,500GB HDD
GROUP - A EXPERIMENT NO : 04 1. Title: Write a Java program for pass-ii of a two-pass macro-processor. The output of assignment-3 (MNT, MDT and file without any macro definitions) should be input for this
More informationM.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.
Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors
More informationTotal No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.
(DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)
More informationThis book is licensed under a Creative Commons Attribution 3.0 License
6. Syntax Learning objectives: syntax and semantics syntax diagrams and EBNF describe context-free grammars terminal and nonterminal symbols productions definition of EBNF by itself parse tree grammars
More informationADMINISTRATIVE MANAGEMENT COLLEGE
First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and
More informationComputer Programming C++ (wg) CCOs
Computer Programming C++ (wg) CCOs I. The student will analyze the different systems, and languages of the computer. (SM 1.4, 3.1, 3.4, 3.6) II. The student will write, compile, link and run a simple C++
More informationSai Nath University. Assignment For MCA 2nd Sem.
Sai Nath University Assignment For MCA 2nd Sem. The Assignment will consist of two parts, A and B. will have 5 short answer questions(40-60 words) of 4 marks each. will have 4 long answer questions of
More informationDEPARTMENT OF ECE QUESTION BANK SUBJECT: MICROPROCESSOR AND MICROCONTROLLER UNIT-1 PART-A (2 MARKS)
DEPARTMENT OF ECE QUESTION BANK SUBJECT: MICROPROCESSOR AND MICROCONTROLLER CODE: EC6504 UNIT-1 1. How many memory locations are available in 8086 microprocessor? 2. What are the flags available in 8086
More informationWeiss Chapter 1 terminology (parenthesized numbers are page numbers)
Weiss Chapter 1 terminology (parenthesized numbers are page numbers) assignment operators In Java, used to alter the value of a variable. These operators include =, +=, -=, *=, and /=. (9) autoincrement
More informationL.J. Institute of Engineering & Technology Semester: VIII (2016)
Subject Name: Design & Analysis of Algorithm Subject Code:1810 Faculties: Mitesh Thakkar Sr. UNIT-1 Basics of Algorithms and Mathematics No 1 What is an algorithm? What do you mean by correct algorithm?
More informationM.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75
(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2012 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section - A Answer any Three of the following (3 15 = 45) 1) Define the
More informationLANGUAGE PROCESSORS. Presented By: Prof. S.J. Soni, SPCE Visnagar.
LANGUAGE PROCESSORS Presented By: Prof. S.J. Soni, SPCE Visnagar. Introduction Language Processing activities arise due to the differences between the manner in which a software designer describes the
More informationM.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75
M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES (DMCS 01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45)
More informationPart I Basic Concepts 1
Introduction xiii Part I Basic Concepts 1 Chapter 1 Integer Arithmetic 3 1.1 Example Program 3 1.2 Computer Program 4 1.3 Documentation 5 1.4 Input 6 1.5 Assignment Statement 7 1.5.1 Basics of assignment
More informationSorting. Sorting in Arrays. SelectionSort. SelectionSort. Binary search works great, but how do we create a sorted array in the first place?
Sorting Binary search works great, but how do we create a sorted array in the first place? Sorting in Arrays Sorting algorithms: Selection sort: O(n 2 ) time Merge sort: O(nlog 2 (n)) time Quicksort: O(n
More informationExam Duration: 2hrs and 30min Software Design
Exam Duration: 2hrs and 30min. 433-254 Software Design Section A Multiple Choice (This sample paper has less questions than the exam paper The exam paper will have 25 Multiple Choice questions.) 1. Which
More informationObjects and Iterators
Objects and Iterators Can We Have Data Structures With Generic Types? What s in a Bag? All our implementations of collections so far allowed for one data type for the entire collection To accommodate a
More informationSARDAR RAJA COLLEGE OF ENGINEERING
SARDAR RAJA COLLEGE OF ENGINEERING RAJA NAGAR, ALANGULAM Department of Electronics & Communication Engineering Subject Name : DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ Subject Code : EC 2202
More informationIntermediate Mathematics League of Eastern Massachusetts
Meet # January 010 Intermediate Mathematics League of Eastern Massachusetts Meet # January 010 Category 1 - Mystery Meet #, January 010 1. Of all the number pairs whose sum equals their product, what is
More information2. Reachability in garbage collection is just an approximation of garbage.
symbol tables were on the first exam of this particular year's exam. We did not discuss register allocation in this This exam has questions from previous CISC 471/672. particular year. Not all questions
More informationASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS
ASSIGNMENT - 1 Data Structures (DMCS01) Q1) a) Write a sub-routine to implement PUSH ( ) and POP ( ) operations using linked list. b) Explain about open hashing and closed hashing. Q2) How to create double
More informationCSE au Final Exam Sample Solution
CSE 413 12au Final Exam Sample Solution Question 1. (10 points) Regular expressions I. Describe the set of strings generated by each of the following regular expressions. For full credit, give a description
More informationAFN-1255 PCA131 P.G.D.C.A. DIPLOMA EXAMINATION, MAY 2011 First Semester Computer Applications FUNDAMENTALS OF DIGITAL COMPUTER (Non-CBCS 2004 onwards) Time : 3 Hours Maximum : 100 Marks Part A (15 1 =
More informationR13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)
SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)
More informationGraphical Interface and Application (I3305) Semester: 1 Academic Year: 2017/2018 Dr Antoun Yaacoub
Lebanese University Faculty of Science Computer Science BS Degree Graphical Interface and Application (I3305) Semester: 1 Academic Year: 2017/2018 Dr Antoun Yaacoub 2 Crash Course in JAVA Classes A Java
More information