Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
C C-Input and Output Quiz C

puts() vs printf() for printing a string

In C, given a string variable str, which of the following two should be preferred to print it to stdout? 1) puts(str); 2) printf(str); puts() can be preferre...
C++ School Programming pattern-printing

Programs for printing pyramid patterns in C++

This article is aimed at giving a C++ implementation for pattern printing. Simple pyramid pattern // C++ code to demonstrate star pattern #include <iostr...
CSS HTML Web Technologies

How to hide an element when printing a web page using CSS?

The media query is used to hide an element when printing a web pages. Use @media print query and set the visibility hidden to that element which need to hide at print...
PHP School Programming pattern-printing

PHP programs for printing pyramid patterns

This article is aimed at giving a PHP implementation for pattern printing. Simple Pyramid Pattern <?php // Php code to demonstrate // star pattern &#xA...
Python School Programming pattern-printing

Programs for printing pyramid patterns in Python

Patterns can be printed in python using simple for loops. First outer loop is used to handle number of rows and Inner nested loop is used to handle the number of col...
Python School Programming

Object Oriented Programming in Python Set 2 (Data Hiding and Object Printing)

Prerequisite : Object Oriented Programming in Python | Set 1 (Class, Object and Members)   Data hiding In Python, we use double underscore (Or __) before the at...
Backtracking Matrix chessboard-problems

Printing all solutions in N-Queen Problem

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example, following is a solution for 4 Que...
Dynamic Programming knapsack Dynamic Programming

Printing Items in 0/1 Knapsack

Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arr...
Dynamic Programming bitonic subsequence

Printing Longest Bitonic Subsequence

The Longest Bitonic Subsequence problem is to find the longest subsequence of a given sequence such that it is first increasing and then decreasing. A sequence, sorte...
Dynamic Programming LIS subsequence

Printing Maximum Sum Increasing Subsequence

The Maximum Sum Increasing Subsequence problem is to find the maximum sum subsequence of a given sequence such that all elements of the subsequence are sorted in incr...

Subscribe to Our Newsletter