Programming & Computer Science Answers

C++ 9913
Python 5288
Java | JSP | JSF 3611
C 1680
C# 1362
Computer Networks 989
Algorithms 652
Databases | SQL | Oracle | MS Access 641
HTML/JavaScript Web Application 588
Other 537
Visual Basic 358
Assembler 209
Software Engineering 202
AJAX | JavaScript | HTML | PHP 166
MatLAB 150
MatLAB | Mathematica | MathCAD | Maple 124
Action Script | Flash | Flex | ColdFusion 112
UNIX/Linux Programming 89
Web Development 73
Excel 36
ASP | ASP.NET 23
Delphi | Pascal 21
Perl 16
Prolog 9
Functional Programming 9
MathCAD 5
Wolfram Mathematica 4
WPF 4
Ruby | Ruby on Rails 3
NodeJS Web Application 2

Questions answered by Experts: 26 876

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search

Write a python function Sum(x) which takes a comma-separated string of numbers and returns the reverse of the sum of the smallest and largest numbers in the given list as shown in example. For ex , for the list 10,28,43,52 the sum of smallest and largest numbers is 62 and the reverse is 26. Write a separate recursive function Reverse-Sum(n)

to compute the reverse of a number and call this function inside the Sum(x). Do not use

input() function, specify the input in fixed form.


given weekday of the first day of the month, determine the day of the week of the given date in that month.

input: 1st line is a string-D

2nd line is a integer-N


write a program to print W pattern of n lines using an asterisk charecter (*)

Explain, What is E-banking and its advantages?

What are the tools you experienced in E-Commerce?

How you can benefit from E-Commerce?

How can education technology improve learning?

What do you think? How does technology affect human relationships?

In today's modern living, how important is information technology?

Given a weighted undirected tree of N nodes and Q queries. Each query contains an integer D. For each query, find the number of paths in the given tree such that all the edges in the path




are divisible by D.




put Format:




First line contains two space separated integers, N and Q (1 ≤ N.Q < 10³), denoting number of nodes in the tree and number of queries. Next N 1 ine contains three space separated integer Y and W[1 < X,Y <N] (1< W< 10³), denoting that there is an edge between X and Y of weight W. Next Qlines contains one integer each, 0(1 <D≤ 10').

LATEST TUTORIALS
APPROVED BY CLIENTS