Your Tech querries at Technical world

 All built-in functions https://docs.python.org/3/library/functions.html#eval a // b = The integer part of the integer division of a by b a ** b = Elevates a to the power of b. For non integer values of b, this becomes a root (i.e. a**(1/2) is the square root of a) Character Meaning 'r' open for reading (default) 'w' open for writing, truncating the file first 'x' open for exclusive creation, failing if the file already exists 'a' open for writing, appending to the end of file if it exists 'b' binary mode 't' text mode (default) '+' open for updating (reading and writing) The default mode is  'r'  (open for reading text, a synonym of  'rt' ). Modes  'w+'  and  'w+b'  open and truncate the file. Modes  'r+'  and  'r+b'  open the file with no truncation.

 Last day interview preparation strategy 💯 - For Tech interviews only for SDE-1 role or intern: ✨ I have listed down some main topics to have a look for the last day before interview for SDE role, though its for those who are freshers going for FTE role or internship interview 👇. 1️⃣ Main topics of DSA - Graphs(DFS,BFS mainly), Trees 🌴, DP(1D,2-D mainly). 2️⃣ OOPS - singleton pattern and it's usage, virtual function concept ,inheritance(diamond problem). 3️⃣ DBMS - Normalisation concepts, indexing, transactions, concurrency control concepts,SQL queries revision 4️⃣ OS - file management, process scheduling algos, memory management, synchronisation concepts involving locks(most important 🤞)and semaphores. 5️⃣ CN - network topology concepts, VPN concepts , IP concepts, OSI Model(important). This strategy does not give guarantee for 100% but it's better to study only few important topics on last few days before interview schedule, I found these topics asked majorly by companies...

  Instead of learning solutions to LeetCode questions, understand patterns!! If the input array is sorted -binary search -two pointers If asked for all permutations/subsets then -Backtracking If given a tree/Graph then -DFS -BFS If given a linked list then -two pointers If recursion is banned -stack If must solve in-place then -swap corresponding values -store one or more different values in the same pointer If asked for maximum/minimum -subarray/subset/options then -dynamic programming If asked for top/least K items then -Heap If asked for common strings then -map -trie else -map/set for O(1) time & O(n) space -sort input for O(nlogn) time and O(1) SPACE

Instead of learning solutions to LeetCode questions, understand patterns!! If the input array is sorted -binary search -two pointers If asked for all permutations/subsets then -Backtracking If given a tree/Graph then -DFS -BFS If given a linked list then -two pointers If recursion is banned -stack If must solve in-place then -swap corresponding values -store one or more different values in the same pointer If asked for maximum/minimum -subarray/subset/options then -dynamic programming If asked for top/least K items then -Heap If asked for common strings then -map -trie else -map/set for O(1) time & O(n) space -sort input for O(nlogn) time and O(1) SPACE

 I'm glad to share that I have been selected in 6 companies. I want to share my interview experience, It would be helpful for my juniors, if its needs any modifications so please leave a comment on it, and I'll try to update it. Persistent System :  click here for Interview questions Accolite Digital : click here for interview questions Deloitte :  click here of Deloitte interview questions Wipro :   click here for interview questions Intellect Design :  click here for interview questions Statusneo :   click here for interview questions

  Statusneo Interview Experience:  1. Technical Interview :      duration: 35 minutes Introduce yourself Some questions from my introduction such as which type of blogs do you write and why? Show me your blogging website, and basic questions about it. Your work experience in persistent? What's your preferred programming language and why? Rate yourself in C++. What is recursion? explain it with an example. Which built-in function do we use to find the type of an element(data type) in c++? write code to convert multidimensional array to one dimension, firstly I gave a brute force approach then optimized it using recursion.  Write code to check given string of parathesis is valid or not? I implemented it using stack and without stack, then he was satisfied. In which technology do you want to work in the future? Logical question: You have 8 balls, among them 7 balls having the same weight and one ball having a lower weight than the others, How would you identi...

