Forwarded from Data Analyst Interview Resources
SQL Interview Questions with Answers
Like for more โค๏ธ
Like for more โค๏ธ
๐1
ML interview Question ๐
What is Quantization in machine learning?
Quantization the process of reducing the precision of the numbers used to represent a model's parameters, such as weights and activations. This is often done by converting 32-bit floating-point numbers (commonly used in training) to lower precision formats, like 16-bit or 8-bit integers.
Quantization is primarily used during model inference to:
1. Reduce model size: Lower precision numbers require less memory.
2. Improve computational efficiency: Operations on lower-precision data types are faster and require less power.
3. Speed up inference: Smaller models can be loaded faster, improving performance on edge devices like smartphones or IoT devices.
Quantization can lead to a small loss in model accuracy, as reducing precision can introduce rounding errors. But in many cases, the trade-off between accuracy and efficiency is worthwhile, especially for deployment on resource-constrained devices.
There are different types of quantization:
1. Post-training quantization: Applied after the model has been trained.
2.Quantization-aware training (QAT): Takes quantization into account during the training process to minimize the accuracy drop.
Best Data Science & Machine Learning Resources:
https://topmate.io/sumit_kumar80/1151675
ENJOY LEARNING ๐๐
What is Quantization in machine learning?
Quantization the process of reducing the precision of the numbers used to represent a model's parameters, such as weights and activations. This is often done by converting 32-bit floating-point numbers (commonly used in training) to lower precision formats, like 16-bit or 8-bit integers.
Quantization is primarily used during model inference to:
1. Reduce model size: Lower precision numbers require less memory.
2. Improve computational efficiency: Operations on lower-precision data types are faster and require less power.
3. Speed up inference: Smaller models can be loaded faster, improving performance on edge devices like smartphones or IoT devices.
Quantization can lead to a small loss in model accuracy, as reducing precision can introduce rounding errors. But in many cases, the trade-off between accuracy and efficiency is worthwhile, especially for deployment on resource-constrained devices.
There are different types of quantization:
1. Post-training quantization: Applied after the model has been trained.
2.Quantization-aware training (QAT): Takes quantization into account during the training process to minimize the accuracy drop.
Best Data Science & Machine Learning Resources:
https://topmate.io/sumit_kumar80/1151675
ENJOY LEARNING ๐๐
topmate.io
Data science Job + Placement with Sumit Kumar
For College and Working Professional
๐ ๏ธ Must-Know SQL Commands & Functions โ
1. SELECT โ Retrieve data
โบ SELECT * FROM customers;
2. WHERE โ Filter rows
โบ SELECT * FROM orders WHERE amount > 500;
3. ORDER BY โ Sort results
โบ SELECT name FROM users ORDER BY age DESC;
4. GROUP BY โ Aggregate data
โบ SELECT department, COUNT(*) FROM employees GROUP BY department;
5. JOIN โ Combine tables
โบ SELECT a.name, b.salary FROM employees a JOIN salaries b ON a.id = b.emp_id;
6. INSERT INTO โ Add new data
โบ INSERT INTO users (name, age) VALUES ('John', 30);
7. UPDATE โ Modify existing data
โบ UPDATE products SET price = 100 WHERE id = 1;
8. DELETE โ Remove data
โบ DELETE FROM logs WHERE date < '2023-01-01';
9. LIKE โ Pattern matching
โบ SELECT * FROM customers WHERE name LIKE 'A%';
10. LIMIT โ Restrict result rows
โบ SELECT * FROM sales LIMIT 10;
๐ก Tip: Practice on real datasets. Learn JOIN and GROUP BY earlyโtheyโre game changers!
SQL Resources:
https://topmate.io/sumit_kumar80/1151675
Placement Resources:
https://topmate.io/sumit_kumar80/1148833
โจ Tap โค๏ธ if this helped you!
1. SELECT โ Retrieve data
โบ SELECT * FROM customers;
2. WHERE โ Filter rows
โบ SELECT * FROM orders WHERE amount > 500;
3. ORDER BY โ Sort results
โบ SELECT name FROM users ORDER BY age DESC;
4. GROUP BY โ Aggregate data
โบ SELECT department, COUNT(*) FROM employees GROUP BY department;
5. JOIN โ Combine tables
โบ SELECT a.name, b.salary FROM employees a JOIN salaries b ON a.id = b.emp_id;
6. INSERT INTO โ Add new data
โบ INSERT INTO users (name, age) VALUES ('John', 30);
7. UPDATE โ Modify existing data
โบ UPDATE products SET price = 100 WHERE id = 1;
8. DELETE โ Remove data
โบ DELETE FROM logs WHERE date < '2023-01-01';
9. LIKE โ Pattern matching
โบ SELECT * FROM customers WHERE name LIKE 'A%';
10. LIMIT โ Restrict result rows
โบ SELECT * FROM sales LIMIT 10;
๐ก Tip: Practice on real datasets. Learn JOIN and GROUP BY earlyโtheyโre game changers!
SQL Resources:
https://topmate.io/sumit_kumar80/1151675
Placement Resources:
https://topmate.io/sumit_kumar80/1148833
โจ Tap โค๏ธ if this helped you!
Data Analyst Interview Resources
SQL Interview Questions with Answers Like for more โค๏ธ
In live session we will discuss these questions
You can join me Fast 8:45 pm
You can join me Fast 8:45 pm
Thank you for joining guys.
Tomorrow at same time will discuss next chapter
Tomorrow at same time will discuss next chapter
โ
Statistics & Probability Cheatsheet ๐๐ง
๐ Descriptive Statistics:
โฆ Mean = (ฮฃx) / n
โฆ Median = Middle value
โฆ Mode = Most frequent value
โฆ Variance (ฯยฒ) = ฮฃ(x - ฮผ)ยฒ / n
โฆ Std Dev (ฯ) = โVariance
โฆ Range = Max - Min
โฆ IQR = Q3 - Q1
๐ Probability Basics:
โฆ P(A) = Outcomes A / Total Outcomes
โฆ P(A โฉ B) = P(A) ร P(B) (if independent)
โฆ P(A โช B) = P(A) + P(B) - P(A โฉ B)
โฆ Conditional: P(A|B) = P(A โฉ B) / P(B)
โฆ Bayesโ Theorem: P(A|B) = [P(B|A) ร P(A)] / P(B)
๐ Common Distributions:
โฆ Binomial (fixed trials)
โฆ Normal (bell curve)
โฆ Poisson (rare events over time)
โฆ Uniform (equal probability)
๐ Inferential Stats:
โฆ Z-score = (x - ฮผ) / ฯ
โฆ Central Limit Theorem: sampling dist โ Normal
โฆ Confidence Interval: CI = xโ ยฑ z*(ฯ/โn)
๐ Hypothesis Testing:
โฆ Hโ = No effect; Hโ = Effect present
โฆ p-value < ฮฑ โ Reject Hโ
โฆ Tests: t-test (small samples), z-test (known ฯ), chi-square (categorical data)
๐ Correlation:
โฆ Pearson: linear relation (โ1 to 1)
โฆ Spearman: rank-based correlation
๐งช Tools to Practice:
Python packages: scipy.stats, statsmodels, pandas
Visualization: seaborn, matplotlib
๐ก Quick tip: Use these formulas to crush interviews and build solid ML foundations!
๐ฌ Tap โค๏ธ for more
https://topmate.io/sumit_kumar80/1151675
๐ Descriptive Statistics:
โฆ Mean = (ฮฃx) / n
โฆ Median = Middle value
โฆ Mode = Most frequent value
โฆ Variance (ฯยฒ) = ฮฃ(x - ฮผ)ยฒ / n
โฆ Std Dev (ฯ) = โVariance
โฆ Range = Max - Min
โฆ IQR = Q3 - Q1
๐ Probability Basics:
โฆ P(A) = Outcomes A / Total Outcomes
โฆ P(A โฉ B) = P(A) ร P(B) (if independent)
โฆ P(A โช B) = P(A) + P(B) - P(A โฉ B)
โฆ Conditional: P(A|B) = P(A โฉ B) / P(B)
โฆ Bayesโ Theorem: P(A|B) = [P(B|A) ร P(A)] / P(B)
๐ Common Distributions:
โฆ Binomial (fixed trials)
โฆ Normal (bell curve)
โฆ Poisson (rare events over time)
โฆ Uniform (equal probability)
๐ Inferential Stats:
โฆ Z-score = (x - ฮผ) / ฯ
โฆ Central Limit Theorem: sampling dist โ Normal
โฆ Confidence Interval: CI = xโ ยฑ z*(ฯ/โn)
๐ Hypothesis Testing:
โฆ Hโ = No effect; Hโ = Effect present
โฆ p-value < ฮฑ โ Reject Hโ
โฆ Tests: t-test (small samples), z-test (known ฯ), chi-square (categorical data)
๐ Correlation:
โฆ Pearson: linear relation (โ1 to 1)
โฆ Spearman: rank-based correlation
๐งช Tools to Practice:
Python packages: scipy.stats, statsmodels, pandas
Visualization: seaborn, matplotlib
๐ก Quick tip: Use these formulas to crush interviews and build solid ML foundations!
๐ฌ Tap โค๏ธ for more
https://topmate.io/sumit_kumar80/1151675
topmate.io
Data science Job + Placement with Sumit Kumar
For College and Working Professional
๐ Data Analytics โ Key Concepts for Beginners ๐
1๏ธโฃ What is Data Analytics?
โ The process of examining data sets to draw conclusions using tools, techniques, and statistical models.
2๏ธโฃ Types of Data Analytics:
- Descriptive: What happened?
- Diagnostic: Why did it happen?
- Predictive: What could happen?
- Prescriptive: What should we do?
3๏ธโฃ Common Tools:
- Excel
- SQL
- Python (Pandas, NumPy)
- R
- Tableau / Power BI
- Google Data Studio
4๏ธโฃ Basic Skills Required:
- Data cleaning & preprocessing
- Data visualization
- Statistical analysis
- Querying databases
- Business understanding
5๏ธโฃ Key Concepts:
- Data types (numerical, categorical)
- Mean, median, mode
- Correlation vs causation
- Outliers & missing values
- Data normalization
6๏ธโฃ Important Libraries (Python):
- Pandas (data manipulation)
- Matplotlib / Seaborn (visualization)
- Scikit-learn (machine learning)
- Statsmodels (statistical modeling)
7๏ธโฃ Typical Workflow:
Data Collection โ Cleaning โ Analysis โ Visualization โ Reporting
๐ก Tip: Always ask the right business question before jumping into analysis.
๐ฌ Tap โค๏ธ for more!
1๏ธโฃ What is Data Analytics?
โ The process of examining data sets to draw conclusions using tools, techniques, and statistical models.
2๏ธโฃ Types of Data Analytics:
- Descriptive: What happened?
- Diagnostic: Why did it happen?
- Predictive: What could happen?
- Prescriptive: What should we do?
3๏ธโฃ Common Tools:
- Excel
- SQL
- Python (Pandas, NumPy)
- R
- Tableau / Power BI
- Google Data Studio
4๏ธโฃ Basic Skills Required:
- Data cleaning & preprocessing
- Data visualization
- Statistical analysis
- Querying databases
- Business understanding
5๏ธโฃ Key Concepts:
- Data types (numerical, categorical)
- Mean, median, mode
- Correlation vs causation
- Outliers & missing values
- Data normalization
6๏ธโฃ Important Libraries (Python):
- Pandas (data manipulation)
- Matplotlib / Seaborn (visualization)
- Scikit-learn (machine learning)
- Statsmodels (statistical modeling)
7๏ธโฃ Typical Workflow:
Data Collection โ Cleaning โ Analysis โ Visualization โ Reporting
๐ก Tip: Always ask the right business question before jumping into analysis.
๐ฌ Tap โค๏ธ for more!
๐น Top 10 SQL Functions/Commands Commonly Used in Data Analysis ๐
1๏ธโฃ SELECT
โ Used to retrieve specific columns from a table.
SELECT name, age FROM users;
2๏ธโฃ WHERE
โ Filters rows based on a condition.
SELECT ร FROM sales WHERE region = 'North';
3๏ธโฃ GROUP BY
โ Groups rows that have the same values into summary rows.
SELECT region, SUM(sales) FROM sales GROUP BY region;
4๏ธโฃ ORDER BY
โ Sorts the result by one or more columns.
SELECT * FROM customers ORDER BY created_at DESC;
5๏ธโฃ JOIN
โ Combines rows from two or more tables based on a related column.
SELECT a.name, b.salary
FROM employees a
JOIN salaries b ON a.id = b.emp_id;
6๏ธโฃ COUNT() / SUM() / AVG() / MIN() / MAX()
โ Common aggregate functions for metrics and summaries.
SELECT COUNT(ร) FROM orders WHERE status = 'completed';
7๏ธโฃ HAVING
โ Filters after a GROUP BY (unlike WHERE, which filters before).
SELECT department, COUNT() FROM employees GROUP BY department HAVING COUNT() > 10;
8๏ธโฃ LIMIT
โ Restricts number of rows returned.
SELECT * FROM products LIMIT 5;
9๏ธโฃ CASE
โ Implements conditional logic in queries.
SELECT name,
CASE
WHEN score >= 90 THEN 'A'
WHEN score >= 75 THEN 'B'
ELSE 'C'
END AS grade
FROM students;
๐ DATE functions (NOW(), DATE_PART(), DATEDIFF(), etc.)
โ Handle and extract info from dates.
SELECT DATE_PART('year', order_date) FROM orders;
๐ฌ Tap โค๏ธ for more!
1๏ธโฃ SELECT
โ Used to retrieve specific columns from a table.
SELECT name, age FROM users;
2๏ธโฃ WHERE
โ Filters rows based on a condition.
SELECT ร FROM sales WHERE region = 'North';
3๏ธโฃ GROUP BY
โ Groups rows that have the same values into summary rows.
SELECT region, SUM(sales) FROM sales GROUP BY region;
4๏ธโฃ ORDER BY
โ Sorts the result by one or more columns.
SELECT * FROM customers ORDER BY created_at DESC;
5๏ธโฃ JOIN
โ Combines rows from two or more tables based on a related column.
SELECT a.name, b.salary
FROM employees a
JOIN salaries b ON a.id = b.emp_id;
6๏ธโฃ COUNT() / SUM() / AVG() / MIN() / MAX()
โ Common aggregate functions for metrics and summaries.
SELECT COUNT(ร) FROM orders WHERE status = 'completed';
7๏ธโฃ HAVING
โ Filters after a GROUP BY (unlike WHERE, which filters before).
SELECT department, COUNT() FROM employees GROUP BY department HAVING COUNT() > 10;
8๏ธโฃ LIMIT
โ Restricts number of rows returned.
SELECT * FROM products LIMIT 5;
9๏ธโฃ CASE
โ Implements conditional logic in queries.
SELECT name,
CASE
WHEN score >= 90 THEN 'A'
WHEN score >= 75 THEN 'B'
ELSE 'C'
END AS grade
FROM students;
๐ DATE functions (NOW(), DATE_PART(), DATEDIFF(), etc.)
โ Handle and extract info from dates.
SELECT DATE_PART('year', order_date) FROM orders;
๐ฌ Tap โค๏ธ for more!
๐๐๐ ๐๐๐ฌ๐ ๐๐ญ๐ฎ๐๐ข๐๐ฌ ๐๐จ๐ซ ๐๐ง๐ญ๐๐ซ๐ฏ๐ข๐๐ฐ:
Join for more: https://t.me/TechAndEvents
1. Dannyโs Diner:
Restaurant analytics to understand the customer orders pattern.
Link: https://8weeksqlchallenge.com/case-study-1/
2. Pizza Runner
Pizza shop analytics to optimize the efficiency of the operation
Link: https://8weeksqlchallenge.com/case-study-2/
3. Foodie Fie
Subscription-based food content platform
Link: https://lnkd.in/gzB39qAT
4. Data Bank: Thatโs money
Analytics based on customer activities with the digital bank
Link: https://lnkd.in/gH8pKPyv
5. Data Mart: Fresh is Best
Analytics on Online supermarket
Link: https://lnkd.in/gC5bkcDf
6. Clique Bait: Attention capturing
Analytics on the seafood industry
Link: https://lnkd.in/ggP4JiYG
7. Balanced Tree: Clothing Company
Analytics on the sales performance of clothing store
Link: https://8weeksqlchallenge.com/case-study-7
8. Fresh segments: Extract maximum value
Analytics on online advertising
Link: https://8weeksqlchallenge.com/case-study-8
Placement Material ๐ฏ๐ฏ: https://topmate.io/sumit_kumar80/1151675
Join for more: https://t.me/TechAndEvents
1. Dannyโs Diner:
Restaurant analytics to understand the customer orders pattern.
Link: https://8weeksqlchallenge.com/case-study-1/
2. Pizza Runner
Pizza shop analytics to optimize the efficiency of the operation
Link: https://8weeksqlchallenge.com/case-study-2/
3. Foodie Fie
Subscription-based food content platform
Link: https://lnkd.in/gzB39qAT
4. Data Bank: Thatโs money
Analytics based on customer activities with the digital bank
Link: https://lnkd.in/gH8pKPyv
5. Data Mart: Fresh is Best
Analytics on Online supermarket
Link: https://lnkd.in/gC5bkcDf
6. Clique Bait: Attention capturing
Analytics on the seafood industry
Link: https://lnkd.in/ggP4JiYG
7. Balanced Tree: Clothing Company
Analytics on the sales performance of clothing store
Link: https://8weeksqlchallenge.com/case-study-7
8. Fresh segments: Extract maximum value
Analytics on online advertising
Link: https://8weeksqlchallenge.com/case-study-8
Placement Material ๐ฏ๐ฏ: https://topmate.io/sumit_kumar80/1151675
Telegram
Tech And Events 2026
Sharing Events In 2026-2027
Technology Updates
World Level Hackathons
Up To Date In Tech Soft Skills For Your Knowledge
Technology Updates
World Level Hackathons
Up To Date In Tech Soft Skills For Your Knowledge
โ
Master Exploratory Data Analysis (EDA) ๐๐ก
1๏ธโฃ Understand Your Dataset
โบ Check shape, column types, missing values
โบ Use: df.info(), df.describe(), df.isnull().sum()
2๏ธโฃ Handle Missing & Duplicate Data
โบ Remove or fill missing values
โบ Use: dropna(), fillna(), drop_duplicates()
3๏ธโฃ Univariate Analysis
โบ Analyze one feature at a time
โบ Tools: histograms, box plots, value_counts()
4๏ธโฃ Bivariate & Multivariate Analysis
โบ Explore relations between features
โบ Tools: scatter plots, heatmaps, pair plots (Seaborn)
5๏ธโฃ Outlier Detection
โบ Use box plots, Z-score, IQR method
โบ Crucial for clean modeling
6๏ธโฃ Correlation Check
โบ Find highly correlated features
โบ Use: df.corr() + Seaborn heatmap
7๏ธโฃ Feature Engineering Ideas
โบ Create or remove features based on insights
๐ Tools: Python (Pandas, Matplotlib, Seaborn)
๐ฏ Mini Project: Try EDA on Titanic or Iris dataset!
Data Scienceเฅค Roadmap:๐ฏ๐ฏ
https://topmate.io/sumit_kumar80/1151675
๐ฌ Double Tap โค๏ธ for more!
1๏ธโฃ Understand Your Dataset
โบ Check shape, column types, missing values
โบ Use: df.info(), df.describe(), df.isnull().sum()
2๏ธโฃ Handle Missing & Duplicate Data
โบ Remove or fill missing values
โบ Use: dropna(), fillna(), drop_duplicates()
3๏ธโฃ Univariate Analysis
โบ Analyze one feature at a time
โบ Tools: histograms, box plots, value_counts()
4๏ธโฃ Bivariate & Multivariate Analysis
โบ Explore relations between features
โบ Tools: scatter plots, heatmaps, pair plots (Seaborn)
5๏ธโฃ Outlier Detection
โบ Use box plots, Z-score, IQR method
โบ Crucial for clean modeling
6๏ธโฃ Correlation Check
โบ Find highly correlated features
โบ Use: df.corr() + Seaborn heatmap
7๏ธโฃ Feature Engineering Ideas
โบ Create or remove features based on insights
๐ Tools: Python (Pandas, Matplotlib, Seaborn)
๐ฏ Mini Project: Try EDA on Titanic or Iris dataset!
Data Scienceเฅค Roadmap:๐ฏ๐ฏ
https://topmate.io/sumit_kumar80/1151675
๐ฌ Double Tap โค๏ธ for more!
topmate.io
Data science Job + Placement with Sumit Kumar
For College and Working Professional
๐ค ChatGPT โ Free
๐ Notion โ Free
๐ Gumroad โ Free
๐ Etsy โ Free
๐ฆ Twitter โ Free
๐บ YouTube โ Free
๐ Wix โ Free
๐จ Canva โ Free
๐ Beehiiv โ Free
๐ฌ Discord โ Free
๐ Google โ Free
๐ Courses โ Free
๐ Buffer โ Free best Best resources: https://topmate.io/sumit_kumar80/1153565
๐ Notion โ Free
๐ Gumroad โ Free
๐ Etsy โ Free
๐ฆ Twitter โ Free
๐บ YouTube โ Free
๐ Wix โ Free
๐จ Canva โ Free
๐ Beehiiv โ Free
๐ฌ Discord โ Free
๐ Google โ Free
๐ Courses โ Free
๐ Buffer โ Free best Best resources: https://topmate.io/sumit_kumar80/1153565
topmate.io
Unlocking the Power of AI with Sumit Kumar
Unlock Your Full Potential as Working Professional/Student
DSA INTERVIEW QUESTIONS AND ANSWERS
1. What is the difference between file structure and storage structure?
The difference lies in the memory area accessed. Storage structure refers to the data structure in the memory of the computer system,
whereas file structure represents the storage structure in the auxiliary memory.
2. Are linked lists considered linear or non-linear Data Structures?
Linked lists are considered both linear and non-linear data structures depending upon the application they are used for. When used for
access strategies, it is considered as a linear data-structure. When used for data storage, it is considered a non-linear data structure.
3. How do you reference all of the elements in a one-dimension array?
All of the elements in a one-dimension array can be referenced using an indexed loop as the array subscript so that the counter runs
from 0 to the array size minus one.
4. What are dynamic Data Structures? Name a few.
They are collections of data in memory that expand and contract to grow or shrink in size as a program runs. This enables the programmer
to control exactly how much memory is to be utilized.Examples are the dynamic array, linked list, stack, queue, and heap.
5. What is a Dequeue?
It is a double-ended queue, or a data structure, where the elements can be inserted or deleted at both ends (FRONT and REAR).
6. What operations can be performed on queues?
enqueue() adds an element to the end of the queue
dequeue() removes an element from the front of the queue
init() is used for initializing the queue
isEmpty tests for whether or not the queue is empty
The front is used to get the value of the first data item but does not remove it
The rear is used to get the last item from a queue.
7. What is the merge sort? How does it work?
Merge sort is a divide-and-conquer algorithm for sorting the data. It works by merging and sorting adjacent data to create bigger sorted
lists, which are then merged recursively to form even bigger sorted lists until you have one single sorted list.
8.How does the Selection sort work?
Selection sort works by repeatedly picking the smallest number in ascending order from the list and placing it at the beginning. This process is repeated moving toward the end of the list or sorted subarray.
Scan all items and find the smallest. Switch over the position as the first item. Repeat the selection sort on the remaining N-1 items. We always iterate forward (i from 0 to N-1) and swap with the smallest element (always i).
Time complexity: best case O(n2); worst O(n2)
Space complexity: worst O(1)
9. What are the applications of graph Data Structure?
Transport grids where stations are represented as vertices and routes as the edges of the graph
Utility graphs of power or water, where vertices are connection points and edge the wires or pipes connecting them
Social network graphs to determine the flow of information and hotspots (edges and vertices)
Neural networks where vertices represent neurons and edge the synapses between them
10. What is an AVL tree?
An AVL (Adelson, Velskii, and Landi) tree is a height balancing binary search tree in which the difference of heights of the left
and right subtrees of any node is less than or equal to one. This controls the height of the binary search tree by not letting
it get skewed. This is used when working with a large data set, with continual pruning through insertion and deletion of data.
11. Differentiate NULL and VOID ?
Null is a value, whereas Void is a data type identifier
Null indicates an empty value for a variable, whereas void indicates pointers that have no initial size
Null means it never existed; Void means it existed but is not in effect
Credits:
Placement Resources:
https://topmate.io/sumit_kumar80/1148833
TCS : https://topmate.io/sumit_kumar80/1151668
All the best ๐๐
1. What is the difference between file structure and storage structure?
The difference lies in the memory area accessed. Storage structure refers to the data structure in the memory of the computer system,
whereas file structure represents the storage structure in the auxiliary memory.
2. Are linked lists considered linear or non-linear Data Structures?
Linked lists are considered both linear and non-linear data structures depending upon the application they are used for. When used for
access strategies, it is considered as a linear data-structure. When used for data storage, it is considered a non-linear data structure.
3. How do you reference all of the elements in a one-dimension array?
All of the elements in a one-dimension array can be referenced using an indexed loop as the array subscript so that the counter runs
from 0 to the array size minus one.
4. What are dynamic Data Structures? Name a few.
They are collections of data in memory that expand and contract to grow or shrink in size as a program runs. This enables the programmer
to control exactly how much memory is to be utilized.Examples are the dynamic array, linked list, stack, queue, and heap.
5. What is a Dequeue?
It is a double-ended queue, or a data structure, where the elements can be inserted or deleted at both ends (FRONT and REAR).
6. What operations can be performed on queues?
enqueue() adds an element to the end of the queue
dequeue() removes an element from the front of the queue
init() is used for initializing the queue
isEmpty tests for whether or not the queue is empty
The front is used to get the value of the first data item but does not remove it
The rear is used to get the last item from a queue.
7. What is the merge sort? How does it work?
Merge sort is a divide-and-conquer algorithm for sorting the data. It works by merging and sorting adjacent data to create bigger sorted
lists, which are then merged recursively to form even bigger sorted lists until you have one single sorted list.
8.How does the Selection sort work?
Selection sort works by repeatedly picking the smallest number in ascending order from the list and placing it at the beginning. This process is repeated moving toward the end of the list or sorted subarray.
Scan all items and find the smallest. Switch over the position as the first item. Repeat the selection sort on the remaining N-1 items. We always iterate forward (i from 0 to N-1) and swap with the smallest element (always i).
Time complexity: best case O(n2); worst O(n2)
Space complexity: worst O(1)
9. What are the applications of graph Data Structure?
Transport grids where stations are represented as vertices and routes as the edges of the graph
Utility graphs of power or water, where vertices are connection points and edge the wires or pipes connecting them
Social network graphs to determine the flow of information and hotspots (edges and vertices)
Neural networks where vertices represent neurons and edge the synapses between them
10. What is an AVL tree?
An AVL (Adelson, Velskii, and Landi) tree is a height balancing binary search tree in which the difference of heights of the left
and right subtrees of any node is less than or equal to one. This controls the height of the binary search tree by not letting
it get skewed. This is used when working with a large data set, with continual pruning through insertion and deletion of data.
11. Differentiate NULL and VOID ?
Null is a value, whereas Void is a data type identifier
Null indicates an empty value for a variable, whereas void indicates pointers that have no initial size
Null means it never existed; Void means it existed but is not in effect
Credits:
Placement Resources:
https://topmate.io/sumit_kumar80/1148833
TCS : https://topmate.io/sumit_kumar80/1151668
All the best ๐๐
topmate.io
Ultimate Placement Coding Resources with Sumit Kumar
Ultimate Placement materials (top 10 companies)