free download pnu pdf file from

Size: px
Start display at page:

Download "free download pnu pdf file from"

Transcription

1 : : : : ( ) -1 Const i : integer = 13; Const integer i = 13; Const i = 13; Const i := 13; (90 shr 3 mod 2 * 3-1) a:=10; b:=13; a := a xor b; b := a xor b; a := a xor b; -3. b a. b a. a b. b a writeln ('36 DIV 5') DIV Writeln (int (31.378) : 5); E /

2 : : : : ( ) program test; i,j,s: integer; s := 0; for i := 1 to 100 do for j := 1 to i do; s := s+1; writeln(s); Var a : array [false..true] of string; n : integer; readln (n); a[false] := 'False Message'; a[true] := 'True Message; write (a [n mod 2 = 1]); 7-7 False False Message True True Message 12 2 free download pnu pdf file from

3 : : : : ( ) for i := 0 to 3 do write ( i = i); = 3, 2=2, 1=1, 0 = 0. i = i. true a:=5; b:=8; while ((a<b) and (a mod 3 <> 1)) do a:=a+1; writeln(a); -9 a:=5; b:=8; Repeat a:=a+1; Until ((a<=b) or (a mod 3 <> 1)); writeln(a); a:=5; b:=8; Repeat a:=a+1; Until ((a>=b) and (a mod 3 = 1)); writeln(a); a:=5; b:=8; Repeat a:=a+1; Until ((a<=b) or (a mod 3 = 1)); writeln(a); a:=5; b:=8; Repeat a:=a+1; Until ((a>=b) or (a mod 3 = 1)); writeln(a); 12 3

4 : : : : ( ) sum := 0; for i := 1 to 20 do for j := i downto 1 do sum := sum + 1; sum := sum - 1; write(sum); program test; st: string; i: integer; st := 'PascalBook'; -11 for i := 1 to length(st) do delete(st,i,1); writeln (st);. st aclok aclbok 12 4

5 : : : : ( ) -12 program test; i : integer; while(i<5) do if (i mod 2 = 0) then continue; write(i:2); i := i + 1;

6 : : : : ( ) program test; a: array[1..6,1..6] of integer; i,j,sum : integer; for i:= 1 to 6 do for j := 1 to 6 do if i<j then continue; a[i,j] := j; sum := 0; for i := 1 to 6 do sum := sum + a[i,2]; write(sum);

7 : : : : ( ) program test; i: integer; procedure p1( k: integer); k := K - 2; p2(k); procedure p2(n: integer); n := n + 1; write(n); i := 3; p1(i); write(i);

8 : : : : ( ) 10 1 for i := 1 to 10 do write (i:3); i := a[i]; a n for i := n downto 2 do (?) if (a[j]>a[j+1]) then tmp := a[j]; a[j] := a[j+1]; a[j+1] := tmp; -16 for j := 1 to i do for j := 1 to n do for j := 1 to n-i do for j := 1 to i-1 do 12 8

9 : : : : ( ) 65 A 98 b -17 D d E C program test; a,b,c: integer; procedure p1( a: integer; b: integer; d: integer); c: integer; c := 5; a := d + c; b := a + b; d := b + c; a := 5; b := 8; c := 4; p1(b,c,a); writeln('a=',a,'b=',b,'c=',c); a = 19 b= 10 c = 4-18 a = 10 b= 8 c = 5 a = 5 b= 14 c = 4 a = 10 b= 8 c =

10 : : : : ( ) function f(m,n: integer) : integer; if m mod n = 0 then f := n else f := f(n,m mod n); -19. n m. n m. n m. n m str := 'this is a book'; delete (str, pos('is', str), 3); insert ('are', str, pos ('is', str)); write (str); -20 thare is a book this are a book this isare a book thareis a book type day_type = (sat,sun,mon,tue,wed,thu,fri); c : array [day_type] of day_type; -21 c[succ(sun)] := fri; c[sat] := 'sun'; c['tue'] := 'wed'; c['fri'] := mon; 12 10

11 : : : : ( ) < > <>. student type person = record name : string[20]; family : string[20]; age : byte; student = record m : person; id : longint; in_year : word; Blockread filesize Seekoln Assign Assign

