Complete the code to create a list of even numbers using deferred execution.
var numbers = new List<int> {1, 2, 3, 4, 5};
var evens = numbers.Where(n => n [1] 2 == 0);/ instead of modulo % to check even numbers.The modulo operator % returns the remainder. Using n % 2 == 0 checks if a number is even.
Complete the code to demonstrate deferred execution by modifying the source list after query creation.
var numbers = new List<int> {1, 2, 3};
var query = numbers.Where(n => n > [1]);
numbers.Add(4);
foreach(var num in query) Console.WriteLine(num);Using n > 1 will include numbers greater than 1, so after adding 4, it will be included in the output, showing deferred execution.
Fix the error in the code to correctly demonstrate deferred execution with LINQ.
var list = new List<int> {1, 2, 3};
var result = list.Select(x => x * 2).ToList();
list.Add(4);
var query = list.Select(x => x [1] 2);
foreach(var item in query) Console.WriteLine(item);The * operator multiplies each element by 2. Using ToList() earlier forces immediate execution, but the second query uses deferred execution.
Fill both blanks to create a dictionary comprehension that filters and transforms elements with deferred execution.
var words = new List<string> {"apple", "bee", "cat", "dog"};
var dict = words.Where(w => w.Length [1] 3)
.ToDictionary(w => w, w => w.[2]());The code filters words with length greater than 3 and converts them to uppercase in the dictionary values.
Fill all three blanks to create a LINQ query that filters, transforms, and orders numbers demonstrating deferred execution.
var nums = new List<int> {5, 3, 8, 1, 4};
var query = nums.Where(n => n [1] 3)
.Select(n => n [2] 1)
.OrderBy(n => n [3] 2);
foreach(var n in query) Console.WriteLine(n);The query filters numbers greater than 3, adds 1 to each, then orders them by their value multiplied by 2.