•

1 like•1,005 views

The document contains descriptions of several LeetCode problems ranging from Medium to Hard difficulty. It provides details about the Maximum Level Sum of a Binary Tree, Jump Game III, Minesweeper, Binary Tree Level Order Traversal, Number of Operations to Make Network Connected, Open the Lock, Sliding Puzzle, and Trapping Rain Water II problems. It also includes pseudocode and explanations for solving the Number of Operations to Make Network Connected and Open the Lock problems.

Report

Share

Report

Share

Download to read offline

Python strings presentation

This is presentation, that covers all the important topics related to strings in python. It covers storing, slicing, format, concatenation, modification, escape characters and string methods.
The file attatched also includes examples related to the slides shown.

OCL tutorial

Introduction to OCL - Tutorial given at the SFM'12 summer school
Learn more about OCL (and UML, DSLs, MDE,...) at : http://modeling-languages.com
Home page: http://jordicabot.com

Euclid's Algorithm for Greatest Common Divisor - Time Complexity Analysis

Euclid's algorithm for finding greatest common divisor is an elegant algorithm that can be written iteratively as well as recursively. The time complexity of this algorithm is O(log^2 n) where n is the larger of the two inputs.

String operation

The document discusses string operations and storage in programming languages. It describes the basic character sets used which include alphabets, digits, and special characters. It then discusses three methods of storing strings: fixed-length storage, variable-length storage with a fixed maximum, and linked storage. The document proceeds to define common string operations like length, substring, indexing, concatenation, insertion, deletion, replacement, and pattern matching. Algorithms for implementing some of these operations are provided.

Chapter 16 Dictionaries

This document discusses dictionaries in Python. It begins by defining a dictionary as an unordered collection of key-value pairs that provides fast lookup by key. Keys must be immutable data types. It then explains how to create dictionaries using curly brackets or the dict() function. Several built-in dictionary methods like get(), items(), keys(), update(), and values() are described along with their functions. The document ends with examples of class work and a practice test on dictionaries.

Data Structure in C (Lab Programs)

Programs are complete in best of my knowledge with zero compilation error in IDE Bloodshed Dev-C++. These can be easily portable to any versions of Visual Studio or Qt. If you need any guidance please let me know via comments and Always Enjoy Programming.

full subtractor

A full subtractor is a logic circuit that performs subtraction between two binary digits. It has three inputs - the minuend, subtrahend, and a borrow bit. It uses logic gates like OR, XOR, and NAND gates. A full subtractor is made up of two half subtractors and can subtract two bits while accounting for a borrow from the next higher order bits. It has three inputs and two outputs - the difference and a new borrow bit. Full subtractors are used in arithmetic logic units of computers and other digital devices to perform subtraction operations.

Deterministic Finite Automata (DFA)

This document provides an overview of deterministic finite automata (DFA) through examples and practice problems. It begins with defining the components of a DFA, including states, alphabet, transition function, start state, and accepting states. An example DFA is given to recognize strings ending in "00". Additional practice problems involve drawing minimal DFAs, determining the minimum number of states for a language, and completing partially drawn DFAs. The document aims to help students learn and practice working with DFA models.

Python strings presentation

This is presentation, that covers all the important topics related to strings in python. It covers storing, slicing, format, concatenation, modification, escape characters and string methods.
The file attatched also includes examples related to the slides shown.

OCL tutorial

Introduction to OCL - Tutorial given at the SFM'12 summer school
Learn more about OCL (and UML, DSLs, MDE,...) at : http://modeling-languages.com
Home page: http://jordicabot.com

Euclid's Algorithm for Greatest Common Divisor - Time Complexity Analysis

Euclid's algorithm for finding greatest common divisor is an elegant algorithm that can be written iteratively as well as recursively. The time complexity of this algorithm is O(log^2 n) where n is the larger of the two inputs.

String operation

The document discusses string operations and storage in programming languages. It describes the basic character sets used which include alphabets, digits, and special characters. It then discusses three methods of storing strings: fixed-length storage, variable-length storage with a fixed maximum, and linked storage. The document proceeds to define common string operations like length, substring, indexing, concatenation, insertion, deletion, replacement, and pattern matching. Algorithms for implementing some of these operations are provided.

Chapter 16 Dictionaries

This document discusses dictionaries in Python. It begins by defining a dictionary as an unordered collection of key-value pairs that provides fast lookup by key. Keys must be immutable data types. It then explains how to create dictionaries using curly brackets or the dict() function. Several built-in dictionary methods like get(), items(), keys(), update(), and values() are described along with their functions. The document ends with examples of class work and a practice test on dictionaries.

Data Structure in C (Lab Programs)

Programs are complete in best of my knowledge with zero compilation error in IDE Bloodshed Dev-C++. These can be easily portable to any versions of Visual Studio or Qt. If you need any guidance please let me know via comments and Always Enjoy Programming.

full subtractor

A full subtractor is a logic circuit that performs subtraction between two binary digits. It has three inputs - the minuend, subtrahend, and a borrow bit. It uses logic gates like OR, XOR, and NAND gates. A full subtractor is made up of two half subtractors and can subtract two bits while accounting for a borrow from the next higher order bits. It has three inputs and two outputs - the difference and a new borrow bit. Full subtractors are used in arithmetic logic units of computers and other digital devices to perform subtraction operations.

Deterministic Finite Automata (DFA)

This document provides an overview of deterministic finite automata (DFA) through examples and practice problems. It begins with defining the components of a DFA, including states, alphabet, transition function, start state, and accepting states. An example DFA is given to recognize strings ending in "00". Additional practice problems involve drawing minimal DFAs, determining the minimum number of states for a language, and completing partially drawn DFAs. The document aims to help students learn and practice working with DFA models.

Nand and nor as a universal gates

NAND and NOR gates are universal gates because any other logic gate can be implemented using only NAND or NOR gates. The document provides examples of how to construct NOT, AND, OR, XOR, and XNOR gates using only NAND gates. Similarly, it demonstrates how to construct these common logic gates using only NOR gates. Both NAND and NOR gates are universal because Boolean logic can be represented entirely with either of these gate types alone.

Data Structure and Algorithms Arrays

This slide explains some basics concepts of array and operation performed on arrays like searching and sorting.

