Search & Filtering
Programming Problem I ( class, stack, Linked list )
You are required to find out whether the number entered by user have length even or odd. You cannot use the modulus function, modulus operator or length function
Programming Problem I ( Singly Circular Linked List)
We are given a pointer to the first element of a linked list L. There are two possibilities for L, either it ends (snake) or it points back to head of the list (snail). Give a function that tests whether given list it is a snake or a snail.
Suppose there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node is not known. Also, the number of nodes in each of the lists before they intersect is unknown and may be different in each list.
For example, List 1 may have 11 nodes before it reaches the intersection point, and List 2 might have 111 nodes before it reaches the point of intersection where 111 and 11 may be m = 11, 111 < 11 or 111 > 11. Give an algorithm for finding the merging point.
text=r'''Everyone has the following fundamental freedoms:
(a) freedom of conscience and religion;
(b) freedom of thought, belief, opinion and expression, including freedom of the press and other media of communication;
(c) freedom of peaceful assembly; and
(d) freedom of association.'''
import re
pattern = X
print(len(re.findall(pattern,text)))
1. Insert a node at beginning
2. Insert a node at end
3. Delete a node from beginning
4. Delete a node from end
5. Count number of nodes in Circular linked
list
Q.1.5 Discuss why is it important to have security in the following Network protocols:
Link Layer;
Network layer;
Transport layer.
Discuss denial of service under the following heading:
• how denial of service works;
• How it can be detected;
• The most well‐known and spectacular DoS attacks in the last few years
Write a program that reads the numbers and sorts them by using the Counting Sort algorithm and finally search a number from that array using Linear Search Algorithm.
Input: 3 6 5 4 7 8 9
Search Item: 7
Output:
Sorted Array: 3 4 5 6 7 8 9
Search item 7 is found.
Given an array arr[] sorted in ascending order of size N and an integer K. Check if K is present in the array or not. (Use Binary Search)
Input: N = 5 K = 6 arr[] = {1,2,3,4,6}
Output: 1
Explanation: Since, 6 is present in the array at index 4 (0-based indexing),
Output is 1
Provide two real life examples of use case situations where QoS is commonly used.