Here I'm sharing my interview experience at Deloitte. I got this opportunity through  NLA: National level assessment, which was off-campus hiring. Round 1 (Online Assessment): The difficulty level of the Online test was Moderate Duration: 2 hours  Logical Reasoning questions Quantitative aptitude MS PowerPoint, word, excel related MCQs Testing and cloud computing-related MCQs were also there. 2 coding questions (one question was of easy level and another was of moderate level) The level of questions was moderate. Just brush up on your basics to prepare for it. Attempt maximum questions to qualify for the next round because there is a sectional cut-off also in this exam. They keep their cutoff very high so try to attempt all the questions. There is no negative marking. Those who were qualified were shortlisted for the next round. Round 2 (Technical + HR): Duration: 40 Min Tell me something about yourself? What is blogging? where and which type of blogs do you write? He asked t...

 &:  if a&1 then last digit of a will always same as in  previous a. a^1= compliment (a),  a^0=a, (diff bit =a) a^a=0, (same bit =0) coversion : Decimal --> n base = keep divide by base  exp : (17)D = ()2 =  ....... n base --> decimal = multiply each digit with the power of base and add them.   exp: 1* 2^3 + 0*2^2 + 0 * 2*1+ 1*2^0=.. Left shift : a<<b = a* (2^b) Right shift :  a>>b = a/(2^b) unique no. in duplicate array : xor all elements find ith bit of a no. n = n & (1<<n-1) set ith bit  = n | (1<<n-1) reset ith bit= !(1<<n-1) Find position of rightmost set bit negative no. in binary= 1st bit (MSB) = if 0 (+ve), id 1(-ve) neg no. by 2's compliment : find compliment of no. ..then add +1 1 byte range = -128 to 127 (total 256 no. can be stored..2^7) because we ignore 1st bit formula of range = -2^(n-1) to 2^(n-1) -1 find uniq no. in odd repeating no. array find nth magic no. find no. of digit in...

 Time complexity is not the time taken by a computer. It is a function that gives a relationship about time will (grows) increase as increase the input. Notation: Big o notation : f(x) < = g(x) little big o nation : f(x) < g(x)  [strictly] big omega notation : f(x) >= g(x) little big omega notation: f(x) > g(x) [strictly] big theta notation: g(x) < f(x) <g(x)        if f(x) = 3x+2, g(x) = n Space complexity :  actual space(input) + auxiliary space (extra space) SC for recursive function= height of the tree (path) because all the same level functions do not come in that stack at the same time.

            Intellect global Hiring Challenge Hello, this is jaya and in this post, I'm going to share my interview experience of intellect Design.        Basically, Intellect hires through Hackathon event, which was conducted on the D2C platform. There were multiple rounds : Online Quiz:   This round only asked java(Core+advance) fundamentals and some DSA based questions. There were 30 minutes to solve 25 questions. It was an elimination round, candidates who scored 70% and above were moved further to the next round. Demo Hackathon: It wasn't an elimination round, but it's mandatory to attempt, so we will be comfortable with the coding platform. Hackathon:    Basically, it was a coding challenge for one hour where they were given two coding questions based on DSA, during the contest we can write code only in java language, we couldn't switch the programming language. the first question was easy to moderate level, where ...

