Visit: https://a2zcareers.viden.io
Principles of Quantum Mechanics
Waves and Particles, de Broglie Hypothesis, Matter waves, Davisson and Germer’s Experiment, G.P. Thomson Experiment, Heisenberg’s Uncertainty Principle, Schrödinger's Time Independent Wave Equation – Physical Significance of the Wave Function – Particle in One Dimensional Potential Box.
Soumya Somayajula
Physics of Semiconductor Devices
Formation of PN Junction and working of PN Junction. Energy Diagram of PN Diode, Diode equation (Quantitative treatment), I-V Characteristics of PN Junction, Applications: LED, Solar Cell, Photo diode.
Introduction to Data Structures
Introduction to Data Structures: Abstract data type (ADT), Stacks, Queues and Circular Queues and their implementation with arrays. Stack Applications: Infix to Post fix conversion, Postfix expression evaluation. Applications of Queues. It contains basics of data structures.
Trees and Graphs
Graph is a non linear data structure, it contains a set of points known as nodes (or vertices) and set of links known as edges (or Arcs) which connects the vertices. Generally, a graph G is represented as G = ( V , E ), where V is set of vertices and E is set of edges. A tree, is a finite set of nodes together with a finite set of directed edges that define parent-child (Hierarchical )relationships. Each directed edge connects a parent to its child.
Heap Sort
This article has content about max heap and minimum in heap in data structures. They are clearly explained in the presentation with suitable examples. Max Heap Store data in ascending order Has property of A[Parent(i)] ≥ A[i] Min Heap Store data in descending order Has property of A[Parent(i)] ≤ A[i] Algorithm Add the new element to the next available position at the lowest level Restore the max-heap property if violated General strategy is percolate up (or bubble up): if the parent of the element is smaller than the element, then interchange the parent and child. OR Restore the min-heap property if violated General strategy is percolate up (or bubble up): if the parent of the element is larger than the element, then interchange the parent and child. Delete max Copy the last number to the root ( overwrite the maximum element stored there ). Restore the max heap property by percolate down. Delete min Copy the last number to the root ( overwrite the minimum element stored there ). Restore the min heap property by percolate down. A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap
Sentiment Analysis
It is a field within NLP where it builds a software which can identify and understand the message or information which is shared in it. Sentiment analysis is the field which uses the vast amount of data ( approx. 2.5 quintillion bytes of data per day) which is produced by the users and understands it.