5-In switch case statement, every case should have a statement as the last statement A- Jump B- Break C- Exit D- Both a and b
|
|
- Anna Margery Skinner
- 5 years ago
- Views:
Transcription
1 Q1) choose the correct answer: 1-High level languages like C, Fortran are also known as A- Procedural languages B- Object oriented language C- Form based language D- Both a and b 2- One of the basic concepts in Object Oriented Programming approach is bundling both data and functions into one unit known as A- Simple variable B- Object C- bundle D- Both a and b 3- Which of the following shows the Operator overloading feature in C++ in A- Polymorphism B- Inheritance C- Message passing D- Both a and b 4-One of the alternative to nested if is the A- Break statement B- Jump statement C- Switch statement D- Both a and b 5-In switch case statement, every case should have a statement as the last statement A- Jump B- Break C- Exit D- Both a and b 6-Conditional operator (?:) is a handy operator which acts like a shortcut for A- If else statement B- Switch statement C- Break statement D- Goto statement 7-Arrays are data types. A- Primitive B- Non-primitive C- User defined D- Both b and c 1
2 8-In two dimensional arrays, elements can be accessed by indexes. A- One B- Four C- Three D- Two Q2/ By using object oriented program, write complete program for all operation (push, pop empty) for stack principle. 2
3 Q3) Choose the correct answer: 1. Website is a collection of: a. Web server b. Web pages c. Web browser d. Www 2. Linux is a web browser: a. Text based b. Graphical based c. Both a & b d. None of these 3. To create and view an html document, which tools are used: a. Text editor b. Web browser c. Both a and b d. None of these 4. The first anchor element is specified with which attribute: a. Name b. Wfhy c. Abfg d. Href 5. Web publishing means: a. Collecting the web pages b. Publishing the web pages c. Storing the web pages d. None of these 6. JavaScript is used for: a. Client-side applications b. Data validation c. Creating interactive forms d. All of these 7. The sequence of methods invoked automatically when an applet is loaded till it is destroyed is: a. init(), paint(),start(),stop(),destroy() b. start(),init(),paint(),stop(),destroy() c. star(),paint(),init(),destroy(),stop() d. init(),start(),paint(),stop(),destroy() 3
4 Q4) Write a program (in any web programming language) build a web page enable the user to do the editor operations (add, delete, save, and update). 4
5 Q5) Choose the correct answer: 1- (a) e -3lnx =3x, (b) e -3lnx 1 = x 3, (c) e -3lnx = 31 x. 2- If f(x) is Fourier cosine Half-range series this function defined as:- (a) f(x)= a n (a n cos n x+ b n n sin x), (b) f(x)= a n ( b n n sin x), (c) f(x)= a 0 + (a n cos 1 Where T is period function on interval T < x < T. n n x), 3- The solution of following differential equation [ y +4y = 0] is (a) y= c 1 cos4x + c 2 sin4x, (b) y= c 1 cosx + c 2 sinx, (c) y= c 1 cos2x + c 2 sin2x. 4- The solution of following differential equation [ y = 1] is 2 x 2 a) y x c, b) y c, c) y x c 2 5- f(x) is even function if defined as: (1) f (-x) = -f(x), (2) f(x) = f (-x), ( 3) -f (x) = f(x), If [ f ( s) ], the inverse of Laplace transformation [f (t) = L { } 3 3 ] is s t a) t, b) 6t, c) 2 7- If [W = f(x, y, z)]. Then the total differential of this function is defined as: f (a) dw = x f (c) dw = x w f + x y dx + f y w f + y z f dy + z f f f, (b) dw =w x + w y +w z w z dz. s, 5
6 8-2 a) sin 1 9 x 1 dx is. x ( ) c, 9 b) sin 1 x ( ) c, 3 c) cos 1 3x c, Q 6 ) If [f (t) = e iwt iwt ]. Then find Laplace transformation [f(s) = L { e }] 6
7 Q7) Choose the correct answer: takes both source program and input data and produce output data. a- Translator b- Compiler c- Assembler d- Interpreter 2- A lexical analyzer is called in some times a- Scanner b- syntax analyzer c- Parser d- intermediate code generator 3- bottom-up parser produces a parse tree for a given input string by starting with a- start symbol in the grammar b- terminals of the given string c- randomly d- none of these 4- Ambiguity in syntax analysis means a- more tokens b- more parse trees c- more types d- more errors 5- The final phase of the compiler is to for a specific machine. a- optimize code b- generate code c- analyze code d- store code 6- Consider the grammar:s B x y C B C z S C x B.Then the FIRST(S) is a- {y} b- x, y} c- {y, z} d- {x, y, z} 7
8 7- Consider the grammar: S B x y C B C z S C x B. Then the FOLLOW(S) is a- {y} b- {y, z} c- { z} d- {x, z} Q8) Explain Loop Optimization with examples. 8
9 Q9) Choose the correct answer: 1... is one color space, which describe color as perceived by human being : a. RGB color space. b. HSL color space. c. PCT color space. d. None of the above 2. One of the below edge detection mask is called "compass" mask. a. Sobel edge detector. b. Perwitt edge detector. c. Kirch edge detector. d. Canny edge detector. 3. To remove Salt type noise from an image, we have to use filter. a. Mean filter. b. Median filter. c. Min filter. d. Max filter. 4. The first order hold method is used to enlarge ( N N ) image to the size of. a. ( N - 1 ) ( N - 1 ). b. ( 2 N - 1 ) ( 2 N - 1 ). c. ( N + 1 ) ( N + 1 ). d. ( 2 N + 1 ) ( 2 N + 1 ). 5. is a technique where the histogram of the resultant image is as flat as possible. a. Histogram equalization. b. Histogram modification. c. Image restoration. d. Image geometry. 6. is the most efficient edge detector. a. Sobel edge detector. b. Perwitt edge detector. c. kirch edge detector. d. Canny edge detector. 9
10 7. In region growing segmentation technique, a pixel is added to a region if and only if it satisfy the condition.. a. It has not been assigned to any other regions. b. It is a neighbor of that region. c. The new region created by addition of this pixel is still uniform. d. All the above. 8. When using region growing segmentation technique image pixels whose intensity corresponds to. Can be used as a seed. a. First element of a look-up table. b. Histogram peak. c. Largest gray level value. d. None of the above. Q10) Identify the steps that are required to enlarge ( N N ) image by factor of K. 01
11 Q11) Choose the correct answer: 1. The average time required to reach a storage location in memory and obtain its contents is called the A. seek time B. turnaround time C. access time D. transfer time 2. Which of the following is lowest in memory hierarchy? A. Cache memory B. Secondary memory C. Registers D. RAM , Write Through technique is used in which memory for updating the data A. Virtual memory B. Main memory C. Auxiliary memory D. Cache memory 4. In a program using subroutine call instruction, it is necessary A. Initialize program counter B. Clear the accumulator C. Reset the microprocessor D. Clear the instruction register 5. Cache memory works on the principle of A. Locality of data B. Locality of memory C. Locality of reference D. Locality of reference & memory register keeps tracks of the instructions stored in program stored in memory. A. AR (Address Register) B. XR (Index Register) C. PC (Program Counter) D. AC (Accumulator) 7. The BSA instruction is A. Branch and store accumulator B. Branch and save return address C. Branch and shift address D. Branch and show accumulator 11
12 Q12) What is the difference between isolated mapped input/output and memory mapped input/output. 12
13 Q13) choose the correct answer: 1. Which one of the following is not a real time operating system? a) VxWorks b) Windows CE c) RTLinux d) Palm OS 2. What is a long-term scheduler? a) It selects which process has to be brought into the ready queue b) It selects which process has to be executed next and allocates CPU c) It selects which process to remove from memory by swapping d) None of these 3. Those processes should be aborted on occurrence of a deadlock, the termination of which a) is more time consuming b) incurs minimum cost c) safety is not hampered d) All of these 4. The interval from the time of submission of a process to the time of completion is termed as a) waiting time b) turnaround time c) response time d) throughput 5. Process are classified into different groups in a) shortest job scheduling algorithm b) round robin scheduling algorithm c) priority scheduling algorithm d) multilevel queue scheduling algorithm 6. External fragmentation will not occur when a) first fit is used b) best fit is used c) worst fit is used d) no matter which algorithm is used, it will always occur 7. The operating system maintains a table that keeps track of how many frames have been allocated, how many are there, and how many are available. a) page b) mapping c) frame d) memory 31
14 8. What is common problem found in distributed operatingsystem? a) Process Synchronization b) Communication synchronization c) Deadlock problem d) Power failure Q14) What are the CPU Scheduling benefits? List its algorithms with brief explain. 31
15 Q15) choose the correct answer: 1- enhances performance and functionality of the software after delivery. A. re-designs B. Re-engineering C. Maintenance D. Post checking 2- Traditionally, the phase of software development where a formal approach used is A. Programming B. Design C. Requirements D. Planning 3- Black box testing is also called A. Specification-based testing B. Structural testing C. Verification D. Unit testing 4- During software development which factor is most crucial A. People B. Process C. Product D. project 5- Which of these truly defines software design A. Software design is an activity subjected to constraints B. Software Design specifies nature and composition of software product C. Software Design satisfies client needs and desires D. All of the mentioned 6- Software Engineering approach is used to achieve A. Better performance of hardware B. Error free software C. Reusable software D. Quality software product 7- RAD stands for A. Rapid Application Development B. Relative Application Development C. Ready Application Development D. Repeated Application Development 51
16 Q16) How does the risk factor affect the spiral model of software development? 51
Q1. Choose the correct answer:
Q1. Choose the correct answer: 1. In the Analysis phase, the development of the occurs, which is a clear statement of the goals and objectives of the project. A. Documentation B. flowchart C. program specification
More information4. Because threads can share common data, they do not need to use? a. Layered Communication b. Interprocess Communication c. Both d.
Q: Select the correct answer:. Spooling is an acronym for? a. Simultaneous Peripheral Operation On Line b. Simultaneous Peripheral Operation On Link c. Simultaneous Peripheral Operation On Light d. None.
More informationChapter 12 : Computer Science. Class XI ( As per CBSE Board) Program Execution. New Syllabus Visit : python.mykvs.in for regular updates
Chapter 12 : Computer Science Class XI ( As per CBSE Board) Program Execution New Syllabus 2018-19 Program Execution The process of running a computer software program or command by processor is known
More informationTechno India Batanagar Department of Computer Science & Engineering. Model Questions. Multiple Choice Questions:
Techno India Batanagar Department of Computer Science & Engineering Model Questions Subject Name: Operating System Multiple Choice Questions: Subject Code: CS603 1) Shell is the exclusive feature of a)
More informationDr. Rafiq Zakaria Campus. Maulana Azad College of Arts, Science & Commerce, Aurangabad. Department of Computer Science. Academic Year
Dr. Rafiq Zakaria Campus Maulana Azad College of Arts, Science & Commerce, Aurangabad Department of Computer Science Academic Year 2015-16 MCQs on Operating System Sem.-II 1.What is operating system? a)
More information2c. Content of Computer systems (Component 01)
c. Content of Computer systems (Component 01) This component will introduce learners to the internal workings of the Central Processing Unit (CPU), the exchange of data and will also look at software development,
More informationB. V. Patel Institute of Business Management, Computer &Information Technology, UTU
BCA-3 rd Semester 030010304-Fundamentals Of Operating Systems Unit: 1 Introduction Short Answer Questions : 1. State two ways of process communication. 2. State any two uses of operating system according
More informationa. It will output It s NOT Rover b. Class Main should be changed to the following (bold characters show the changes)
May 2015 Computing Advanced Paper 1 Question 1 a. It will output It s NOT Rover b. Class Main should be changed to the following (bold characters show the changes) public class Main public static void
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 informationMARUTHI SCHOOL OF BANKING (MSB)
MARUTHI SCHOOL OF BANKING (MSB) SO IT - OPERATING SYSTEM(2017) 1. is mainly responsible for allocating the resources as per process requirement? 1.RAM 2.Compiler 3.Operating Systems 4.Software 2.Which
More informationInsight into Program execution
Insight into Program execution Based on CBSE curriculum Class 11 By- Neha Tyagi PGT CS KV 5 Jaipur II Shift, Jaipur Region Introduction As we know that computer works on machine level language which is
More informationOperating Systems Overview. Chapter 2
Operating Systems Overview Chapter 2 Operating System A program that controls the execution of application programs An interface between the user and hardware Masks the details of the hardware Layers and
More informationFaculty of Electrical Engineering, Mathematics, and Computer Science Delft University of Technology
Faculty of Electrical Engineering, Mathematics, and Computer Science Delft University of Technology exam Compiler Construction in4303 April 9, 2010 14.00-15.30 This exam (6 pages) consists of 52 True/False
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 informationProcesses, PCB, Context Switch
THE HONG KONG POLYTECHNIC UNIVERSITY Department of Electronic and Information Engineering EIE 272 CAOS Operating Systems Part II Processes, PCB, Context Switch Instructor Dr. M. Sakalli enmsaka@eie.polyu.edu.hk
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 informationCompiler Theory. (Semantic Analysis and Run-Time Environments)
Compiler Theory (Semantic Analysis and Run-Time Environments) 005 Semantic Actions A compiler must do more than recognise whether a sentence belongs to the language of a grammar it must do something useful
More informationDepartment of Computer Science Admission Test for PhD Program. Part I Time : 30 min Max Marks: 15
Department of Computer Science Admission Test for PhD Program Part I Time : 0 min Max Marks: 5 Each Q carries marks. ¼ mark will be deducted for every wrong answer. Part II of only those candidates will
More informationLearning objectives. Computer principles The characteristics of contemporary processors, input, output and storage devices
Learning objectives Computer principles 1.1. The characteristics of contemporary processors, input, output and storage devices Components of a computer and their uses 1.1.1 Structure and function of the
More informationAnatomy of a Compiler. Overview of Semantic Analysis. The Compiler So Far. Why a Separate Semantic Analysis?
Anatomy of a Compiler Program (character stream) Lexical Analyzer (Scanner) Syntax Analyzer (Parser) Semantic Analysis Parse Tree Intermediate Code Generator Intermediate Code Optimizer Code Generator
More informationOperating Systems (2INC0) 2017/18
Operating Systems (2INC0) 2017/18 Memory Management (09) Dr. Courtesy of Dr. I. Radovanovic, Dr. R. Mak (figures from Bic & Shaw) System Architecture and Networking Group Agenda Reminder: OS & resources
More informationDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT-1
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester Section Subject Code Subject Name Degree & Branch : I & II : M.E : CP7204 : Advanced Operating Systems : M.E C.S.E. 1. Define Process? UNIT-1
More informationOPERATING SYSTEMS. Goals of the Course. This lecture will cover: This Lecture will also cover:
OPERATING SYSTEMS This lecture will cover: Goals of the course Definitions of operating systems Operating system goals What is not an operating system Computer architecture O/S services This Lecture will
More informationCS 406/534 Compiler Construction Putting It All Together
CS 406/534 Compiler Construction Putting It All Together Prof. Li Xu Dept. of Computer Science UMass Lowell Fall 2004 Part of the course lecture notes are based on Prof. Keith Cooper, Prof. Ken Kennedy
More informationCS1622. Semantic Analysis. The Compiler So Far. Lecture 15 Semantic Analysis. How to build symbol tables How to use them to find
CS1622 Lecture 15 Semantic Analysis CS 1622 Lecture 15 1 Semantic Analysis How to build symbol tables How to use them to find multiply-declared and undeclared variables. How to perform type checking CS
More informationSemantic Analysis. Outline. The role of semantic analysis in a compiler. Scope. Types. Where we are. The Compiler Front-End
Outline Semantic Analysis The role of semantic analysis in a compiler A laundry list of tasks Scope Static vs. Dynamic scoping Implementation: symbol tables Types Static analyses that detect type errors
More informationSubject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering)
A. Multiple Choice Questions (60 questions) Subject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering) Unit-I 1. What is operating system? a) collection of programs that manages hardware
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 9 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 CPU Scheduling: Objectives CPU scheduling,
More informationCS 326: Operating Systems. CPU Scheduling. Lecture 6
CS 326: Operating Systems CPU Scheduling Lecture 6 Today s Schedule Agenda? Context Switches and Interrupts Basic Scheduling Algorithms Scheduling with I/O Symmetric multiprocessing 2/7/18 CS 326: Operating
More informationThe role of semantic analysis in a compiler
Semantic Analysis Outline The role of semantic analysis in a compiler A laundry list of tasks Scope Static vs. Dynamic scoping Implementation: symbol tables Types Static analyses that detect type errors
More information... Lecture 10. Concepts of Mobile Operating Systems. Mobile Business I (WS 2017/18) Prof. Dr. Kai Rannenberg
Lecture 10 Concepts of Mobile Operating Systems Mobile Business I (WS 2017/18) Prof. Dr. Kai Rannenberg... Deutsche Telekom Chair of Mobile Business & Multilateral Security Johann Wolfgang Goethe University
More informationDr. Babasaheb Ambedkar Open University
Enrollment Number : Dr. Babasaheb Ambedkar Open University Term End Examination January - 2015 Course : BCA Numerical Code: 0065 Subject Code : BCA 301 Numerical Code: 0530 Subject : Introduction to Computer
More informationModule 1. Introduction:
Module 1 Introduction: Operating system is the most fundamental of all the system programs. It is a layer of software on top of the hardware which constitutes the system and manages all parts of the system.
More informationNotes on the Exam. Question 1. Today. Comp 104:Operating Systems Concepts 11/05/2015. Revision Lectures (separate questions and answers)
Comp 104:Operating Systems Concepts Revision Lectures (separate questions and answers) Today Here are a sample of questions that could appear in the exam Please LET ME KNOW if there are particular subjects
More informationCOMPILER DESIGN. For COMPUTER SCIENCE
COMPILER DESIGN For COMPUTER SCIENCE . COMPILER DESIGN SYLLABUS Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. ANALYSIS OF GATE PAPERS Exam
More informationYear 12 Computer Science Learning Cycle 2 Overview
Year 12 Computer Science Learning Cycle 2 Overview Learning Cycle Overview: Specification Topic Taught Week 1.2.1 abcd Operating System Functions, MM, Interupts & Scheduling 2.2.1 ea Integrated Development
More informationComp 204: Computer Systems and Their Implementation. Lecture 25a: Revision Lectures (separate questions and answers)
Comp 204: Computer Systems and Their Implementation Lecture 25a: Revision Lectures (separate questions and answers) 1 Today Here are a sample of questions that could appear in the exam Please LET ME KNOW
More informationPrevious Year Questions
Previous Year Questions KVS PGT Computer Science 2017 1. Which of the following most accurately describes "multiple inheritances? A. When two classes inherit from each other. B. When a child class has
More informationSubject Teacher: Prof. Sheela Bankar
Peoples Empowerment Group ISB&M SCHOOL OF TECHNOLOGY, NANDE, PUNE DEPARTMENT OF COMPUTER ENGINEERING Academic Year 2017-18 Subject: SP&OS Class: T.E. computer Subject Teacher: Prof. Sheela Bankar 1. Explain
More informationUniprocessor Scheduling. Aim of Scheduling
Uniprocessor Scheduling Chapter 9 Aim of Scheduling Response time Throughput Processor efficiency Types of Scheduling Long-Term Scheduling Determines which programs are admitted to the system for processing
More informationUniprocessor Scheduling. Aim of Scheduling. Types of Scheduling. Long-Term Scheduling. Chapter 9. Response time Throughput Processor efficiency
Uniprocessor Scheduling Chapter 9 Aim of Scheduling Response time Throughput Processor efficiency Types of Scheduling Long-Term Scheduling Determines which programs are admitted to the system for processing
More informationAddresses in the source program are generally symbolic. A compiler will typically bind these symbolic addresses to re-locatable addresses.
1 Memory Management Address Binding The normal procedures is to select one of the processes in the input queue and to load that process into memory. As the process executed, it accesses instructions and
More informationGeneral Objectives: To understand the process management in operating system. Specific Objectives: At the end of the unit you should be able to:
F2007/Unit5/1 UNIT 5 OBJECTIVES General Objectives: To understand the process management in operating system Specific Objectives: At the end of the unit you should be able to: define program, process and
More informationRun-time Environments. Lecture 13. Prof. Alex Aiken Original Slides (Modified by Prof. Vijay Ganesh) Lecture 13
Run-time Environments Lecture 13 by Prof. Vijay Ganesh) Lecture 13 1 What have we covered so far? We have covered the front-end phases Lexical analysis (Lexer, regular expressions,...) Parsing (CFG, Top-down,
More informationChapter 6: CPU Scheduling. Operating System Concepts 9 th Edition
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time
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 informationComp 310 Computer Systems and Organization
Comp 310 Computer Systems and Organization Lecture #9 Process Management (CPU Scheduling) 1 Prof. Joseph Vybihal Announcements Oct 16 Midterm exam (in class) In class review Oct 14 (½ class review) Ass#2
More informationOPERATING SYSTEMS. After A.S.Tanenbaum, Modern Operating Systems 3rd edition Uses content with permission from Assoc. Prof. Florin Fortis, PhD
OPERATING SYSTEMS #8 After A.S.Tanenbaum, Modern Operating Systems 3rd edition Uses content with permission from Assoc. Prof. Florin Fortis, PhD MEMORY MANAGEMENT MEMORY MANAGEMENT The memory is one of
More informationProblem solving using standard programming techniques and Turbo C compiler.
Course Outcome First Year of B.Sc. IT Program Semester I Course Number:USIT 101 Course Name: Imperative Programming Introduces programming principles and fundamentals of programming. The ability to write
More informationProgramming Language Processor Theory
Programming Language Processor Theory Munehiro Takimoto Course Descriptions Method of Evaluation: made through your technical reports Purposes: understanding various theories and implementations of modern
More informationIntroduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras
Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Week 05 Lecture 18 CPU Scheduling Hello. In this lecture, we
More informationQ1. Choose the proper selection for the following statements. (30 Marks) No Statement Selection
Q1. Choose the proper selection for the following statements. (30 Marks) No Statement Selection 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 A plateau is a -------------- A) Search strategy B) Representation method
More informationOperating System. Operating System Overview. Layers of Computer System. Operating System Objectives. Services Provided by the Operating System
Operating System Operating System Overview Chapter 2 A program that controls the execution of application programs An interface between applications and hardware 1 2 Operating System Objectives Layers
More informationOperating System Overview. Operating System
Operating System Overview Chapter 2 1 Operating System A program that controls the execution of application programs An interface between applications and hardware 2 1 Operating System Objectives Convenience
More informationSyllabus for Computer Science General Part I
Distribution of Questions: Part I Q1. (Compulsory: 20 marks). Any ten questions to be answered out of fifteen questions, each carrying two marks (Group A 3 questions, Group B, Group C and Group D 4 questions
More informationScheduling II. Today. Next Time. ! Proportional-share scheduling! Multilevel-feedback queue! Multiprocessor scheduling. !
Scheduling II Today! Proportional-share scheduling! Multilevel-feedback queue! Multiprocessor scheduling Next Time! Memory management Scheduling with multiple goals! What if you want both good turnaround
More informationOperating System. Operating System Overview. Structure of a Computer System. Structure of a Computer System. Structure of a Computer System
Overview Chapter 1.5 1.9 A program that controls execution of applications The resource manager An interface between applications and hardware The extended machine 1 2 Structure of a Computer System Structure
More informationSemantic Analysis. Outline. The role of semantic analysis in a compiler. Scope. Types. Where we are. The Compiler so far
Outline Semantic Analysis The role of semantic analysis in a compiler A laundry list of tasks Scope Static vs. Dynamic scoping Implementation: symbol tables Types Statically vs. Dynamically typed languages
More informationScheduling II. q q q q. Proportional-share scheduling Multilevel-feedback queue Multiprocessor scheduling Next Time: Memory management
Scheduling II q q q q Proportional-share scheduling Multilevel-feedback queue Multiprocessor scheduling Next Time: Memory management Scheduling with multiple goals What if you want both good turnaround
More informationOperating Systems Memory Management. Mathieu Delalandre University of Tours, Tours city, France
Operating Systems Memory Management Mathieu Delalandre University of Tours, Tours city, France mathieu.delalandre@univ-tours.fr 1 Operating Systems Memory Management 1. Introduction 2. Contiguous memory
More informationCSc33200: Operating Systems, CS-CCNY, Fall 2003 Jinzhong Niu December 10, Review
CSc33200: Operating Systems, CS-CCNY, Fall 2003 Jinzhong Niu December 10, 2003 Review 1 Overview 1.1 The definition, objectives and evolution of operating system An operating system exploits and manages
More informationMemory Management. 3. What two registers can be used to provide a simple form of memory protection? Base register Limit Register
Memory Management 1. Describe the sequence of instruction-execution life cycle? A typical instruction-execution life cycle: Fetches (load) an instruction from specific memory address. Decode the instruction
More informationChapter 9. Uniprocessor Scheduling
Operating System Chapter 9. Uniprocessor Scheduling Lynn Choi School of Electrical Engineering Scheduling Processor Scheduling Assign system resource (CPU time, IO device, etc.) to processes/threads to
More information2068 (I) Attempt all questions.
2068 (I) 1. What do you mean by compiler? How source program analyzed? Explain in brief. 2. Discuss the role of symbol table in compiler design. 3. Convert the regular expression 0 + (1 + 0)* 00 first
More informationParsing Scheme (+ (* 2 3) 1) * 1
Parsing Scheme + (+ (* 2 3) 1) * 1 2 3 Compiling Scheme frame + frame halt * 1 3 2 3 2 refer 1 apply * refer apply + Compiling Scheme make-return START make-test make-close make-assign make- pair? yes
More informationAC59/AT59 OPERATING SYSTEMS & SYSTEMS SOFTWARE DECEMBER 2012
Q2a. What are the various actions an operating system performs when a new process is created? Explain four fundamental states for a process using a state transition diagram. Ans 2a. As a process executes,
More informationOperating System Review
COP 4225 Advanced Unix Programming Operating System Review Chi Zhang czhang@cs.fiu.edu 1 About the Course Prerequisite: COP 4610 Concepts and Principles Programming System Calls Advanced Topics Internals,
More informationSAMPLE CURRICULUM GUIDE June 2014
SAMPLE CURRICULUM GUIDE June 2014 A Level Computer Science A LEVEL REFORM CONTENTS Introduction Page 3 Year 1 Page 4 Year 2 Page 8 This resource is an exemplar of the types of materials that will be provided
More informationCS370 Operating Systems Midterm Review
CS370 Operating Systems Midterm Review Yashwant K Malaiya Fall 2015 Slides based on Text by Silberschatz, Galvin, Gagne 1 1 What is an Operating System? An OS is a program that acts an intermediary between
More informationPRINCIPLES OF COMPILER DESIGN UNIT I INTRODUCTION TO COMPILERS
Objective PRINCIPLES OF COMPILER DESIGN UNIT I INTRODUCTION TO COMPILERS Explain what is meant by compiler. Explain how the compiler works. Describe various analysis of the source program. Describe the
More informationInstruction Set Architecture
Computer Architecture Instruction Set Architecture Lynn Choi Korea University Machine Language Programming language High-level programming languages Procedural languages: C, PASCAL, FORTRAN Object-oriented
More informationCOSC160: Data Structures: Lists and Queues. Jeremy Bolton, PhD Assistant Teaching Professor
COSC160: Data Structures: Lists and Queues Jeremy Bolton, PhD Assistant Teaching Professor Outline I. Queues I. FIFO Queues I. Usage II. Implementations II. LIFO Queues (Stacks) I. Usage II. Implementations
More informationCS 406: Syntax Directed Translation
CS 406: Syntax Directed Translation Stefan D. Bruda Winter 2015 SYNTAX DIRECTED TRANSLATION Syntax-directed translation the source language translation is completely driven by the parser The parsing process
More informationCJT^jL rafting Cm ompiler
CJT^jL rafting Cm ompiler ij CHARLES N. FISCHER Computer Sciences University of Wisconsin Madison RON K. CYTRON Computer Science and Engineering Washington University RICHARD J. LeBLANC, Jr. Computer Science
More informationCS304,EC304,DCSE16, DETE16
CS304,EC304,DCSE16, DETE16 III SEMESTER DIPLOMA EXAMINATION, JANUARY-2013 MICROPROCESSOR Time: 3 Hours Max. Marks: 75 GROUP A : Answer any three questions. (Question No. 1 is compulsory) Q.1 What do you
More informationAC59/AT59/AC110/AT110 OPERATING SYSTEMS & SYSTEMS SOFTWARE DEC 2015
Q.2 a. Explain the following systems: (9) i. Batch processing systems ii. Time sharing systems iii. Real-time operating systems b. Draw the process state diagram. (3) c. What resources are used when a
More informationPrinciples of Compiler Design
Principles of Compiler Design Code Generation Compiler Lexical Analysis Syntax Analysis Semantic Analysis Source Program Token stream Abstract Syntax tree Intermediate Code Code Generation Target Program
More informationMain Points of the Computer Organization and System Software Module
Main Points of the Computer Organization and System Software Module You can find below the topics we have covered during the COSS module. Reading the relevant parts of the textbooks is essential for a
More informationChap 4, 5: Process. Dongkun Shin, SKKU
Chap 4, 5: Process 1 Process Concept Job A bundle of program and data to be executed An entity before submission for execution Process (= running program) An entity that is registered to kernel for execution
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 10 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Chapter 6: CPU Scheduling Basic Concepts
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 Lecture 8 Threads and Scheduling Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ How many threads
More informationB. the address of the data is supplied by the users C. there is no need for an address i.e. the data is used as an address
1. The part of machine level instruction, which tells the central processor what has to be done, is A. Operation code B. Address C. Locator D. Flip-Flop 2. Which of the following refers to the associative
More informationCSCE Introduction to Computer Systems Spring 2019
CSCE 313-200 Introduction to Computer Systems Spring 2019 Operating Systems Dmitri Loguinov Texas A&M University January 22, 2019 1 Chapter 2: Book Overview Lectures skip chapter 1 Mostly 312 background
More informationPart III : Parsing. From Regular to Context-Free Grammars. Deriving a Parser from a Context-Free Grammar. Scanners and Parsers.
Part III : Parsing From Regular to Context-Free Grammars Deriving a Parser from a Context-Free Grammar Scanners and Parsers A Parser for EBNF Left-Parsable Grammars Martin Odersky, LAMP/DI 1 From Regular
More informationCS 415 Midterm Exam Spring SOLUTION
CS 415 Midterm Exam Spring 2005 - SOLUTION Name Email Address Student ID # Pledge: This exam is closed note, closed book. Questions will be graded on quality of answer. Please supply the best answer you
More informationLECTURE 3:CPU SCHEDULING
LECTURE 3:CPU SCHEDULING 1 Outline Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time CPU Scheduling Operating Systems Examples Algorithm Evaluation 2 Objectives
More informationMemory: Overview. CS439: Principles of Computer Systems February 26, 2018
Memory: Overview CS439: Principles of Computer Systems February 26, 2018 Where We Are In the Course Just finished: Processes & Threads CPU Scheduling Synchronization Next: Memory Management Virtual Memory
More informationUNIT 3
UNIT 3 Presentation Outline Sequence control with expressions Conditional Statements, Loops Exception Handling Subprogram definition and activation Simple and Recursive Subprogram Subprogram Environment
More informationCPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University
Operating Systems (Fall/Winter 2018) CPU Scheduling Yajin Zhou (http://yajin.org) Zhejiang University Acknowledgement: some pages are based on the slides from Zhi Wang(fsu). Review Motivation to use threads
More informationCHAPTER 2: PROCESS MANAGEMENT
1 CHAPTER 2: PROCESS MANAGEMENT Slides by: Ms. Shree Jaswal TOPICS TO BE COVERED Process description: Process, Process States, Process Control Block (PCB), Threads, Thread management. Process Scheduling:
More informationCIS Operating Systems Memory Management. Professor Qiang Zeng Fall 2017
CIS 5512 - Operating Systems Memory Management Professor Qiang Zeng Fall 2017 Previous class Uniprocessor policies FCFS, Shortest Job First Round Robin Multilevel Feedback Queue Multiprocessor policies
More informationIntroduction to Operating Systems. Chapter Chapter
Introduction to Operating Systems Chapter 1 1.3 Chapter 1.5 1.9 Learning Outcomes High-level understand what is an operating system and the role it plays A high-level understanding of the structure of
More informationUNIT:2. Process Management
1 UNIT:2 Process Management SYLLABUS 2.1 Process and Process management i. Process model overview ii. Programmers view of process iii. Process states 2.2 Process and Processor Scheduling i Scheduling Criteria
More informationOPERATING SYSTEM. Functions of Operating System:
OPERATING SYSTEM Introduction: An operating system (commonly abbreviated to either OS or O/S) is an interface between hardware and user. OS is responsible for the management and coordination of activities
More informationVirtual Machine. Part II: Program Control. Building a Modern Computer From First Principles.
Virtual Machine Part II: Program Control Building a Modern Computer From First Principles www.nand2tetris.org Elements of Computing Systems, Nisan & Schocken, MIT Press, www.nand2tetris.org, Chapter 8:
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 information8. The use of multiple register windows with overlap causes a reduction in the number of
1. A full binary tree with n leaves contains? 2. The expression 1*2^3*4^5*6 will be evaluated as? 3. The feature in object oriented programming that follows he same operation to be carried out differently,depending
More informationAn Overview to Compiler Design. 2008/2/14 \course\cpeg421-08s\topic-1a.ppt 1
An Overview to Compiler Design 2008/2/14 \course\cpeg421-08s\topic-1a.ppt 1 Outline An Overview of Compiler Structure Front End Middle End Back End 2008/2/14 \course\cpeg421-08s\topic-1a.ppt 2 Reading
More informationCSCI 1800 Cybersecurity and International Relations. Computer Hardware & Software John E. Savage Brown University
CSCI 1800 Cybersecurity and International Relations Computer Hardware & Software John E. Savage Brown University Overview Introduction computer design Central Processing Unit (CPU) Random Access Memory
More informationContext-Free Grammar. Concepts Introduced in Chapter 2. Parse Trees. Example Grammar and Derivation
Concepts Introduced in Chapter 2 A more detailed overview of the compilation process. Parsing Scanning Semantic Analysis Syntax-Directed Translation Intermediate Code Generation Context-Free Grammar A
More information