IPM THEORY CHALLENGE

1
IPM THEORY CHALLENGE

• QUIZ NUMBER 1

2
Q1 - We are able to place organisations into
which of the following categories based on their
prime purpose

1. Profit and Loss
2. Small, Medium and Large
3. The number of customers they have
4. Profit and Non Profit

3
Q2 - An organisational objective to reduce the
time it takes to process orders would be..

1. An effectiveness objective
2. An efficiency objective
3. Both an efficient and effective objective
4. Neither it falls into the category of tactical
   decisions

4
Q3 - An organisational objective to produce more
accurate reports would be ..

1. An effectiveness objective
2. An efficiency objective
3. Both an efficient and effective objective
4. Neither it falls into the category of strategic
   decisions

5
Q4 - The College LAN is an example of a..

1. Knowledge Management System
2. Business Support System
3. User Productivity System
4. Transaction Processing System

6
Q5 - A car mechanic workshop has an electronic
testing and diagnostic system. It is an example
of a

1. Knowledge Management System
2. Business Support System
3. Enterprise Computing System
4. User Productivity System

7
Q6 - Access and MYOB are examples of

1. Utility software
2. Application software
3. Desktop publishing software
4. System software

8
Q7 - Interviewing people and filling in a form
typically occurs during which stage of the
Information Processing steps

1. Input
2. Validation
3. Acquisition
4. Retrieval

9
Q8 - Which of the following is not one of the
Information Processing steps

1. Communication
2. Storage
3. Suitability
4. delete

10
Q9 - Which of the following choices is not a
criteria for checking the compatibility of
hardware When buying new software

1. Hard disk space
2. The operating system type
3. Memory capacity (RAM)
4. Whether it is a laptop or desktop

11
Q10 - Which of the following statements is
correct?

1. GIF is a lossy data compression technique suited
   to illustrations
2. GIF is a lossy data compression technique suited
   to photographs
3. GIF is a lossless data compression technique
   suited to illustrations
4. GIF is a lossless data compression technique
   suited to photographs

12
Q11 - This type of data validation technique is
used to check that a value is not above or below
a certain value

1. Limit check
2. Range check
3. Existence check
4. Reasonableness check

13
Q12 Which of the following statements is true

1. JPG is a lossy data compression technique that is
   used to store photos with some loss of data
2. JPG is a lossless data compression technique that
   is used to store photos without loss of data
3. JPG is a lossless data compression technique that
   is used to store photos at high compression
   values
4. JPG is a lossy data compression technique that is
   used to store photos at low, medium or high
   compression values

14
Q13 Information that is free from bias and
error free has the attribute of

1. Accuracy
2. Relevance
3. Timeliness
4. completeness

15
Q14 Claire tries to withdraw 1200 from the ATM
at her bank but the request is denied what type
of data validation is being used

1. Limit check
2. Range check
3. Existence check
4. Reasonableness check

16
Q15 What file format would you recommend for a
logo for a website

1. Doc
2. GIF
3. Bitmap
4. HTML

17
Q16 What file format would you recommend for a
music track for a school intranet

1. xls
2. Html
3. Jpg
4. MP3

18
Q17 Resolution refers to

1. The number of colours used in a pixel
2. The size of the pixel
3. The density or number of pixels in an image
4. Interpolating by filling in the gaps of pixels

19
Q18 Which of the following file types would
allow for simple animations

1. JPG
2. GIF
3. TIFF
4. PNG

20
Q19 There are two main categories of graphic
images

1. Bitmap and Web based
2. Cross platform and software specific
3. Web safe and cross platform
4. Bitmap and Vector

21
Q20 During which stage of the Information
Processing Steps does the transfer of information
to a user occur

1. Communication
2. Output
3. Disposal
4. Presentation

22
ANSWERS

• B
• D
• A
• A
• B
• D
• C
• B
• D
• A

1. D
2. B
3. A
4. C
5. A
6. B
7. C
8. C
9. D
10. C