Multiple Choice Quizzes

How to detect the user’s device using jQuery ?

Leave a Comment

The task is to determine the user’s device, whether it is iPad or not, using JQuery. Below are the required methods:

Example: This example uses the navigator.userAgent property to identify the user’s device.

<!DOCTYPE HTML>

<html>

<head>

<title>

JQuery

| Detect iPad users.

</title>

</head>

<script src=

</script>

<body style="text-align:center;"

id="body">

<h1 style="color:green;">

GeeksForGeeks

</h1>

<p id="GFG_UP"

style="font-size: 17px;

font-weight: bold;">

</p>

<button>

click here

</button>

<p id="GFG_DOWN"

style="color: green;

font-size: 24px;

font-weight: bold;">

</p>

<script>

$('#GFG_UP').text(

"Click on the button to see "+

"whether user's device is iPad or not");

$('button').on('click', function() {

var is_iPad =

navigator.userAgent.match(/iPad/i) != null;

$('#GFG_DOWN').text(is_iPad);

});

</script>

</body>

</html>

Output:

Before reaching the bottom:
After reaching the bottom:

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the “Improve Article” button below.

Source link

JavaScript vs Python : Can Python Overtop JavaScript by 2020?

Leave a Comment

This is the Clash of the Titans!!

And no…I am not talking about the Hollywood movie (don’t bother watching it…it’s horrible!). I am talking about JavaScript and Python, two of the most popular programming languages in existence today.

JavaScript is currently the most commonly used programming language (and has been for quite some time!) but now Python is dishing out some stiff competition. Python has been steadily increasing in popularity so much so that it is now the fastest-growing programming language. So now the question is…Will Python Replace JavaScript popularity by 2020?

To understand the above question correctly, it is important to know more about JavaScript and Python as well as the reasons for their popularity. So let’s start with JavaScript first!

Why is JavaScript so popular?

JavaScript is a high-level, interpreted programming language that is most popular as a scripting language for Web pages. This means that if a web page is not just sitting there and displaying static information, then JavaScript is probably behind that. And that’s not all, there are even advanced versions of the language such as Node.js which is used for server-side scripting.

JavaScript is an extremely popular language. And if my word doesn’t convince you, here are the facts!!!

According to StackOverflow Developer Survey Results 2019, JavaScript is the most commonly used programming language, used by 69.7 % of professional developers. And this is a title it has claimed the past seven years in a row.

In addition to that, the most commonly used Web Frameworks are jQuery, Angular.js and React.js (All of which incidentally use JavaScript). Now if that doesn’t demonstrate JavaScript’s popularity, what does?!

Image Source: Stackoverflow

So now the question arises…Why is JavaScript so popular?

Well, some of the reasons for that are:

JavaScript is used both on the client-side and the server-side. This means that it runs practically everywhere from browsers to powerful servers. This gives it an edge over other languages that are not so versatile.
JavaScript implements multiple paradigms ranging from OOP to procedural. This allows developers the freedom to experiment as they want.
JavaScript has a large community of enthusiasts that actively back the language. Without this, it would have been tough for JavaScript to establish the number one position it has.

Can Python Replace JavaScript in Popularity?

Python is an interpreted, general-purpose programming language that has multiple uses ranging from web applications to data analysis. This means that Python can be seen in complex websites such as YouTube or Instagram, in cloud computing projects such as OpenStack, in Machine Learning, etc. (basically everywhere!)

Python has been steadily increasing in popularity so much so that it is the fastest-growing major programming language today according to StackOverflow Developer Survey Results 2019.

This is further demonstrated by this Google Trends chart showing the growth of Python as compared to JavaScript over the last 5 years:

As shown in the above data, Python recorded increased search interest as compared to JavaScript for the first time around November 2017 and it has maintained its lead ever since. This shows remarkable growth in Python as compared to 5 years ago.

In fact, Stack Overflow created a model to forecast its future traffic based on a model called STL and guess what…the prediction is that Python could potentially stay in the lead against JavaScript till 2020 at the least.

Future-Traffic-on-Major-Programming-Languages-Stackoverflow

Image Source : Stackoverflow

All these trends indicate that Python is extremely popular and getting even more popular with time. Some of the reasons for this incredible performance of Python are given as follows:

