Total No. of Questions : 4] SEAT No.

8
23
P1274 [Total No. of Pages : 2

ic -
ta t
OCT/FE/Insem-7

5s
F.E. (Semester - I)

5:1
PROGRAMMING AND PROBLEM SOLVING

01 91
0:5
(2019 Pattern)

0
91
5/1 13
0
Time : 1 Hour] 0/2 [Max. Marks : 30
.23 GP

Instructions to the candidates:

1) Solve Q1 or Q2, Q3 or Q4.
CE
80

8
2) Neat Diagrams must be drawn wherever necessary.

23
ic-
16

Q1) a) What are identifiers? List the rules to name an identifier. [3]

tat
8.2

5s
b) Explain different data types supported by Python. [5]
.24

5:1
91
49

c) What is a problem? List down steps in problem solving. [4]

0:5
30
91

d) Write an Algorithm to find sum of ‘n’ natural numbers. [3]

01
01

OR
0/2
GP
5/1

Q2) a) Explain the use of Indentation in Python. [3]

CE
80

8
23
b) What is an operator? Enlist various types of operators. [5]
.23

c) What is modularization? Explain top down design approach. ic-

[4]
16

tat
8.2

5s

d) Write an algorithm to swap two numbers. [3]

.24

5:1
1
49

0:5
0/2 309
91

Q3) a) Explain selection/conditional statements in Python. [4]

01
01

b) Explain while loop with flowchart. [3]

GP
5/1

c) Write a program in Python to find whether gives is even or odd. [3]

CE
80

d) What is difference between ‘break’ and ‘continue’ statement in Python?

.23

Explain with example. [5]

16

OR
8.2
.24

P.T.O.
49
Q4) a) What is dictionary? How to add and remove elements in dictionary? [4]

8
23
b) What is a list? Explain accessing and removing of elements from list with

ic -
example. [3]

ta t
5s
c) Explain for loop with flowchart. [3]

5:1
01 91
0:5
d) Write a program to print the following pattern. [5]

0
91
5/1 13
0
0/2
.23 GP
CE
80

8
23
ic-
16

tat
8.2

5s
.24

5:1
91
49

0:5
30
91
01
01
0/2
GP
5/1
CE
80

8
23
.23

ic-
16

tat
8.2

5s
.24

5:1
1
49

0:5
0/2 309
91
01
01
GP
5/1
CE
80
.23
16
8.2
.24

FE/Insem-7 2
49
Total No. of Questions : 4] SEAT No. :

8
23
P6 [Total No. of Pages : 2

ic -
FE/INSEM/APR-6

ta t
F.E. (Semester - II)

5s
110005 : PROGRAMMING AND PROBLEM SOLVING

0:3
02 91
(2019 Pattern)

1:2
0
01
Time : 1 Hour] 5/0 13 [Max. Marks : 30
Instructions to the candidates :
0
3/2
.23 GP

1) Solve Q.1 or Q.2, Q.3 or Q.4.

2) Neat diagrams must be drawn wherever necessary.
CE
80

8
23
Q1) a) What is a problem? Explain six problem solving steps. [4]

ic-
16

tat
b) List down types of operators in Python. Explain relational operators.[5]
8.2

5s
c) Explain flow-chart and algorithm with example. [6]
.24

0:3
OR
91
49

1:2
Q2) a) Explain following terms with suitable examples. [4]
30
01

i) Comment
01
02

ii) Reserve Words

3/2
GP
5/0

b) Write a program to swap two numbers. [5]

CE
80

c) Explain any six features of Python programming. [6]

8
23
.23

ic-
16

tat
Q3) a) Describe the following terms with examples (any two) : [4]
8.2

5s

i) break
.24

0:3
1

ii) continue
49

1:2
3/2 309

iii) pass
01

iv) range
01
02

b) Write a program to test whether a number entered by the user is positive,

GP

negative or zero. [5]

5/0
CE

c) Explain following selection/decision making statements in Python [6]

80
.23

i) if statement
16

ii) if....else statement

8.2

iii) if..else..else statement

.24

P.T.O.
49
 OR

8
23
Q4) a) Explain for loop with flow chart. [4]

ic -
ta t
b) What is a list? Explain any three operations of list. [5]

5s
c) Write a program to generate a Fibonacci series of ‘n’ numbers. [6]

0:3
02 91
1:2
0 
01
5/0 13
0
3/2
.23 GP
CE
80

8
23
ic-
16

tat
8.2

5s
.24

0:3
91
49

1:2
30
01
01
02
3/2
GP
5/0
CE
80

8
23
.23

ic-
16

tat
8.2

5s
.24

0:3
1
49

1:2
3/2 309
01
01
02
GP
5/0
CE
80
.23
16
8.2
.24

FE/INSEM/APR-6 2
49