12 : : : : ( ),. ( n ) ( 5 * n ) * * * * * * * * * * * * * * * * * * * * * * * * -1,, ,, * ). mat.txt ( free download pnu pdf file from

13 يلک تيعضو حيحص خساپ ب فلا لاوس هرامش فلا فلا ب ب فلا ب فلا ب ب ب 25 free download pnu pdf file from

14 : : : : ( ) -١program star; n, j, iinteger; : readln( n ); j:= ( n *2) -1; for i:=1 to n do for j:=1 to i do write ('*': j-2* i +2) ; writeln;,, 350 ( ). -2,,, 350 ( ) -3 ( ) free download pnu pdf file from

15 سایت مرع انشوی پیام نور نمونه سواالت پیام نور : بیش از 110 هزار نمونه سوال همراه با پاسخنامه تستی و تشریحی کتاب زوه و خالصه روس برنامه امتحانات منابع و لیست روس هر ترم انلو کامال رایگان بیش از 140 هزار فایل مختص انشویان پیام نور

{ -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '84 } { -- PASCAL PROGRAM SOLUTIONS }

{ -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '84 } { -- PASCAL PROGRAM SOLUTIONS } { -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '84 } { -- PASCAL PROGRAM SOLUTIONS } {1.1} program One1T84; { -- This program produces a table of Fahrenheit for Celcius. } C: Integer; Writeln ('CELCIUS

More information

COMPUTER SCIENCES II Spring Term 2017 Asst.Prof.Elgin KILIÇ

COMPUTER SCIENCES II Spring Term 2017 Asst.Prof.Elgin KILIÇ COMPUTER SCIENCES II Spring Term 2017 Asst.Prof.Elgin KILIÇ TURBO PASCAL WEEK 2 DECLARATION BLOCKS in DETAIL Uses There default sub pascal programs called UNITS which are already embedded in pascal editor.

More information

Quick Reference Guide

Quick Reference Guide SOFTWARE AND HARDWARE SOLUTIONS FOR THE EMBEDDED WORLD mikroelektronika Development tools - Books - Compilers Quick Reference Quick Reference Guide with EXAMPLES for Pascal language This reference guide

More information

A/L 2011_revision. PASCAL PROGRAMMING

A/L 2011_revision. PASCAL PROGRAMMING Pascal is a high level programming language developed by Niklaus Wirth in 1970 based on the ALGOL programming language. It was named in honor of the French mathematician and philosopher Blaise Pascal.

More information

(c) ((!(a && b)) == (!a!b)) TRUE / FALSE. (f) ((!(a b)) == (!a &&!b)) TRUE / FALSE. (g) (!(!a) && (c-d > 0) && (b!b))

(c) ((!(a && b)) == (!a!b)) TRUE / FALSE. (f) ((!(a b)) == (!a &&!b)) TRUE / FALSE. (g) (!(!a) && (c-d > 0) && (b!b)) ComS 207: Programming I Midterm 2, Tue. Mar 21, 2006 Student Name: Student ID Number: Recitation Section: 1. True/False Questions (10 x 1p each = 10p) Determine the value of each boolean expression given

More information

{ -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '83 } { -- PASCAL PROGRAM SOLUTIONS }

{ -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '83 } { -- PASCAL PROGRAM SOLUTIONS } FHSCC '83 PASCAL PROGRAM SOLUTIONS 145 { -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '83 } { -- PASCAL PROGRAM SOLUTIONS } {1.1} program One1T83; { -- This program will round a number to nearest whole

More information

208 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION

208 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION 208 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION 1985-1994 { -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '93 } { -- PASCAL PROGRAM SOLUTIONS } {1.1} program One1T93; { -- This program displays six lines

More information

{ -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '91 } { -- PASCAL PROGRAM SOLUTIONS }

{ -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '91 } { -- PASCAL PROGRAM SOLUTIONS } FHSCC '91 PASCAL PROGRAM SOLUTIONS 163 { -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '91 } { -- PASCAL PROGRAM SOLUTIONS } {1.1} program One1T91; { -- This program will display a phrase as a rectangle.

More information

In Delphi script, when values are assigned to variables, the colon-equal operator is used; :=

In Delphi script, when values are assigned to variables, the colon-equal operator is used; := Statements and Operators Old Content - visit altium.com/documentation Modified by on 13-Sep-2017 Parent page: DelphiScript DelphiScript Statements A statement in DelphiScript is considered as simple when

More information

Annex A (Informative) Collected syntax The nonterminal symbols pointer-type, program, signed-number, simple-type, special-symbol, and structured-type

Annex A (Informative) Collected syntax The nonterminal symbols pointer-type, program, signed-number, simple-type, special-symbol, and structured-type Pascal ISO 7185:1990 This online copy of the unextended Pascal standard is provided only as an aid to standardization. In the case of dierences between this online version and the printed version, the

More information

Chapter 7 Arrays. One-Dimensional Arrays. Fred Jack. Anna. Sue. Roy

Chapter 7 Arrays. One-Dimensional Arrays. Fred Jack. Anna. Sue. Roy Chapter 7 Arrays High-level languages provide programmers with a variety of ways of organising data. There are not only simple data types, but also data structures. A data structure is a data type composed

More information

Quick Reference Guide

Quick Reference Guide SOFTWARE AND HARDWARE SOLUTIONS FOR THE EMBEDDED WORLD mikroelektronika Development tools - Books - Compilers Quick Reference Quick Reference Guide with EXAMPLES for Basic language This reference guide

More information

Computer Science II TURBO PASCAL

Computer Science II TURBO PASCAL Computer Science II TURBO PASCAL WEEK4 Program Flow Commands Dr.ELGİN KILIÇ IF THEN ELSE expression: If then Begin End else Begin < Processes when CASE is FALSE> End;

More information

3/12/2018. Structures. Programming in C++ Sequential Branching Repeating. Loops (Repetition)

3/12/2018. Structures. Programming in C++ Sequential Branching Repeating. Loops (Repetition) Structures Programming in C++ Sequential Branching Repeating Loops (Repetition) 2 1 Loops Repetition is referred to the ability of repeating a statement or a set of statements as many times this is necessary.

More information

122 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION

122 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION 122 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION 1995-1996 { -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '96 } { -- PASCAL PROGRAM SOLUTIONS } {1.1} program One1T96; { -- This program displays a phrase

More information

56 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION

56 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION 56 FLORIDA HIGH SCHOOLS COMPUTING COMPETITION 1985-1994 { -- FLORIDA HIGH SCHOOLS COMPUTING COMPETITION '87 } { -- PASCAL PROGRAM SOLUTIONS } {1.1} program One1T87; { -- This program will print out the

More information

CSc 372. Comparative Programming Languages. 36 : Scheme Conditional Expressions. Department of Computer Science University of Arizona

CSc 372. Comparative Programming Languages. 36 : Scheme Conditional Expressions. Department of Computer Science University of Arizona 1/26 CSc 372 Comparative Programming Languages 36 : Scheme Conditional Expressions Department of Computer Science University of Arizona collberg@gmail.com Copyright c 2013 Christian Collberg 2/26 Comparison

More information

Chapter 01 Arrays Prepared By: Dr. Murad Magableh 2013

Chapter 01 Arrays Prepared By: Dr. Murad Magableh 2013 Chapter 01 Arrays Prepared By: Dr. Murad Magableh 2013 One Dimensional Q1: Write a program that declares two arrays of integers and fills them from the user. Then exchanges their values and display the

More information

ISA 563 : Fundamentals of Systems Programming

ISA 563 : Fundamentals of Systems Programming ISA 563 : Fundamentals of Systems Programming Variables, Primitive Types, Operators, and Expressions September 4 th 2008 Outline Define Expressions Discuss how to represent data in a program variable name

More information

CSc 520 Principles of Programming Languages

CSc 520 Principles of Programming Languages CSc 520 Principles of Programming Languages 36 : Scheme Conditional Expressions Christian Collberg Department of Computer Science University of Arizona collberg+520@gmail.com Copyright c 2008 Christian

More information

Getting Started With Pascal Programming

Getting Started With Pascal Programming Getting Started With Pascal Programming How are computer programs created What is the basic structure of a Pascal Program Variables and constants Input and output Common programming errors Computer Programs

More information

Lecture 7. Memory in Python

Lecture 7. Memory in Python Lecture 7 Memory in Python Announcements For This Lecture Readings Reread Chapter 3 No reading for Thursday Lab Work on Assignment Credit when submit A Nothing else to do Assignment Moved to Fri, Sep.

More information

Government Polytechnic Muzaffarpur.

Government Polytechnic Muzaffarpur. Government Polytechnic Muzaffarpur. Name of the Lab: COMPUTER PROGRAMMING LAB (MECH. ENGG. GROUP) Subject Code: 1625408 Experiment: 1 Aim: Programming exercise on executing a C program. If you are looking

More information

Making Decisions In Pascal

Making Decisions In Pascal Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs choose between alternative courses of action High Level View Of Decision Making For The Computer Is income

More information

DEPARTMENT OF MATHS, MJ COLLEGE

DEPARTMENT OF MATHS, MJ COLLEGE T. Y. B.Sc. Mathematics MTH- 356 (A) : Programming in C Unit 1 : Basic Concepts Syllabus : Introduction, Character set, C token, Keywords, Constants, Variables, Data types, Symbolic constants, Over flow,

More information

STRING Represents group of characters Each character 1 byte CIE, AB304 BOOLEAN Logical Datatype, return true or False Memory Required 1

STRING Represents group of characters Each character 1 byte CIE, AB304 BOOLEAN Logical Datatype, return true or False Memory Required 1 2.2 Data representation 2.2.1 Data types A data type is a method of interpreting a pattern of bits. There are numerous different data types but here explained ones are according to CIE syllabus: Integer

More information

Q1: /30 Q2: /25 Q3: /45. Total: /100

Q1: /30 Q2: /25 Q3: /45. Total: /100 ECE 2035(A) Programming for Hardware/Software Systems Fall 2013 Exam One September 19 th 2013 This is a closed book, closed note texam. Calculators are not permitted. Please work the exam in pencil and

More information

1 Programming. 1.1 Analyzing a problem

1 Programming. 1.1 Analyzing a problem 1 Programming The chapter concerns the following; ² How to analyze a problem and develop an algorithm ² Control structures and their use ² ² Finding alternate solutions to a problem ² Programming in Pascal

More information

UNIVERSITY OF SWAZILAND SUPPLEMENTARY EXAMINATION, JULY 2013

UNIVERSITY OF SWAZILAND SUPPLEMENTARY EXAMINATION, JULY 2013 UNIVERSITY OF SWAZILAND SUPPLEMENTARY EXAMINATION, JULY 2013 Title of Paper : STRUCTURED PROGRAMMING - I Course number: CS243 Time allowed Instructions : Three (3) hours. : (1) Read all the questions in

More information

Duhok Polytechnic University Amedi Technical Institute/ IT Dept. Halkawt Rajab Hussain

Duhok Polytechnic University Amedi Technical Institute/ IT Dept. Halkawt Rajab Hussain Duhok Polytechnic University Amedi Technical Institute/ IT Dept. By Halkawt Rajab Hussain 2016-04-02 Overview. C# program structure. Variables and Constant. Conditional statement (if, if/else, nested if

More information

Programming for Engineers in Python

Programming for Engineers in Python Programming for Engineers in Python Autumn 2016/17 Lecture 2: Lists & Loops 1 Admin Python installation status? 2 Last Week Highlights Memory and variables Different variables types (number, string, bool)

More information

UNIT 3 ARRAYS, RECURSION, AND COMPLEXITY CHAPTER 10 INTRODUCTION TO ARRAYS

UNIT 3 ARRAYS, RECURSION, AND COMPLEXITY CHAPTER 10 INTRODUCTION TO ARRAYS UNIT 3 ARRAYS, RECURSION, AND COMPLEXITY CHAPTER 10 INTRODUCTION TO ARRAYS EXERCISE 10.1 1. An array can contain many items and still be treated as one thing. Thus, instead of having many variables for

More information

PROGRAMMING IN HASKELL. Chapter 5 - List Comprehensions

PROGRAMMING IN HASKELL. Chapter 5 - List Comprehensions PROGRAMMING IN HASKELL Chapter 5 - List Comprehensions 0 Set Comprehensions In mathematics, the comprehension notation can be used to construct new sets from old sets. {x 2 x {1...5}} The set {1,4,9,16,25}

More information

A First Program - Greeting.cpp

A First Program - Greeting.cpp C++ Basics A First Program - Greeting.cpp Preprocessor directives Function named main() indicates start of program // Program: Display greetings #include using namespace std; int main() { cout

More information

A general introduction to Functional Programming using Haskell

A general introduction to Functional Programming using Haskell A general introduction to Functional Programming using Haskell Matteo Rossi Dipartimento di Elettronica e Informazione Politecnico di Milano rossi@elet.polimi.it 1 Functional programming in a nutshell

More information

CSCE 314 Programming Languages

CSCE 314 Programming Languages CSCE 314 Programming Languages Haskell: Declaring Types and Classes Dr. Hyunyoung Lee 1 Outline Declaring Data Types Class and Instance Declarations 2 Defining New Types Three constructs for defining types:

More information

Exponentiation. Evaluation of Polynomial. A Little Smarter. Horner s Rule. Chapter 5 Recursive Algorithms 2/19/2016 A 2 M = (A M ) 2 A M+N = A M A N

Exponentiation. Evaluation of Polynomial. A Little Smarter. Horner s Rule. Chapter 5 Recursive Algorithms 2/19/2016 A 2 M = (A M ) 2 A M+N = A M A N Exponentiation Chapter 5 Recursive Algorithms A 2 M = (A M ) 2 A M+N = A M A N quickpower(a, N) { if (N == 1) return A; if (N is even) B = quickpower(a, N/2); retrun B*B; return A*quickPower(A, N-1); slowpower(a,

More information

CS61B Lecture #2. Public Service Announcements:

CS61B Lecture #2. Public Service Announcements: CS61B Lecture #2 Please make sure you have obtained an account, run register, and finished the survey today. In the future (next week), the password required for surveys and such will be your account password

More information

Making Decisions In Pascal

Making Decisions In Pascal Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs choose between alternative courses of action High Level View Of Decision Making For The Computer??? True

More information

Arrays. Systems Programming Concepts

Arrays. Systems Programming Concepts Arrays Systems Programming Concepts Arrays Arrays Defining and Initializing Arrays Array Example Subscript Out-of-Range Example Passing Arrays to Functions Call by Reference Multiple-Subscripted Arrays

More information

CSCE 110 PROGRAMMING FUNDAMENTALS. Prof. Amr Goneid AUC Part 7. 1-D & 2-D Arrays

CSCE 110 PROGRAMMING FUNDAMENTALS. Prof. Amr Goneid AUC Part 7. 1-D & 2-D Arrays CSCE 110 PROGRAMMING FUNDAMENTALS WITH C++ Prof. Amr Goneid AUC Part 7. 1-D & 2-D Arrays Prof. Amr Goneid, AUC 1 Arrays Prof. Amr Goneid, AUC 2 1-D Arrays Data Structures The Array Data Type How to Declare

More information

History. used in early Mac development notable systems in Pascal Skype TeX embedded systems

History. used in early Mac development notable systems in Pascal Skype TeX embedded systems Overview The Pascal Programming Language (with material from tutorialspoint.com) Background & History Features Hello, world! General Syntax Variables/Data Types Operators Conditional Statements Functions

More information

Lecture 5: Matrices. Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur

Lecture 5: Matrices. Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur Lecture 5: Matrices Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur 29 th July, 2008 Types of Matrices Matrix Addition and Multiplication

More information

Getting Started With Pascal Programming

Getting Started With Pascal Programming Getting Started With Pascal Programming How are computer programs created What is the basic structure of a Pascal Program Variables and constants Input and output Pascal operators Common programming errors

More information

Beginning Programming (Pascal) Lecture 75. Figure 1. type-declarations. simple-type. pointer-type. array-type. file-type. set-type.

Beginning Programming (Pascal) Lecture 75. Figure 1. type-declarations. simple-type. pointer-type. array-type. file-type. set-type. -declarations -identifier = ; ; Figure 1. -declarations simple- pointer- array- file- set- record- Figure 2. simple- standard- subrange- enumerated- Figure 3. simple- standard- boolean char integer real

More information

NCS 301 DATA STRUCTURE USING C

NCS 301 DATA STRUCTURE USING C NCS 301 DATA STRUCTURE USING C Unit-1 Part-3 Arrays Hammad Mashkoor Lari Assistant Professor Allenhouse Institute of Technology www.ncs301ds.wordpress.com Introduction Array is a contiguous memory of homogeneous

More information

1. General Computer Questions

1. General Computer Questions CE 311K Introduction to Computer Methods McKinney Example Problems Section Page 1. General Computer Questions... 1 2. Flowcharts... 2 3. Number Systems... 3 5. Programming Language Facts... 4 1. General

More information

Class 2: Variables and Memory. Laura Marik Spring 2012 C++ Course Notes (Provided by Jason Minski)

Class 2: Variables and Memory. Laura Marik Spring 2012 C++ Course Notes (Provided by Jason Minski) Class 2: Variables and Memory Variables A variable is a value that is stored in memory It can be numeric or a character C++ needs to be told what type it is before it can store it in memory It also needs

More information

The Hyderabad Public School, Begumpet, Hyderabad, A.P

The Hyderabad Public School, Begumpet, Hyderabad, A.P The Hyderabad Public School, Begumpet, Hyderabad, A.P. 500 016 2012-13 Department of Computer Science Class 8 Worksheet 3 1) How many times will the following statement execute? ( ) int a=5; while(a>6)

More information

Professor Peter Cheung EEE, Imperial College

Professor Peter Cheung EEE, Imperial College 1/1 1/2 Professor Peter Cheung EEE, Imperial College In this lecture, we take an overview of the course, and briefly review the programming language. The rough guide is not very complete. You should use

More information

Variable initialization and assignment

Variable initialization and assignment Variable initialization and assignment int variable_name; float variable_name; double variable_name; String variable_name; boolean variable_name; Initialize integer variable Initialize floating point variable

More information

Appendix 1: Pseudo-code command set

Appendix 1: Pseudo-code command set Appendix 1: Pseudo-code command set Questions in the written examination that involve code will use this pseudo-code for clarity and consistency. However, students may answer questions using any valid

More information

Introduction to Algorithms and Data Structures. Lecture 12: Sorting (3) Quick sort, complexity of sort algorithms, and counting sort

Introduction to Algorithms and Data Structures. Lecture 12: Sorting (3) Quick sort, complexity of sort algorithms, and counting sort Introduction to Algorithms and Data Structures Lecture 12: Sorting (3) Quick sort, complexity of sort algorithms, and counting sort Professor Ryuhei Uehara, School of Information Science, JAIST, Japan.

More information

Sample Examination. Family Name:... Other Names:... Signature:... Student Number:...

Sample Examination. Family Name:... Other Names:... Signature:... Student Number:... Family Name:... Other Names:... Signature:... Student Number:... THE UNIVERSITY OF NEW SOUTH WALES SCHOOL OF COMPUTER SCIENCE AND ENGINEERING Sample Examination COMP1917 Computing 1 EXAM DURATION: 2 HOURS

More information

Final CSE 131B Spring 2005

Final CSE 131B Spring 2005 Login name Signature Name Student ID Final CSE 131B Spring 2005 Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Page 8 (27 points) (24 points) (32 points) (24 points) (32 points) (26 points) (31 points)

More information

Lecture 4. 1 Statements: 2 Getting Started with C++: LESSON FOUR

Lecture 4. 1 Statements: 2 Getting Started with C++: LESSON FOUR 1 Statements: A statement in a computer carries out some action. There are three types of statements used in C++; they are expression statement, compound statement and control statement. Expression statement

More information

Input parameters. Function. An ideal black-box representation of a function

Input parameters. Function. An ideal black-box representation of a function 7 Functions 7. Introduction Functions are identifiable pieces of code with a defined interface. They are called from any part of a program and allow large programs to be split into more manageable tasks,

More information

Math & CompSci Contest - model Written Test in Computer Science

Math & CompSci Contest - model Written Test in Computer Science BABEŞ-BOLYAI UNIVERSITY FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Important observations for candidates: Math & CompSci Contest - model Written Test in Computer Science 1. All arrays are indexed starting

More information

PASCAL. PASCAL, like BASIC, is a computer language. However, PASCAL, unlike BASIC, is a Blocked Structured Language (BASIC is known as unstructured).

PASCAL. PASCAL, like BASIC, is a computer language. However, PASCAL, unlike BASIC, is a Blocked Structured Language (BASIC is known as unstructured). PASCAL 11 OVERVIEW OF PASCAL LANGUAGE PASCAL, like BASIC, is a computer language However, PASCAL, unlike BASIC, is a Blocked Structured Language (BASIC is known as unstructured) Let look at a simple {BLOCK

More information

WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION

WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION Computer Science - 1 WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION 1. Access to moving head disks requires three periods of delay before information is brought into memory. The

More information

Repetition Structures

Repetition Structures Repetition Structures Chapter 5 Fall 2016, CSUS Introduction to Repetition Structures Chapter 5.1 1 Introduction to Repetition Structures A repetition structure causes a statement or set of statements

More information

Condition-Controlled Loop. Condition-Controlled Loop. If Statement. Various Forms. Conditional-Controlled Loop. Loop Caution.

Condition-Controlled Loop. Condition-Controlled Loop. If Statement. Various Forms. Conditional-Controlled Loop. Loop Caution. Repetition Structures Introduction to Repetition Structures Chapter 5 Spring 2016, CSUS Chapter 5.1 Introduction to Repetition Structures The Problems with Duplicate Code A repetition structure causes

More information

C++ Arrays. C++ Spring 2000 Arrays 1

C++ Arrays. C++ Spring 2000 Arrays 1 C++ Arrays C++ Spring 2000 Arrays 1 C++ Arrays An array is a consecutive group of memory locations. Each group is called an element of the array. The contents of each element are of the same type. Could

More information

Problem Solving. Problem Solving Concept for Computer Science

Problem Solving. Problem Solving Concept for Computer Science Problem Solving Problem Solving Concept for Computer Science by Noor Azida Binti Sahabudin Faculty of Computer Systems & Software Engineering azida@ump.edu.my OER Problem Solving by Noor Azida Binti Sahabudin

More information

Mathematical Induction

Mathematical Induction Mathematical Induction Victor Adamchik Fall of 2005 Lecture 3 (out of three) Plan 1. Recursive Definitions 2. Recursively Defined Sets 3. Program Correctness Recursive Definitions Sometimes it is easier

More information

( ) 1.,, Visual Basic,

( ) 1.,, Visual Basic, ( ) 1. Visual Basic 1 : ( 2012/2013) :. - : 4 : 12-14 10-12 2 http://www.institutzamatematika.com/index.ph p/kompjuterski_praktikum_2 3 2 / ( ) 4 90% 90% 10% 90%! 5 ? 6 "? : 7 # $? - ( 1= on 0= off ) -

More information

COMPUTER APPLICATIONS

COMPUTER APPLICATIONS COMPUTER APPLICATIONS (Theory) (Two hours) Answers to this Paper must be written on the paper provided separately. You will not be allowed to write during the first 15 minutes. This time is to be spent

More information

ECE 2035 Programming HW/SW Systems Spring problems, 6 pages Exam One 4 February Your Name (please print clearly)

ECE 2035 Programming HW/SW Systems Spring problems, 6 pages Exam One 4 February Your Name (please print clearly) Your Name (please print clearly) This exam will be conducted according to the Georgia Tech Honor Code. I pledge to neither give nor receive unauthorized assistance on this exam and to abide by all provisions

More information

CHPSIM. Version 2.0. A Simulator and Debugger for the CHP Language. User Manual. Written by Marcel van der Goot and Chris Moore

CHPSIM. Version 2.0. A Simulator and Debugger for the CHP Language. User Manual. Written by Marcel van der Goot and Chris Moore CHPSIM Version 2.0 A Simulator and Debugger for the CHP Language User Manual Written by Marcel van der Goot and Chris Moore Copyright c 2010 Caltech All rights reserved. 1 2 Contents 1 Getting Started

More information

Pascal: operations on basic data structures (selection) (I) 2.3 Accessing and manipulating data

Pascal: operations on basic data structures (selection) (I) 2.3 Accessing and manipulating data 2.3 Accessing and manipulating data structures (selection) (I) Data without being able to generate, access and change it is useless Usually, for elemental data types imperative and object-oriented languages

More information

CS177 Recitation. Functions, Booleans, Decision Structures, and Loop Structures

CS177 Recitation. Functions, Booleans, Decision Structures, and Loop Structures CS177 Recitation Functions, Booleans, Decision Structures, and Loop Structures Functions Collection of instructions that perform a task as: o Printing your name and course. o Calculating the average of

More information

Lab #10 Multi-dimensional Arrays

Lab #10 Multi-dimensional Arrays Multi-dimensional Arrays Sheet s Owner Student ID Name Signature Group partner 1. Two-Dimensional Arrays Arrays that we have seen and used so far are one dimensional arrays, where each element is indexed

More information

Goals of this Lecture

Goals of this Lecture C Pointers Goals of this Lecture Help you learn about: Pointers and application Pointer variables Operators & relation to arrays 2 Pointer Variables The first step in understanding pointers is visualizing

More information

Computer Science Papers 1, 2 and 3

Computer Science Papers 1, 2 and 3 Pearson Edexcel Level 1/Level 2 GCSE (9 1) Computer Science Papers 1, 2 and 3 Sample assessment material for first teaching September 2016 Pseudo-code command set Paper Reference 1CP1/01 1CP1/02 1CP1/3A-3E

More information

CIS 252 Introduction to Computer Science Section M019: Exam 1 (Yellow) February 22, Points Possible

CIS 252 Introduction to Computer Science Section M019: Exam 1 (Yellow) February 22, Points Possible Name: CIS 252 Introduction to Computer Science Section M019: February 22, 2018 Question Points Possible Points Received 1 34 2 16 3 16 4 10 5 12 6 12 Total 100 Instructions: 1. This exam is a closed-book

More information

Department of Computer Science COMP The Programming Competency Test

Department of Computer Science COMP The Programming Competency Test The Australian National University Faculty of Engineering & Information Technology Department of Computer Science COMP1120-2003-01 The Programming Competency Test 1 Introduction The purpose of COMP1120

More information

SharePoint Development- Core

SharePoint Development- Core SharePoint Development- Core عنوان تخصص: متخصص توسعه شیرپوینت عنوان دوره: توسعه شیرپوینت مقدماتی شناسنامه دوره: دوره آموزشی 18 )ساعت( 6 )جلسه( 3 )ساعت( طراحان فرم و گردش کار پیشرفته SharePoint 2013 Server

More information

Flow Chart. The diagrammatic representation shows a solution to a given problem.

Flow Chart. The diagrammatic representation shows a solution to a given problem. low Charts low Chart A flowchart is a type of diagram that represents an algorithm or process, showing the steps as various symbols, and their order by connecting them with arrows. he diagrammatic representation

More information

ACSL All-Star Practice

ACSL All-Star Practice ACSL All-Star Practice By GG, DH, YL, JP, DP, HW for WCI PEG EOL May, 2012 Question 1. How many paths of length 4 are there in the following graph? Question 2. Let s add two additional functions to the

More information

1. In C++, reserved words are the same as predefined identifiers. a. True

1. In C++, reserved words are the same as predefined identifiers. a. True C++ Programming From Problem Analysis to Program Design 8th Edition Malik TEST BANK Full clear download (no formatting errors) at: https://testbankreal.com/download/c-programming-problem-analysis-program-design-8thedition-malik-test-bank/

More information

1:

1: Student: Date: Instructor: Ray Brown Course: M055 Sum7 CAI 0054 G4 Assignment: ch4rev HW. Click the link below to watch a video reviewing concepts in this chapter. You are encouraged to watch the video

More information

Operators in java Operator operands.

Operators in java Operator operands. Operators in java Operator in java is a symbol that is used to perform operations and the objects of operation are referred as operands. There are many types of operators in java such as unary operator,

More information

Premaster Course Algorithms 1 Chapter 2: Heapsort and Quicksort

Premaster Course Algorithms 1 Chapter 2: Heapsort and Quicksort Premaster Course Algorithms 1 Chapter 2: Heapsort and Quicksort Christian Scheideler SS 2018 16.04.2018 Chapter 2 1 Heapsort Motivation: Consider the following sorting algorithm Input: Array A Output:

More information

2. Distinguish between a unary, a binary and a ternary operator. Give examples of C++ operators for each one of them.

2. Distinguish between a unary, a binary and a ternary operator. Give examples of C++ operators for each one of them. 1. Why do you think C++ was not named ++C? C++ is a super set of language C. All the basic features of C are used in C++ in their original form C++ can be described as C+ some additional features. Therefore,

More information

Fall Recursion and induction. Stephen Brookes. Lecture 4

Fall Recursion and induction. Stephen Brookes. Lecture 4 15-150 Fall 2018 Stephen Brookes Lecture 4 Recursion and induction Last time Specification format for a function F type assumption guarantee (REQUIRES) (ENSURES) For all (properly typed) x satisfying the

More information

Computer Science II TURBO PASCAL

Computer Science II TURBO PASCAL Computer Science II TURBO PASCAL WEEK6 LOOP structures Dr.ELGİN KILIÇ Loop Type Description while-do loop Repeats a statement or group of statements while a given condition is true. It tests the condition

More information

1- Write a single C++ statement that: A. Calculates the sum of the two integrates 11 and 12 and outputs the sum to the consol.

1- Write a single C++ statement that: A. Calculates the sum of the two integrates 11 and 12 and outputs the sum to the consol. 1- Write a single C++ statement that: A. Calculates the sum of the two integrates 11 and 12 and outputs the sum to the consol. B. Outputs to the console a floating point number f1 in scientific format

More information

PROGRAMMING IN HASKELL. Chapter 2 - First Steps

PROGRAMMING IN HASKELL. Chapter 2 - First Steps PROGRAMMING IN HASKELL Chapter 2 - First Steps 0 The Hugs System Hugs is an implementation of Haskell 98, and is the most widely used Haskell system; The interactive nature of Hugs makes it well suited

More information

Intermediate Representations

Intermediate Representations Compiler Design 1 Intermediate Representations Compiler Design 2 Front End & Back End The portion of the compiler that does scanning, parsing and static semantic analysis is called the front-end. The translation

More information

Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs to execute alternatives

Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs to execute alternatives Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs to execute alternatives Decision-Making In Pascal Decisions are questions that are either true or false

More information

MA 511: Computer Programming Lecture 3: Partha Sarathi Mandal

MA 511: Computer Programming Lecture 3: Partha Sarathi Mandal MA 511: Computer Programming Lecture 3: http://www.iitg.ernet.in/psm/indexing_ma511/y10/index.html Partha Sarathi Mandal psm@iitg.ernet.ac.in Dept. of Mathematics, IIT Guwahati Semester 1, 2010-11 Last

More information

{C} Programming. Part 1/2 Basics Variables, Conditions, Loops, Arrays, Pointer basics

{C} Programming. Part 1/2 Basics Variables, Conditions, Loops, Arrays, Pointer basics {C Programming Part 1/2 Basics Variables, Conditions, Loops, Arrays, Pointer basics Variables A variable is a container (storage area) to hold data. Eg. Variable name int potionstrength = 95; Variable

More information

Standard prelude. Appendix A. A.1 Classes

Standard prelude. Appendix A. A.1 Classes Appendix A Standard prelude In this appendix we present some of the most commonly used definitions from the standard prelude. For clarity, a number of the definitions have been simplified or modified from

More information

COP 3223 Introduction to Programming with C - Study Union - Fall 2017

COP 3223 Introduction to Programming with C - Study Union - Fall 2017 COP 3223 Introduction to Programming with C - Study Union - Fall 2017 Chris Marsh and Matthew Villegas Contents 1 Code Tracing 2 2 Pass by Value Functions 4 3 Statically Allocated Arrays 5 3.1 One Dimensional.................................

More information

Introduction to ML. Mooly Sagiv. Cornell CS 3110 Data Structures and Functional Programming

Introduction to ML. Mooly Sagiv. Cornell CS 3110 Data Structures and Functional Programming Introduction to ML Mooly Sagiv Cornell CS 3110 Data Structures and Functional Programming Typed Lambda Calculus Chapter 9 Benjamin Pierce Types and Programming Languages Call-by-value Operational Semantics

More information

Features of C. Portable Procedural / Modular Structured Language Statically typed Middle level language

Features of C. Portable Procedural / Modular Structured Language Statically typed Middle level language 1 History C is a general-purpose, high-level language that was originally developed by Dennis M. Ritchie to develop the UNIX operating system at Bell Labs. C was originally first implemented on the DEC

More information

SharePoint Development- Advance

SharePoint Development- Advance SharePoint Development- Advance عنوان تخصص: متخصص توسعه شیرپوینت عنوان دوره: توسعه شیرپوینت پیشرفته شناسنامه دوره: دوره آموزشی 18 )ساعت( 6 )جلسه( 3 )ساعت( طراحان فرم و گردش کار پیشرفته SharePoint 2013

More information

Chapel Introduction and

Chapel Introduction and Lecture 24 Chapel Introduction and Overview of X10 and Fortress John Cavazos Dept of Computer & Information Sciences University of Delaware www.cis.udel.edu/~cavazos/cisc879 But before that Created a simple

More information

Design and Analysis of Algorithms PART III

Design and Analysis of Algorithms PART III Design and Analysis of Algorithms PART III Dinesh Kullangal Sridhara Pavan Gururaj Muddebihal Counting Sort Most of the algorithms cannot do better than O(nlogn). This algorithm assumes that each input

More information

OF VICTORIA EXAMINATIONS- DECEMBER 2010 CSC

OF VICTORIA EXAMINATIONS- DECEMBER 2010 CSC Name: ID Number: UNIVERSITY OF VICTORIA EXAMINATIONS- DECEMBER 2010 CSC 225 - Algorithms and Data Structures: I Section A01 (CRN 1089) Instructor: Wendy Myrvold Duration: 3 hours TO BE ANSWERED ON THE

More information