SIR MICHELANGELO REFALO

Size: px
Start display at page:

Download "SIR MICHELANGELO REFALO"

Transcription

1 SIR MICHELANGELO REFALO SIXTH FORM Annual Exam 2014 Name: COMPUTING ADV 2 ND 3hrs Section A This question is Compulsory of 16 marks Consider carefully the following 2 classes and answer the related questions below: public abstract class SuperClass{ public SuperClass(){ System.out.println( super class: constructor ); public void methodx(){ System.out.println( super class: methodx ); public class SubClass extends SuperClass(){ static int n=0; int id; public SubClass(int num){ super(); System.out.println( sub class: constructor ); id = ++n; public void methoda(int num){ System.out.println( sub class: methoda + num); System.out.println( line 2 sub class: method + id); Page 1 of 11

2 public void methoda(){ System.out.println( sub class: methoda ); System.out.println( line 2 sub class: method + id); a. What will be the output when the below code is executed: public static void main(string[] gahan){ SubClass sub = new SubClass(3); sub.methoda(4); sub.methodx(); [4 marks] b. Explain why the code will not be executed. Modify is so that it will execute and display the output. public static void main(string[] kokroces){ SuperClass sup = new SubClass(3); SubClass sub2 = superclass; [marks 4] c. What will be the output when the below code is executed: public static void main(string[] miskinilgemel){ SubClass sub = new SubClass(3); SubClass sub1 = new SubClass(3); SubClass sub2 = new SubClass(3); sub.methoda(69); sub1.methoda(); sub2.methoda(); [marks 4] Page 2 of 11

3 Section B Answer ONLY 7 questions of 14 marks each. Question 1 Digital Logic A box contains red and white balls. Four balls are drawn in succession from the box. If the outcome of this event results in three or four of the balls drawn being of the same colour, it is called a success. Otherwise it is a failure. a. For the four balls drawn, named A, B, C, D work out the logic truth table that has an output F. 1 for success and 0 for failure. [7 marks] b. Set up a suitable Karnaugh map [3 marks] c. Draw the Logic circuit. d. Use Boolean algebra to show that ((XW) + (XZ) ) = XWZ Page 3 of 11

4 Question 2 Computer Architecture a. Name the three main buses of a computer. State and explain in detail how the bus size can affect computer performance and how. [3 marks] b. Differentiate between Synchronous and Asynchronous data communication. c. Explain the characteristics of SRAM and DRAM in regards of computer s memory. d. The computer has to communicate with its IO (input or output) using two different IO addressing. Name and explain these 2 different IO addressing. e. With regards to speed, width and function compare and contrast AGP, PCI and PCI- X. f. What is the use of the DMA? [1 mark] g. With regards to CPU instruction set compare and contrast RISC and CISC. [2marks] Page 4 of 11

5 Question 3 Assembly Language a. An instruction of assembly is made into 2 parts. Name the parts and state the use of each part. b. Some registers are of 2 or more bytes having High order bits and low order bits. What are high order and low order bits in relationship to assembly instructions? c. Below is part of main memory: Mem Address Data What are the contents of the four memory addresses after the execution of the following instructions? MOV R1, #02; put 2 in R1 MOV R2, 401; put 401 in R2 ADD R2, R1; add R1 to R2 result in R2 MOV (R2), R1; put R1 to memory, using R2 as a register indirect memory address d. Explain in detail the four stages of the assembly process. [4 marks] e. State the differences between: cross assembler, macro assembler, and meta assembler.[4 marks] Page 5 of 11

6 Question 4 Operating Systems a. What is the difference between the following types of OSes: Online, Real-Time and network? b. Explain the 3 states a process can be during it execution. In case the OS is single task not multi task will there be different states for a process? c. Name and explain 2 different CPU scheduling algorithms. d. What is deadlock and how can the OS detects or avoid? e. Contiguous Memory can be partitioned using fixed or variable partition. Explain fixed and variable partition in relationship to contiguous memory. Mention also the drawbacks in each method. f. What are pages and page frames in relationship to non-contiguous memory? What is the use of the PMT table? [2marks] g. Files on disc can be stored using: o Contiguous blocks o Linked blocks o Indexed Explain the above types of storage files systems. Page 6 of 11

7 Question 5 Networking and Communications a. When data is being transferred from one point to another in a network, transmission errors may arise. Describe 2 commonly used methods that help detect such errors and state how errors are corrected b. In detail explain the OSI model. c. What is the TCP/IP protocol and where is it used? d. Differentiate between bit rate, baud rate and bandwidth? e. What are modems and explain the following modulation in terms of modems: amplitude frequency phase pulse coded (PCM) f. Compare and contrast TDM with FDM in terms of multiplexing. g. In terms of media access methods with is CSMA/CD? Page 7 of 11

8 Question 6 Language Translators a. What are the differences between formal and natural languages? Why cannot natural languages be used in order to describe the syntax of a PL (programming language)?[2marks] b. Name two different ways how we can represent the syntax of a PL? Give appropriate examples. c. Write the syntax using BNF for a valid Maltese post code (e.g. KIK letters followed by 4 numbers) d. What is the difference between syntax and semantics? e. What is parsing and in what stage of compilation does parsing occur? f. Write the stages of compilation and explain in detail each stage. g. If the rules of precedence are ignored, this expression, W Z * X, can be evaluated in 2 different ways. Use a BST to evaluate/parse the possible combinations of this expression. Also state why this expression is Ambiguous. Page 8 of 11

9 Question 7 Systems Analysis and Design a. Compare and contrast RAD with waterfall? b. What is UML and how can class diagrams help in designing a computer system? [2 marks] c. DFDs are very useful in System analysis. What are DFDs and state their use. d. HIPO and JSP are two algorithm representation forms. Explain these two forms and give a simple example of each. [3 marks] e. Name three types of software maintenance. [3 marks] f. Differentiate between White box Testing and Black Box Testing. Page 9 of 11

10 Question 8 Databases A shipping agency ShipAnywhere processes and has information about the current location of each shipped item. Shipped items are tracked using a special tracking information system. Item shipped are characterized by Item ID (unique and not null), dimensions, weight, insurance value, destination address and delivery date. Shipped item are inputted into the system at the company headquarters/centres. Company centres are characterised by ID, address and type. Shipped items are delivered either by flight or truck. These transportation events are characterised by Schedule ID, type (flight or truck) and delivery route. a. Use a standard notation to represent the entities described above. Clearly identify the primary key and attributes for each table: Entity (attrb 1, attrb2 attrbn) [4 marks] b. Draw and E-R diagram representing the above database with its relationships. [4 marks] c. SQL can be categorised in 3 sections in Databases. Name and Explain the 3 categories.. [6 marks] Page 10 of 11

11 Question 9 Data Structures and Algorithms a. Show and describe, step by step, how the quick sort algorithm sorts the flowing list of integers. (show the steps in a table) [4 marks] 66,97,89,10,92,8 b. State the complexity of this algorithm in Best case, average and worst case d. What can be a worst case scenario for quick sort. c. A binary search tree is a special data structure. Explain in detail and using examples the conditions required to make a correct BST. e. Use a BST below to traverse it and output the data in pre-order, post-order and inorder. [4 marks] Page 11 of 11

SIR MICHELANGELO REFALO SIXTH FORM

SIR MICHELANGELO REFALO SIXTH FORM SIR MICHELANGELO REFALO SIXTH FORM Annual Exam 2016 Subject: Computer Advanced Time: 3 hours 1. System modularisation refers to dividing a system into smaller pieces explain a. What makes a good module?

More information

SIR MICHELANGELO REFALO

SIR MICHELANGELO REFALO SIR MICHELANGELO REFALO SIXTH FORM Annual Exam 2014 Subject: Computing ADV 1st Time: 3Hrs Section A Answer all Questions, No Calculators allowed. 1. Write a Boolean expression represented by this Karnaugh

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75 M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 First Year Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY (DMSIT01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer

More information

Syllabus for Computer Science General Part I

Syllabus 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 information

public static void main(string args[]) { Circle c = new Circle (5.0); System.out.println ("Area is " + c.getarea());

public static void main(string args[]) { Circle c = new Circle (5.0); System.out.println (Area is  + c.getarea()); May 2014 Computing Advanced Paper 1 Question 1 a. Area is 0.0 b. One solution is the following: public class Circle { private double radius; public Circle (double r) { radius = r; } public double getarea

More information

UNIVERSITY OF MALTA THE MATRICULATION CERTIFICATE EXAMINATION ADVANCED LEVEL. COMPUTING May 2011 MARKING SCHEME

UNIVERSITY OF MALTA THE MATRICULATION CERTIFICATE EXAMINATION ADVANCED LEVEL. COMPUTING May 2011 MARKING SCHEME UNIVERSITY OF MALTA THE MATRICULATION CERTIFICATE EXAMINATION ADVANCED LEVEL COMPUTING May 2011 MARKING SCHEME MATRICULATION AND SECONDARY EDUCATION CERTIFICATE EXAMINATIONS BOARD PAPER I 1. XW + XZ =

More information

«Computer Science» Requirements for applicants by Innopolis University

«Computer Science» Requirements for applicants by Innopolis University «Computer Science» Requirements for applicants by Innopolis University Contents Architecture and Organization... 2 Digital Logic and Digital Systems... 2 Machine Level Representation of Data... 2 Assembly

More information

Learning objectives. Computer principles The characteristics of contemporary processors, input, output and storage devices

Learning 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 information

Since ESE GATE PSUs ELECTRICAL ENGINEERING COMPUTER FUNDAMENTALS. Volume - 1 : Study Material with Classroom Practice Questions

Since ESE GATE PSUs ELECTRICAL ENGINEERING COMPUTER FUNDAMENTALS. Volume - 1 : Study Material with Classroom Practice Questions Since 20 ESE GATE PSUs ELECTRICAL ENGINEERING COMPUTER FUNDAMENTALS Volume - : Study Material with Classroom Practice Questions Computer Fundamentals (Solutions for Classroom Practice Questions). Number

More information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year INFORMATION TECHNOLOGY.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year INFORMATION TECHNOLOGY. (DMSIT01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year INFORMATION TECHNOLOGY Basics of IT Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15

More information

ADMINISTRATIVE MANAGEMENT COLLEGE

ADMINISTRATIVE 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 information

COMPUTER SCIENCE Paper 1

COMPUTER SCIENCE Paper 1 COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------

More information

Fundamental of I.T. (c) Application of computer *************

Fundamental of I.T. (c) Application of computer ************* Paper I Fundamental of I.T 1. What is an output device? Discuss the type of output device used in computer. 2. What is Secondary memory? Discuss the type of secondary memory used in computer. 3. Explain

More information

UNIVERSITY OF MALTA THE MATRICULATION EXAMINATION ADVANCED LEVEL. COMPUTING May 2016 EXAMINERS REPORT

UNIVERSITY OF MALTA THE MATRICULATION EXAMINATION ADVANCED LEVEL. COMPUTING May 2016 EXAMINERS REPORT UNIVERSITY OF MALTA THE MATRICULATION EXAMINATION ADVANCED LEVEL COMPUTING May 2016 EXAMINERS REPORT MATRICULATION AND SECONDARY EDUCATION CERTIFICATE EXAMINATIONS BOARD Computing Advanced Level May 2016

More information

UNIT I BASIC STRUCTURE OF COMPUTERS Part A( 2Marks) 1. What is meant by the stored program concept? 2. What are the basic functional units of a

UNIT I BASIC STRUCTURE OF COMPUTERS Part A( 2Marks) 1. What is meant by the stored program concept? 2. What are the basic functional units of a UNIT I BASIC STRUCTURE OF COMPUTERS Part A( 2Marks) 1. What is meant by the stored program concept? 2. What are the basic functional units of a computer? 3. What is the use of buffer register? 4. Define

More information

M.Sc. (CS) Second Semester Examination (Year 2016) Data Structures & Algorithms Subject Code: MSC-201 Paper Code: TMT-141

M.Sc. (CS) Second Semester Examination (Year 2016) Data Structures & Algorithms Subject Code: MSC-201 Paper Code: TMT-141 Time : 10 Minutes M.Marks : 10 M.Sc. (CS) Second Semester Examination (Year 2016) Data Structures & Algorithms Subject Code: MSC-201 Paper Code: TMT-141 Section A (Objective Type Questions) Roll No. Enrollment

More information

FAQ: Classes & Objects

FAQ: Classes & Objects Question 1: How do I define a class as a data type? Answer 1: Data types in Java can be simple data types such as integers and floating point numbers. Data types can also be complex, collecting many different

More information

2c. Content of Computer systems (Component 01)

2c. 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 information

Exam Duration: 2hrs and 30min Software Design

Exam 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 information

SECONDARY SCHOOL, L-IMRIEĦEL HALF YEARLY EXAMINATIONS 2016/2017

SECONDARY SCHOOL, L-IMRIEĦEL HALF YEARLY EXAMINATIONS 2016/2017 SECONDARY SCHOOL, L-IMRIEĦEL HALF YEARLY EXAMINATIONS 2016/2017 YEAR: 10 Computing Time: 1½ Hr. Name: Class: Instructions: 1. Answer all the questions in the space provided on this paper. 2. Calculators

More information

COMPUTER SCIENCE PAPER 1

COMPUTER SCIENCE PAPER 1 COMPUTER SCIENCE PAPER 1 (THEORY) (Maximum Marks: 70) (Time allowed: Three hours) (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time.)

More information

2. This Question Booklet contains nine questions. Answer any SIX questions.

2. This Question Booklet contains nine questions. Answer any SIX questions. PROGRESSIVE COMPREHENSIVE HIGH SCHOOL (PCHS) MANKON, BAMENDA 14 FEBRUARY 2014 ADVANCED LEVEL Subject/Code: Computer Science 795 Paper N Paper 2 Examiner DZEUGANG Placide TIME ALLOWED: 2 hours INSTRUCTIONS

More information

COURSE OUTLINE & WEEK WISE BREAKAGE

COURSE OUTLINE & WEEK WISE BREAKAGE COURSE OUTLINE & WEEK WISE BREAKAGE Week wise Course outline of Computer Fundamentals & Programming (CE-100) 3+1 (Batch 2018-Electronic Engineering) Dated: 13-12-2017 Course Coordinator: Saeed Azhar WEEK

More information

Syllabi of the Comprehensive Examination in Computer Science

Syllabi 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 information

ECE550 PRACTICE Final

ECE550 PRACTICE Final ECE550 PRACTICE Final This is a full length practice midterm exam. If you want to take it at exam pace, give yourself 175 minutes to take the entire test. Just like the real exam, each question has a point

More information

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

CIS 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 information

ii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define X-NOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034

ii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define X-NOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034 No. of Printed Pages : 4 Roll No.... rd 3 Sem. / ECE Subject : Digital Electronics - I SECTION-A Note: Very Short Answer type questions. Attempt any 15 parts. (15x2=30) Q.1 a) Define analog signal. b)

More information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Total 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 information

Computing Science 115 Final Examination April 23, 2002 Section: B2 BASU. Please put student id on last page. Instructions:

Computing Science 115 Final Examination April 23, 2002 Section: B2 BASU. Please put student id on last page. Instructions: Computing Science 115 Final Examination April 23, 2002 Section: B2 BASU Last Name: First Name: Please put student id on last page Instructions: The time for this test is 3 hrs. No references or calculators

More information

Computer Science Paper 1 (Theory) Part I While working questions in this part, indicate briefly your working and reasoning wherever required.

Computer Science Paper 1 (Theory) Part I While working questions in this part, indicate briefly your working and reasoning wherever required. Computer Science Paper 1 (Theory) Part I While working questions in this part, indicate briefly your working and reasoning wherever required. Question 1. a) Using truth table, verify the following expression:

More information

Quiz for Chapter 6 Storage and Other I/O Topics 3.10

Quiz for Chapter 6 Storage and Other I/O Topics 3.10 Date: 3.10 Not all questions are of equal difficulty. Please review the entire quiz first and then budget your time carefully. Name: Course: 1. [6 points] Give a concise answer to each of the following

More information

CS 110 Practice Final Exam originally from Winter, Instructions: closed books, closed notes, open minds, 3 hour time limit.

CS 110 Practice Final Exam originally from Winter, Instructions: closed books, closed notes, open minds, 3 hour time limit. Name CS 110 Practice Final Exam originally from Winter, 2003 Instructions: closed books, closed notes, open minds, 3 hour time limit. There are 4 sections for a total of 49 points. Part I: Basic Concepts,

More information

Answer any Five Questions. All questions carry equal marks.

Answer any Five Questions. All questions carry equal marks. PART I, PAPER I (Problem Solving and Programming) 1. What do you understand by function prototype? Differentiate between call by value and call by reference methods of parameters passing to a function

More information

N.B. These pastpapers may rely on the knowledge gained from the previous chapters.

N.B. These pastpapers may rely on the knowledge gained from the previous chapters. N.B. These pastpapers may rely on the knowledge gained from the previous chapters. 1 SEC 94-PAPER 1-Q3B Briefly explain the purpose of the PROGRAM COUNTER 2 SEC 94-PAPER 2A-Q4 (a) Why is a 16-bit 60 MHz

More information

McGill University Department of Electrical and Computer Engineering. Course ECSE-322A -- Computer Engineering. MidTerm Test Version 1 Solutions

McGill University Department of Electrical and Computer Engineering. Course ECSE-322A -- Computer Engineering. MidTerm Test Version 1 Solutions Signature: I.D. Number: Printed Name: McGill University Department of Electrical and Computer Engineering Course ECSE-322A -- Computer Engineering PLEASE NOTE CAREFULLY: MidTerm Test Version 1 Solutions

More information

IBPS SO Examination 2013 IT Officer Professional Knowledge Question Paper

IBPS SO Examination 2013 IT Officer Professional Knowledge Question Paper IBPS SO Examination 2013 IT Officer Professional Knowledge Question Paper 1. The tracks on a disk which can be accused without repositioning the R/W heads is (A) Surface (B) Cylinder (C) Cluster 2. Which

More information

History of Computing. Ahmed Sallam 11/28/2014 1

History of Computing. Ahmed Sallam 11/28/2014 1 History of Computing Ahmed Sallam 11/28/2014 1 Outline Blast from the past Layered Perspective of Computing Why Assembly? Data Representation Base 2, 8, 10, 16 Number systems Boolean operations and algebra

More information

COURSE DESCRIPTION. CS 232 Course Title Computer Organization. Course Coordinators

COURSE DESCRIPTION. CS 232 Course Title Computer Organization. Course Coordinators COURSE DESCRIPTION Dept., Number Semester hours CS 232 Course Title Computer Organization 4 Course Coordinators Badii, Joseph, Nemes 2004-2006 Catalog Description Comparative study of the organization

More information

CS2253 COMPUTER ORGANIZATION AND ARCHITECTURE 1 KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY

CS2253 COMPUTER ORGANIZATION AND ARCHITECTURE 1 KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY CS2253 COMPUTER ORGANIZATION AND ARCHITECTURE 1 KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK Sub. Code & Name: CS2253 Computer organization and architecture Year/Sem

More information

COURSE OUTCOMES OF M.Sc(IT)

COURSE OUTCOMES OF M.Sc(IT) COURSE OUTCOMES OF M.Sc(IT) Sr. No Subject Code Subject Name Sem-I CO Status Course Outcomes 1. A304101 PROGRAMMING USING C 2. A304102 FUNDAMENTALS OF COMPUTER & INFORMATION TECHNOLOGIES CO1 CO2 Understands

More information

A simple syntax-directed

A simple syntax-directed Syntax-directed is a grammaroriented compiling technique Programming languages: Syntax: what its programs look like? Semantic: what its programs mean? 1 A simple syntax-directed Lexical Syntax Character

More information

B.Tech in COMPUTER SCIENCE & ENGINEERING

B.Tech in COMPUTER SCIENCE & ENGINEERING B.Tech in COMPUTER SCIENCE & ENGINEERING Paper - 1 S.No. Unit/Topic NPTEL Link 1. DIGITAL SYSTEM DESIGN Binary Systems: Introduction to Number Systems and conversions. Arithmetic with number systems, Signed

More information

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax 7.2: Methods for defining syntax 2 What this module is about In this module we discuss: explain how functions, procedures and their related variables may be used to develop a program in a structured way,

More information

MaanavaN.Com CS1202 COMPUTER ARCHITECHTURE

MaanavaN.Com CS1202 COMPUTER ARCHITECHTURE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK SUB CODE / SUBJECT: CS1202/COMPUTER ARCHITECHTURE YEAR / SEM: II / III UNIT I BASIC STRUCTURE OF COMPUTER 1. What is meant by the stored program

More information

CSE 373 Autumn 2010: Midterm #1 (closed book, closed notes, NO calculators allowed)

CSE 373 Autumn 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Name: Email address: CSE 373 Autumn 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Instructions: Read the directions for each question carefully before answering. We may give partial

More information

https://asd-pa.perfplusk12.com/admin/admin_curric_maps_display.aspx?m=5507&c=618&mo=18917&t=191&sy=2012&bl...

https://asd-pa.perfplusk12.com/admin/admin_curric_maps_display.aspx?m=5507&c=618&mo=18917&t=191&sy=2012&bl... Page 1 of 13 Units: - All - Teacher: ProgIIIJavaI, CORE Course: ProgIIIJavaI Year: 2012-13 Intro to Java How is data stored by a computer system? What does a compiler do? What are the advantages of using

More information

a. It will output It s NOT Rover b. Class Main should be changed to the following (bold characters show the changes)

a. 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 information

(3 Hours) N.B. (1) Question No. 1 is compulsory. (2) Attempt any four from the remaining six questions. (3) Figures to the right indicate full marks.

(3 Hours) N.B. (1) Question No. 1 is compulsory. (2) Attempt any four from the remaining six questions. (3) Figures to the right indicate full marks. Q. P. Code: 30990 (3 Hours) Total Marks: 0 N.B. (1) Question No. 1 is compulsory. (2) Attempt any four from the remaining six questions. (3) Figures to the right indicate full marks. Q.1 (a) What is flowchart?

More information

Telecommunications II TEL 202 Spring, 2004

Telecommunications II TEL 202 Spring, 2004 Telecommunications II TEL 202 Spring, 2004 Time: Lecture: Thursday 12:20 3:30 Lynn Campus, Room LW207 Laboratory: Thursday 4:00 5:00 Lynn Campus, Room LE201 Instructor: Scott Stimpson Office: Lynn, W228

More information

Solution to the Problems and Questions

Solution to the Problems and Questions Solution to the Problems and Questions Chapter 1 Problems and Questions 1. Show an analog signal 2. Show a digital signal Springer International Publishing Switzerland 2015 A. Elahi, T. Arjeski, ARM Assembly

More information

SIR C R REDDY COLLEGE OF ENGINEERING

SIR C R REDDY COLLEGE OF ENGINEERING SIR C R REDDY COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY Course Outcomes II YEAR 1 st SEMESTER Subject: Data Structures (CSE 2.1.1) 1. Describe how arrays, records, linked structures,

More information

PART B UNIT II PART A

PART B UNIT II PART A SRM INSTITUTE OF SCIENCE AND TECHNOLOGY (Deemed University) DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK SUB : Microprocessor/CS201 YEAR/SEM : II/III UNIT I PART - A 1. Differentiate accumulator

More information

MCT611 Computer Architecture & Operating Systems Module Handbook. Master of Science in Software Engineering & Database Technologies (MScSED)

MCT611 Computer Architecture & Operating Systems Module Handbook. Master of Science in Software Engineering & Database Technologies (MScSED) MCT611 Computer Architecture & Operating Systems Module Handbook Master of Science in Software Engineering & Database Technologies (MScSED) Table of Contents 1 Module Details... 2 1.1 Module Description...2

More information

COMPUTER SCIENCE. Paper 1

COMPUTER SCIENCE. Paper 1 COMPUTER SCIENCE Paper 1 (THEORY) Three hours (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) ----------------------------------------------------------------------------------------------------------------------------------

More information

COP 3330 Final Exam Review

COP 3330 Final Exam Review COP 3330 Final Exam Review I. The Basics (Chapters 2, 5, 6) a. comments b. identifiers, reserved words c. white space d. compilers vs. interpreters e. syntax, semantics f. errors i. syntax ii. run-time

More information

F453. COMPUTING Advanced Computing Theory ADVANCED GCE. Thursday 23 June 2011 Morning

F453. COMPUTING Advanced Computing Theory ADVANCED GCE. Thursday 23 June 2011 Morning ADVANCED GCE COMPUTING Advanced Computing Theory F453 *F430360611* Candidates answer on the question paper. OCR supplied materials: None Other materials required: None Thursday 23 June 2011 Morning Duration:

More information

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

M.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 information

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours CE161-4-AU UNIVERSITY OF ESSEX Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE Time allowed: TWO hours The following items are provided: Graph paper (available on invigilator s desk) Candidates

More information

COMPUTER SCIENCE (ELECTIVE) Paper-A (100 Marks) Section-I: INTRODUCTION TO INFORMATION TECHNOLOGY Computer and its characteristics, Computer Organization & operation, Components of Computer, Input/Output

More information

Switching to AQA from OCR

Switching to AQA from OCR Switching to AQA from OCR This resource compares our new GCSE Computer Science specification (8520) with the new OCR Computer Science specification (J276). If you are thinking of switching from OCR to

More information

Exam 1 - (20 points)

Exam 1 - (20 points) Exam 1 - (20 points) Answer all of the following questions. READ EACH QUESTION CAREFULLY. Fill the correct bubble on your scantron sheet. Each correct answer is worth 1 point (unless otherwise stated).

More information

Class, Variable, Constructor, Object, Method Questions

Class, Variable, Constructor, Object, Method Questions Class, Variable, Constructor, Object, Method Questions http://www.wideskills.com/java-interview-questions/java-classes-andobjects-interview-questions https://www.careerride.com/java-objects-classes-methods.aspx

More information

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *7825200973* COMPUTER SCIENCE 9608/32 Paper 3 Advanced Theory October/November 2018 1 hour 30 minutes

More information

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

5. (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 information

Entrance exam - Computer Science

Entrance exam - Computer Science Entrance exam - Computer Science Name and Surname fill in the field Application No. Test Sheet No. 4 Algorithms and Data Structures 1 Consider a hash table with linear probing, and the hash function h(x)

More information

3. (a) Explain the steps involved in the Interfacing of an I/O device (b) Explain various methods of interfacing of I/O devices.

3. (a) Explain the steps involved in the Interfacing of an I/O device (b) Explain various methods of interfacing of I/O devices. Code No: R05320202 Set No. 1 1. (a) Discuss the minimum mode memory control signals of 8086? (b) Explain the write cycle operation of the microprocessor with a neat timing diagram in maximum mode. [8+8]

More information

AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS

AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS PAUL L. BAILEY Abstract. This documents amalgamates various descriptions found on the internet, mostly from Oracle or Wikipedia. Very little of this

More information

Chapter 1: Introduction

Chapter 1: Introduction EE4272: Computer Networks Chapter 1: Introduction Instructor: Tricia Chigan Dept.: Elec. & Comp. Eng. 1) Data Communications: Deals with the transmission of signals in a reliable & efficient manner. Topics:

More information

Honorary Professor Supercomputer Education and Research Centre Indian Institute of Science, Bangalore

Honorary Professor Supercomputer Education and Research Centre Indian Institute of Science, Bangalore COMPUTER ORGANIZATION AND ARCHITECTURE V. Rajaraman Honorary Professor Supercomputer Education and Research Centre Indian Institute of Science, Bangalore T. Radhakrishnan Professor of Computer Science

More information

Total Score /1 /20 /41 /15 /23 Grader

Total Score /1 /20 /41 /15 /23 Grader NAME: NETID: CS2110 Spring 2015 Prelim 2 April 21, 2013 at 5:30 0 1 2 3 4 Total Score /1 /20 /41 /15 /23 Grader There are 5 questions numbered 0..4 on 8 pages. Check now that you have all the pages. Write

More information

Syllabi & Scheme of Examination BCA-2 nd Year. Website:-

Syllabi & Scheme of Examination BCA-2 nd Year. Website:- Syllabi & Scheme of Examination BCA-2 nd Year Website:- www.cdlu.ac.in SCHEME OF EXMINATION University Centre for Distance Learning BCA - II Paper Code Course Nomenclature Ext. Inter. Min. Pass Time Ass.

More information

Computer Organisation CS303

Computer Organisation CS303 Computer Organisation CS303 Module Period Assignments 1 Day 1 to Day 6 1. Write a program to evaluate the arithmetic statement: X=(A-B + C * (D * E-F))/G + H*K a. Using a general register computer with

More information

PROGRAMMING FUNDAMENTALS

PROGRAMMING FUNDAMENTALS PROGRAMMING FUNDAMENTALS Q1. Name any two Object Oriented Programming languages? Q2. Why is java called a platform independent language? Q3. Elaborate the java Compilation process. Q4. Why do we write

More information

Programming Lecture 3

Programming Lecture 3 Programming Lecture 3 Expressions (Chapter 3) Primitive types Aside: Context Free Grammars Constants, variables Identifiers Variable declarations Arithmetic expressions Operator precedence Assignment statements

More information

COMPUTER SCIENCE TRIPOS Part II (General) DIPLOMA IN COMPUTER SCIENCE

COMPUTER SCIENCE TRIPOS Part II (General) DIPLOMA IN COMPUTER SCIENCE CST.2001.10.1 COMPUTER SCIENCE TRIPOS Part II (General) DIPLOMA IN COMPUTER SCIENCE Monday 4 June 2001 1.30 to 4.30 Paper 10 (Paper 1 of Diploma in Computer Science) Answer five questions. Submit the answers

More information

Arrays Classes & Methods, Inheritance

Arrays Classes & Methods, Inheritance Course Name: Advanced Java Lecture 4 Topics to be covered Arrays Classes & Methods, Inheritance INTRODUCTION TO ARRAYS The following variable declarations each allocate enough storage to hold one value

More information

COA. Prepared By: Dhaval R. Patel Page 1. Q.1 Define MBR.

COA. Prepared By: Dhaval R. Patel Page 1. Q.1 Define MBR. Q.1 Define MBR. MBR( Memory buffer register) A Memory Buffer Register (MBR) is the register in a computers processor that stores the data being transferred to and from the devices It allowing the processor

More information

CSE 373 Spring 2010: Midterm #1 (closed book, closed notes, NO calculators allowed)

CSE 373 Spring 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Name: Email address: CSE 373 Spring 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Instructions: Read the directions for each question carefully before answering. We may give partial

More information

This paper consists of 27 pages and the instructions for the completion of a mark-reading sheet.

This paper consists of 27 pages and the instructions for the completion of a mark-reading sheet. This paper consists of 27 pages and the instructions for the completion of a mark-reading sheet. Please complete the attendance register on the back page, tear it off and hand it to the invigilator. Instructions:

More information

Chapter - 7. Multiplexing and circuit switches

Chapter - 7. Multiplexing and circuit switches Chapter - 7 Multiplexing and circuit switches Multiplexing Multiplexing is used to combine multiple communication links into a single stream. The aim is to share an expensive resource. For example several

More information

Chapter Overview. Assembly Language for Intel-Based Computers, 4 th Edition. Chapter 1: Basic Concepts. Printing this Slide Show

Chapter Overview. Assembly Language for Intel-Based Computers, 4 th Edition. Chapter 1: Basic Concepts. Printing this Slide Show Assembly Language for Intel-Based Computers, 4 th Edition Kip R. Irvine Chapter 1: Basic Concepts Chapter Overview Welcome to Assembly Language Virtual Machine Concept Data Representation Boolean Operations

More information

Prelim One Solution. CS211 Fall Name. NetID

Prelim One Solution. CS211 Fall Name. NetID Name NetID Prelim One Solution CS211 Fall 2005 Closed book; closed notes; no calculators. Write your name and netid above. Write your name clearly on each page of this exam. For partial credit, you must

More information

Chapter 02: Computer Organization Functional units and components in a computer organization Part 3 Bus Structures

Chapter 02: Computer Organization Functional units and components in a computer organization Part 3 Bus Structures Chapter 02: Computer Organization Functional units and components in a computer organization Part 3 Bus Structures Objective: Understand the IO Subsystem and Understand Bus Structures Understand the functions

More information

CS/B.TECH/CSE(OLD)/SEM-6/CS-605/2012 OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70

CS/B.TECH/CSE(OLD)/SEM-6/CS-605/2012 OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70 CS/B.TECH/CSE(OLD)/SEM-6/CS-605/2012 2012 OBJECT ORIENTED PROGRAMMING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers

More information

CS 12 Fall 2003 Solutions for mid-term exam #2

CS 12 Fall 2003 Solutions for mid-term exam #2 CS 12 Fall 2003 Solutions for mid-term exam #2 1. (10 points) Compilers and interpreters Provide short answers (a few sentences at most) to the following questions. (a) What is the difference between a

More information

CS 231 Data Structures and Algorithms, Fall 2016

CS 231 Data Structures and Algorithms, Fall 2016 CS 231 Data Structures and Algorithms, Fall 2016 Dr. Bruce A. Maxwell Department of Computer Science Colby College Course Description Focuses on the common structures used to store data and the standard

More information

Code No: R Set No. 1

Code 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 information

Getting started with Java

Getting started with Java Getting started with Java Magic Lines public class MagicLines { public static void main(string[] args) { } } Comments Comments are lines in your code that get ignored during execution. Good for leaving

More information

ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY

ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY Question 1. a) State the two absorption laws. Verify any one of them using truth table. b) Reduce the following expression : F(A,B,C)= (0,1,2,3,4,5,6,7) Also find

More information

Introduction to Programming Using Java (98-388)

Introduction 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 information

Computer Science II (20073) Week 1: Review and Inheritance

Computer Science II (20073) Week 1: Review and Inheritance Computer Science II 4003-232-01 (20073) Week 1: Review and Inheritance Richard Zanibbi Rochester Institute of Technology Review of CS-I Hardware and Software Hardware Physical devices in a computer system

More information

Master of Computer Application (MCA) Semester III MC0071 Software Engineering 4 Credits

Master of Computer Application (MCA) Semester III MC0071 Software Engineering 4 Credits MC0071 Software Engineering 4 Credits (Book ID: B0808 & B0809) Assignment Set 1 (60 Marks) Each question carries six marks 10 x 6 = 60 1. What do you understand by information determinacy?. Why is it inappropriate

More information

CISC 3115 Modern Programming Techniques Spring 2018 Section TY3 Exam 2 Solutions

CISC 3115 Modern Programming Techniques Spring 2018 Section TY3 Exam 2 Solutions Name CISC 3115 Modern Programming Techniques Spring 2018 Section TY3 Exam 2 Solutions 1. a. (25 points) A rational number is a number that can be represented by a pair of integers a numerator and a denominator.

More information

JAIPUR NATIONAL UNIVERSITY, JAIPUR

JAIPUR NATIONAL UNIVERSITY, JAIPUR Paper Code: MCA - 101 Paper Title: Fundamental of Computer Master of Computer Application (MCA) (i) Differentiate between data and information. Which is more useful to the people and why? (ii) Explain

More information

DATA COMMUNICATIONS AND DISTRIBUTED NETWORKS

DATA COMMUNICATIONS AND DISTRIBUTED NETWORKS DATA COMMUNICATIONS AND DISTRIBUTED NETWORKS UYLESS D. BLACK CONTENTS PREFACE xv 1 INTRODUCTION 1 Purpose of Data Communications Systems and Networks 1 Purpose of Data Communications Systems 2 The Components

More information

Assembly Language for Intel-Based Computers, 4 th Edition. Chapter 1: Basic Concepts. Chapter Overview. Welcome to Assembly Language

Assembly Language for Intel-Based Computers, 4 th Edition. Chapter 1: Basic Concepts. Chapter Overview. Welcome to Assembly Language Assembly Language for Intel-Based Computers, 4 th Edition Kip R. Irvine Chapter 1: Basic Concepts Slides prepared by Kip R. Irvine Revision date: 09/15/2002 Chapter corrections (Web) Printing a slide show

More information

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular

More information

7/28/ Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc.

7/28/ Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc. Technology in Action Technology in Action Chapter 9 Behind the Scenes: A Closer Look a System Hardware Chapter Topics Computer switches Binary number system Inside the CPU Cache memory Types of RAM Computer

More information

Time : 03 Hours Maximum Marks : 75

Time : 03 Hours Maximum Marks : 75 (DMSIT 01) Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY Answer any Three of the following 1) Define IT. Enumerate various IT trends and their benefits to the organizations. 2) Bring

More information