Python is Easy To Use
No one likes excessively complicated things and that’s one of the reasons for the growing popularity of Python. It is simple with an easily readable syntax and that makes it well loved by both seasoned developers and experimental students. In addition to this, Python is also supremely efficient. It allows developers to complete more work using fewer lines of code. With all these advantages, what’s not to love?!!
Python has a Supportive Community
Python has been around since 1990 and that is ample time to create a supportive community. Because of this support, Python learners can easily improve their knowledge, which only leads to increasing popularity. And that’s not all! There are many resources available online to promote Python, ranging from official documentation to YouTube tutorials that are a big help for learners.
Python has multiple Libraries and Frameworks
Python is already quite popular and consequently, it has hundreds of different libraries and frameworks that can be used by developers. These libraries and frameworks are really useful in saving time which in turn makes Python even more popular. Some of the popular libraries of Python are NumPy and SciPy for scientific computing, Django for web development, BeautifulSoup for XML and HTML parsing, scikit-learn for machine learning applications, nltk for natural language processing, etc.

So What’s the Conclusion?

While JavaScript is currently the most popular programming language, Python could soon outstrip it of this title based on its incredible growth rate. So it is entirely possible that Python could be the most popular programming language by 2020.

However, this will merely impact the relative popularity of these two languages and not specify which among them is the better language. That choice is entirely subjective and may depend on multiple factors such as project requirements, scalability, ease of learning as well as the future growth prospects.

Please Improve this article if you find anything incorrect by clicking on the “Improve Article” button below.

Source link

Walk-Through DSA3 : Data Structures and Algorithms Online Course by GeeksforGeeks

Leave a Comment

This is a 10 weeks long online certification program specializing in Data Structures & Algorithms which includes pre-recorded premium Video lectures & programming questions for practice. You will learn algorithmic techniques for solving various computational problems and will implement more than 200 algorithmic coding problems. This course offers you a wealth of programming challenges that you may face at your next job interview. The course focuses mainly on Data Structure & Algorithms: the key to selection in top product based companies.

Recommended for:

Pre-Final/Final year students preparing for the Placement drives
Employees looking for a job change

This post is designed for all the registered users of the DSA3 course to get familiar with the learning environment of the course.

Let’s begin our tour of the DSA3 course.

Open GeeksforGeeks | Practice. Click on slider on the right side named “Live Batches” to access batches of all of the courses in which you are registered.

Click on the batch for DSA3 course, named “DSA Online 3 – Basic to Advance“.

Clicking on the above link will take you to the landing page of the DSA3 Batch. The landing page of the DSA3 course batch is shown below.

The main page of the batch for DSA3 contains the following components:

Tracks: This part of the batch contains, all of the tracks topic wise, which are released weekly. You can find the details about the topics week wise on the DSA3 Course Page.
Contests: This part contains the contests associated with the weeekly tracks. For each week there will be a contest where you can practice your skills in a timed environment. The contests have their own specific rules that are available on the contest page.
Leader Board: This is the leaderboard of the course and will display ranks of all of the users registered in the course.
Discussion: This is the discussion forum where you can ask any of your queries to our moderators.
Notice Board: The noticeboard is on the rightmost part of the page and will contain all of the important updates related to the course.

Let us look at each of the above-mentioned sections in details and about how to use them?

TRACKS

Each week a cluster of new tracks will be published. The tracks will have an overview, theory, video lectures, problems, and quiz sections. You are advised to read the theory and watch the videos before solving the problems and quiz.

We have used the second track of the first week of the course to show you a glimpse of the details of different parts of tracks.

CONTESTS

The Contests page contains a list of all of the contests associated with the tracks in a particular week. Contests are also released weekly along with the tracks and are open for the entire duration of the week with a time constraint of 2 Hours. That is, any registered user can complete the learning part of the week as soon as possible and can take part in the corresponding contest of that week at any time and can compete for a duration of 2 hours.

For each week there will be a contest where you can practice your skills in a timed environment. The contests have their own specific rules that are available on the contest page.

Below is the screenshot of the contest page of the course.

Discussion

We have also designed a discussion forum to help you troubleshoot the problems that you might comes across. You can ask queries to our doubt-solving team anytime and we assure you to get a reply within 2 hours.

Below is the screenshot of the discussion page:

