Question 14 Marks
Write algorithm for Delete operation in Queue.
Questions
4 Marks Each
🎯
Test yourself on this topic
40 questions · timed · auto-graded
View full question & answer→
Question 24 Marks
Write algorithm for insert operation in Queue.
Question 34 Marks
Write algorithm for POP(Remove) operation in stack.
Question 44 Marks
Write algorithm for PUSH(insert) operation in stack.
Question 54 Marks
Write the function Selection() to sort the list using Selection sort technique. The function will take the list as parameter.
Question 64 Marks
Write the function Insertion() to sort the list using Insertion sort technique. The function will take the list as parameter.
Question 74 Marks
Write the function Bubble() to sort the list using Bubble sort technique. The function will take the list as parameter.
Question 84 Marks
Write definition of a Method AFIND(CITIES) to display all the city names from a list of CITIES, which are starting with alphabet A.
For example:If the list CITIES contains[“AHMEDABAD”,”CHENNAI”,”NEW DELHI”,”AMRITSAR”,”AGRA”]The following should get displayedAHEMDABADAMRITSARAGRA
Question 94 Marks
Write a Python program to push all zeros to the end of a given list a. The order of the elements should not change.
Question 104 Marks
Given a list of numbers (integers), write a function to return the second maximum and second minimum in this list.
Question 114 Marks
Write a program which will store the student information in the form of a nested list as follows.
( i.e: student_name, roll_number, avg_marks )
Question 124 Marks
WAP using Function to take an list as parameter and print Second largest elemennt.
Question 134 Marks
Write a Python Function to count the number of elements in a list within a specified range.
Question 144 Marks
WAP using function to change the alternate index value of the element.
Question 154 Marks
WAF to take a list and inserting element as parameter and insert the new element at begining of the list.
Question 164 Marks
WAP using function to insert new element in sorted list.
Question 174 Marks
Write a menu driven python program using function InQ(), DelQ() and DisplayQ() to implement the Queue. The program will store details of the flights
i.e Flight Number, Flight Name and Fare.
i.e Flight Number, Flight Name and Fare.
Question 184 Marks
Write a menu driven python program using function InQ(), DelQ() and DisplayQ() to implement the Queue. The program will store the name of the books.
Question 194 Marks
Write a menu driven python program using function Push (), Pop () and Display() to implement the stack. The program will store the Employee details i.e. Employee number, Employee name and Salary.
Question 204 Marks
Write a menu driven python program using function Push(), Pop() and Display() to implement the stack. The program will store the name of the books.
Question 214 Marks
Write AddClient(Client) and DeleteClient(Client) methods in python to add a new Client and delete a Client from a List of Client Names, considering them to act as insert and delete operations of the queue data structure.
Question 224 Marks
Write Push(Book) and Pop(Book) methods in Python to Add a new Book and Remove a Book from a List of Books, considering them to act as PUSH and POP
operations of the data structure Stack.
operations of the data structure Stack.
Question 234 Marks
Write a function Common () to accept lists as argument and return the list with common elements from both the lists.
Question 244 Marks
Write a Function Filter() which will take a list as parameter and made the different lists Even[] and Odd[]. And then combine the two list and return the main list i.e. nested list.
Question 254 Marks
Write the function Change(), to double the even elements and triple the odd elements present in a list. The function will take and list as parameter and also return the list.
Question 264 Marks
Suppose we want to sort the following list of 7 elements in ascending order using
Selection sort:
Write the complete steps to sort the above along with each pass explanation.
Answer
View full question & answer→Original array
Iteration 1 : Select the smallest element from unsorted array which is 3 and exchange 3 with the first element of the unsorted array i.e. exchange 3 with 8. After 1st iteration the element 3 is at its final position in the array.
Iteration 2: The second pass identifies 4 as the next smallest element and then exchange 4 with 5.
Iteration 3: The third pass identifies 5 as the next smallest element and then exchange 5 with 9.
Iteration 4: The third pass identifies 7 as the next smallest element and then exchange 7 with 8.
Iteration 5: The third pass identifies 8 as the next smallest element and then exchange 8 with 16
Iteration 6: The third pass identifies 9 as the next smallest element and then exchange 9 with 9 which makes no effect. Thus, the final list
Question 274 Marks
p>Suppose we want to sort the following list of 7 elements in ascending order using insertion sort
Write the complete steps to sort the above along with each pass explanation.
Answer
View full question & answer→Now, we get the sorted list is as follows:
The above procedure can also be shown as:
Question 284 Marks
Suppose we want to sort the following list of 7 elements in ascending order using bubble sort:
Write the complete steps to sort the above along with each pass explanation.
Answer
View full question & answer→The first pass of the comparisons goes as follows:
This completes one pass (round) of comparisons. This pass had 6 individual comparisons and had put the most significant element (9) of the list at the last position.
Now, the second pass of the comparisons starts. We shall not include the last element (9) in this pass, as it is the most significant element of the list and has been put at its required position by the previous pass. The second pass goes as follows:
This completes the second pass of comparisons. This pass had 5 individual comparisons and has put the most significant element (8), of the list of first six elements, at the last position. It gives the following list:
So, now we have one less element to sort.
It means that in each pass we are taking one element to its required position in the sorted list. This is repeated until all the elements have been sorted. Let us see the list after each pass:
We observe that each pass takes one element to its desired position, and hence, six elements are at their desired positions in six passes, and the seventh element is automatically left at its desired position. So, a list of seven elements are sorted in six passes.
In general, a list of N elements can be sorted in N-1 passes.
Question 294 Marks
Write the Pseudocode to sort the list using Selection sort – to sort a list A in ascending order
Question 304 Marks
Write the Pseudocode to sort the list using Insertion sort – to sort a list A in ascending order
Question 314 Marks
Write the Pseudocode to sort the list using Bubble sort– to sort a list A in ascending order
Question 324 Marks
Write a menu driven program in python to implement the various method related to insertion and deletion in the list.
Question 334 Marks
Write a program to implement the Queue using list.
Question 344 Marks
Write definition of a function MSEARCH(STATES) to display all the state names from a list of STATES, which are starting with alphabet M.
For example:
If the list STATES contains
The following should get displayed
MP
MH
MZ
Question 354 Marks
Write a program to implement the stack using list.
Question 364 Marks
Write definition of a function EvenSum(NUMBERS) to add those values in the list of NUMBERS, which are odd on position.
Question 374 Marks
Write a python program to create a list of numeric values and sort the list using Insertion Sort Technique.
Question 384 Marks
Write a python program to create the list numeric values and sort the list using Bubble sort technique.
Question 394 Marks
Write a python program using method to create the list of numeric values and search the number in the list using Binary Search Technique.
Question 404 Marks
Write a python program using function to create the list of numeric values and search the number in the list using Linear Search Technique. The function will return –1 if element not found otherwise show the position.