python-1
python-1
1. Which of the following best defines "problem defini on" in program planning?
o A) Debugging code
o C) Wri ng pseudocode
o D) Execu ng a program
Answer: B
o C) Wri ng documenta on
o A) Syntax error
o B) Run me error
o C) Logical error
o D) Compila on error
Answer: C
o A) Bo om-up
o B) Top-down
o C) Le -right
o D) Structured
Answer: C
o A) Venn diagram
o B) Pie chart
o C) Flowchart
o D) Decision tree
Answer: C
o A) GOTO statements
o A) File encryp on
o A) Compiler
o B) Decision table
o C) IDE
o D) Debugger
Answer: B
9. Which method starts from a general idea and works toward specifics?
o A) Bo om-up
o B) Top-down
o C) Inside-out
o D) Backward chaining
Answer: B
10. In which concept are small problems solved first and then integrated?
A) Linear programming
B) Top-down
C) Bo om-up
D) Dynamic programming
Answer: C
B) #
C) /*
D) <!--
Answer: B
A) 2data
B) my-name
C) _value
D) class
Answer: C
A) 25
B) 17
C) 15
D) 21
Answer: B
A) ^
B) **
C) ~
D) %
Answer: B
A) True
B) False
C) 0
D) 1
Answer: B
A) Integer
B) Float
C) String
D) Boolean
Answer: C
A) con nue
B) exit
C) stop
D) break
Answer: D
A) func on
B) func
C) define
D) def
Answer: D
19. What is the default return value of a func on that does not explicitly return anything?
A) null
B) None
C) 0
D) Undefined
Answer: B
A) if
B) for
C) do-while
D) while
Answer: C
B) Calls itself
C) Uses loops
C) Op mize loops
C) Raise an error
A) return
B) yield
C) output
D) pass
Answer: A
25. Which loop is best suited for checking a condi on before execu ng?
A) for
B) do-while
A) myList[0]
B) myList[1]
C) myList[-1]
D) myList[len]
Answer: C
C) Removes 5
A) delete()
B) remove()
C) del
D) pop()
Answer: C
A) Dele ng a list
A) [1, 2, 3]
B) [“a”, “b”]
D) [5]
Answer: C
A) class MyClass()
B) class = MyClass:
C) class MyClass:
D) class: MyClass()
Answer: C
A) this
B) class
C) self
D) object
Answer: C
A) Java
B) collec ons
C) main
D) cpp
Answer: B
A) del
B) new
C) init
D) call
Answer: C
B) obj = Car
C) obj = Car()
D) obj.Car()
Answer: C
A) Tree
B) Graph
C) Stack
D) HashMap
Answer: C
A) LIFO
B) FIFO
C) FILO
D) LILO
Answer: B
A) list
B) set
C) stack
D) string
Answer: D
44. What is the me complexity of linear search in worst case?
A) O(1)
B) O(n)
C) O(log n)
D) O(n log n)
Answer: B
A) Selec on sort
B) Bubble sort
C) Inser on sort
D) Merge sort
Answer: B
A) O(n)
B) O(1)
C) O(log n)
D) O(n^2)
Answer: C
47. Which algorithm builds the sorted list one element at a me?
A) Bubble sort
B) Merge sort
C) Inser on sort
D) Quick sort
Answer: C
A) List
B) Tuple
C) Set
D) String
Answer: C
49. The data structure where elements can be added or removed from both ends:
A) Stack
B) Queue
C) Deque
D) Tree
Answer: C
A) Queue
B) Stack
C) Array
D) Set
Answer: B
D) Avoid documenta on
Answer: B
A) UML diagram
B) Flowchart
C) Stack diagram
D) Gan chart
Answer: C
C) Break loops
A) 0b101
B) 3.14
C) "Hello"
D) 2e2.5
Answer: D
A) 15
B) 555
C) Error
D) 5 * 3
Answer: B
A) try-expect
B) try-except
C) catch-except
D) handle-catch
Answer: B
59. Which statement can be used to skip the rest of the code inside a loop for current itera on?
A) break
B) skip
C) con nue
D) exit
Answer: C
print(f())
A) None
B) 0
C) Error
D) pass
Answer: A
A) ['abc']
C) ['a b c']
D) abc
Answer: B
A) 2
B) 1
C) 3
D) True
Answer: A
A) remove()
B) pop()
C) del()
D) discard()
Answer: A
C) Creates tuple
A) Doubles values
A) @sta c
B) @classmethod
C) @method
D) @self
Answer: B
A) delete
B) destroy
C) del
D) finalize
Answer: C
A) [1, 3, 4, 5]
B) [3, 1, 4, 5]
C) [1, 1, 3, 4, 5]
D) Error
Answer: A
A) [1, 2, 2, 3]
B) {1, 2, 2, 3}
C) {1, 2, 3}
D) Error
Answer: C
B) Set
C) Tuple
D) String
Answer: B
print(fact(3))
A) 6
B) 9
C) 3
D) Error
Answer: A
A) Always stable
B) Minimum swaps
C) Uses pivot
A) Linear search
B) Binary search
C) Bubble search
D) Tree traversal
Answer: B
75. How many comparisons does linear search do in worst case for n items?
A) 1
B) n
C) n/2
D) log(n)
Answer: B
76. Which Python module provides array support with fixed types?
A) array
B) list
C) typing
D) numpy
Answer: A
A) Less memory
C) Be er performance always
D) Restarts loop
Answer: A
A) True
B) False
C) Error
D) None
Answer: A
A) True
B) False
C) 0
D) None
Answer: B
A) O(1)
B) O(n)
C) O(log n)
D) O(n log n)
Answer: A
82. What is the me complexity of removing an element from the middle of a list?
A) O(1)
B) O(n)
C) O(log n)
D) O(n^2)
Answer: B
A) List
B) Tuple
C) Set
D) Array
Answer: C
A) explode()
B) char()
C) list()
D) strtolist()
Answer: C
A) read ('r')
B) write ('w')
C) append ('a')
D) binary ('b')
Answer: A
A) Dic onary
B) List
C) Same
D) Depends on size
Answer: A
B) Merge Sort
C) Selec on Sort
D) Inser on Sort
Answer: B
A) insert()
B) append()
C) push()
D) add()
Answer: A
A) True
B) False
C) None
D) 0
Answer: B
A) object
B) def
C) struct
D) class
Answer: D
A) mem()
B) id()
C) ref()
D) address()
Answer: B
A) True
B) False
C) list
D) Error
Answer: A
93. Which loop is most appropriate when the number of itera ons is unknown?
A) for
B) while
C) do-while
D) repeat
Answer: B
A) List
B) Dic onary
C) Tuple
D) Set
Answer: C
A) Skips func on
C) Exits loop
D) Repeats loop
Answer: B
A) Membership
B) Index
C) Type
D) Range
Answer: A
A) if-else
B) try-catch
C) try-except
D) switch-case
Answer: C
C) A method in a class
D) A type of loop
Answer: B
A) Pass by value
B) Pass by reference
C) Pass by object-reference
D) Pass by copy
Answer: C
D) Python En ty Processor
Answer: A