Programming 1 Essay

Submitted By cherishye

Words: 1372

Pages: 6

Open Document

|Course: | |ITECH1000/5000 |
| | |PROGRAMMING 1 |
| | | |
|Date: | |Version: June 2012 |
| | | |
|Reading Commences: | | |
| | | |
|Writing Commences: | |10 minutes after reading commences |
| | | |
|Duration: | |2 hours |
| | | |
|Location Course Coordinator: | | |
| | | |
|Total marks: | |50 marks |

Instructions to candidates:

1. Print your name and student number on the Examination Paper.

2. Attempt ALL questions, answering in the spaces provided.

3. Do not detach any portion of the examination paper.

4. Begin writing, as indicated, after the reading time has ended.

Materials allowed (in addition to normal writing materials): Nil

DO NOT REMOVE ANY PART OF THIS EXAM PAPER FROM THE EXAMINATION ROOM

|Student Name: | | |
| | | |
|Student ID: | | |

MODEL ANSWERS
Q1. a) Using the following successive assignment statements in a segment of code, write down the values of variables x & y at the completion of each line of code. Use ‘undefined’ where a variable is undefined.
|code |value of x |value of y |
|y = 3 |undefined |3 |
|x = 2 |2 |3 |
|x = x + y |5 |3 |
|y = y - 1 |5 |2 |

b) Draw a diagram of the activation stack after all the assignment statements have been executed. x 5 y 2 main() --- [2 + 2 = 4 marks]

Q2. Inspect the following code segment.

number = 0 # line 1 max = 0 # line 2 while number > -999: # line 3 number = input (“Enter a number: “) # line 4 - numbers to be entered are in the table

Nt1310 Unit 1 Programming Essay

1.Explain the different memory areas available to the programmer briefly with example? Hints:Explain with example to show the memory like stack,global,heap etc. Ans- The different memory areas available to the programmer are- a)Stack b)Heap c)Global/static d)Code(Text) a)Stack-- It's a special region of our computer's memory that stores temporary variables created by each function (including the main() function).…

Words 1039 - Pages 5

Brs Mdm3 Tif Ch06 Essay

Managerial Decision Modeling w/ Spreadsheets, 3e (Balakrishnan/Render/Stair) Chapter 6 Integer, Goal, and Nonlinear Programming Models 6.1 Chapter Questions 1) These are problems in which some, but not all, the decision variables must have integer solutions: A) mixed IP problems B) pure IP problems C) pure binary problems D) mixed binary IP problems E) goal programming problems Answer: A Page Ref: 212 Topic: Introduction Difficulty: Easy 2) These are problems in which all decision variables…

Words 2861 - Pages 12

Essay Conditional Programming

Introduction COMP 202 – Introduction to Computing 1 COMP 202 – Introduction to Computing 1 COMP-202 Unit 3: Conditional Programming CONTENTS: Boolean Expressions The if and if-else Statements • Suppose we want to write a program which asks the user to enter two numbers and then displays only the larger of the two • This will involve executing certain statements in some circumstances, and different statements in other circumstances • Problem: So far, all the programs we have written…

Words 3198 - Pages 13

Nt1330 Unit 4 Exercise 2.2

2.2 Programming Programming is a stage where the system specification that was prepared during the design stage is translates into software program code. In this case, as we figured out earlier they will require 2 programmers in order to generate the new programs into the new Systems Applications and Products (SAP) system. During this phase each programmer that was assigned with their activities has to use the SAP required software which is Windows NT Server 4.0, Windows NT Server Pack 6.0, Internet…

Words 887 - Pages 4

Linear Programm Essay

EMBA – LP: Using Excel; Transportation & Assignment; Integer Programming Learning goals Modeling in Excel using Solver • Understand the importance of optimization (linear programming) via Excel’s Solver • Understand how to model simple linear programs using Excel and Solver • Understand the power of Solver to perform nonlinear and integer programming The Transportation Model • Understand the structure and assumptions of the transportation model • Understand the…

Words 1160 - Pages 5

DSA Lecture 4 1 2 Essay

Lecture 4- Outline 1. (0-1) IP problem: an example 2. LP solution using the DecisionPro software 3. IP solution using DecisionPro 4. (0-1) IP solution using DecisionPro 5. Assignment Problem solution using DecisionPro www.bradford.ac.uk/managem (0-1) IP Problem: An Recreation facilities selection to maximize daily usage Example by residents. Resource constraints: £120,000 budget; 12 acres of land. Selection constraint: either swimming pool or tennis center (not both). Data: Recreation Facility…

Words 1050 - Pages 5

Review Of Linear Programming

FOUNDATION REVIEW Contents FR.1 Graphing linear inequalities 2 FR.2 The linear programming model 7 FR.3 Interpreting linear programming results 13 Review questions 16 Introduction Linear programming is commonly used in short-term operations planning. In MA2, you will use linear programming and its related concepts to make relevant management accounting decisions. Knowing how to formulate and interpret a linear program will help you determine the optimum production plan to analyze various…

Words 1004 - Pages 5

Pt1420 Unit 3a Assignment

Information Systems 3A assignment Question 1 a) i) UML stands for Unified Modelling Language, which is a set of model constructs and notations .Analysts use UML to enable them to get a better grasp of the different diagrams used in system development project. Examples of UML graphical models are : Use Case and Activity diagram. ii) An actor is an external agent, which may be an individual, group of individuals or an external system that interacts with a particular system by providing or receiving…

Words 946 - Pages 4

Ex 7 Essay

Mat-2.3140 Linear Programming Exercise 9 Thu 09.10.2014 Y346 Homework (Assignment 9.1) is due at the beginning of the next week’s exercise session on Friday, and can be returned by email, or handed to the assistant at the exercise session. Blackboard assignment is 9.2. Students who are willing to present the solution receive extra credit. 9.1 Integer Programming Problem (HOMEWORK) Course book Exercise 11.1 (a),(b) and (d) Consider the problem max x1 + 2x2 s.t. −3x1 + 4x2 ≤ 4 3x1 + 2x2 ≤ 11…

Words 1450 - Pages 6

Optimization Assignment

be the shortest but may well be the most challenging one. 1. Allocation and Linear Programming. A company produces three products in kilos. Each product requires different amounts of time per kilo in each of four departments (A, B, C, and D). The following table gives the profit contributions per kilo, the available time (minutes) in each department, and time requires per kilo in each department for each product. Product 1 Product 2 Product 3 Profit Contribution per Kilo 13 17…

Words 1023 - Pages 5