Skip to main content

Terms and Conditions

 

Terms of use of the site

The motivation behind this site is to unite all Developers and Students who work in Programming and Internet field, with the goal that we can help one another and make our work simpler. This site is the simplest method to connect with industry specialists. We have made this site to empower everybody to pick up acknowledgment for their work, information, aptitudes and chance to help other people refine their insight.

Here you will find both professionals with years of experience and knowledge in the field, as well as people who are just learning to work with these programs. Please treat all participants in this forum with respect. The use of cynicism, offensive qualifications, and personal attacks on any of the forum participants will not be tolerated. If you ever come across content on this site that is contrary to good tone and our general terms and conditions, please notify the administrator immediately. The content will be immediately deleted and the user blocked.

Web Owners maintain the network and related services on this site to ensure availability 7 days a week, 24 hours a day. However, site availability may be interrupted in some cases. This may be due to technical reasons, such as telecommunication malfunction or lack of equipment, as well as website maintenance. Administrators are not responsible for network interruptions for the reasons listed above. In the event of interruption, the necessary measures shall be taken in good time to restore the service offered. The Website reserves the right to restrict or discontinue the provision of the service. You agree that the site will not be responsible for any change in the services provided.

Users receive a different number of points according to their participation in the forum. For every question you ask, you get some points to your asset. You get some bonus points for each answer. If your answer is chosen as the best one, you get an extra points to your asset.

The content of this website is protected within the meaning of the Copyright and Related Rights Act (LAPS) - software product design, graphic design, and published copyright content: articles, questions and answers, comments, opinions, opinions, photos, individual elements, texts, other animated elements, graphics, HTML code, databases, avatars, etc.

These General Terms and Conditions are applied simultaneously with the protective norms of the Pakistam legislation in force, and in particular with the Criminal Code and the CSPA, insofar as there are no contradictions with the clauses explicitly agreed with these General Terms and Conditions.

The website allows you to post questions and answers related to Programming and Study. Questions on side topics are also allowed, as long as they do not prevail and contribute to solving a specific problem. Before you ask a question, please make sure that this question is no longer asked. Duplicate issues will not be allowed to be published, i.e. ones that have already been set before on the site. Questions that conflict with the site's terms of service will be immediately deleted. Users who violate the Terms of Service will be deleted.

Conditions of confidentiality of information

This site uses cookies to provide the best services to its users.

The Website is not responsible for the accuracy, completeness and availability of the services provided on the site. The Website is not responsible for which users use the website, how users interpret the information on this site and for what purposes they use the information. Administrators do not provide a guarantee that all responses will be answered or will meet the expectations of the user such as the quality of the service offered, including response time, no bugs and errors, correction of existing defects, etc.

Cookies are used by sites like Google to deliver ads based on user behavior online.
You can change your cookie usage settings from your Google Account.

If you have any questions about the Terms of Use and the Privacy Policy, you can contact the site administrators at any time.

Popular posts from this blog

How to split a rinex file if I need 24 hours data

Trying to divide rinex file using the command gfzrnx but getting this error. While doing that getting this error msg 'gfzrnx' is not recognized as an internal or external command Trying to split rinex file using the command gfzrnx. also install'gfzrnx'. my doubt is I need to run this program in 'gfzrnx' or in 'cmdprompt'. I am expecting a rinex file with 24 hrs or 1 day data.I Have 48 hrs data in RINEX format. Please help me to solve this issue. source https://stackoverflow.com/questions/75385367/how-to-split-a-rinex-file-if-i-need-24-hours-data

ValueError: X has 10 features, but LinearRegression is expecting 1 features as input

So, I am trying to predict the model but its throwing error like it has 10 features but it expacts only 1. So I am confused can anyone help me with it? more importantly its not working for me when my friend runs it. It works perfectly fine dose anyone know the reason about it? cv = KFold(n_splits = 10) all_loss = [] for i in range(9): # 1st for loop over polynomial orders poly_order = i X_train = make_polynomial(x, poly_order) loss_at_order = [] # initiate a set to collect loss for CV for train_index, test_index in cv.split(X_train): print('TRAIN:', train_index, 'TEST:', test_index) X_train_cv, X_test_cv = X_train[train_index], X_test[test_index] t_train_cv, t_test_cv = t[train_index], t[test_index] reg.fit(X_train_cv, t_train_cv) loss_at_order.append(np.mean((t_test_cv - reg.predict(X_test_cv))**2)) # collect loss at fold all_loss.append(np.mean(loss_at_order)) # collect loss at order plt.plot(np.log(al...

Sorting large arrays of big numeric stings

I was solving bigSorting() problem from hackerrank: Consider an array of numeric strings where each string is a positive number with anywhere from to digits. Sort the array's elements in non-decreasing, or ascending order of their integer values and return the sorted array. I know it works as follows: def bigSorting(unsorted): return sorted(unsorted, key=int) But I didnt guess this approach earlier. Initially I tried below: def bigSorting(unsorted): int_unsorted = [int(i) for i in unsorted] int_sorted = sorted(int_unsorted) return [str(i) for i in int_sorted] However, for some of the test cases, it was showing time limit exceeded. Why is it so? PS: I dont know exactly what those test cases were as hacker rank does not reveal all test cases. source https://stackoverflow.com/questions/73007397/sorting-large-arrays-of-big-numeric-stings