Main menu

Search
Create account
Log in
Personal tools

Search results
Help
Tools
Search
Results 1 – 20 of 219
Advanced search:
Sort by relevance
Search in:
(Article)

Showing results for fshm. No results found for fsgj,.

The page "Fsgj," does not exist. You

can create a draft and submit it for
review or request that a redirect be
created, but consider checking the
search results below to see whether
the topic is already covered.

View (previous 20 | next 20)

(20 | 50 | 100 | 250 | 500)

(newest | oldest) View (newer

50 | older 50)
(20 | 50 | 100 | 250 | 500)

Compare selected revisions

18-Nov-23
curprev
 15:17, 18 November
2023 JPxG talk contribs 33,91
6 bytes +9 →Routine
calculations
12-Nov-23
curprev

02:18, 12 November
2023 Shadestar474 talk contrib
s 33,907 bytes +1 Fixed
grammar Tags: Mobile edit Mobile
web edit Advanced mobile edit

5-Nov-23
curprev

16:48, 5 November
2023 SMcCandlish talk contrib
s 33,906 bytes 0 Original was
much, much better, since the
rewrite strongly implies "since
the creation of the world". Don't
separate an "it" from its
referent when doing so can
make "it" seem to have a
different target. Tag: Manual revert

curprev

16:25, 5 November
2023 HouseBlaster talk contrib
s 33,906 bytes 0 →Synthesis
of published
material: per Comma#Separati
on of clauses, there should be
a comma after a dependant
clause when it comes before
an independent clause.
Instead of making a comma-
happy sentence, I have
swapped the order of the
clauses Tag: Reverted

Matrix
Matrix
Matrix
Matrix
Matrix
Matrix
Matrix
Matrix
Matrix
Matrix

String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String

String
String
String
String
String
String
String
String
String
 String
String

String
String

String
String
String
String
String
String

String
String

String
String

String
String

Searching & Sorting

Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting

Searching & Sorting

Searching & Sorting
Searching & Sorting
Searching & Sorting

Searching & Sorting

Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting

Searching & Sorting

Searching & Sorting
Searching & Sorting
Searching & Sorting

Searching & Sorting

Searching & Sorting
 LinkedList
LinkedList

LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
CompareLinkedList
selected revisions
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
 LinkedList
LinkedList

LinkedList
LinkedList
LinkedList

LinkedList
LinkedList

LinkedList
LinkedList
LinkedList
LinkedList
LinkedList

Binary Trees

Binary Trees
Binary Trees
Binary Trees

Binary Trees
Binary Trees
Binary Trees
Binary Trees

Binary Trees
Binary Trees

Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees

Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees

Binary Trees
Binary Trees

Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees
Binary Search Trees

Binary Search Trees

Greedy

Greedy
Greedy

Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy

Greedy
Greedy
 Greedy
Greedy

Greedy
Greedy
Greedy

Greedy
Greedy

BackTracking
BackTracking
BackTracking

BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking

BackTracking
BackTracking
BackTracking
BackTracking
 BackTracking

BackTracking
BackTracking

BackTracking
BackTracking

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues
Stacks & Queues

Stacks & Queues

Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues

Stacks & Queues

Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues
Stacks & Queues

Heap

Heap
Heap
Heap
Heap
Heap

Heap

Heap
Heap
Heap

Heap
Heap

Heap
Heap

Heap
Heap
Heap
Heap

Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph

Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
 Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph

Trie
Trie
Trie
Trie
Trie
Trie

Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming

Dynamic Programming

Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming

Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
 Questions by Love Babbar:
Youtube Channel: https://www.youtube.com/channel/UCQHLxxBFrbfdrk1jF0moTpw

FC FShM Moscow
FC FSHM Moscow (Russian: ФШМ (Москва)) is a Russian football team from Moscow. It played professionally from 1979 to 1996. FShM stands for "Football S
2 KB (117 words) - 19:44, 23 June 2022

Imaging model

Toggle Imaging model subsection

Additional features
Toggle Additional features subsection
Licensing

Security

Toggle Security subsection

Software
Toggle Software subsection

Alternatives

See also

References

Further reading

External links
PDF
89 languages
Article
Talk
Read
Edit
View history
Tools
From Wikipedia, the free encyclopedia
For other uses, see PDF (disambiguation).
Portable Document Format

Adobe PDF icon

Filename extension
Internet media type

Type code

Uniform Type Identifier (UTI)

Magic number
Developed by

Initial release

Latest release
Extended to

Standard
Open format?
Website