Computer organization and architecture lab manual

This document contains information about a computer organization and architecture lab. It includes details about the lab report format, integer representation using fixed point, two's complement, addition and subtraction algorithms and hardware. It also discusses logical operations, and provides MATLAB code examples for 4-bit binary addition, subtraction, multiplication and restoring division algorithms.

Chapter 17 Tuples

This document discusses tuples in Python. It begins by defining a tuple as a sequence of values that can be of any type and are indexed by integers. Tuples are immutable, like lists but values cannot be changed. Various tuple functions are described such as creating empty tuples, accessing tuple elements using indexes and loops, checking if an item exists, getting the length, and removing a tuple. Built-in tuple methods like count() and index() are explained. The key differences between tuples, lists, and dictionaries are outlined. Finally, some example programs demonstrating tuple operations are provided.

Topological Sort

This document discusses several graph algorithms:
1) Topological sort is an ordering of the vertices of a directed acyclic graph (DAG) such that for every edge from vertex u to v, u comes before v in the ordering. It can be used to find a valid schedule respecting dependencies.
2) Strongly connected components are maximal subsets of vertices in a directed graph such that there is a path between every pair of vertices. An algorithm uses depth-first search to find SCCs in linear time.
3) Minimum spanning trees find a subset of edges that connects all vertices at minimum total cost. Prim's and Kruskal's algorithms find minimum spanning trees using greedy strategies in O(E

Exception handling in python

This document provides information about a mentoring program run by Baabtra-Mentoring Partner. It includes a trainee's typing speed progress over 5 weeks, with targets and achievements. It also lists 3 job applications with company names, designations, and application dates. Finally, it discusses Python exceptions handling, including try/catch blocks, built-in exception classes, raising exceptions, and error types.

Java programming lab manual

This document contains instructions for several Java programming exercises involving classes, packages, inheritance, overriding, exceptions, and threads. It outlines code for programs that demonstrate concepts like classes and objects, command line arguments, bitwise operators, method overriding, and packages. For each exercise, it provides the aim, algorithm, sample code, input/output, and result to verify the output. The exercises are intended to help students learn and practice core Java programming concepts.

Type conversion

Type conversion in C provides two methods: implicit type conversion which occurs automatically during expressions, and explicit type conversion using cast expressions. Implicit conversion occurs when different types are used in expressions, such as when an int is used in a calculation with a float. The usual arithmetic conversions implicitly promote operands to the smallest type that can accommodate both values. Explicit casting uses cast operators to force a type conversion.

Data Structure Project File

1. Perform Linear Search and Binary Search on an array.
Descriptions of the programs:
Read and array of type integer.
Input element from user for searching.
Search the element by passing the array to a function and then returning the position of the element from the function else return -1 if the element is not found.
Display the positions where the element has been found.
2. Implement sparse matrix using array.
Description of program:
Read a 2D array from the user.
Store it in the sparse matrix form, use array of structures.
Print the final array.
3. Create a linked list with nodes having information about a student and perform.
Description of the program:
Insert a new node at specified position.
Delete of a node with the roll number of student specified.
Reversal of that linked list.
4. Create doubly linked list with nodes having information about an employee and perform Insertion at front of doubly linked list and perform deletion at end of that doubly linked list.
5. Create circular linked list having information about a college and perform Insertion at front perform Deletion at end.
6. Create a stack and perform Pop, Push, Traverse operations on the stack using Linear Linked list.
7. Create a Linear Queue using Linked List and implement different operations such as Insert, Delete, and Display the queue elements.

Iterarators and generators in python

Basics of Iterators and Generators,Uses of iterators and generators in python. advantage of iterators and generators. difference between generators and iterators.

Graph in data structure

This document defines and provides examples of graphs and their representations. It discusses:
- Graphs are data structures consisting of nodes and edges connecting nodes.
- Examples of directed and undirected graphs are given.
- Graphs can be represented using adjacency matrices or adjacency lists. Adjacency matrices store connections in a grid and adjacency lists store connections as linked lists.
- Key graph terms are defined such as vertices, edges, paths, and degrees. Properties like connectivity and completeness are also discussed.

Dictionaries in Python

This document provides information about dictionaries in Python. It defines dictionaries as mutable containers that store key-value pairs, with keys being unique and values being of any type. It describes dictionary syntax and how to access, update, delete and add elements. It notes that dictionary keys must be immutable like strings or numbers, while values can be any type. Properties of dictionary keys like no duplicate keys and keys requiring immutability are also summarized.

Fibonacci search

- Fibonacci search is applied to sorted arrays to determine the index position of an item to be searched.
- It uses the Fibonacci series to select indices to compare the item to, narrowing the search range with each comparison until the item is found or the range is reduced to one element.
- Interpolation search works on uniformly distributed arrays by calculating a mid-point based on the relative position of the item to the first and last array elements. It compares the item to the element at that mid-point to narrow the search range.

digital logic design number system

Digital logic design deals with digital circuits and how to design digital hardware using logic gates. It involves working with binary and other number systems. Binary represents information using two states (0 and 1) which can be represented electrically using voltage levels. Converting between number systems like binary, decimal, and octal allows digital components to interface. Basic logic operations like addition, subtraction and multiplication can then be performed on binary numbers.

Chapter 5 boolean algebra

This document provides an introduction to Boolean algebra, which was developed by English mathematician George Boole in the 1800s. It describes Boolean algebra as an algebra of logic or an algebra of two values (true or false). The key concepts covered include:
- The basic logical operators of AND, OR, and NOT
- How these operators are represented using 1s and 0s in digital circuits
- Truth tables for the operators
- Logic gates (AND, OR, NOT) that perform Boolean operations in circuits
- Practical applications of logic gates in electronic devices
- Other logic gates like NAND, NOR, XOR, and XNOR
- Basic theorems of Boolean algebra including De Morgan's theorems

Algorithm analysis

This document provides an overview of algorithm analysis. It discusses how to analyze the time efficiency of algorithms by counting the number of operations and expressing efficiency using growth functions. Different common growth rates like constant, linear, quadratic, and exponential are introduced. Examples are provided to demonstrate how to determine the growth rate of different algorithms, including recursive algorithms, by deriving their time complexity functions. The key aspects covered are estimating algorithm runtime, comparing growth rates of algorithms, and using Big O notation to classify algorithms by their asymptotic behavior.

Algorithms Lecture 4: Sorting Algorithms I

The document discusses three sorting algorithms: bubble sort, selection sort, and insertion sort. Bubble sort works by repeatedly swapping adjacent elements that are in the wrong order. Selection sort finds the minimum element and swaps it into the sorted portion of the array. Insertion sort inserts elements into the sorted portion of the array, swapping as needed to put the element in the correct position. Both selection sort and insertion sort have a time complexity of O(n^2) in the worst case.

Regular expressions in Python

Regular expressions are a powerful tool for searching, matching, and parsing text patterns. They allow complex text patterns to be matched with a standardized syntax. All modern programming languages include regular expression libraries. Regular expressions can be used to search strings, replace parts of strings, split strings, and find all occurrences of a pattern in a string. They are useful for tasks like validating formats, parsing text, and finding/replacing text. This document provides examples of common regular expression patterns and methods for using regular expressions in Python.

Digital Logic circuit

This document provides an overview of digital logic circuits and sequential circuits. It discusses various logic gates like OR, AND, NOT, NAND, NOR and XOR gates. It explains their truth tables and symbols. It also covers Boolean algebra, map simplification using K-maps, combinational circuits like multiplexers, demultiplexers, encoders and decoders. Finally, it describes different types of flip-flops like SR, D, JK and T flip-flops which are used to build sequential circuits that have memory and can store past states.

Pointers in c++

Pointer is a variable that stores the memory address of another variable. It allows dynamic memory allocation and access of memory locations. There are three ways to pass arguments to functions in C++ - pass by value, pass by reference, and pass by pointer. Pass by value copies the value, pass by reference copies the address, and pass by pointer passes the address of the argument. Pointers can also point to arrays or strings to access elements. Arrays of pointers can store multiple strings. References are alternative names for existing variables and any changes made using the reference affect the original variable. Functions can return pointers or references.

Subnetting

The document provides examples of subnetting IP address ranges to meet specific requirements for number of subnets and hosts. It demonstrates converting host bits in an IP address to network bits to create subnets, and calculating the resulting number of subnets, hosts per subnet, and subnet ranges. Custom subnet masks are provided based on the number of bits converted from host to network.

Chapter 3. fundamentals of wan and ip routing

The document discusses fundamentals of wide area networks (WANs) and IP routing. It covers common WAN link technologies like Ethernet and leased lines. It also explains key networking protocols including TCP/IP, IPv4 and IPv6 addressing, IP routing, subnet masking, and the classes of IP addresses. Additional topics covered are Ethernet and leased line WANs, how routers use WAN links, and Layer 3 protocols like DNS, ARP, and ping.

Nand and nor as a universal gates

NAND and NOR gates are universal gates because any other logic gate can be implemented using only NAND or NOR gates. The document provides examples of how to construct NOT, AND, OR, XOR, and XNOR gates using only NAND gates. Similarly, it demonstrates how to construct these common logic gates using only NOR gates. Both NAND and NOR gates are universal because Boolean logic can be represented entirely with either of these gate types alone.

Data Structure and Algorithms Arrays

This slide explains some basics concepts of array and operation performed on arrays like searching and sorting.

Computer organization and architecture lab manual

This document contains information about a computer organization and architecture lab. It includes details about the lab report format, integer representation using fixed point, two's complement, addition and subtraction algorithms and hardware. It also discusses logical operations, and provides MATLAB code examples for 4-bit binary addition, subtraction, multiplication and restoring division algorithms.

Chapter 17 Tuples

This document discusses tuples in Python. It begins by defining a tuple as a sequence of values that can be of any type and are indexed by integers. Tuples are immutable, like lists but values cannot be changed. Various tuple functions are described such as creating empty tuples, accessing tuple elements using indexes and loops, checking if an item exists, getting the length, and removing a tuple. Built-in tuple methods like count() and index() are explained. The key differences between tuples, lists, and dictionaries are outlined. Finally, some example programs demonstrating tuple operations are provided.

Topological Sort

This document discusses several graph algorithms:
1) Topological sort is an ordering of the vertices of a directed acyclic graph (DAG) such that for every edge from vertex u to v, u comes before v in the ordering. It can be used to find a valid schedule respecting dependencies.
2) Strongly connected components are maximal subsets of vertices in a directed graph such that there is a path between every pair of vertices. An algorithm uses depth-first search to find SCCs in linear time.
3) Minimum spanning trees find a subset of edges that connects all vertices at minimum total cost. Prim's and Kruskal's algorithms find minimum spanning trees using greedy strategies in O(E

Exception handling in python

This document provides information about a mentoring program run by Baabtra-Mentoring Partner. It includes a trainee's typing speed progress over 5 weeks, with targets and achievements. It also lists 3 job applications with company names, designations, and application dates. Finally, it discusses Python exceptions handling, including try/catch blocks, built-in exception classes, raising exceptions, and error types.

Java programming lab manual

This document contains instructions for several Java programming exercises involving classes, packages, inheritance, overriding, exceptions, and threads. It outlines code for programs that demonstrate concepts like classes and objects, command line arguments, bitwise operators, method overriding, and packages. For each exercise, it provides the aim, algorithm, sample code, input/output, and result to verify the output. The exercises are intended to help students learn and practice core Java programming concepts.

Type conversion

Type conversion in C provides two methods: implicit type conversion which occurs automatically during expressions, and explicit type conversion using cast expressions. Implicit conversion occurs when different types are used in expressions, such as when an int is used in a calculation with a float. The usual arithmetic conversions implicitly promote operands to the smallest type that can accommodate both values. Explicit casting uses cast operators to force a type conversion.

Data Structure Project File

1. Perform Linear Search and Binary Search on an array.
Descriptions of the programs:
Read and array of type integer.
Input element from user for searching.
Search the element by passing the array to a function and then returning the position of the element from the function else return -1 if the element is not found.
Display the positions where the element has been found.
2. Implement sparse matrix using array.
Description of program:
Read a 2D array from the user.
Store it in the sparse matrix form, use array of structures.
Print the final array.
3. Create a linked list with nodes having information about a student and perform.
Description of the program:
Insert a new node at specified position.
Delete of a node with the roll number of student specified.
Reversal of that linked list.
4. Create doubly linked list with nodes having information about an employee and perform Insertion at front of doubly linked list and perform deletion at end of that doubly linked list.
5. Create circular linked list having information about a college and perform Insertion at front perform Deletion at end.
6. Create a stack and perform Pop, Push, Traverse operations on the stack using Linear Linked list.
7. Create a Linear Queue using Linked List and implement different operations such as Insert, Delete, and Display the queue elements.

Iterarators and generators in python

Basics of Iterators and Generators,Uses of iterators and generators in python. advantage of iterators and generators. difference between generators and iterators.

Graph in data structure

This document defines and provides examples of graphs and their representations. It discusses:
- Graphs are data structures consisting of nodes and edges connecting nodes.
- Examples of directed and undirected graphs are given.
- Graphs can be represented using adjacency matrices or adjacency lists. Adjacency matrices store connections in a grid and adjacency lists store connections as linked lists.
- Key graph terms are defined such as vertices, edges, paths, and degrees. Properties like connectivity and completeness are also discussed.

Dictionaries in Python

This document provides information about dictionaries in Python. It defines dictionaries as mutable containers that store key-value pairs, with keys being unique and values being of any type. It describes dictionary syntax and how to access, update, delete and add elements. It notes that dictionary keys must be immutable like strings or numbers, while values can be any type. Properties of dictionary keys like no duplicate keys and keys requiring immutability are also summarized.

Fibonacci search

- Fibonacci search is applied to sorted arrays to determine the index position of an item to be searched.
- It uses the Fibonacci series to select indices to compare the item to, narrowing the search range with each comparison until the item is found or the range is reduced to one element.
- Interpolation search works on uniformly distributed arrays by calculating a mid-point based on the relative position of the item to the first and last array elements. It compares the item to the element at that mid-point to narrow the search range.

digital logic design number system

Digital logic design deals with digital circuits and how to design digital hardware using logic gates. It involves working with binary and other number systems. Binary represents information using two states (0 and 1) which can be represented electrically using voltage levels. Converting between number systems like binary, decimal, and octal allows digital components to interface. Basic logic operations like addition, subtraction and multiplication can then be performed on binary numbers.

Chapter 5 boolean algebra

This document provides an introduction to Boolean algebra, which was developed by English mathematician George Boole in the 1800s. It describes Boolean algebra as an algebra of logic or an algebra of two values (true or false). The key concepts covered include:
- The basic logical operators of AND, OR, and NOT
- How these operators are represented using 1s and 0s in digital circuits
- Truth tables for the operators
- Logic gates (AND, OR, NOT) that perform Boolean operations in circuits
- Practical applications of logic gates in electronic devices
- Other logic gates like NAND, NOR, XOR, and XNOR
- Basic theorems of Boolean algebra including De Morgan's theorems

Algorithm analysis

This document provides an overview of algorithm analysis. It discusses how to analyze the time efficiency of algorithms by counting the number of operations and expressing efficiency using growth functions. Different common growth rates like constant, linear, quadratic, and exponential are introduced. Examples are provided to demonstrate how to determine the growth rate of different algorithms, including recursive algorithms, by deriving their time complexity functions. The key aspects covered are estimating algorithm runtime, comparing growth rates of algorithms, and using Big O notation to classify algorithms by their asymptotic behavior.

Algorithms Lecture 4: Sorting Algorithms I

The document discusses three sorting algorithms: bubble sort, selection sort, and insertion sort. Bubble sort works by repeatedly swapping adjacent elements that are in the wrong order. Selection sort finds the minimum element and swaps it into the sorted portion of the array. Insertion sort inserts elements into the sorted portion of the array, swapping as needed to put the element in the correct position. Both selection sort and insertion sort have a time complexity of O(n^2) in the worst case.

Regular expressions in Python

Regular expressions are a powerful tool for searching, matching, and parsing text patterns. They allow complex text patterns to be matched with a standardized syntax. All modern programming languages include regular expression libraries. Regular expressions can be used to search strings, replace parts of strings, split strings, and find all occurrences of a pattern in a string. They are useful for tasks like validating formats, parsing text, and finding/replacing text. This document provides examples of common regular expression patterns and methods for using regular expressions in Python.

Digital Logic circuit

This document provides an overview of digital logic circuits and sequential circuits. It discusses various logic gates like OR, AND, NOT, NAND, NOR and XOR gates. It explains their truth tables and symbols. It also covers Boolean algebra, map simplification using K-maps, combinational circuits like multiplexers, demultiplexers, encoders and decoders. Finally, it describes different types of flip-flops like SR, D, JK and T flip-flops which are used to build sequential circuits that have memory and can store past states.

Pointers in c++

Pointer is a variable that stores the memory address of another variable. It allows dynamic memory allocation and access of memory locations. There are three ways to pass arguments to functions in C++ - pass by value, pass by reference, and pass by pointer. Pass by value copies the value, pass by reference copies the address, and pass by pointer passes the address of the argument. Pointers can also point to arrays or strings to access elements. Arrays of pointers can store multiple strings. References are alternative names for existing variables and any changes made using the reference affect the original variable. Functions can return pointers or references.

Nand and nor as a universal gates

Nand and nor as a universal gates

Data Structure and Algorithms Arrays

Data Structure and Algorithms Arrays

Computer organization and architecture lab manual

Computer organization and architecture lab manual

Chapter 17 Tuples

Chapter 17 Tuples

Topological Sort

Topological Sort

Exception handling in python

Exception handling in python

Java programming lab manual

Java programming lab manual

Type conversion

Type conversion

Data Structure Project File

Data Structure Project File

Iterarators and generators in python

Iterarators and generators in python

Graph in data structure

Graph in data structure

Dictionaries in Python

Dictionaries in Python

Fibonacci search

Fibonacci search

digital logic design number system

digital logic design number system

Chapter 5 boolean algebra

Chapter 5 boolean algebra

Algorithm analysis

Algorithm analysis

Algorithms Lecture 4: Sorting Algorithms I

Algorithms Lecture 4: Sorting Algorithms I

Regular expressions in Python

Regular expressions in Python

Digital Logic circuit

Digital Logic circuit

Pointers in c++

Pointers in c++

Subnetting

The document provides examples of subnetting IP address ranges to meet specific requirements for number of subnets and hosts. It demonstrates converting host bits in an IP address to network bits to create subnets, and calculating the resulting number of subnets, hosts per subnet, and subnet ranges. Custom subnet masks are provided based on the number of bits converted from host to network.

Chapter 3. fundamentals of wan and ip routing

The document discusses fundamentals of wide area networks (WANs) and IP routing. It covers common WAN link technologies like Ethernet and leased lines. It also explains key networking protocols including TCP/IP, IPv4 and IPv6 addressing, IP routing, subnet masking, and the classes of IP addresses. Additional topics covered are Ethernet and leased line WANs, how routers use WAN links, and Layer 3 protocols like DNS, ARP, and ping.

Student IP Addressing Tutorial.ppt

This document provides an overview of IP addressing and subnetting. It begins with an introduction to binary to decimal conversion and how binary weighting is used to represent numeric values. It then discusses IP addressing fundamentals including address classes, private addresses, and how subnet masks are used to partition addresses into network and host portions. The document explains how subnetting allows large networks to be divided into smaller sub-networks through the use of custom subnet masks. Key concepts covered include default subnet masks, finding the network address through binary AND operations, and limitations of classful addressing that subnetting addresses.

Hurdle Race Game

The document describes a hardware implemented hurdle race game project. It includes:
- Block and work division diagrams showing the main components and division of labor.
- Problem statements addressed, such as generating random numbers for obstacles, player movement control, collision detection, lives/score tracking, and reset functionality.
- Solutions provided, including use of counters, shift registers, decoders, and other logic gates to implement the random number generation, player control, collision detection, lives/score functions, and reset.
- Detailed logic diagrams and descriptions of the circuits designed to solve each problem statement.

Student sub network book

This document provides information about IP addressing and subnetting. It includes definitions of IP address classes, private address space, and default subnet masks. It also covers binary to decimal and decimal to binary conversions, identifying address classes, network and host portions of addresses, and network addressing using subnet masks. The workbook aims to help readers learn key concepts of IP addressing and subnetting.

Student subnetworkbook

Here are the default subnet masks for the given IP addresses:
177.100.18.4 - 255.255.0.0
119.18.45.0 - 255.255.255.0
191.249.0.0 - 255.255.255.0

Ccent notes part 3

This document provides information about IP addressing and subnetting including:
- Details on classful IP addressing including valid address ranges and network/host bit breakdowns for Class A, B, and C networks.
- Explanations of private IP address spaces, IPv6 addressing, and comparisons between IPv4 and IPv6.
- Examples and processes for converting between dotted decimal and prefix notation for subnet masks, analyzing network, subnet, and host bits, and calculating numbers of subnets and hosts.
- Tables with binary representations and number of 1s/0s for the 9 possible decimal values in an IPv4 subnet mask.

Subnetting

Subnetting

Chapter 3. fundamentals of wan and ip routing

Chapter 3. fundamentals of wan and ip routing

Student IP Addressing Tutorial.ppt

Student IP Addressing Tutorial.ppt

Hurdle Race Game

Hurdle Race Game

Student sub network book

Student sub network book

Student subnetworkbook

Student subnetworkbook

Ccent notes part 3

Ccent notes part 3

Generative AI leverages algorithms to create various forms of content

What is Generative AI?

Virtualization: A Key to Efficient Cloud Computing

The document discusses various types of virtualization used in cloud computing. It describes virtualization as a technique that allows sharing of physical resources among multiple customers. There are two main types of hypervisors - Type 1 hypervisors run directly on hardware while Type 2 hypervisors run on a host operating system. The document also summarizes different types of virtualization including hardware, software, memory, storage, network, and desktop virtualization. Benefits of virtualization include improved efficiency, outsourcing of hardware costs, testing software in isolated environments, and emulating machines beyond physical availability.

Automating the Cloud: A Deep Dive into Virtual Machine Provisioning

Virtual machine provisioning allows users to quickly provision new virtual machines through a self-service interface in minutes, rather than the days it previously took to provision physical servers. Virtual machine migration also allows live migration of virtual machines between physical hosts in milliseconds for maintenance or upgrades. Standards like OVF and OCCI help ensure interoperability and portability of virtual machines across platforms. The virtual machine lifecycle includes provisioning, serving requests, and deprovisioning resources when the service is ended.

Harnessing the Power of Google Cloud Platform: Strategies and Applications

The document discusses Google Cloud Platform (GCP), a suite of cloud computing services provided by Google. It provides infrastructure as a service (IaaS), platform as a service (PaaS), and software as a service (SaaS). GCP allows users to access computing power, storage, databases, and other applications through remote servers on the internet. It offers advantages like scalability, security, redundancy, and cost-effectiveness compared to traditional data centers. Example applications of GCP include enabling collaborative document editing in real-time.

Scheduling in Cloud Computing

Scheduling refers to allocating computing resources like processor time and memory to processes. In cloud computing, scheduling maps jobs to virtual machines. There are two levels of scheduling - at the host level to distribute VMs, and at the VM level to distribute tasks. Common scheduling algorithms include first-come first-served (FCFS), shortest job first (SJF), round robin, and max-min. FCFS prioritizes older jobs but has high wait times. SJF prioritizes shorter jobs but can starve longer ones. Max-min prioritizes longer jobs to optimize resource use. The choice depends on goals like throughput, latency, and fairness.

Cloud-Case study

This document provides a template for submitting case studies to a case study compendium on cloud computing solutions. The template requests information on the customer organization, industry, location, the cloud solution provider, area of application of the cloud solution, challenges addressed, objectives, timeline of implementation, solution approach, challenges during implementation, benefits to the customer, innovation enabled, partnerships involved, and a customer testimonial. It requests details on the cloud solution type (IaaS, PaaS, or SaaS), quantitative and qualitative benefits realized by the customer, and how the solution helped boost innovation. Contact details of the submitter are also requested. The focus is on how cloud platforms and solutions enabled customer enterprises to innovate and

RAID

RAID (Redundant Array of Independent Disks) uses multiple hard disks or solid-state drives to protect data by storing it across the drives in a way that if one drive fails, the data can still be accessed from the other drives. There are different RAID levels that provide varying levels of data protection and performance. A RAID controller manages the drives in an array, presenting them as a single logical drive and improving performance and reliability. Common RAID levels include RAID 0 for performance without redundancy, RAID 1 for disk mirroring, and RAID 5 for striping with parity data distributed across drives. [/SUMMARY]

Load balancing in cloud computing.pptx

Cloud load balancing distributes workloads and network traffic across computing resources in a cloud environment to improve performance and availability. It routes incoming traffic to multiple servers or other resources while balancing the load. Load balancing in the cloud is typically software-based and offers benefits like scalability, reliability, reduced costs, and flexibility compared to traditional hardware-based load balancing. Common cloud providers like AWS, Google Cloud, and Microsoft Azure offer multiple load balancing options that vary based on needs and network layers.

Cluster Computing

A computer cluster is a set of computers that work together so that they can be viewed as a single system.

ITU-T requirement for cloud and cloud deployment model

List and explain the functional requirements for networking as per the ITU-T technical report. List and explain cloud deployment models and list relative strengths and weaknesses of the deployment models with neat diagram.

Leetcode Problem Solution

The document discusses three problems: (1) finding the cheapest flight route between two cities with at most k stops using DFS and pruning; (2) merging k sorted linked lists into one sorted list using a priority queue; (3) using a sequence of acceleration (A) and reversing (R) instructions to reach a target position in the shortest number of steps for a car that can move to negative positions.

Trie Data Structure

Trie Data Structure
LINK: https://leetcode.com/tag/trie/
Easy:
1. Longest Word in Dictionary
Medium:
1. Count Substrings That Differ by One Character
2. Replace Words
3. Top K Frequent Words
4. Maximum XOR of Two Numbers in an Array
5. Map Sum Pairs
Hard:
1. Concatenated Words
2. Word Search II

Reviewing basic concepts of relational database

The document discusses the basics of relational databases. It defines what a database is, the advantages it provides over file-based data storage, and some disadvantages. It also covers relational database concepts like tables, records, fields, keys, and normalization. The document explains how to design a relational database by determining the purpose and entities, modeling relationships with E-R diagrams, and following steps to normalize the data.

Reviewing SQL Concepts

https://youtu.be/0l83FZfrerg
What is SQL?
What Can SQL do?
SQL Syntax
Semicolon after SQL Statements?

Advanced database protocols

https://youtu.be/yP14a2Qzx8c
DATABASE PROTOCOLS OVERVIEW
Oracle Two-Tier
Two-Tier and Three-Tier Computing Models

Measures of query cost

The document discusses measures of query cost in database management systems. It explains that query cost can be measured by factors like the number of disk accesses, size of the table, and time taken by the CPU. It further breaks down disk access time into components like seek time, rotational latency, and sequential vs. random I/O. The document then provides an example formula to calculate estimated query cost based on these components.

Involvement of WSN in Smart Cities

This document discusses how wireless sensor networks (WSNs) can be used in smart city applications. It first defines WSNs as self-configured, infrastructure-less networks that use sensors to monitor conditions like temperature, sound, and pollution. It then discusses how WSNs can influence lifestyle by enabling applications in areas like healthcare, transportation, the environment and more. Finally, it discusses how WSNs are a primary strength for smart cities by allowing remote and cost-effective monitoring of infrastructure and resources across applications like smart water, smart grid, and smart transportation.

Data Structure and its Fundamentals

The document provides an overview and syllabus for a course on fundamentals of data structures. It covers topics such as linear and non-linear data structures including arrays, stacks, queues, linked lists, trees and graphs. It describes various data types in C like integers, floating-point numbers, characters and enumerated types. It also discusses operations on different data structures and analyzing algorithm complexity.

WORKING WITH FILE AND PIPELINE PARAMETER BINDING

EXPORTING USER INFORMATION TO A FILE
SEND OUTPUT CONSISTING OF PIPELINE DATA
PREDICTING PIPELINE BEHAVIOR

Basic commands for powershell : Configuring Windows PowerShell and working wi...

This document provides an overview of common PowerShell commands for automating tasks and managing configurations in Windows. It discusses commands for configuring the PowerShell console and ISE application, finding available commands, getting help, and viewing services, events, and processes. The document also covers using the history, setting execution policies, filtering output, and managing aliases, modules, drives and sessions. Specific commands demonstrated include Get-Command, Get-Help, Get-Service, Get-EventLog, Get-Process, Clear-History, Set-ExecutionPolicy, Select-Object, and more.

Generative AI leverages algorithms to create various forms of content

Generative AI leverages algorithms to create various forms of content

Virtualization: A Key to Efficient Cloud Computing

Virtualization: A Key to Efficient Cloud Computing

Automating the Cloud: A Deep Dive into Virtual Machine Provisioning

Automating the Cloud: A Deep Dive into Virtual Machine Provisioning

Harnessing the Power of Google Cloud Platform: Strategies and Applications

Harnessing the Power of Google Cloud Platform: Strategies and Applications

Scheduling in Cloud Computing

Scheduling in Cloud Computing

Cloud-Case study

Cloud-Case study

RAID

RAID

Load balancing in cloud computing.pptx

Load balancing in cloud computing.pptx

Cluster Computing

Cluster Computing

ITU-T requirement for cloud and cloud deployment model

ITU-T requirement for cloud and cloud deployment model

Leetcode Problem Solution

Leetcode Problem Solution

Trie Data Structure

Trie Data Structure

Reviewing basic concepts of relational database

Reviewing basic concepts of relational database

Reviewing SQL Concepts

Reviewing SQL Concepts

Advanced database protocols

Advanced database protocols

Measures of query cost

Measures of query cost

Involvement of WSN in Smart Cities

Involvement of WSN in Smart Cities

Data Structure and its Fundamentals

Data Structure and its Fundamentals

WORKING WITH FILE AND PIPELINE PARAMETER BINDING

WORKING WITH FILE AND PIPELINE PARAMETER BINDING

Basic commands for powershell : Configuring Windows PowerShell and working wi...

Basic commands for powershell : Configuring Windows PowerShell and working wi...

Presentation on Food Delivery Systems

This presentation is about Food Delivery Systems and how they are developed using the Software Development Life Cycle (SDLC) and other methods. It explains the steps involved in creating a food delivery app, from planning and designing to testing and launching. The slide also covers different tools and technologies used to make these systems work efficiently.

SENTIMENT ANALYSIS ON PPT AND Project template_.pptx

It is used for sentiment analysis project

Blood finder application project report (1).pdf

Blood Finder is an emergency time app where a user can search for the blood banks as
well as the registered blood donors around Mumbai. This application also provide an
opportunity for the user of this application to become a registered donor for this user have
to enroll for the donor request from the application itself. If the admin wish to make user
a registered donor, with some of the formalities with the organization it can be done.
Specialization of this application is that the user will not have to register on sign-in for
searching the blood banks and blood donors it can be just done by installing the
application to the mobile.
The purpose of making this application is to save the user’s time for searching blood of
needed blood group during the time of the emergency.
This is an android application developed in Java and XML with the connectivity of
SQLite database. This application will provide most of basic functionality required for an
emergency time application. All the details of Blood banks and Blood donors are stored
in the database i.e. SQLite.
This application allowed the user to get all the information regarding blood banks and
blood donors such as Name, Number, Address, Blood Group, rather than searching it on
the different websites and wasting the precious time. This application is effective and
user friendly.

AI in customer support Use cases solutions development and implementation.pdf

AI in customer support will integrate with emerging technologies such as augmented reality (AR) and virtual reality (VR) to enhance service delivery. AR-enabled smart glasses or VR environments will provide immersive support experiences, allowing customers to visualize solutions, receive step-by-step guidance, and interact with virtual support agents in real-time. These technologies will bridge the gap between physical and digital experiences, offering innovative ways to resolve issues, demonstrate products, and deliver personalized training and support.
https://www.leewayhertz.com/ai-in-customer-support/#How-does-AI-work-in-customer-support

Levelised Cost of Hydrogen (LCOH) Calculator Manual

The aim of this manual is to explain the
methodology behind the Levelized Cost of
Hydrogen (LCOH) calculator. Moreover, this
manual also demonstrates how the calculator
can be used for estimating the expenses associated with hydrogen production in Europe
using low-temperature electrolysis considering different sources of electricity

Introduction to Computer Networks & OSI MODEL.ppt

Introduction to Computer Networks

Applications of artificial Intelligence in Mechanical Engineering.pdf

Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.

FULL STACK PROGRAMMING - Both Front End and Back End

This ppt gives details about Full Stack Programming and its basics.

AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...

AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...Paris Salesforce Developer Group

Build the Next Generation of Apps with the Einstein 1 Platform.
Rejoignez Philippe Ozil pour une session de workshops qui vous guidera à travers les détails de la plateforme Einstein 1, l'importance des données pour la création d'applications d'intelligence artificielle et les différents outils et technologies que Salesforce propose pour vous apporter tous les bénéfices de l'IA.AN INTRODUCTION OF AI & SEARCHING TECHIQUES

Useful for engineering students

An Introduction to the Compiler Designss

compiler material

Call Girls Chennai +91-8824825030 Vip Call Girls Chennai

Call Girls Chennai +91-8824825030 Vip Call Girls Chennai

A high-Speed Communication System is based on the Design of a Bi-NoC Router, ...

The Network on Chip (NoC) has emerged as an effective
solution for intercommunication infrastructure within System on
Chip (SoC) designs, overcoming the limitations of traditional
methods that face significant bottlenecks. However, the complexity
of NoC design presents numerous challenges related to
performance metrics such as scalability, latency, power
consumption, and signal integrity. This project addresses the
issues within the router's memory unit and proposes an enhanced
memory structure. To achieve efficient data transfer, FIFO buffers
are implemented in distributed RAM and virtual channels for
FPGA-based NoC. The project introduces advanced FIFO-based
memory units within the NoC router, assessing their performance
in a Bi-directional NoC (Bi-NoC) configuration. The primary
objective is to reduce the router's workload while enhancing the
FIFO internal structure. To further improve data transfer speed,
a Bi-NoC with a self-configurable intercommunication channel is
suggested. Simulation and synthesis results demonstrate
guaranteed throughput, predictable latency, and equitable
network access, showing significant improvement over previous
designs

Determination of Equivalent Circuit parameters and performance characteristic...

Includes the testing of induction motor to draw the circle diagram of induction motor with step wise procedure and calculation for the same. Also explains the working and application of Induction generator

Beckhoff Programmable Logic Control Overview Presentation

This presentation is to describe the overview of PLC Beckhoff for beginners

Tools & Techniques for Commissioning and Maintaining PV Systems W-Animations ...

Join us for this solutions-based webinar on the tools and techniques for commissioning and maintaining PV Systems. In this session, we'll review the process of building and maintaining a solar array, starting with installation and commissioning, then reviewing operations and maintenance of the system. This course will review insulation resistance testing, I-V curve testing, earth-bond continuity, ground resistance testing, performance tests, visual inspections, ground and arc fault testing procedures, and power quality analysis.
Fluke Solar Application Specialist Will White is presenting on this engaging topic:
Will has worked in the renewable energy industry since 2005, first as an installer for a small east coast solar integrator before adding sales, design, and project management to his skillset. In 2022, Will joined Fluke as a solar application specialist, where he supports their renewable energy testing equipment like IV-curve tracers, electrical meters, and thermal imaging cameras. Experienced in wind power, solar thermal, energy storage, and all scales of PV, Will has primarily focused on residential and small commercial systems. He is passionate about implementing high-quality, code-compliant installation techniques.

SCALING OF MOS CIRCUITS m .pptx

this ppt explains about scaling parameters of the mosfet it is basically vlsi subject

Call For Paper -3rd International Conference on Artificial Intelligence Advan...

* Registration is currently open *
Call for Research Papers!!!
Free – Extended Paper will be published as free of cost.
3rd International Conference on Artificial Intelligence Advances (AIAD 2024)
July 13 ~ 14, 2024, Virtual Conference
Webpage URL: https://aiad2024.org/index
Submission Deadline: June 22, 2024
Submission System URL:
https://aiad2024.org/submission/index.php
Contact Us:
Here's where you can reach us : aiad@aiad2024.org (or) aiadconference@yahoo.com
WikiCFP URL: http://wikicfp.com/cfp/servlet/event.showcfp?eventid=180509©ownerid=171656
#artificialintelligence #softcomputing #machinelearning #technology #datascience #python #deeplearning #tech #robotics #innovation #bigdata #coding #iot #computerscience #data #dataanalytics #engineering #robot #datascientist #software #automation #analytics #ml #pythonprogramming #programmer #digitaltransformation #developer #promptengineering #generativeai #genai #chatgpt #artificial #intelligence #datamining #networkscommunications #robotics #callforsubmission #submissionsopen #deadline #opencall #virtual #conference

Presentation on Food Delivery Systems

Presentation on Food Delivery Systems

1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf

1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf

SENTIMENT ANALYSIS ON PPT AND Project template_.pptx

SENTIMENT ANALYSIS ON PPT AND Project template_.pptx

UNIT 4 LINEAR INTEGRATED CIRCUITS-DIGITAL ICS

UNIT 4 LINEAR INTEGRATED CIRCUITS-DIGITAL ICS

Blood finder application project report (1).pdf

Blood finder application project report (1).pdf

AI in customer support Use cases solutions development and implementation.pdf

AI in customer support Use cases solutions development and implementation.pdf

Levelised Cost of Hydrogen (LCOH) Calculator Manual

Levelised Cost of Hydrogen (LCOH) Calculator Manual

Introduction to Computer Networks & OSI MODEL.ppt

Introduction to Computer Networks & OSI MODEL.ppt

Applications of artificial Intelligence in Mechanical Engineering.pdf

Applications of artificial Intelligence in Mechanical Engineering.pdf

FULL STACK PROGRAMMING - Both Front End and Back End

FULL STACK PROGRAMMING - Both Front End and Back End

AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...

AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...

AN INTRODUCTION OF AI & SEARCHING TECHIQUES

AN INTRODUCTION OF AI & SEARCHING TECHIQUES

An Introduction to the Compiler Designss

An Introduction to the Compiler Designss

Call Girls Chennai +91-8824825030 Vip Call Girls Chennai

Call Girls Chennai +91-8824825030 Vip Call Girls Chennai

A high-Speed Communication System is based on the Design of a Bi-NoC Router, ...

A high-Speed Communication System is based on the Design of a Bi-NoC Router, ...

Determination of Equivalent Circuit parameters and performance characteristic...

Determination of Equivalent Circuit parameters and performance characteristic...

Beckhoff Programmable Logic Control Overview Presentation

Beckhoff Programmable Logic Control Overview Presentation

Tools & Techniques for Commissioning and Maintaining PV Systems W-Animations ...

Tools & Techniques for Commissioning and Maintaining PV Systems W-Animations ...

SCALING OF MOS CIRCUITS m .pptx

SCALING OF MOS CIRCUITS m .pptx

Call For Paper -3rd International Conference on Artificial Intelligence Advan...

Call For Paper -3rd International Conference on Artificial Intelligence Advan...

- 1. Medium: Maximum Level sum of a Binary Tree Jump Game III Minesweeper Binary Tree Level Order Traversal Number of operations to make network connected Open the lock Hard: Sliding Puzzle Trapping Rain Water II 22-02-2021 Hitesh Mohapatra 1 Leetcode
- 10. 22-02-2021 Hitesh Mohapatra 10
- 11. 22-02-2021 Hitesh Mohapatra 11
- 12. 22-02-2021 Hitesh Mohapatra 12
- 13. 22-02-2021 Hitesh Mohapatra 13
- 14. 1319. Number of Operations to Make Network Connected • There are n computers numbered from 0 to n-1 connected by Ethernet cables connections forming a network where connections[i] = [a, b] represents a connection between computers a and b. Any computer can reach any other computer directly or indirectly through the network. • Given an initial computer network connections. You can extract certain cables between two directly connected computers, and place them between any pair of disconnected computers to make them directly connected. Return the minimum number of times you need to do this in order to make all the computers connected. If it's not possible, return -1. 22-02-2021 Hitesh Mohapatra 14
- 15. 22-02-2021 Hitesh Mohapatra 15
- 16. 22-02-2021 Hitesh Mohapatra 16
- 17. 22-02-2021 Hitesh Mohapatra 17
- 18. Algorithm • Make Adjacency List • Find number of components by using DFS • Find number of redundant edges – When(Redundant edges >= component -1) – Then (Edges required = (C-1) Negative Case • Edge < number of nodes -1 • Redundant edges < component-1 22-02-2021 Hitesh Mohapatra 18
- 19. 752. Open the Lock • You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely and wrap around: for example we can turn '9' to be '0', or '0' to be '9'. Each move consists of turning one wheel one slot. • The lock initially starts at '0000', a string representing the state of the 4 wheels. • You are given a list of deadends dead ends, meaning if the lock displays any of these codes, the wheels of the lock will stop turning and you will be unable to open it. • Given a target representing the value of the wheels that will unlock the lock, return the minimum total number of turns required to open the lock, or -1 if it is impossible. 22-02-2021 Hitesh Mohapatra 19
- 20. 22-02-2021 Hitesh Mohapatra 20
- 21. Target 0202 0000 ------------------------ Initial State 0100 ------------------------1 0200 ------------------------2 0201 0210 ------------------------3 0211 ------------------------4 0212 ------------------------5 0202------------------------ 6 Target deadends = ["0201","0101","0102","1212","2002"] 22-02-2021 Hitesh Mohapatra 21
- 22. 22-02-2021 Hitesh Mohapatra 22
- 23. Algorithm • Initiate the with 0000 • Find out potential neighbors • Check neighbor with deadends • Take the turn where turn != deadends • Count the number of turn to meet the target. Negative Side • If initial state is == deadend ; return -1 • If all the possible moves are falls under deadends ; return -1 22-02-2021 Hitesh Mohapatra 23
- 24. 773. Sliding Puzzle • On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0. • A move consists of choosing 0 and a 4- directionally adjacent number and swapping it. • The state of the board is solved if and only if the board is [[1,2,3],[4,5,0]]. • Given a puzzle board, return the least number of moves required so that the state of the board is solved. If it is impossible for the state of the board to be solved, return -1. 22-02-2021 Hitesh Mohapatra 24
- 25. 22-02-2021 Hitesh Mohapatra 25
- 26. 22-02-2021 Hitesh Mohapatra 26