QuizMagic

    
Now available on:
QuizMagic on Google Play QuizMagic Window8 App QuizMagic on Amazon Store QuizMagic on Firefox Marketplace
Create you own quizzes

Programming Aptitude Quiz (PAQ)

Programming Aptitude Quiz (PAQ)
Created by Quizmagic Team on Mar 12, 2015 09:47 AM.
Take this quiz and find out how ready you are for a software development job.

This is a 40 minutes’ quiz with 30 questions. The quiz tests candidates on the fundamentals of computer programming, and programming concepts and logic.

If you can answer 20 or more questions correctly in your FIRST UNAIDED attempt, you are likely to be in the top 10 % of the population taking this test, and you probably have good career prospects as a software professional.

Evaluate yourself NOW, for FREE!

You can take this quiz multiple times and keep improving your scores as you strengthen your fundamentals.
Top 5 Scores
Anonymous
178
03:28
Anonymous
177
01:09
Anonymous
176
01:38
Anonymous
175
05:08
Anonymous
172
01:25
Questions
30
Minutes
40
High Score
341
03:30
Quiz Played
267
times
Last played on Nov 15, 2019View comments
Congratulation!

You are in top 5 scorers.
0
0
0
0
N/A
Answering this correctly will make the indicated neighbouring questions be automatically treated as having been answered correctly.
Answering this incorrectly will make the indicated neighbouring questions be automatically treated as having been answered incorrectly.
Answering this correctly will earn you some extra points.
Answering this incorrectly will cause you to lose some points.
Answering this correctly will increase the total time available to you.
Answering this incorrectly will reduce the total time available to you.
Rate this quiz
Embed this quiz on your blog or websiteShare this quiz

Copy this HTML code and paste in your website code to run this quiz on your site.

Size:
Size:

Sample Questions

Question 1
Following is a Visual representation of an Algebraic expression? Which is that expression?

[a + (b – c)] * [(d – e) / (f + g – h)]
[a + (b – c)] * [(d – e) (f + g – h)]
a + [(b – c)] * [(d – e) / (f + g – h)]
None
Question 2
Following is a Flowchart. Indicate what is wrong?


N should be set to 0 not 1
Nothing is wrong
Checking of condition is wrong
Condition is wrong
Question 3
Which is the line that should be added so that the code works as required? Note that N and ITEM are variables.

1 Set J: = 1, LOCATION: =0, MINIMUM: = 2

2 Repeat Steps 3 and 4 while LOCATION = 0 and J <= N

3    If ITEM = DATA[J], Then: Set LOCATION:= J

4       Set J:= J + 1

5    [End of Step 2 loop]

6    If LOCATION = 0 then:
         Write: ITEM is not in the list DATA
      Else
         Write: LOCATION is the location of ITEM

7 [End of If Structure]

8 Exit
LOCATION:= LOCATION + 1
Set LOCATION = DATA[J]
None
Set LOCATION: = N
Question 4
Following is linear array NAME


If ‘Lewis” has to be removed from the list and “Jeremy” has to be added instead of “Lewis” how many items need to be moved in the above list?
5 below
None
6
5 below and 9 above
Question 5
What is the following Pseudocode doing? 

1 Set J: = N

2 Repeat Steps 3 and 4 while J >= K

3    Set LA[J+1]:= LA[J]

4    Set J:= J - 1 
  [End of Step 2 loop]

5 Set LA[K]:= ITEM

6 Set N:= N + 1

7 Exit


Where LA is a Linear list with N elements and K is a positive integer such that K <= N.
None
Sets the value of LA to the highest value
Copies from one linear list to another
Inserts an element into the Kth position
Question 6
Suppose MEMBER is a character list with fixed length 20. Assume a string is stored left justified in a memory cell with blank spaces padded on the right or with the right-most characters truncated. For example here is how “JOHN PAUL JONES” is stored.

What will happen if ‘ROBERT ANDREW WASHINGTON’ is assigned to MEMBER? 

None
Will increase the size of the list
Will not fit
Will fit with some characters deleted
Question 7
Suppose a 32 bit memory location AAA contains the following sequence of bits:
0100 1101 1100 0001 1110 1001 0101 1101 
Determine the data stored in AAA?
30
8
Cannot be determined
4
Question 8
Following is a Linear list DATA with N elements and a specific ITEM of information. What does this pseudocode do?

1 Set K: = 1 and LOC: = 0.

2 Repeat Steps 3 and 4 while LOC = 0 and K <= N

3     If ITEM = DATA[K], then: Set LOC:= K
       Set K:= K + 1 
   [End of Step 2 loop]

4 If LOC = 0, then:
      Write: ITEM is not in the list DATA
   Else:
      Write: LOC is the location of ITEM
   [End of If structure]

5 Exit
Finds the location LOC of ITEM in the list DATA and writes
Finds if LOC = 0, writes and exits
Finds the location LOC of ITEM and exits
None
Question 9
Consider a list AUTO, which records the number of automobiles sold each year from 1932 through 1984. Find the number of years during which more than 300 automobiles were sold? Which pseudocode does the same?
1 Set NUM: = 0
2 Repeat for K = 1932 to 1984: 
      If AUTO[K]>300, then: 
         Set NUM = NUM + 1 
  [End of loop]
3 Return NUM.
1 Set NUM: = 0
2 Repeat for K = 1932 to 1984:
      Write: K, AUTO[K]
      Set NUM = NUM + 1
  [End of loop]
3 Return.
None
1 Set NUM: = 0
2 Repeat for K = 1932 to 1984: 
      If AUTO[K]>300, then 
         Set NUM = NUM + 1 
  [End of loop]
3 Return.
Question 10
Find the right pseudocode for finding the largest element in a list? Note that N is a variable.
None
1 Set P: = 1, LOC: =1 and MAX: = DATA [1]
2 Set P: =P+1
3 If P > N, then:
      Write: LOC, MAX, and EXIT 
4 If MAX < DATA [P], then:
      Set LOC: = P and MAX: = DATA [P]
5 Go to Step 2
1 Set P: = 1, LOC: =1 and MAX: = DATA [1]
2 Set P: =P+1
3 If P > N, then: 
      Set LOC: = P and MAX: = DATA [P]
4 If MAX < DATA [P], then: 
      Write: LOC, MAX, and EXIT
5 Go to Step 2
1 Set P: = 1, LOC: =1 and MAX: = DATA [1]
2 Set P: =P+1
3 If P < N, then: 
      Write: LOC, MAX, and EXIT
4 If MAX < DATA [P], then: 
      Set LOC: = P and MAX: = DATA [P]
5 Go to Step 2
comments powered by Disqus
X
Other recommended quiz for you
Connect with Facebook
OR
Connect with Google
Connecting...Back

Existing users, click here to login



By registering with us, you are agreeing to TERMS AND CONDITIONS of using our products/services.