Lakme :              It is an Indian brand but this word came from France. In France, there was a musical play is based on the Hindu goddess Lakshmi. Ola :       Indian brand,         Spanish word: Hola (hello) Uber :         Ux brand (taxi company)      meaning: supreme (super, best ) Zomato :     It came from the name of tomato (vegetable) Swiggy :   swig - gulp in once Amazon :  one of the biggest rivers in America is named amazon. So the company also would be big all the thing will be available on it. Dabur :              healthcare products, ayurvedic          founder: Dr. Sk Burman: da cter + Bur ma= dabur Starbuck:   It came from a Famous novel "moby-dick"..character: starbuck Vodafone :     full form: voice data phone Reliance :    meaning : Trust Googl...

 Hello, This is Jaya. On this page, I will share my interview experience in Wipro. Basically, there are two rounds in this company:               1. Written-test  2. Business communication round 1. Written-test:  It was first-round there were three sections in this round.  The first section having multiple-choice questions related to apti, reasoning, and verbal. The second section had two coding questions, my first question was related to the Fibonacci series and the second was related to the easy hashmap problem. The third section contains essay writing. They have given an easy topic and I had to write 200 words essay on it. 2. Bussiness communication round :  After qualifying written round this interview happened. it was a combination of HR+ Commincation+technical round . My interview was 15 minutes long. Tell me something about yourself? what is JDK? What tools are present in JDK? What are JRE and JVM? Concept and use of JDK...

 Accolite digital  Interview experience: Hello, This is jaya. I want to share my interview experience of Accolite digital (hiring process) It was a diversity hiring challenge. I got this opportunity through She codes. There were five rounds. Technical written interview (Gaming assessment) Coding round (code analyzer) Technical interview -1 Technical interview-2 H R interview                                           1. Technical written Round :      This round was conducted on the Eduthrill platform. there were 30 MCQ questions, we had to solve them in 30  minutes. All questions were based on DSA, time and space complexity, OS, DBMS, pseudo-code, apti, and COA. Level was easy to moderate. 2. Coding Round:        This round also happened on the Eduthrill platform. We can not switch coding language, it was fixed, they gave us a coding ...

  Unit 1: History of Deep Learning, McCulloch Pitts Neuron, Thresholding Logic, Activation functions, Gradient Descent (GD), Momentum Based GD, Nesterov Accelerated GD, Stochastic GD, AdaGrad, RMSProp, Adam, Eigenvalue Decomposition. Recurrent Neural Networks, Backpropagation through time (BPTT), Vanishing and Exploding Gradients, Truncated BPTT, GRU, LSTMs, Encoder Decoder Models, Attention Mechanism, Attention over images. Deep learning : thinking like human or mimic how human brain                                  learn through neural network,various layers-                           input layer-----hidden layers----output layers History :    1960 -   continuous Back Propagation  1965- models with polynomial  (non linear) 1970-   first AI winter , 2001- three-dimensional,big data 2009-...

  Silicon Valley is known as a Tech hub for plenty of IT companies. Why? and what is it? History of Silicon Valley : Silicon Valley is a place in the southern bey of the USA in California. Before the second world war, this land was used for farming such as fruits and vegetables. But After the war, this land was completely sabotaged and not fit for farming. At that time people also didn't live there. There was a great university named Standford university.  Many legends had completed their study from here and made a unique identity in the world. These legends have really brilliant ideas, so they implemented them during their education and after education in the same place (Silicon Valley).  This land was very cheap and also university provided loans for strat up. So they started their companies. Many of the companies headquarters are established here. Such as Google, Facebook, Cisco, Infosys, Wipro, Palo Alto, Intel, etc. Intel has a huge business of chips (microchips for ...

Microsoft Interview questions   Technical Interview: What is the basic difference between 32-bit and 64-bit operating system? What is deadlock? What are the conditions of deadlock? Can you write a code to show deadlock. What is the Bankers Algorithm? What exactly do you mean by UDP? State three differences between HTML and XML. Explain polymorphism. Given a pile of 9 objects. 2 players take turns to pick 1, 2 or 3 objects. The last one to pick is the looser. What is the winning strategy? What is the winning strategy for 9 coins? Define stored procedure. What are its advantages and disadvantages? What are the differences between interfaces and abstract classes? How do you sort a linked list using the most efficient algorithm? Design a Memory Management System. Differentiate between data set and data reader. Problems to find median of two shorted arrays. Different types of system calls. What are different types of Interrupts? What happens when an interrupt is called? Find if there is...

Persistent system pvt. limited: serviced based IT company incorporated-1990 founder- Anand deshpandey head quaters : Pune CEO: Sandeep Kalra (oct 2020)  Persistent system has been my dream company since I was in second smester. When i was in second semester, A day my teacher gave us a coding questions to solve. That was releted to pointer. I have solved that question in few seconds. My teacher told me that great!! Jaya... If you can solve this question in very less time, so you can easily cracked persistent system. It is really a good MNC to start your carrier. This company focus more on technical skills, that's why it is arduos to crack it. My other classmates took more time solved that question as compare to me. I asked from my teacher....Which one is best TCS or persistent? because that time i was aware about only one tech compant that was TCS and also it was in vogue on my college. Sir told me, persistent is good becaude in this company your profile will be growing continuously...

         1.      Explain layers of OSI        2.   Briefly summarize what you’ve learned in CCNA courses        3.   Functionality of DLL        4.   What is Checksum and how does it work. (explained)        5.   Difference between switch and router        6.   Explain how router sends packets(explained that it does it through routing table)       7.   List a few Routing algorithms(I could remember only one at that time, he gave hints on a few more and asked me how they work )         8.   So you said that switch operates on layer2, so how does it work?         9.   Vlan, Switch vs routers, Process scheduling       10.    Write the pseudo code for Caesar Cipher       11.  What happens wh...