As a leading data visualization tool, Tableau has many desirable and unique features. Its powerful data discovery and exploration application allows you to answer important questions in seconds. You can use Tableau's drag and drop interface to visualize any data, explore different views, and even combine multiple databases easily. It does not require any complex scripting. Anyone who understands the business problems can address it with a visualization of the relevant data. After analysis, sharing with others is as easy as publishing to Tableau Server. Tableau Features Tableau provides solutions for all kinds of industries, departments, and data environments. Following are some unique features which enable Tableau to handle diverse scenarios. Speed of Analysis − As it does not require high level of programming expertise, any user with access to data can start using it to derive value from the data. Self-Reliant − Tableau does not need a complex software setup. The desktop ve...
Differences between Hive and Pig: Hive Pig 1.Hive is declarative language works on HiveQL(HQL) which is similar to SQL. 1.Pig is procedural language. Works on Pig Latin 2.Used by data analytics people 2.Used by Researchers, and programmers. 3.Works only on structured data. 3.Works on structured, semi structured and unstructured data . 4.Hive operates on server side of the cluster. 4.Pig operates on Client side of the cluster. 5.Supports partitioning of data. 5.Doesnot support partitioning. 6.Doesnot load the data quickly but executes quickly 6.Loads the data quickly and effectively 7.Has separate metadata database on HDFS. 7.Doesnot have separate metadata database.Uses HDFS as its database. 8.Hive was first developed by facebook 8.Pig was first developed by ...
Given an array of positive and negative integer s, find a contiguous subarray whose sum (sum of elements) is maximized. · Maximum subarray in an array is found in a single scan. We keep track of global maximum sum so far and the maximum sum, which include the current element. · When we find global maximum value so far is less than the maximum value containing current value we update the global maximum value. · Finally return the global maximum value.Concept of Stack A stack is a memory in which values are stored and retrieved in “last in firs import java.util.*; class SumOfArray { public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println("enter size of Array"); int a=s.nextInt(); int[] arr=new int[a]; System.out.println("enter element of Array"); for(int i=0;i<a;i++) { arr[i]=s.nextInt(); } System.out.println("Max sub...
Comments
Post a Comment