Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
This can be checked using below SQL query and it will display all system schema in HANA system.select distinct BASE_SCHEMA_NAME from "SYS"."OBJECT_DEPENDENCIES" where BASE_SCHEMA_NAME like ‘_SYS%’;
You can check this detail using a SQL query in HANA. You have to pass schema name in Where condition. Try running below SQL query and this will show you list of all tables in a schema.Select distinct BASE_OBJECT_NAME from "SYS"."OBJECT_DEPENDENCIES" where BASE_SCHEMA_NAME like 'AF_HANA';AH_HANA- Schema name
This can be checked via SQL query on view in HANA system. Try run the below query −SELECT "DEPENDENT_OBJECT_NAME" from "SYS"."OBJECT_DEPENDENCIES" WHERE "BASE_SCHEMA_NAME" = 'AF_HANA' AND "BASE_OBJECT_NAME" = 'STORE' AND "DEPENDENT_OBJECT_NAME" Not like '%hier%';
You can check this detail using a SQL query in HANA. You have to pass schema name in Where condition. Try running below SQL query −SELECT "DEPENDENT_OBJECT_NAME" from "SYS"."OBJECT_DEPENDENCIES" WHERE "BASE_SCHEMA_NAME" = 'AF_HANA' AND "BASE_OBJECT_NAME" = 'STORE' AND "DEPENDENT_OBJECT_NAME" like '%hier%';
With use of Where-used functionality you can easily find this information. Right click on object name → Where-Used
In SAP HANA, you can delete all inactive objects in workspace. In HANA Modeler Perspective → Delete Inactive Objects..You can also revert to last active version if exists.
Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a recursive call of the function.Following is an example to find palindrome of a given number using recursive function.Examplepublic class PalindromeRecursion { public static boolean isPalindrome(String str){ if(str.length() == 0 ||str.length()==1){ return true; } if(str.charAt(0) == str.charAt(str.length()-1)){ return isPalindrome(str.substring(1, str.length()-1)); } return false; ... Read More
Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a recursive call of the function.ExampleFollowing is an example to find Fibonacci series of a given number using a recursive functionpublic class FibonacciSeriesUsingRecursion { public static long fibonacci(long number) { if ((number == 0) || (number == 1)) return number; else return fibonacci(number - 1) + fibonacci(number - 2); } public static void main(String[] args) { for (int counter = 0; counter
Floyd's triangle, named after Robert Floyd, is a right-angled triangle, which is made using natural numbers. It starts at 1 and consecutively selects the next greater number in the sequence.AlgorithmTake a number of rows to be printed, n.Make outer iteration I for n times to print rowsMake inner iteration for J to IPrint KIncrement KPrint NEWLINE character after each inner iterationExampleimport java.util.Scanner; public class FloyidsTriangle { public static void main(String args[]){ int n, i, j, k = 1; System.out.println("Enter the number of lines you need in the FloyidsTriangle"); Scanner sc ... Read More
The java.util.Scanner class is a simple text scanner which can parse primitive types and strings using regular expressions.1. A Scanner breaks its input into tokens using a delimiter pattern, which by default matches whitespace.2. A scanning operation may block waiting for input.3. A Scanner is not safe for multi-threaded use without external synchronization.The nextInt() method of the Scanner class is used to read an integer value from the source.Exampleimport java.util.Scanner; public class ReadingNumbersFromUser { public static void main(String args[]){ Scanner sc = new Scanner(System.in); System.out.println("Enter a number ::"); int num ... Read More