Doubt Solving:

Please post your doubt with the link to the question in which you are facing difficulty.
We assure you to provide assistance within 2 hours.
You may ask queries during Weekdays in the time-slot 10 AM to 10 PM (IST), and during Weekend in the slot 10 AM to 6 PM (IST).
If you think a particular reply answers your query then please click on resolved.
For non-coding queries like certificates and all, please shoot a mail to geeks.classes@geeksforgeeks.org

You may ask any question by clicking on the “Ask / Start a new Discussion” button and filling up the modal as shown below:

Senior Technical Content Engineer | GeeksforGeeks

Please Improve this article if you find anything incorrect by clicking on the “Improve Article” button below.

Source link

Repeated Character Whose First Appearance is Leftmost

Leave a Comment

Given a string, find the repeated character present first in the string.

Examples:


Input  : geeksforgeeks
Output : g
(mind that it will be g, not e.)

Input  : abcdabcd
Output : a

Input  : abcd
Output : -1
No character repeats

Asked in: Goldman Sachs internship

We have discussed different approaches in Find repeated character present first in a string.

How to solve this problem using one traversal of input string?

Method 1 (Traversing from Left to Right) We traverse the string from left to right. We keep track of the leftmost index of every character. If a character repeats, we compare its leftmsot index with current result and update the result if result is greater

#include <bits/stdc++.h>

using namespace std;

#define NO_OF_CHARS 256

int firstRepeating(string& str)

{

int firstIndex[NO_OF_CHARS];

for (int i = 0; i < NO_OF_CHARS; i++)

firstIndex[i] = -1;

int res = INT_MAX;

for (int i = 0; i < str.length(); i++) {

if (firstIndex[str[i]] == -1)

firstIndex[str[i]] = i;

else

res = min(res, firstIndex[str[i]]);

}

return (res == INT_MAX) ? -1 : res;

}

int main()

{

string str = "geeksforgeeks";

int index = firstRepeating(str);

if (index == -1)

printf("Either all characters are "

"distinct or string is empty");

else

printf("First Repeating character"

" is %c",

str[index]);

return 0;

}

Output:


First Repeating character is g

Time Complexity : O(n). It does only one traversal of input string.
Auxiliary Space : O(1)

Method 2 (Traversing Right to Left) We traverse the string from right to left. We keep track of the visited characters. If a character repeats, we update the result.

#include <bits/stdc++.h>

using namespace std;

#define NO_OF_CHARS 256

int firstRepeating(string& str)

{

bool visited[NO_OF_CHARS];

for (int i = 0; i < NO_OF_CHARS; i++)

visited[i] = false;

int res = -1;

for (int i = str.length() - 1; i >= 0; i--) {

if (visited[str[i]] == false)

visited[str[i]] = true;

else

res = i;

}

return res;

}

int main()

{

string str = "geeksforgeeks";

int index = firstRepeating(str);

if (index == -1)

printf("Either all characters are "

"distinct or string is empty");

else

printf("First Repeating character"

" is %c",

str[index]);

return 0;

}

Output:


First Repeating character is g

Time Complexity : O(n). It does only one traversal of input string.
Auxiliary Space : O(1)

The method 2 is better than method 1 as it does fewer comparisons.

Please Improve this article if you find anything incorrect by clicking on the “Improve Article” button below.

Source link

Congnizant ( CTS ) Placement Preparation

Leave a Comment

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.

Source link

Given two arrays count all pairs whose sum is an odd number

Leave a Comment

#include <bits/stdc++.h>

using namespace std;

int count_pairs(int a[], int b[], int n, int m)

{

int odd1 = 0, even1 = 0;

int odd2 = 0, even2 = 0;

for (int i = 0; i < n; i++) {

if (a[i] % 2)

odd1++;

else

even1++;

}

for (int i = 0; i < m; i++) {

if (b[i] % 2)

odd2++;

else

even2++;

}

int pairs = min(odd1, even2) + min(odd2, even1);

return pairs;

}

int main()

{

int a[] = { 9, 14, 6, 2, 11 };

int b[] = { 8, 4, 7, 20 };

int n = sizeof(a) / sizeof(a[0]);

int m = sizeof(b) / sizeof(b[0]);

cout << count_pairs(a, b, n, m);

return 0;

}

Source link