Portable Document Format (PDF), standardized as ISO 32000, is a file format developed by Adobe in 1992 to present docum
images, in a manner independent of application software, hardware, and operating systems.[2][3] Based on the PostScript langua
complete description of a fixed-layout flat document, including the text, fonts, vector graphics, raster images and other informat
in "The Camelot Project" initiated by Adobe co-founder John Warnock in 1991.[4] PDF was standardized as ISO 32000 in 2008.[5
was published in December 2020.

PDF files may contain a variety of content besides flat text and graphics including logical structuring elements, interactive eleme
layers, rich media (including video content), three-dimensional objects using U3D or PRC, and various other data formats. The
encryption and digital signatures, file attachments, and metadata to enable workflows requiring these features.

History[edit]
Main article: History of PDF
Adobe Systems made the PDF specification available free of charge in 1993. In the early years PDF was popular mainly in des
with several other formats, including DjVu, Envoy, Common Ground Digital Paper, Farallon Replica and even Adobe's own Pos

PDF was a proprietary format controlled by Adobe until it was released as an open standard on July 1, 2008, and published by
Standardization as ISO 32000-1:2008,[6][7] at which time control of the specification passed to an ISO Committee of volunteer ind
a Public Patent License to ISO 32000-1 granting royalty-free rights for all patents owned by Adobe necessary to make, use, se
implementations.[8]

PDF 1.7, the sixth edition of the PDF specification that became ISO 32000-1, includes some proprietary technologies defined o
Architecture (XFA) and JavaScript extension for Acrobat, which are referenced by ISO 32000-1 as normative and indispensable
32000-1 specification.[9] These proprietary technologies are not standardized, and their specification is published only on Adobe
supported by popular third-party implementations of PDF.

ISO's published ISO 32000-2 in 2017, available for purchase, replacing the free specification provided by Adobe. [13] In Decembe
ISO 32000-2:2020, was published, with clarifications, corrections, and critical updates to normative references [14] (ISO 32000-2 d
technologies as normative references).[15] In April 2023 the PDF Association made ISO 32000-2 available for download free of c

Technical details[edit]
A PDF file is often a combination of vector graphics, text, and bitmap graphics. The basic types of content in a PDF are:

Typeset text stored as content streams (i.e., not encoded in plain text);
Vector graphics for illustrations and designs that consist of shapes and lines;
Raster graphics for photographs and other types of images
Multimedia objects in the document.
In later PDF revisions, a PDF document can also support links (inside document or web page), forms, JavaScript (initially availa
other types of embedded contents that can be handled using plug-ins.

PDF combines three technologies:

 An equivalent subset of the PostScript page description programming language but in declarative form, for generating th
A font-embedding/replacement system to allow fonts to travel with the documents.

A structured storage system to bundle these elements and any associated content into a single file, with data

PostScript language[edit]
PostScript is a page description language run in an interpreter to generate an image. It can handle graphics and has standard f
as if statements and loop commands. PDF is largely based on PostScript, but simplified to remove flow control features like t
commands equivalent to lineto remain.

Historically, the PostScript-like PDF code is generated from a source PostScript file. The graphics commands that are output by
and tokenized.[clarification needed] Any files, graphics, or fonts to which the document refers also are collected. Then, everything is compre
entire PostScript world (fonts, layout, measurements) remains intact.[citation needed]

As a document format, PDF has several advantages over PostScript:

PDF contains tokenized and interpreted results of the PostScript source code, for direct correspondence between chang
and changes to the resulting page appearance.
Since version 1.4 PDF supports transparent graphics; PostScript does not.
PostScript is an interpreted programming language with an implicit global state, so instructions accompanying the descr
appearance of any following page; consequently all preceding pages in a PostScript document must be processed to de
given page, unless the optional PostScript Document Structuring Conventions have been carefully compiled and include
document is unaffected by the others, so it is possible to jump quickly to any page of a long document.
PDF since v1.6 supports embedding of interactive 3D documents: 3D drawings can be embedded using U3D or PRC and vario

File format[edit]
A PDF file is organized using ASCII characters, except for certain elements that may have binary content. The file starts with a
readable string) and the version of the format, for example %PDF-1.7. The format is a subset of a COS ("Carousel" Object Stru
primarily of objects, of which there are nine types:[15]

Boolean values, representing true or false

Real numbers
Integers

Strings, enclosed within parentheses ((...)) or represented as hexadecimal within single angle brackets (<...>).

Names, starting with a forward slash (/)

Arrays, ordered collections of objects enclosed within square brackets ([...])
Dictionaries, collections of objects indexed by names enclosed within double angle brackets (<<...>>)

Streams, usually containing large amounts of optionally compressed binary data, preceded by a dictionary an

The null object

 Comments using 8-bit characters prefixed with the percent sign (%) may be inserted.

Objects may be either direct (embedded in another object) or indirect. Indirect objects are numbered with an object number and
between the obj and endobj keywords if residing in the document root. Beginning with PDF version 1.5, indirect objects (exce
special streams known as object streams (marked /Type /ObjStm). This technique enables non-stream objects to have stan
reduces the size of files that have large numbers of small indirect objects and is especially useful for Tagged PDF. Object strea
object's generation number (other than 0).

An index table, also called the cross-reference table, is located near the end of the file and gives the byte offset of each indirect
design allows for efficient random access to the objects in the file, and also allows for small changes to be made without rewriti
Before PDF version 1.5, the table would always be in a special ASCII format, be marked with the xref keyword, and follow the
Version 1.5 introduced optional cross-reference streams, which have the form of a standard stream object, possibly with filters
instead of the ASCII cross-reference table and contains the offsets and other information in binary format. The format is flexible
specification (using the /W array), so that for example, a document not exceeding 64 KiB in size may dedicate only 2 bytes for

At the end of a PDF file is a footer containing

The startxref keyword followed by an offset to the start of the cross-reference table (starting with the xref keyword)
followed by
The %%EOF end-of-file marker.
If a cross-reference stream is not being used, the footer is preceded by the trailer keyword followed by a dictionary containi
contained in the cross-reference stream object's dictionary:

A reference to the root object of the tree structure, also known as the catalog (/Root)
The count of indirect objects in the cross-reference table (/Size)
Other optional information
Within each page, there are one or multiple content streams that describe the text, vector and images being drawn on the page
similar to PostScript.[21]

revisions
The maximum size of an Acrobat PDF page, superimposed on a map of Europe.
There are two layouts to the PDF files: non-linearized (not "optimized") and linearized ("optimized"). Non-linearized PDF files ca
counterparts, though they are slower to access because portions of the data required to assemble pages of the document are s
Linearized PDF files (also called "optimized" or "web optimized" PDF files) are constructed in a manner that enables them to be
waiting for the entire file to download, since all objects required for the first page to display are optimally organized at the start o
using Adobe Acrobat software or QPDF.

Page dimensions are not limited by the format itself. However, Adobe Acrobat imposes a limit of 15 million by 15 m

Imaging model[edit]

The basic design of how graphics are represented in PDF is very similar to that of PostScript, except for the use of tr

PDF graphics use a device-independent Cartesian coordinate system to describe the surface of a page. A PDF page descriptio
or skew graphical elements. A key concept in PDF is that of the graphics state, which is a collection of graphical parameters tha
by a page description. PDF has (as of version 2.0) 25 graphics state properties, of which some of the most important are:

The current transformation matrix (CTM), which determines the coordinate system
The clipping path
The color space
The alpha constant, which is a key component of transparency
Black point compensation control (introduced in PDF 2.0)
Vector graphics[edit]

As in PostScript, vector graphics in PDF are constructed with paths. Paths are usually composed of lines and cubic Bézier curv
outlines of text. Unlike PostScript, PDF does not allow a single path to mix text outlines with lines and curves. Paths can be stro
for clipping. Strokes and fills can use any color set in the graphics state, including patterns. PDF supports several types of patte
which a piece of artwork is specified to be drawn repeatedly. This may be a colored tiling pattern, with the colors specified in the
pattern, which defers color specification to the time the pattern is drawn. Beginning with PDF 1.3 there is also a shading pattern
colors. There are seven types of shading patterns of which the simplest are the axial shading (Type 2) and radial shading (Type

Raster images[edit]

Raster images in PDF (called Image XObjects) are represented by dictionaries with an associated stream. The diction

ASCII85Decode, a filter used to put the stream into 7-bit ASCII,

ASCIIHexDecode, similar to ASCII85Decode but less compact,
FlateDecode, a commonly used filter based on the deflate algorithm defined in RFC 1951 (deflate is also used in the gz
others); introduced in PDF 1.2; it can use one of two groups of predictor functions for more compact zlib/deflate compre
specification and predictors (filters) from the PNG specification (RFC 2083),
 LZWDecode, a filter based on LZW Compression; it can use one of two groups of predictor functions for more

RunLengthDecode, a simple compression method for streams with repetitive data using the run-length encod

DCTDecode, a lossy filter based on the JPEG standard,

CCITTFaxDecode, a lossless bi-level (black/white) filter based on the Group 3 or Group 4 CCITT (ITU-T) fax compressio

JBIG2Decode, a lossy or lossless bi-level (black/white) filter based on the JBIG2 standard, introduced in PDF 1
JPXDecode, a lossy or lossless filter based on the JPEG 2000 standard, introduced in PDF 1.5.
Normally all image content in a PDF is embedded in the file. But PDF allows image data to be stored in external files by the use
Standardized subsets of PDF, including PDF/A and PDF/X, prohibit these features.

Text[edit]
Text in PDF is represented by text elements in page content streams. A text element specifies that characters should be drawn
specified using the encoding of a selected font resource.

A font object in PDF is a description of a digital typeface. It may either describe the characteristics of a typeface, or it may inclu
is called an embedded font while the former is called an unembedded font. The font files that may be embedded are based on
formats: Type 1 (and its compressed variant CFF), TrueType, and (beginning with PDF 1.6) OpenType. Additionally PDF suppo
components of the font are described by PDF graphic operators.

Fourteen typefaces, known as the standard 14 fonts, have a special significance in PDF documents:

Times (v3) (in regular, italic, bold, and bold italic)

Courier (in regular, oblique, bold and bold oblique)
Helvetica (v3) (in regular, oblique, bold and bold oblique)
Symbol
Zapf Dingbats
These fonts are sometimes called the base fourteen fonts.[23] These fonts, or suitable substitute fonts with the same metrics, sho
but they are not guaranteed to be available in the reader, and may only display correctly if the system has them installed. [24] Fon
embedded in a PDF.

Within text strings, characters are shown using character codes (integers) that map to glyphs in the current font using an encod
encodings, including WinAnsi, MacRoman, and many encodings for East Asian languages and a font can have its own built-in e
MacRoman encodings are derived from the historical properties of the Windows and Macintosh operating systems, fonts using
platform.) PDF can specify a predefined encoding to use, the font's built-in encoding or provide a lookup table of differences to
recommended with TrueType fonts).[2] The encoding mechanisms in PDF were designed for Type 1 fonts, and the rules for appl

For large fonts or fonts with non-standard glyphs, the special encodings Identity-H (for horizontal writing) and Identity-V (for ver
necessary to provide a ToUnicode table if semantic information about the characters is to be preserved.
A text document which is scanned to PDF without the text being recognised by optical character recognition (OCR) is an image

Transparency[edit]
The original imaging model of PDF was opaque, similar to PostScript, where each object drawn on the page completely replace
same location. In PDF 1.4 the imaging model was extended to allow transparency. When transparency is used, new objects int
produce blending effects. The addition of transparency to PDF was done by means of new extensions that were designed to be
and earlier specifications. As a result, files that use a small amount of transparency might be viewed acceptably by older viewe
transparency could be viewed incorrectly by an older viewer.

The transparency extensions are based on the key concepts of transparency groups, blending modes, shape, and alpha. The m
of Adobe Illustrator version 9. The blend modes were based on those used by Adobe Photoshop at the time. When the PDF 1.4
formulas for calculating blend modes were kept secret by Adobe. They have since been published. [25]

The concept of a transparency group in PDF specification is independent of existing notions of "group" or "layer" in applications
groupings reflect logical relationships among objects that are meaningful when editing those objects, but they are not part of the

Additional features[edit]
Logical structure and accessibility[edit]
A "tagged" PDF (see clause 14.8 in ISO 32000) includes document structure and semantics information to enable reliable text e
speaking, tagged PDF is a stylized use of the format that builds on the logical structure framework introduced in PDF 1.3. Tagg
structure types and attributes that allow page content (text, graphics, and images) to be extracted and reused for other purpose

Tagged PDF is not required in situations where a PDF file is intended only for print. Since the feature is optional, and since the
vague in ISO 32000-1, support for tagged PDF among consuming devices, including assistive technology (AT), is uneven as of
an improved discussion of tagged PDF which is anticipated to facilitate further adoption.

An ISO-standardized subset of PDF specifically targeted at accessibility, PDF/UA, was first published in 2012.

Optional Content Groups (layers)[edit]

With the introduction of PDF version 1.5 (2003) came the concept of Layers. Layers, more formally known as Optional Content
content in a PDF document that can be selectively viewed or hidden by document authors or viewers. This capability is useful in
multi-language documents, etc.

Basically, it consists of an Optional Content Properties Dictionary added to the document root. This dictionary contains an array
each describing a set of information and each of which may be individually displayed or suppressed, plus a set of Optional Con
give the status (Displayed or Suppressed) of the given OCGs.

Encryption and signatures[edit]

A PDF file may be encrypted, for security, in which case a password is needed to view or edit the contents. PDF 2.0 d

PDF files may be digitally signed, to provide secure authentication; complete details on implementing digital signatures in PDF
PDF files may also contain embedded DRM restrictions that provide further controls that limit copying, editing, or p

The standard security provided by PDF consists of two different methods and two different passwords: a user password, which
and an owner password, which specifies operations that should be restricted even when the document is decrypted, which can
text and graphics out of the document, or adding or modifying text notes and AcroForm fields. The user password encrypts the
instead relying on client software to respect these restrictions. An owner password can easily be removed by software, includin
use restrictions that a document author places on a PDF document are not secure, and cannot be assured once the file is distri
applying such restrictions using Adobe Acrobat software to create or edit PDF files.

Even without removing the password, most freeware or open source PDF readers ignore the permission "protections" and allow
excerpts of the text as if the document were not limited by password protection. [29][30][31]

Beginning with PDF 1.5, Usage rights (UR) signatures are used to enable additional interactive features that are not available b
application. The signature is used to validate that the permissions have been granted by a bona fide granting authority. For exa

To save the PDF document along with a modified form or annotation data
Import form data files in FDF, XFDF, and text (CSV/TSV) formats
Export form data files in FDF and XFDF formats
Submit form data
Instantiate new pages from named page templates
Apply a digital signature to existing digital signature form field
Create, delete, modify, copy, import, and export annotations
For example, Adobe Systems grants permissions to enable additional features in Adobe Reader, using public-key cryptography
signature uses a certificate from an Adobe-authorized certificate authority. Any PDF application can use this same mechanism

Under specific circumstances including non-patched systems of the receiver, the information the receiver of a digital signed doc
sender after the document has been signed by the signer. [33]

PAdES (PDF Advanced Electronic Signatures) is a set of restrictions and extensions to PDF and ISO 32000-1 [34] making it suita
This is published by ETSI as TS 102 778.[35]

File attachments[edit]
PDF files can have file attachments which processors may access and open or save to a local filesystem.[36]

Metadata[edit]

PDF files can contain two types of metadata.[2] The first is the Document Information Dictionary, a set of key/value
In PDF 1.4, support was added for Metadata Streams, using the Extensible Metadata Platform (XMP) to add XML sta

PDF documents can also contain display settings, including the page display layout and zoom level in a Viewer Prefe

Accessibility[edit]

PDF files can be created specifically to be accessible to people with disabilities. [38][39][40][41][42] PDF file formats in use as of 2014 can
audio descriptions, and more. Some software can automatically produce tagged PDFs, but this feature is not always enabled b
including JAWS, Window-Eyes, Hal, and Kurzweil 1000 and 3000 can read tagged PDFs.[45][46] Moreover, tagged PDFs can be re
visual impairments. Adding tags to older PDFs and those that are generated from scanned documents can present some challe

One of the significant challenges with PDF accessibility is that PDF documents have three distinct views, which, depending on
inconsistent with each other. The three views are (i) the physical view, (ii) the tags view, and (iii) the content view. The physical
people consider a PDF document). The tags view is what screen readers and other assistive technologies use to deliver high-q
to users with disabilities. The content view is based on the physical order of objects within the PDF's content stream and may b
fully support the tags' view, such as the Reflow feature in Adobe's Reader.

PDF/UA, the International Standard for accessible PDF based on ISO 32000-1 was first published as ISO 14289–1 in 2

Multimedia[edit]
Rich Media PDF is a PDF file including interactive content that can be embedded or linked within the file. It can contain images
example, if the interactive PDF is a digital catalog for an E-commerce business, products can be listed on the PDF pages and c
website and buttons to order directly from the document.

Forms[edit]
Interactive Forms is a mechanism to add forms to the PDF file format. PDF currently supports two different methods for integrat
today coexist in the PDF specification:[32][47][48][49]

AcroForms (also known as Acrobat forms), was introduced in the PDF 1.2 format specification and included in all later P
XML Forms Architecture (XFA) forms, introduced in the PDF 1.5 format specification. Adobe XFA Forms are not compat
deprecated from PDF with PDF 2.0.
AcroForms were introduced in the PDF 1.2 format. AcroForms permit the uses of objects (e.g. text boxes, Radio buttons, etc.) a
Alongside the standard PDF action types, interactive forms (AcroForms) support submitting, resetting, and importing data. The
values of selected interactive form fields to a specified uniform resource locator (URL). Interactive form field names and values
formats, (depending on the settings of the action's ExportFormat, SubmitPDF, and XFDF flags): [32]

HTML Form format

HTML 4.01 Specification since PDF 1.5; HTML 2.0 since 1.2
Forms Data Format (FDF)

based on PDF, uses the same syntax and has essentially the same file structure, but is much simpler than PDF

XML Forms Data Format (XFDF)

(external XML Forms Data Format Specification, Version 2.0; supported since PDF 1.5; it replaced the "XML" form subm
XML version of Forms Data Format, but the XFDF implements only a subset of FDF containing forms and annotations. S
have XFDF equivalents – such as the Status, Encoding, JavaScript, Page's keys, EmbeddedFDFs, Differences, and Ta
spawning, or addition, of new pages based on the given data; as can be done when using an FDF file. The XFDF specif
PDF 1.5 specification (and in later versions). It is described separately in XML Forms Data Format Specification.[51] The P
submissions in XML format, but this was replaced by submissions in XFDF format in the PDF 1.5 specification. XFDF co
be used in the same way as FDF; e.g., form data is submitted to a server, modifications are made, then sent back and t
interactive form. It can also be used to export form data to stand-alone files that can be imported back into the correspon
2019, XFDF 3.0 is an ISO/IEC standard under the formal name ISO 19444-1:2019 - Document management — XML Fo
32000-2 (XFDF 3.0).[52] This standard is a normative reference of ISO 32000-2.

PDF
The entire document can be submitted rather than individual fields and values, as was defined in PDF 1.4.

AcroForms can keep form field values in external stand-alone files containing key-value pairs. The external files may use Forms
Data Format (XFDF) files.[53][51][54] The usage rights (UR) signatures define rights for import form data files in FDF, XFDF, and text
files in FDF and XFDF formats.[32]

In PDF 1.5, Adobe Systems introduced a proprietary format for forms; Adobe XML Forms Architecture (XFA). Adobe

Licensing[edit]

Anyone may create applications that can read and write PDF files without having to pay royalties to Adobe Systems;

Security[edit]
See also: Adobe Acrobat § Security
Changes to content[edit]
In November 2019, researchers from Ruhr University Bochum and Hackmanit GmbH published attacks on digitally signed PDF
visible content in a signed PDF without invalidating the signature in 21 of 22 desktop PDF viewers and 6 of 8 online validation s
At the same conference, they additionally showed how to exfiltrate the plaintext of encrypted content in PDFs. [57] In 2021, they s
PDFs that abuse the flexibility of features provided in the specification. [58] An overview of security issues in PDFs regarding deni
manipulation, and arbitrary code execution attacks was presented by Jens Müller.[59][60]

Malware vulnerability[edit]
PDF files can be infected with viruses, Trojans, and other malware. They can have hidden JavaScript code that might

PDF attachments carrying viruses were first discovered in 2001. The virus, named OUTLOOK.PDFWorm or Peachy, uses Micr
attached Adobe PDF file. It was activated with Adobe Acrobat, but not with Acrobat Reader. [62]

From time to time, new vulnerabilities are discovered in various versions of Adobe Reader, [63] prompting the company to issue s
susceptible. One aggravating factor is that a PDF reader can be configured to start automatically if a web page has an embedd
If a malicious web page contains an infected PDF file that takes advantage of a vulnerability in the PDF reader, the system may
secure. Some of these vulnerabilities are a result of the PDF standard allowing PDF documents to be scripted with JavaScript.
PDF reader can help mitigate such future exploits, although it does not protect against exploits in other parts of the PDF viewin
JavaScript is not essential for a PDF reader and that the security benefit that comes from disabling JavaScript outweighs any c
avoiding PDF file exploits is to have a local or web service convert files to another format before viewing.

On March 30, 2010, security researcher Didier Stevens reported an Adobe Reader and Foxit Reader exploit that runs

Software[edit]
For a more comprehensive list, see List of PDF software.
Viewers and editors[edit]
Many PDF viewers are provided free of charge from a variety of sources. Programs to manipulate and edit PDF files are availab

There are many software options for creating PDFs, including the PDF printing capabilities built into macOS, iOS,[66] and most L
processing software including LibreOffice, Microsoft Office 2007 (if updated to SP2) and later,[67] WordPerfect 9, and Scribus can
are many PDF print drivers for Microsoft Windows, the pdfTeX typesetting system, the DocBook PDF tools, applications develo
Acrobat itself as well as Adobe InDesign, Adobe FrameMaker, Adobe Illustrator, Adobe Photoshop, that allow a "PDF printer" to
output to a PDF file instead of a physical printer. Google's online office suite Google Docs allows uploading and saving to PDF.
and annotation tools.

The Free Software Foundation were "developing a free, high-quality and fully functional set of libraries and programs that imple
technologies to the ISO 32000 standard", as one of their high priority projects.[68][69] In 2011, however, the GNU PDF project was
projects" due to the maturation of the Poppler library,[70] which has enjoyed wider use in applications such as Evince with the GN
based on Xpdf[71][72] code base. There are also commercial development libraries available as listed in List of PDF software.

The Apache PDFBox project of the Apache Software Foundation is an open source Java library, licensed under the Apache Lic

Printing[edit]
Raster image processors (RIPs) are used to convert PDF files into a raster format suitable for imaging onto paper and other me
and prepress in a process known as rasterization. RIPs capable of processing PDF directly include the Adobe PDF Print Engin
the Harlequin RIP from Global Graphics.

In 1993, the Jaws raster image processor from Global Graphics became the first shipping prepress RIP that interpret
Agfa-Gevaert introduced and shipped Apogee, the first prepress workflow system based on PDF, in 1997.

Many commercial offset printers have accepted the submission of press-ready PDF files as a print source, specificall

In 2006, PDF was widely accepted as the standard print job format at the Open Source Development Labs Printing Summit. It i
the Common Unix Printing System and desktop application projects such as GNOME, KDE, Firefox, Thunderbird, LibreOffice a
print jobs in PDF.[78]

Some desktop printers also support direct PDF printing, which can interpret PDF data without external help.

Native display model[edit]

PDF was selected as the "native" metafile format for Mac OS X, replacing the PICT format of the earlier classic Mac OS. The im
is based on the model common to Display PostScript and PDF, leading to the nickname Display PDF. The Preview application
and later of the Safari web browser. System-level support for PDF allows Mac OS X applications to create PDF documents auto
standard printing architecture. The files are then exported in PDF 1.3 format according to the file header. When taking a screen
through 10.3, the image was also captured as a PDF; later versions save screen captures as a PNG file, though this behavior c

Annotation[edit]

See also: Comparison of note-taking software

Adobe Acrobat is one example of proprietary software that allows the user to annotate, highlight, and add notes to already crea
available as free software (under the GNU General Public License) is PDFedit. The freeware Foxit Reader, available for Micros
annotating documents. Tracker Software's PDF-XChange Viewer allows annotations and markups without restrictions in its free
integrated PDF viewer, Preview, does also enable annotations as does the open-source software Skim, with the latter supportin
PDFSync and integration with BibDesk reference management software. Freeware Qiqqa can create an annotation report that
one has made across their library of PDFs. The Text Verification Tool exports differences in documents as annotations and ma

There are also web annotation systems that support annotation in pdf and other document formats. In cases where
Alternatives[edit]
Main article: Open XML Paper Specification § Comparison with PDF
See also: EPUB
The Open XML Paper Specification is a competing format used both as a page description language and as the native print spo
since Windows Vista.

Mixed Object: Document Content Architecture is a competing format. MO:DCA-P is a part of Advanced Function Presentation.

See also[edit]
Web page
XSL Formatting Objects
Page margin
PDF portfolio

References[edit]
1. ^ Jump up to:a b Hardy, M.; Masinter, L.; Markovic, D.; Johnson, D.; Bailey, M. (March 2017). The application/pdf Media Type. IETF. doi:10.17487/RF

2. ^ Jump up to:a b c d Adobe Systems Incorporated (November 2006). "PDF Reference" (PDF). 1.7 (6th ed.). Archived from the original (PDF) on October

3. ^ Warnock, J. (October 14, 2004) [Original date 5 May 1995]. "The Camelot Project" (PDF). Archived (PDF) from the original on July 18, 2011.

4. ^ "What is a PDF? Portable Document Format | Adobe Acrobat DC". Adobe Systems Inc. Archived from the original on January 30, 2023. Retrieved

5. ^ "ISO 32000-1:2008" (PDF). Archived from the original (PDF) on July 26, 2018.

6. ^ "ISO 32000-1:2008 – Document management – Portable document format – Part 1: PDF 1.7". ISO. July 1, 2008. Archived from the original on Dec

7. ^ Orion, Egan (December 5, 2007). "PDF 1.7 is approved as ISO 32000". The Inquirer. Archived from the original on December 13, 2007. Retrieved

8. ^ "Public Patent License, ISO 32000-1: 2008 – PDF 1.7" (PDF). Adobe Systems Inc. 2008. Archived (PDF) from the original on June 18, 2009. Retriev
9. ^ "Guide for the procurement of standards-based ICT – Elements of Good Practice, Against lock-in: building open ICT systems by making better use
Commission. June 25, 2013. Archived from the original on September 19, 2020. Retrieved January 12, 2023. Example: ISO/IEC 29500, ISO/IEC 26300
information that is not accessible by all parties (references to proprietary technology and brand names, incomplete scope or dead web links).
10. ^ "ISO/TC 171/SC 2/WG 8 N 603 – Meeting Report" (PDF). Edit me. June 27, 2011. Archived from the original (PDF) on November 26, 2012 – via A
Committee urges Adobe Systems to submit the XFA Specification, XML Forms Architecture (XFA), to ISO for standardization The Committee is concer
2 will reference XFA 3.1
11. ^ "Embedding and publishing interactive, 3-dimensional, scientific figures in Portable Document Format (PDF) files". PLOS ONE. 8 (9). 2013. doi:1
implementation of the U3D standard was not complete and proprietary extensions were used.
12. ^ Leonard Rosenthol (2012). "PDF and Standards" (PDF). Adobe Systems. Archived from the original (PDF) on September 2, 2013. Retrieved Octob

13. ^ Jump up to:a b "Announcing no-cost access to the latest PDF standard: ISO 32000-2 (PDF 2.0)" (Press release). PDF Association. June 16, 2023

14. ^ "ISO 32000-2:2020 is now available". PDFA. December 14, 2020. Archived from the original on December 4, 2022. Retrieved February 3, 2021.
15. ^ Jump up to:a b "ISO 32000-2 – Document management — Portable document format — Part 2: PDF 2.0". ISO. January 5, 2021. Archived from the
3, 2021.
16. ^ "3D supported formats". Adobe Systems Inc. July 14, 2009. Archived from the original on February 12, 2010. Retrieved February 21, 2010.

17. ^ "Supported file formats in Acrobat and Reader". Adobe Systems Inc. November 11, 2022. Archived from the original on December 21, 2022. Retr

18. ^ "JavaScript for Acrobat 3D | Adobe Acrobat Developer Center". Adobe Systems Inc. Archived from the original on November 12, 2009. Retrieved

19. ^ Pravetz, Jim. "In Defense of COS, or Why I Love JSON and Hate XML". jimpravetz.com. Archived from the original on May 2, 2014.
20. ^ Adobe Systems, PDF Reference, pp. 39–40.
21. ^ PikePdf documentation. "Working with content streams". Archived from the original on July 5, 2022. Retrieved May 8, 2022.
22. ^ "Adobe Developer Connection: PDF Reference and Adobe Extensions to the PDF Specification". Adobe Systems Inc. Archived from the original o
13, 2010.
23. ^ Howard, Jacci. "Desktop Publishing: Base 14 Fonts – Definition". About.com Tech. Archived from the original on June 14, 2016.

24. ^ Merz, Thomas (June 2003). "The PDF Font Aquarium" (PDF). Archived from the original on July 18, 2011.

25. ^ "PDF Blend Modes Addendum" (PDF). Archived from the original (PDF) on October 14, 2011. Retrieved January 12, 2023.

26. ^ Johnson, Duff (April 22, 2004). "What is Tagged PDF?". Archived from the original on August 7, 2004.
27. ^ "Is PDF accessible?". DO-IT - Disabilities, Opportunities, Internetworking, and Technology. University of Washington. October 4, 2022. Archived
Retrieved January 12, 2023.
28. ^ "FreeMyPDF.com – Removes passwords from viewable PDFs". freemypdf.com. Archived from the original on February 20, 2021. Retrieved June
29. ^ Kirk, Jeremy (December 4, 2008). "Adobe admits new PDF password protection is weaker". Macworld. IDG Communications Inc. Archived from t
Retrieved September 14, 2016.
30. ^ Guignard, Bryan. "How secure is PDF" (PDF). Carnegie Mellon University. Archived from the original (PDF) on October 24, 2005.

31. ^ Merz, Thomas (November 2001). PDF Security Overview: Strengths and Weaknesses (PDF). PDF 2001 conference. Scottsdale/Arizona. Archived
32. ^ Jump up to:a b c d e Adobe Systems Inc. (July 1, 2008). "Document Management – Portable Document Format – Part 1: PDF 1.7, First Edition" (PDF
2008. Retrieved January 12, 2023.
33. ^ "PDF Insecurity Website". pdf-insecurity.org. Archived from the original on March 26, 2023. Retrieved January 12, 2023.
34. ^ "ISO 32000-1:2008 Document management -- Portable document format -- Part 1: PDF 1.7". International Organization for Standardization ISO. A
Retrieved March 22, 2016.
35. ^ "ETSI TS 102 778-1 - Electronic Signatures and Infrastructures (ESI); PDF Advanced Electronic Signature Profiles; Part 1: PAdES Overview - a f
European Telecommunications Standards Institute ETSI. July 2009. Archived (PDF) from the original on March 8, 2023. Retrieved January 12, 2023.
36. ^ "Links and attachments in PDFs". Archived from the original on April 23, 2021. Retrieved April 23, 2021.

37. ^ "Getting Familiar with Adobe Reader > Understanding Preferences". Adobe Press. Pearson. September 2, 2005. Archived from the original on Oc

38. ^ "PDF Accessibility". WebAIM. Archived from the original on January 12, 2023. Retrieved January 12, 2023.

39. ^ Clark, Joe (August 22, 2005). "Facts and Opinions About PDF Accessibility". Archived from the original on January 24, 2013. Retrieved January 1

40. ^ "Accessibility and PDF documents". Web Accessibility Center. The Ohio State University. Archived from the original on April 27, 2010. Retrieved

41. ^ "PDF Accessibility Standards". 1.2. BBC. Archived from the original on May 29, 2010. Retrieved January 12, 2023.

42. ^ "PDF Accessibility" (PDF). California State University. 2009. Archived from the original (PDF) on May 27, 2010. Retrieved January 12, 2023.

43. ^ "LibreOffice Help – Export as PDF". Archived from the original on January 12, 2023. Retrieved January 12, 2023.
44. ^ Z., Andrew (January 11, 2008). "Exporting PDF/A for long-term archiving". Archived from the original on February 24, 2021. Retrieved September

45. ^ Biersdorfer, J.D. (April 10, 2009). "Tip of the Week: Adobe Reader's 'Read Aloud' Feature". The New York Times. Archived from the original on N

46. ^ "Accessing PDF documents with assistive technology: A screen reader user's guide" (PDF). Adobe Systems Inc. Archived from the original (PDF)

47. ^ "Gnu PDF – PDF Knowledge – Forms Data Format". Archived from the original on January 1, 2013. Retrieved January 12, 2023.

48. ^ "About PDF forms". Adobe Systems Inc. Archived from the original on April 29, 2011. Retrieved February 19, 2010.

49. ^ Demling, Peter (July 1, 2008). "Convert XFA Form to AcroForm?". Archived from the original on January 12, 2023. Retrieved January 12, 2023.

50. ^ "Migrating from Adobe Acrobat forms to XML forms". Archived from the original on October 6, 2010. Retrieved January 12, 2023.

51. ^ Jump up to:a b "XML Forms Data Format Specification, version 2" (PDF). September 2007. Archived from the original (PDF) on July 30, 2018. Retrie

52. ^ "ISO 19444-1:2019(en)". The International Organization for Standardization. Archived from the original on June 17, 2016. Retrieved December 3,

53. ^ Adobe Systems Incorporated (September 20, 2022). "Using Acrobat forms and form data on the web". Archived from the original on January 12, 2

54. ^ "FDF Data Exchange Specification" (PDF). February 8, 2007. Archived from the original (PDF) on December 3, 2008. Retrieved January 12, 2023.
 55. ^ "Developer Resources". Adobe Systems Inc. Archived from the original on February 27, 2016.
56. ^ Mladenov, Vladislav; Mainka, Christian; Meyer Zu Selhausen, Karsten; Grothe, Martin; Schwenk, Jörg (November 6, 2019). "1 Trillion Dollar Refu
the 2019 ACM SIGSAC Conference on Computer and Communications Security. CCS '19. ACM Digital Library, ACM SIGSAC Conference on Compute
14. doi:10.1145/3319535.3339812. ISBN 9781450367479. S2CID 199367545. Archived from the original on April 26, 2021. Retrieved April 6, 2021.
57. ^ Müller, Jens; Ising, Fabian; Mladenov, Vladislav; Mainka, Christian; Schinzel, Sebastian; Schwenk, Jörg (November 6, 2019). "Practical Decryptio
Encryption". Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. CCS '19. ACM Digital Library, ACM SIGS
Security. pp. 15–29. doi:10.1145/3319535.3354214. ISBN 9781450367479. S2CID 207959243. Archived from the original on April 26, 2021. Retrieved
58. ^ "Shadow Attacks: Hiding and Replacing Content in Signed PDFs". Internet Society, The Network and Distributed System Security Symposium. A
Retrieved April 6, 2021.
59. ^ "Processing Dangerous Paths – On Security and Privacy of the Portable Document Format". Internet Society, The Network and Distributed Syste
on April 21, 2021. Retrieved April 6, 2021.
60. ^ "Portable Document Flaws 101". Blackhat. Archived from the original on April 9, 2021. Retrieved April 6, 2021.

61. ^ "Can PDFs have viruses? Keep your files safe". Adobe. Retrieved October 3, 2023.

62. ^ Adobe Forums, Announcement: PDF Attachment Virus "Peachy" Archived September 4, 2015, at the Wayback Machine, August 15, 2001.

63. ^ "Security bulletins and advisories". Adobe Systems Inc. January 10, 2023. Archived from the original on April 6, 2010. Retrieved January 12, 2023

64. ^ Gibson, Steve; Laporte, Leo (March 12, 2009). "Steve Gibson – SecurityNow Podcast". Archived from the original on May 8, 2020. Retrieved Jan

65. ^ "Malicious PDFs Execute Code Without a Vulnerability". PCMAG. Archived from the original on April 4, 2010.

66. ^ Pathak, Khamosh (October 7, 2017). "How to Create a PDF from Web Page on iPhone and iPad in iOS 11". iJunkie. Archived from the original on

67. ^ "Description of 2007 Microsoft Office Suite Service Pack 2 (SP2)". Microsoft. Archived from the original on April 29, 2009. Retrieved January 12, 2
68. ^ On 2014-04-02, a note dated February 10, 2009 referred to Current FSF High Priority Free Software Projects Archived August 10, 2007, at the W
page, however, changes over time.
69. ^ "Goals and Motivations". gnupdf.org. GNUpdf. November 28, 2007. Archived from the original on July 4, 2014. Retrieved April 2, 2014.

70. ^ Lee, Matt (October 6, 2011). "GNU PDF project leaves FSF High Priority Projects list; mission complete!". fsf.org. Free Software Foundation. Arc

71. ^ "Poppler Homepage". Archived from the original on January 8, 2015. Retrieved January 12, 2023. Poppler is a PDF rendering library based on th

72. ^ "Xpdf License". Archived from the original on April 14, 2013. Retrieved January 12, 2023. Xpdf is licensed under the GNU General Public License

73. ^ "The Apache PDFBox project- Apache PDFBox 3.0.0 released". August 17, 2023. Archived from the original on January 7, 2023. Updated for new

74. ^ "Adobe PDF Print Engine". Adobe Systems Inc. Archived from the original on August 22, 2013. Retrieved August 20, 2014.

75. ^ "Jaws® 3.0 PDF and PostScript RIP SDK". globalgraphics.com. Archived from the original on March 5, 2016. Retrieved November 26, 2010.

76. ^ "Harlequin MultiRIP". Archived from the original on February 9, 2014. Retrieved March 2, 2014.
77. ^ "Press-Ready PDF Files". Archived from the original on February 5, 2009. Retrieved January 12, 2023. For anyone interested in having their grap
files or PDFs.
78. ^ "PDF as Standard Print Job Format". The Linux Foundation. Linux Foundation. October 23, 2009. Archived from the original on November 14, 20

Further reading[edit]
Hardy, M. R. B.; Brailsford, D. F. (2002). "Mapping and displaying structural transformations between XML and PDF". P
on Document engineering – DocEng '02 (PDF). Proceedings of the 2002 ACM symposium on Document engineering. pp
102. doi:10.1145/585058.585077. ISBN 1-58113-594-7. S2CID 9371237.[relevant?]

PDF 2.0 "ISO 32000-2:2020(en), Document management — Portable document format — Part 2: PDF 2.0". In

PDF 2.0 "ISO 32000-2:2017(en), Document management — Portable document format — Part 2: PDF 2.0". In

PDF 1.7 (ISO 32000-1:2008)

PDF 1.7 and errata to 1.7 at the Wayback Machine (archived March 6, 2022)
 PDF 1.6 (ISBN 0-321-30474-8) and errata to 1.6 at the Wayback Machine (archived March 6, 2022)
PDF 1.5 and errata to 1.5 at the Wayback Machine (archived December 22, 2021)
PDF 1.4 (ISBN 0-201-75839-3) and errata to 1.4 at the Wayback Machine (archived March 6, 2022)
PDF 1.3 (ISBN 0-201-61588-6) and errata to 1.3 at the Wayback Machine (archived March 6, 2022)
PDF 1.2
PDF 1.0 (ISBN 0-201-62628-4)

External links[edit]

Wikimedia Commons has media related to Portable Document Format.

PDF Association – The PDF Association is the industry association for software developers producing or proce
PDF Specification Index at the PDF Association
Adobe PDF 101: Summary of PDF at the Wayback Machine (archived 2010-10-07)
Adobe: PostScript vs. PDF at the Wayback Machine (archived 2016-04-13) – Official introductory comparison of PS, EP
PDF Standards....transitioning the PDF specification from a de facto standard to a de jure standard at the Wayback Mac
about PDF/E and PDF/UA specification for accessible documents file format
PDF/A-1 ISO standard published by the International Organization for Standardization (with corrigenda)
PDF Reference and Adobe Extensions to the PDF Specification at the Wayback Machine (archived 2021-01-16)
Portable Document Format: An Introduction for Programmers – Introduction to PDF vs. PostScript and PDF in
The Camelot Paper at the Wayback Machine (archived 2019-04-22) – the paper in which John Warnock outlined the pro
Everything you wanted to know about PDF but was afraid to ask at the Wayback Machine (archived 2016-01-18) – reco
mins) (Adobe Systems) at TUG 2007

show

v
t
e
Graphics file formats
show

v
t
e
Multi-purpose office document file formats

show

v
t
e
 ISO standards by standard number
show

v
t
e
Ebooks

Categories:
Computer-related introductions in 1993
Adobe Inc.
Digital press
Electronic documents
Graphics file formats
ISO standards
Office document file formats
Open formats
Page description languages
Vector graphics
PDF software
This page was last edited on 4 December 2023, at 15:05 (UTC).
Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you
Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Code of Conduct
Developers
Statistics
Cookie statement
Mobile view

Toggle limited content width

Adobe Systems Incorporated (November 2006). "PDF Reference" (PDF). 1.7 (6th ed.). Archived from the original (PDF) on October 1, 2008. Retrieved January 1
Done [yes or no]
<->
<->
<->
<->
<->
<->

<->
<->
.pdf

application/pdf,[1]
application/x-pdf
application/x-bzpdf
application-gzpdf
PDF [1] (including a single trailing space)

com.adobe.pdf

%PDF

Adobe Inc. (1991–2008)

ISO (2008–)
June 15, 1993; 30 years ago

PDF/A, PDF/E, PDF/UA, PDF/VT, PDF/X

ISO 32000-2
Yes

iso.org/standard/75839.html
This section does
not cite any sources. Please help improve
this section by adding citations to reliable
sources. Unsourced material may be
challenged and removed. (November
2023) (Learn how and when to remove this template
message)

This section does

not cite any sources. Please help improve
this section by adding citations to reliable
sources. Unsourced material may be
challenged and removed. (November
2023) (Learn how and when to remove this template
message)
Germany
Israel
United States
Czech Republic
Topic:

Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array
Array

Matrix
Matrix
Matrix
Matrix
Matrix
Matrix
Matrix
Matrix
Matrix
Matrix

String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
String
 String

Searching & Sorting

Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting

LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
 LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList
LinkedList

Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
 Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees

Binary Search Trees

Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees

Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
 Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy

BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
BackTracking
 BackTracking
BackTracking
BackTracking
BackTracking

Stacks & Queues

Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues

Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Heap
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
 Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph
Graph

Trie
Trie
Trie
Trie
Trie
Trie

Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming

Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
 Questions by Love Babbar:
Youtube Channel: https://www.youtube.com/channel/UCQHLxxBFrbfdrk1jF0moTpw

Problem:

Reverse the array

Find the maximum and minimum element in an array
Find the "Kth" max and min element of an array
Given an array which consists of only 0, 1 and 2. Sort the array without using any sortin
Move all the negative elements to one side of the array
Find the Union and Intersection of the two sorted arrays.
Write a program to cyclically rotate an array by one.
find Largest sum contiguous Subarray [V. IMP]
Minimise the maximum difference between heights [V.IMP]
Minimum no. of Jumps to reach end of an array
find duplicate in an array of N+1 Integers
Merge 2 sorted arrays without using Extra space.
Kadane's Algo [V.V.V.V.V IMP]
Merge Intervals
Next Permutation
Count Inversion
Best time to buy and Sell stock
find all pairs on integer array whose sum is equal to given number
find common elements In 3 sorted arrays
Rearrange the array in alternating positive and negative items with O(1) extra space
Find if there is any subarray with sum equal to 0
Find factorial of a large number
find maximum product subarray
Find longest coinsecutive subsequence
Given an array of size n and a number k, fin all elements that appear more than " n/k "
Maximum profit by buying and selling a share atmost twice
Find whether an array is a subset of another array
Find the triplet that sum to a given value
Trapping Rain water problem
Chocolate Distribution problem
Smallest Subarray with sum greater than a given value
Three way partitioning of an array around a given value
Minimum swaps required bring elements less equal K together
Minimum no. of operations required to make an array palindrome
Median of 2 sorted arrays of equal size
Median of 2 sorted arrays of different size

Spiral traversal on a Matrix

Search an element in a matriix
Find median in a row wise sorted matrix
Find row with maximum no. of 1's
Print elements in sorted order using row-column wise sorted matrix
Maximum size rectangle
Find a specific pair in matrix
Rotate matrix by 90 degrees
Kth smallest element in a row-cpumn wise sorted matrix
Common elements in all rows of a given matrix

Reverse a String
Check whether a String is Palindrome or not
Find Duplicate characters in a string
Why strings are immutable in Java?
Write a Code to check whether one string is a rotation of another
Write a Program to check whether a string is a valid shuffle of two strings or not
Count and Say problem
Write a program to find the longest Palindrome in a string.[ Longest palindromic Substr
Find Longest Recurring Subsequence in String
Print all Subsequences of a string.
Print all the permutations of the given string
Split the Binary string into two substring with equal 0’s and 1’s
Word Wrap Problem [VERY IMP].
EDIT Distance [Very Imp]
Find next greater number with same set of digits. [Very Very IMP]
Balanced Parenthesis problem.[Imp]
Word break Problem[ Very Imp]
Rabin Karp Algo
KMP Algo
Convert a Sentence into its equivalent mobile numeric keypad sequence.
Minimum number of bracket reversals needed to make an expression balanced.
Count All Palindromic Subsequence in a given String.
Count of number of given string in 2D character array
Search a Word in a 2D Grid of characters.
Boyer Moore Algorithm for Pattern Searching.
Converting Roman Numerals to Decimal
Longest Common Prefix
Number of flips to make binary string alternate
Find the first repeated word in string.
Minimum number of swaps for bracket balancing.
Find the longest common subsequence between two strings.
Program to generate all possible valid IP addresses from given string.
Write a program tofind the smallest window that contains all characters of string itself.
Rearrange characters in a string such that no two adjacent are same
Minimum characters to be added at front to make string palindrome
Given a sequence of words, print all anagrams together
Find the smallest window in a string containing all characters of another string
Recursively remove all adjacent duplicates
String matching where one string contains wildcard characters
Function to find Number of customers who could not get a computer
Transform One String to Another using Minimum Number of Given Operation
Check if two given strings are isomorphic to each other
Recursively print all sentences that can be formed from list of word lists

Find first and last positions of an element in a sorted array

Find a Fixed Point (Value equal to index) in a given array
Search in a rotated sorted array
square root of an integer
Maximum and minimum of an array using minimum number of comparisons
Optimum location of point to minimize total distance
Find the repeating and the missing
find majority element
Searching in an array where adjacent differ by at most k
find a pair with a given difference
find four elements that sum to a given value
maximum sum such that no 2 elements are adjacent
Count triplet with sum smaller than a given value
merge 2 sorted arrays
print all subarrays with 0 sum
Product array Puzzle
Sort array according to count of set bits
minimum no. of swaps required to sort the array
Bishu and Soldiers
Rasta and Kheshtak
Kth smallest number again
Find pivot element in a sorted array
K-th Element of Two Sorted Arrays
Aggressive cows
Book Allocation Problem
EKOSPOJ:
Job Scheduling Algo
Missing Number in AP
Smallest number with atleastn trailing zeroes infactorial
Painters Partition Problem:
ROTI-Prata SPOJ
DoubleHelix SPOJ
Subset Sums
Findthe inversion count
Implement Merge-sort in-place
Partitioning and Sorting Arrays with Many Repeated Entries

Write a Program to reverse the Linked List. (Both Iterative and recursive)
Reverse a Linked List in group of Given Size. [Very Imp]
Write a program to Detect loop in a linked list.
Write a program to Delete loop in a linked list.
Find the starting point of the loop.
Remove Duplicates in a sorted Linked List.
Remove Duplicates in a Un-sorted Linked List.
Write a Program to Move the last element to Front in a Linked List.
Add “1” to a number represented as a Linked List.
Add two numbers represented by linked lists.
Intersection of two Sorted Linked List.
Intersection Point of two Linked Lists.
Merge Sort For Linked lists.[Very Important]
Quicksort for Linked Lists.[Very Important]
Find the middle Element of a linked list.
Check if a linked list is a circular linked list.
Split a Circular linked list into two halves.
Write a Program to check whether the Singly Linked list is a palindrome or not.
Deletion from a Circular Linked List.
Reverse a Doubly Linked list.
Find pairs with a given sum in a DLL.
Count triplets in a sorted DLL whose sum is equal to given value “X”.
Sort a “k”sorted Doubly Linked list.[Very IMP]
Rotate DoublyLinked list by N nodes.
Rotate a Doubly Linked list in group of Given Size.[Very IMP]
Can we reverse a linked list in less than O(n) ?
Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ?
Flatten a Linked List
Sort a LL of 0's, 1's and 2's
Clone a linked list with next and random pointer
Merge K sorted Linked list
Multiply 2 no. represented by LL
Delete nodes which have a greater value on right side
Segregate even and odd nodes in a Linked List
Program for n’th node from the end of a Linked List
Find the first non-repeating character from a stream of characters

level order traversal

Reverse Level Order traversal
Height of a tree
Diameter of a tree
Mirror of a tree
Inorder Traversal of a tree both using recursion and Iteration
Preorder Traversal of a tree both using recursion and Iteration
Postorder Traversal of a tree both using recursion and Iteration
Left View of a tree
Right View of Tree
Top View of a tree
Bottom View of a tree
Zig-Zag traversal of a binary tree
Check if a tree is balanced or not
Diagnol Traversal of a Binary tree
Boundary traversal of a Binary tree
Construct Binary Tree from String with Bracket Representation
Convert Binary tree into Doubly Linked List
Convert Binary tree into Sum tree
Construct Binary tree from Inorder and preorder traversal
Find minimum swaps required to convert a Binary tree into BST
Check if Binary tree is Sum tree or not
Check if all leaf nodes are at same level or not
Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ]
Check if 2 trees are mirror or not
Sum of Nodes on the Longest path from root to leaf node
Check if given graph is tree or not. [ IMP ]
Find Largest subtree sum in a tree
Maximum Sum of nodes in Binary tree such that no two are adjacent
Print all "K" Sum paths in a Binary tree
Find LCA in a Binary tree
Find distance between 2 nodes in a Binary tree
Kth Ancestor of node in a Binary tree
Find all Duplicate subtrees in a Binary tree [ IMP ]
Tree Isomorphism Problem

Fina a value in a BST

Deletion of a node in a BST
Find min and max value in a BST
Find inorder successor and inorder predecessor in a BST
Check if a tree is a BST or not
Populate Inorder successor of all nodes
Find LCA of 2 nodes in a BST
Construct BST from preorder traversal
Convert Binary tree into BST
Convert a normal BST into a Balanced BST
Merge two BST [ V.V.V>IMP ]
Find Kth largest element in a BST
Find Kth smallest element in a BST
Count pairs from 2 BST whose sum is equal to given value "X"
Find the median of BST in O(n) time and O(1) space
Count BST ndoes that lie in a given range
Replace every element with the least greater element on its right
Given "n" appointments, find the conflicting appointments
Check preorder is valid or not
Check whether BST contains Dead end
Largest BST in a Binary Tree [ V.V.V.V.V IMP ]
Flatten BST to sorted list

Activity Selection Problem

Job SequencingProblem
Huffman Coding
Water Connection Problem
Fractional Knapsack Problem
Greedy Algorithm to find Minimum number of Coins
Maximum trains for which stoppage can be provided
Minimum Platforms Problem
Buy Maximum Stocks if i stocks can be bought on i-th day
Find the minimum and maximum amount to buy all N candies
Minimize Cash Flow among a given set of friends who have borrowed money from each
Minimum Cost to cut a board into squares
Check if it is possible to survive on Island
Find maximum meetings in one room
Maximum product subset of an array
Maximize array sum after K negations
Maximize the sum of arr[i]*i
Maximum sum of absolute difference of an array
Maximize sum of consecutive differences in a circular array
Minimum sum of absolute difference of pairs of two arrays
Program for Shortest Job First (or SJF) CPU Scheduling
Program for Least Recently Used (LRU) Page Replacement algorithm
Smallest subset with sum greater than all other elements
Chocolate Distribution Problem
DEFKIN -Defense of a Kingdom
DIEHARD -DIE HARD
GERGOVIA -Wine trading in Gergovia
Picking Up Chicks
CHOCOLA –Chocolate
ARRANGE -Arranging Amplifiers
K Centers Problem
Minimum Cost of ropes
Find smallest number with given number of digits and sum of digits
Rearrange characters in a string such that no two adjacent are same
Find maximum sum possible equal sum of three stacks

Rat in a maze Problem

Printing all solutions in N-Queen Problem
Word Break Problem using Backtracking
Remove Invalid Parentheses
Sudoku Solver
m Coloring Problem
Print all palindromic partitions of a string
Subset Sum Problem
The Knight’s tour problem
Tug of War
Find shortest safe route in a path with landmines
Combinational Sum
Find Maximum number possible by doing at-most K swaps
Print all permutations of a string
Find if there is a path of more than k length from a source
Longest Possible Route in a Matrix with Hurdles
Print all possible paths from top left to bottom right of a mXn matrix
Partition of a set intoK subsets with equal sum
Find the K-th Permutation Sequence of first N natural numbers

Implement Stack from Scratch

Implement Queue from Scratch
Implement 2 stack in an array
find the middle element of a stack
Implement "N" stacks in an Array
Check the expression has valid or Balanced parenthesis or not.
Reverse a String using Stack
Design a Stack that supports getMin() in O(1) time and O(1) extra space.
Find the next Greater element
The celebrity Problem
Arithmetic Expression evaluation
Evaluation of Postfix expression
Implement a method to insert an element at its bottom without using any other data s
Reverse a stack using recursion
Sort a Stack using recursion
Merge Overlapping Intervals
Largest rectangular Area in Histogram
Length of the Longest Valid Substring
Expression contains redundant bracket or not
Implement Stack using Queue
Implement Stack using Deque
Stack Permutations (Check if an array is stack permutation of other)
Implement Queue using Stack
Implement "n" queue in an array
Implement a Circular queue
LRU Cache Implementationa
Reverse a Queue using recursion
Reverse the first “K” elements of a queue
Interleave the first half of the queue with second half
Find the first circular tour that visits all Petrol Pumps
Minimum time required to rot all oranges
Distance of nearest cell having 1 in a binary matrix
First negative integer in every window of size “k”
Check if all levels of two trees are anagrams or not.
Sum of minimum and maximum elements of all subarrays of size “k”.
Minimum sum of squares of character counts in a given string after removing “k” chara
Queue based approach or first non-repeating character in a stream.
Next Smaller Element

Implement a Maxheap/MinHeap using arrays and recursion.

Sort an Array using heap. (HeapSort)
Maximum of all subarrays of size k.
“k” largest element in an array
Kth smallest and largest element in an unsorted array
Merge “K” sorted arrays. [ IMP ]
Merge 2 Binary Max Heaps
Kth largest sum continuous subarrays
Leetcode- reorganize strings
Merge “K” Sorted Linked Lists [V.IMP]
Smallest range in “K” Lists
Median in a stream of Integers
Check if a Binary Tree is Heap
Connect “n” ropes with minimum cost
Convert BST to Min Heap
Convert min heap to max heap
Rearrange characters in a string such that no two adjacent are same.
Minimum sum of two numbers formed from digits of an array
Create a Graph, print it
Implement BFS algorithm
Implement DFS Algo
Detect Cycle in Directed Graph using BFS/DFS Algo
Detect Cycle in UnDirected Graph using BFS/DFS Algo
Search in a Maze
Minimum Step by Knight
flood fill algo
Clone a graph
Making wired Connections
word Ladder
Dijkstra algo
Implement Topological Sort
Minimum time taken by each job to be completed given by a Directed Acyclic Graph
Find whether it is possible to finish all tasks or not from given dependencies
Find the no. of Isalnds
Given a sorted Dictionary of an Alien Language, find order of characters
Implement Kruksal’sAlgorithm
Implement Prim’s Algorithm
Total no. of Spanning tree in a graph
Implement Bellman Ford Algorithm
Implement Floyd warshallAlgorithm
Travelling Salesman Problem
Graph ColouringProblem
Snake and Ladders Problem
Find bridge in a graph
Count Strongly connected Components(Kosaraju Algo)
Check whether a graph is Bipartite or Not
Detect Negative cycle in a graph
Longest path in a Directed Acyclic Graph
Journey to the Moon
Cheapest Flights Within K Stops
Oliver and the Game
Water Jug problem using BFS
Water Jug problem using BFS
Find if there is a path of more thank length from a source
M-ColouringProblem
Minimum edges to reverse o make path from source to destination
Paths to travel each nodes using each edge(Seven Bridges)
Vertex Cover Problem
Chinese Postman or Route Inspection
Number of Triangles in a Directed and Undirected Graph
Minimise the cashflow among a given set of friends who have borrowed money from e
Two Clique Problem

Construct a trie from scratch

Find shortest unique prefix for every word in a given list
Word Break Problem | (Trie solution)
Given a sequence of words, print all anagrams together
Implement a Phone Directory
Print unique rows in a given boolean matrix

Coin ChangeProblem
Knapsack Problem
Binomial CoefficientProblem
Permutation CoefficientProblem
Program for nth Catalan Number
Matrix Chain Multiplication
Edit Distance
Subset Sum Problem
Friends Pairing Problem
Gold Mine Problem
Assembly Line SchedulingProblem
Painting the Fenceproblem
Maximize The Cut Segments
Longest Common Subsequence
Longest Repeated Subsequence
Longest Increasing Subsequence
Space Optimized Solution of LCS
LCS (Longest Common Subsequence) of three strings
Maximum Sum Increasing Subsequence
Count all subsequences having product less than K
Longest subsequence such that difference between adjacent is one
Maximum subsequence sum such that no three are consecutive
Egg Dropping Problem
Maximum Length Chain of Pairs
Maximum size square sub-matrix with all 1s
Maximum sum of pairs with specific difference
Min Cost PathProblem
Maximum difference of zeros and ones in binary string
Minimum number of jumps to reach end
Minimum cost to fill given weight in a bag
Minimum removals from array to make max –min <= K
Longest Common Substring
Count number of ways to reacha given score in a game
Count Balanced Binary Trees of Height h
LargestSum Contiguous Subarray [V>V>V>V IMP ]
Smallest sum contiguous subarray
Unbounded Knapsack (Repetition of items allowed)
Word Break Problem
Largest Independent Set Problem
Partition problem
Longest Palindromic Subsequence
Count All Palindromic Subsequence in a given String
Longest Palindromic Substring
Longest alternating subsequence
Weighted Job Scheduling
Coin game winner where every player has three choices
Count Derangements (Permutation such that no element appears in its original position
Maximum profit by buying and selling a share at most twice [ IMP ]
Optimal Strategy for a Game
Optimal Binary Search Tree
Palindrome PartitioningProblem
Word Wrap Problem
Mobile Numeric Keypad Problem [ IMP ]
Boolean Parenthesization Problem
Largest rectangular sub-matrix whose sum is 0
Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ]
Maximum sum rectangle in a 2D matrix
Maximum profit by buying and selling a share at most k times
Find if a string is interleaved of two other strings
Maximum Length of Pair Chain

Count set bits in an integer

Find the two non-repeating elements in an array of repeating elements
Count number of bits to be flipped to convert A to B
Count total set bits in all numbers from 1 to n
Program to find whether a no is power of two
Find position of the only set bit
Copy set bits in a range
Divide two integers without using multiplication, division and mod operator
Calculate square of a number without using *, / and pow()
Power Set
Done [yes or no]
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->
<->

<->
<->
<->
<->
<->
<->
<->
<->
<->
<->