Python tapos na 1st yr

• Binary search is an efficient algorithm

  used to find a target value within a sorted

  array or list.
• LINEAR SEARCH IS DEFINED AS A

  SEQUENTIAL SEARCH

  ALGORITHM THAT STARTS AT

  ONE END AND GOES THROUGH

  EACH ELEMENT OF A LIST UNTIL

  THE DESIRED ELEMENT IS

  FOUND,
• Graph is a non-linear data structure

  consisting of vertices and edges.
• Null Graph - A graph where there are no edges in the

  graph.
• Trivial Graph - Graph having only a

  single vertex, it is also the smallest

  graph possible.
• Undirected Graph - A graph in which

  edges do not have any direction. That is the

  nodes are unordered pairs in the definition

  of every edge.
• Directed Graph - A graph in which edge

  has direction. That is the nodes are ordered

  pairs in the definition of every edge.
• Connected Graph - The graph in which

  from one node we can visit any other node

  in the graph is known as
• Disconnected Graph - The graph in

  which at least one node is not reachable

  from a node is known as
• Complete Graph - The graph in

  which from each node there is an edge

  to each other
• Cycle Graph - The graph in which the

  graph is a cycle in itself, the degree of

  each vertex is 2.
• Cyclic Graph - A graph containing

  at least one cycle is known as
• Directed Acyclic Graph - A Graph that does not contain

  any cycle.
• Bipartite Graph - A graph in which

  vertex can be divided into two sets such

  that vertex in each set does not contain

  any edge between
• Weighted Graph

  A graph in which the edges are already

  specified with suitable weight is known

  as
• Adjacency Matrix

  In this method, the graph is stored in the form of the

  2D matrix where rows and columns denote vertices.
• Adjacency List

  This graph is represented as a collection of linked lists.
• Trees are a fundamental

  data structure in computer

  science. They are used to

  represent hierarchical

  relationships between data.
• Leaves

  Nodes with no children
• Internal Nodes

  Nodes with at least one child
• SIBLINGS

  Nodes with the same parent
• EDGES

  It is a link between two node.
• HEIGHT of the node

  the number of edges

  from the node to the

  deepest leaf.
• DEPTH of a node

  is the number of

  edges from the root

  to the node
• Level of Tree

  The Level starts from ZERO and increment by 1
• GENERAL TREE

  A type of tree that

  can have multiple

  child nodes
• BINARY TREE

  a tree where each node can have no more than two children
• FULL BINARY

  Every node can have 0, 2 child nodes
• Complete Binary Tree

  is a binary tree in which all the levels are completely filled except possibly the lowest one, which is filled from the left.
• Perfect Binary Tree

  Type of binary tree in which all internal nodes contain 2 children, and all leaf nodes are present in the same level
• Balanced Binary Tree

  a binary tree in which the height of the left and right subtree of any node differ by not more than 1
• Pathological Binary Tree

  a binary tree wherein every parent node has only 1 child
• Recursion is the process of a function calling itself from within its own code.
• Direct recursion is a type of recursion where a function or process calls itself directly within its own definition.
• Indirect recursive functions, two functions mutually call each other wherein both the functions must have a base case.
• TAIL RECURSION - when the last statement in the function is another recursive call to that

  function.
• NON-TAIL RECURSION - The last statement in this recursive function is not a recursive call.
• Stack is a linear data structure that

  stores items in a Last-In/First-Out (LIFO) or

  First-In/Last-Out (FILO) manner.
• queue is a linear data structure that stores items

  in First In First Out (FIFO) manner.
• linked list is a data structure that stores a sequence of elements.