Introduction to programming

Question 1

What is an IDE?

Answer 1

An IDE is a software which enables you to enter,edit ,compile(or interrupt) and run your programs
It is a software package that helps you write the code more easily

Question 2

3 debugging facilities:

Answer 2

Set a BREAKPOINT in the program which will cause the program to stop on the line
STEP THROUGH a program one line at a time so that you can see what is happening
Set a WATCH on a variable so that its value is displayed each time it changes

Question 3

What is an identifier?

Answer 3

An identifier is a name or label chosen by a programmer to represent an object within a program.the object can be a variable ,a function, a procedure or any element defined within a program

Question 4

Difference between MOD and DIV

Answer 4

Div returns a integer

Mod returns the remainder

Question 5

how a pogrom code can be improved or more refined

Answer 5

Use meaningful variable names to allow others to understand scope of variables
Indentation of code to show clearly the lines of code which should be treated together , typically loops/selection
Annotate code with comments that are not read by the computer and so that others can understand

Question 6

What is the agile model and when to use?

Answer 6

Software is developed in rapid incremental cycles each version builds on previous functionality and is thoroughly trusted
When to use:
small changes can be made frequently of a low cost
In an expanding or developing business-where users needs are constantly changing

Question 7

Extreme programming

Answer 7

A type of agile software development
frequent releases are made in short development cycles
intended to improve productivity

Question 8

Rapid application development

Answer 8

Workshops and focus groups gather requirement
prototyping is used to continually refine the system
in responsive to feedback
each part produced in time limit
software components can be re-used

Question 9

Linear search

Answer 9

Linear search involves methodically searching one location after another until the serached-for value is found

Question 10

Binary search

Answer 10

Binary search works by dividing the list in two each time until we find the item being searched for,the list has to be in order

Question 11

Bubble sort

Answer 11

Bubble sort is one of the easiest sorting algorithm to understand and implement

Question 12

Insertion sort

Answer 12

Insertion sort works by dividing a list two parts;sorted and unsorted.Elements are inserted one by one into their correct position in the sorted section