Skip to main content

Contact Us

APPLICATIONS

Comments

Post a Comment

Popular posts from this blog

ISC Computer Science-2020 Paper 2(Theory) Q7. Solved

Computer Science Paper -(ISC Programs 2020) Write a program in JAVA to to find the date and the month from a given day number for a particular year. For e.g.  Year: 2020 Day: 64 March 4, 2020     ----------------------------------------------------------------------      import java.util.*; public class Q_7 {     public static void main(String args[])     {         Scanner sc=new Scanner(System.in);         System.out.println("Year : ");         int i,f,s;         int year=sc.nextInt();         System.out.println("Day : ");         int d=sc.nextInt();         int a[]={31,28,31,30,31,30,31,31,30,31,30,31};         String b[]={"January","February","March","April","May","June","July","August","September","October","November","December"}; ...
Post a Comment
Read more

You got latest news updates here.......

Jeep stranded in a  water becomes a Social Media Sensation The vehicle, which the police in Myrtle shore, S.C., found abandoned as Hurricane Dorian loomed, grew into a popular meme. As he was turning, Mr. Farrar got stuck in a ditch in the sand and left the vehicle in search of help, but all of the towing companies he called said they couldn’t get to the vehicle before the hurricane was expected to strike. Someone noticed the abandoned vehicle on the beach, and called the police. Officers were sent around 7 a.m., according to a police report, but with the hurricane nearly upon them, they determined it was too dangerous for a tow truck to remove the Jeep. Before leaving, one officer attached a buoy to the bumper so the vehicle could be located later.
Post a Comment
Read more

Greedy approach to Solve Array/Lists Problems having large number of elements.

Greedy   Approach to Solve Array problems Are you tired of using two loops to check individual elements ? If yes, then try this Greedy Approach to solve these kind of problems. For e.g.,   1) We have two arrays as given below: 2) First, sort the arrays in descending order: 3) Now, check the conditions in a single for loop. Check below for full greedy approach (PYTHON CODE SNIPPET) : count,j=0,0             for j in range(N):                 if A[count]>B[j]:                        count+=1             print(count) Comment below if it works!!! Thank You
1 comment
Read more