↳

URG, RST, PSH, CWR, SYN, FIN, ACK, ECN

↳

In block codes, information bits are followed by parity bits. In convolution codes, information bits are spread along the sequence. Block codes are memoryless whereas Convolution codes have memory. Convolution codes use small codewords in comparison to block codes, both achieving the same quality. Less

↳

Think it through, out loud. Walk through your options- don't just pick one. DS3, metro-E, SONET, etc. Less

↳

As long as possible

↳

For ever

↳

Nope. no sign at all. In another company interview, met another guy who attended interview at aryaka networks on the 3rd june. He told me same answer :D. you better search for another job, i did like that and got selected to another company, don't just wait for that. If you want confirm, u can ask HR through linkedin (if you remember HR name). or paste your mail id il send the HR linkedin link. Less

↳

did they told you that hr will contact you after 4 rounds or something else , i got interviewed too and they told me that , i need to know ,it will be really helpful for me if you could tell me what they said. thanks Less

↳

rawalpindi

↳

rawalpindi

↳

1. You receive a vector/ array and 2 numbers, eg 2 and 5. Between those 2 positions in the vector (2 and 5) you have to reverse the order of the elements. Code #include #include #include using vec = std::vector; using itr = std::vector::iterator; int main(){ vec v = {1,2,9,8,4,5,23,5,252,445,677,5}; //Find position of 2 itr it1 = std::find(v.begin(), v.end(), 2); //O(n) //Find position of 5 itr it2 = std::find(v.begin(), v.end(), 5); //O(n) std::reverse(it1+1, it2); //O(n) for (auto i:v) std::cout< Less

↳

2. Count words and output top n Complexity n: number of words Space map=O(n), priority_queue = O(k). Since we only create queue of size=k, output vector = O(k) Time Creation of map=O(n), Creation of priority Queue=O(n), Creation of output vector=O(k) Code #include #include #include #include using VS = std::vector; using mypair = std::pair; class Solution { public: VS topKFrequent(VS& vsWords, int k) { VS vsOut; std::priority_queue pq; std::unordered_map um; // for(const auto i : vsWords) //1 um[i]++; //um[key]=value; //um[i] = um[i]+1 for(const auto i:um){ //2 pq.push(make_pair(-i.second,i.first)); if (pq.size() > k) pq.pop(); } while(not pq.empty()){ //3 vsOut.push_back(pq.top().second); pq.pop(); } for(int i = 0; i < vsOut.size()/2; i++) //4 std::swap(vsOut[i], vsOut[vsOut.size()-i - 1]); return vsOut; } }; Less

↳

Hello, Can anyone tell me the best link to study troubleshooting scenarios from?

↳

#sh vlan brief

↳

STP operates at the Data Link layer of the OSI model which prevents traffic loops. STP chooses only one root switch/bridge, out of which all data paths span out logically getting the data to the target the quickest and detect and correct link failures when a switch/bridge fails...STP stands for Spanning Tree Protocol. The root is chosen based on its BID( Bridge ID) which is the combination of a 2 byte priority field and the bridge/switch MAC address....Since all switch/bridges on the network start out with the same priority, the one with the lowest MAC address becomes the root bridge. Less

↳

STP is basically used for loop prevention and to prodive redundancy. Devices participating in STP perform a root bridge election process. Device having the lowest priority will be choosen as the root bridge. If every device participating in STP have the same priority value, device with the lowest mac-address becomes the root bridge. The root bridge will be responsible to make th overall traffic flow decision on the LAN. Non-root bridges use a lowest cost path to reach the root bridge. This cost is dependent on the interface speed. Topological changes downstream from the root bridge is communicated to the root bridge. Less