Area of a Circle The program must accept the diameter of the circle as a command line argument and print the area of the circle rounding it up to 2 decimal places. Example Input/Output 1: Input: 14 Output: 154.00

Perfect Square till N Java, Cpp Given a positive integer N as the input, print all the perfect squares till N (inclusive of N). Input Format: The first line contains N. Output Format: The first line contains the perfect squares till N separated by

Pattern - ZigZag Number Square Given an integer N as the input, print the pattern as given in the Example Input/Output section. Input Format: The first line contains N. Output Format: N lines containing the desired pattern. Boundary Conditions: 2 <= N <= 50 Example Input/Output

Second largest value among n integer The program must accept N integers and print the second largest value among the N integers. Input Format: The first line denotes the value of N. Next N lines will contain the N integer values. Output Format: The first line contains the

Matrix Pattern Printing - First / Last Higher Given an integer N as the input, print the pattern as given in the Example Input/Output section. Input Format: The first line contains N. Output Format: N lines containing the desired pattern. Boundary Conditions: 2 <= N <= 100

Pattern Printing – Till N & Reverse The program must accept an integer N and print 2N lines as shown in the Example Input/Output. Input Format:The first line contains N. Output Format:2N lines as shown in the Example Input/Output. Boundary Conditions:2 <= N <= 100 Example Input/Output 1:4 Output:12233344444444333221 Example

Binary Search Tree Implement a C program to construct a Binary Search Tree and also display the elements in the tree using Inorder , Preorder and Postorder traversals. Create a structure

Robot Picking Boxes Robots are used to automate the process of picking up mobile phone boxes and relocating them within a warehouse. The boxes are stacked and arranged

L4 – Linked List :All operations Write a C program to add a node after a particular position in the Linked List. Define a structure struct node { int data; struct node * link; } Dont use a global variable for storing count … Each function will be checked individually…. Include functions append — to