i
Mayerfeld
Consulting
Filter interviews by
I appeared for an interview in Sep 2024, where I was asked the following questions.
Subnetting divides a larger network into smaller, manageable sub-networks for efficient IP address management.
Subnetting uses a subnet mask to determine the network and host portions of an IP address.
For example, in a Class C network with IP 192.168.1.0/24, the /24 indicates 24 bits for the network and 8 bits for hosts.
Subnetting allows for better utilization of IP addresses by creating smaller networks, reducing broad...
Top trending discussions
I appeared for an interview in Jan 2021.
Merge sort and Quick sort are sorting algorithms while Fibonacci is a sequence of numbers.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half and then merges them.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot.
Fibonacci is a sequence of numbers where each number is the sum of the two precedin...
I applied via LinkedIn and was interviewed in Nov 2020. There was 1 interview round.
OOP is a programming paradigm based on objects, encapsulating data and behavior for modular and reusable code.
Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).
Inheritance: Mechanism to create a new class using properties and methods of an existing class (e.g., a 'Dog' class inheriting from an 'Animal' class).
Polymorphism: Ability to present the same interface for differe...
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Company Website and was interviewed before Nov 2020. There was 1 interview round.
I applied via LinkedIn and was interviewed in May 2021. There was 1 interview round.
I applied via Referral and was interviewed before Jun 2021. There were 2 interview rounds.
Coding test
I applied via Company Website and was interviewed in Dec 2020. There was 1 interview round.
Time complexity measures the amount of time an algorithm takes to complete based on input size.
Time complexity is expressed using Big O notation (e.g., O(n), O(log n)).
O(1) indicates constant time, e.g., accessing an array element.
O(n) indicates linear time, e.g., iterating through an array.
O(n^2) indicates quadratic time, e.g., nested loops through an array.
O(log n) indicates logarithmic time, e.g., binary search in a...
based on 1 interview experience
Difficulty level
Duration