6-๐ฉ
myCars.ForEach(p => Console.WriteLine(โ{0} {1:C}โ, p.VIN, p.StickerPrice));
7-๐ฉ
Console.WriteLine(myCars.Exists(p => p.Model == โ745liโ));
8-๐ฉ
Console.WriteLine(myCars.Sum(p => p.StickerPrice));
9-๐ฉ
foreach (var car in orderedCars)
{
Console.WriteLine(โ{0} {1}โ, car.Year, car.Model, car.VIN);
}
myCars.ForEach(p => Console.WriteLine(โ{0} {1:C}โ, p.VIN, p.StickerPrice));
7-๐ฉ
Console.WriteLine(myCars.Exists(p => p.Model == โ745liโ));
8-๐ฉ
Console.WriteLine(myCars.Sum(p => p.StickerPrice));
9-๐ฉ
foreach (var car in orderedCars)
{
Console.WriteLine(โ{0} {1}โ, car.Year, car.Model, car.VIN);
}
sharing some Interview questions #sql #advance
1. What are Window Functions?
-> A Window Function performs a calculation across a set of table rows that are somehow related to the current row. Window functions are initiated by the OVER() clause. Another important clause is PARTITION BY, which defines data partitions within a window frame. When this clause is omitted, the partition is the entire result table. Another important clause is ORDER BY. It sorts data within the window.
2. What Window Functions do you know?
-> SQL window functions can be generally divided into four categories:
a. Ranking Functions
b. Distribution Functions
c. Analytic Functions
d. Aggregate Functions
a. The Ranking functions are:
1. ROW_NUMBER() โ Returns a unique number for each row within a partition; tied values have different row numbers.
2. RANK() โ Ranks data within a partition; tied values have the same rank, and thereโs a gap following ties (e.g. 1, 2, 3, 3, 5).
3. DENSE_RANK() โ Ranks data within a partition; tied values have the same rank and thereโs no ranking gap (e.g. 1, 2, 3, 3, 4).
b. The Distribution functions are:
1. PERCENT_RANK() โ Returns the relative rank within a partition.
2. CUME_DIST() โ Returns the cumulative distribution within a partition.
c. The Analytic functions are:
1. LEAD() โ Allows accessing values from a subsequent row in relation to the current row.
2. LAG() โ Allows accessing values from a previous row in relation to the current row.
3. NTILE() โ Divides rows within a partition into approximately equal groups.
4. FIRST_VALUE() โ Allows accessing values from the first row within a partition.
5. LAST_VALUE() โ Allows accessing values from the last row within a partition.
6. NTH_VALUE() โ Allows accessing the nth row within a partition.
d. The Aggregate functions are:
1. AVG() โ Returns an average value for the rows in a partition.
2. COUNT() โ Returns the number of values in the rows in a partition.
3. MAX() โ Returns the maximum value for the rows in a partition.
4. MIN() โ Returns the minimum value for the rows in a partition.
5. SUM() โ Returns the sum value of the rows in a partition.
1. What are Window Functions?
-> A Window Function performs a calculation across a set of table rows that are somehow related to the current row. Window functions are initiated by the OVER() clause. Another important clause is PARTITION BY, which defines data partitions within a window frame. When this clause is omitted, the partition is the entire result table. Another important clause is ORDER BY. It sorts data within the window.
2. What Window Functions do you know?
-> SQL window functions can be generally divided into four categories:
a. Ranking Functions
b. Distribution Functions
c. Analytic Functions
d. Aggregate Functions
a. The Ranking functions are:
1. ROW_NUMBER() โ Returns a unique number for each row within a partition; tied values have different row numbers.
2. RANK() โ Ranks data within a partition; tied values have the same rank, and thereโs a gap following ties (e.g. 1, 2, 3, 3, 5).
3. DENSE_RANK() โ Ranks data within a partition; tied values have the same rank and thereโs no ranking gap (e.g. 1, 2, 3, 3, 4).
b. The Distribution functions are:
1. PERCENT_RANK() โ Returns the relative rank within a partition.
2. CUME_DIST() โ Returns the cumulative distribution within a partition.
c. The Analytic functions are:
1. LEAD() โ Allows accessing values from a subsequent row in relation to the current row.
2. LAG() โ Allows accessing values from a previous row in relation to the current row.
3. NTILE() โ Divides rows within a partition into approximately equal groups.
4. FIRST_VALUE() โ Allows accessing values from the first row within a partition.
5. LAST_VALUE() โ Allows accessing values from the last row within a partition.
6. NTH_VALUE() โ Allows accessing the nth row within a partition.
d. The Aggregate functions are:
1. AVG() โ Returns an average value for the rows in a partition.
2. COUNT() โ Returns the number of values in the rows in a partition.
3. MAX() โ Returns the maximum value for the rows in a partition.
4. MIN() โ Returns the minimum value for the rows in a partition.
5. SUM() โ Returns the sum value of the rows in a partition.
๐2
Google is hiring for Web Solutions Engineering role in Gurgaon โก๏ธ๐
https://www.google.com/about/careers/applications/jobs/results/75837410539119302-web-solutions-engineer?location=Gurgaon%2C%20India&page=2
https://www.google.com/about/careers/applications/jobs/results/75837410539119302-web-solutions-engineer?location=Gurgaon%2C%20India&page=2
๐ Check out my YouTube tutorial: "Mastering JavaScript from Basic to Advanced" ๐
Whether you're just starting out or looking to level up your skills, this comprehensive guide has got you covered!
๐ป๐ฅ Dive into the world of JavaScript and unlock its full potential with step-by-step lessons and hands-on examples.
๐ก Don't miss out on the chance to become a JavaScript pro! Watch the tutorial now by clicking the link below:
https://youtu.be/cdgrKbB4V78?si=_uYhtj246MuIRl-6
๐ #JavaScriptTutorial #LearnJavaScript #JavaScriptBasics #JavaScriptAdvanced #CodingTutorial #WebDevelopment #FrontendDevelopment #Programming #TechEducation #OnlineLearning #DeveloperSkills ๐
follow @coder_baba
#coderbaba #dotnet #coding
Whether you're just starting out or looking to level up your skills, this comprehensive guide has got you covered!
๐ป๐ฅ Dive into the world of JavaScript and unlock its full potential with step-by-step lessons and hands-on examples.
๐ก Don't miss out on the chance to become a JavaScript pro! Watch the tutorial now by clicking the link below:
https://youtu.be/cdgrKbB4V78?si=_uYhtj246MuIRl-6
๐ #JavaScriptTutorial #LearnJavaScript #JavaScriptBasics #JavaScriptAdvanced #CodingTutorial #WebDevelopment #FrontendDevelopment #Programming #TechEducation #OnlineLearning #DeveloperSkills ๐
follow @coder_baba
#coderbaba #dotnet #coding
YouTube
#7 ASP.NET Course 2023 | Learn JavaScript | Mastering JavaScript Tutorial for Beginners
JavaScript เคธเฅเคเฅเค: เคนเคฟเคเคฆเฅ เคฎเฅเค JavaScript เคเฅเคฏเฅเคเฅเคฐเคฟเคฏเคฒ Step-by-Step JavaScript Tutorial in Hindi #coderbaba #javascript Beginner's Guide to JavaScript
How to use JavaScript in Asp .Net
Download ASP.NET C# Complete PDF Notes
https://bit.ly/3PhO8tg
Free ๐ Downloadโฆ
How to use JavaScript in Asp .Net
Download ASP.NET C# Complete PDF Notes
https://bit.ly/3PhO8tg
Free ๐ Downloadโฆ
๐1
10 AI Tools to Replace your Tedious Work:
------------------------------------------------------
1. 10web.io - AI Website Builder
2. Lovo.ai - AI Voice Generator
3. Opus.pro - Create viral videos in sec
4. Tldv.io - AI Meeting Assistant
5. Perplexity.ai - Use AI while browsing
6. Kickresume.com - AI Resume Builder
7. Rytr.me - Personal AI copywriter
8. Eightify.app - Summarize YouTube video
9. Chatpdf.com - Chat with any PDF
10. Sheetplus.ai - Write excel formulas with AI
follow for more
Subscribe my youtube channel
https://www.youtube.com/@coderbaba?sub_confirmation=1
#coderbaba #coding #programming #dotnet #project #sourcecode #technology #AI #AITools
------------------------------------------------------
1. 10web.io - AI Website Builder
2. Lovo.ai - AI Voice Generator
3. Opus.pro - Create viral videos in sec
4. Tldv.io - AI Meeting Assistant
5. Perplexity.ai - Use AI while browsing
6. Kickresume.com - AI Resume Builder
7. Rytr.me - Personal AI copywriter
8. Eightify.app - Summarize YouTube video
9. Chatpdf.com - Chat with any PDF
10. Sheetplus.ai - Write excel formulas with AI
follow for more
Subscribe my youtube channel
https://www.youtube.com/@coderbaba?sub_confirmation=1
#coderbaba #coding #programming #dotnet #project #sourcecode #technology #AI #AITools
๐ฏ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
12. Do dynamic memory allocations help in managing data? How?
Dynamic memory allocation stores simple structured data types at runtime. It has the ability to combine separately allocated
structured blocks to form composite structures that expand and contract as needed, thus helping manage data of data blocks
of arbitrary size, in arbitrary order.
๐ปFollow for more
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
12. Do dynamic memory allocations help in managing data? How?
Dynamic memory allocation stores simple structured data types at runtime. It has the ability to combine separately allocated
structured blocks to form composite structures that expand and contract as needed, thus helping manage data of data blocks
of arbitrary size, in arbitrary order.
๐ปFollow for more
Subscribe my YouTube channel
https://www.youtube.com/@coderbaba?sub_confirmation=1
#coderbaba #coding #programming #dotnet #project #sourcecode #technology
ENJOY LEARNING ๐๐
https://www.youtube.com/@coderbaba?sub_confirmation=1
#coderbaba #coding #programming #dotnet #project #sourcecode #technology
ENJOY LEARNING ๐๐
๐ Introducing final year project: "Online Examination System"! ๐
๐ป Built with ASP.NET C#, HTML, Bootstrap, JavaScript, and SQL Server database,
this project is perfect for final year students eager to develop web applications using cutting-edge .NET technology.
๐ก Get hands-on experience and comprehensive training with this comprehensive project.
๐ Dive into the world of web development and master the skills needed to create robust, user-friendly applications!
๐ผ๐ป Don't miss out on this opportunity to enhance your portfolio and impress potential employers.
Download the complete source code
๐ Ready to take your coding skills to the next level?
Subscribe to my YouTube channel #coderbaba for more tutorials, project demos, and tech insights! ๐ฅโจ
https://www.youtube.com/@coderbaba?sub_confirmation=1
#FinalYearProject #OnlineExaminationSystem #ASPdotNET #CSharp #HTML #Bootstrap #JavaScript #SQLServer #WebDevelopment #Coding #Programming #TechSkills #DeveloperTraining #CoderBaba
@coder_baba
๐ป Built with ASP.NET C#, HTML, Bootstrap, JavaScript, and SQL Server database,
this project is perfect for final year students eager to develop web applications using cutting-edge .NET technology.
๐ก Get hands-on experience and comprehensive training with this comprehensive project.
๐ Dive into the world of web development and master the skills needed to create robust, user-friendly applications!
๐ผ๐ป Don't miss out on this opportunity to enhance your portfolio and impress potential employers.
Download the complete source code
๐ Ready to take your coding skills to the next level?
Subscribe to my YouTube channel #coderbaba for more tutorials, project demos, and tech insights! ๐ฅโจ
https://www.youtube.com/@coderbaba?sub_confirmation=1
#FinalYearProject #OnlineExaminationSystem #ASPdotNET #CSharp #HTML #Bootstrap #JavaScript #SQLServer #WebDevelopment #Coding #Programming #TechSkills #DeveloperTraining #CoderBaba
@coder_baba
Online-Examination-System-Project-By CoderBaba.rar
1.7 MB
๐ Introducing final year project: "Online Examination System"! ๐
๐ป Built with ASP.NET C#, HTML, Bootstrap, JavaScript, and SQL Server database,
this project is perfect for final year students eager to develop web applications using cutting-edge .NET technology.
๐ก Get hands-on experience and comprehensive training with this comprehensive project.
๐ Dive into the world of web development and master the skills needed to create robust, user-friendly applications!
๐ผ๐ป Don't miss out on this opportunity to enhance your portfolio and impress potential employers.
Download the complete source code
๐ Ready to take your coding skills to the next level?
Subscribe to my YouTube channel @coderbaba for more tutorials, project demos, and tech insights! ๐ฅโจ
https://www.youtube.com/@coderbaba?sub_confirmation=1
#FinalYearProject #OnlineExaminationSystem #ASPdotNET #CSharp #HTML #Bootstrap #JavaScript #SQLServer #WebDevelopment #Coding #Programming #TechSkills #DeveloperTraining #CoderBaba
๐ป Built with ASP.NET C#, HTML, Bootstrap, JavaScript, and SQL Server database,
this project is perfect for final year students eager to develop web applications using cutting-edge .NET technology.
๐ก Get hands-on experience and comprehensive training with this comprehensive project.
๐ Dive into the world of web development and master the skills needed to create robust, user-friendly applications!
๐ผ๐ป Don't miss out on this opportunity to enhance your portfolio and impress potential employers.
Download the complete source code
๐ Ready to take your coding skills to the next level?
Subscribe to my YouTube channel @coderbaba for more tutorials, project demos, and tech insights! ๐ฅโจ
https://www.youtube.com/@coderbaba?sub_confirmation=1
#FinalYearProject #OnlineExaminationSystem #ASPdotNET #CSharp #HTML #Bootstrap #JavaScript #SQLServer #WebDevelopment #Coding #Programming #TechSkills #DeveloperTraining #CoderBaba
๐1