Knowledge in GATE on viden.io

Knowledge in GATE

ONGC interview guidelines

ONGS interview guidelines by SK Mondal

GATE

Mayank Jain

IOCL Interview questions

Excerpts from Interview #1: (NIT Nagpur student having Xth score 91.4%, XIIth score 89.8% and graduation score 79.2%) Personal Interview: Tell me about yourself. Why do you want to join IOCL? Briefly describe the project that you have done in your training period? According to you which is the most important OSI layer? Justify your performance in college Excerpts from Interview #2: (NIT Nagpur student having Xth score 96.8%, XIIth score 93.8% and graduation score 88.32%) Personal Interview: Introduce yourself. Tell me something about data mining? Where is it used? Can you tell its 3applications? Who is your role model and why? Can you name all the physical layers in networking? Excerpts from Interview #3: (CGPA 6.85 in Graduation, 90% in 12th and 84% in 10th.) Personal Interview: Can you explain the difference between LIFO and FIFO? Where these two terms are implemented? Some theory of computation questions. What do you prefer- Hard work or smart work? Are you ready to relocate if required? Excerpts from Interview #4: (NIT Nagpur student having Xth score 92.2%, XIIth score 79.08% and graduation score 71.36%) Technical interview: Do you know the concept of hashing? What do you know about IOCL? Why do we mostly prefer to generate and distribute electricity in 3 phase and not in 4 phase or 5 phase? Which motor connection is preferable star-delta or delta-star? Any questions? Excerpts from Interview #5: (NIT Nagpur student having Xth score 94%, XIIth score 92.6% and graduation score 87.5%) Personal Interview: Can you name the different types of processor? What is the difference between alternator and generator? Where do you see yourself in next 5 years? What are your present hobbies? How do you manage time in college between studies and extra-curricular activities? Excerpts from Interview #6: (A CGC landran student having 10th grade- 82% 12th grade-70.3% and graduation score-70.56%) Personal Interview: What is the minimum cetane number for the diesel used for naval application? Name the hydrocarbon having the poorest oxidation stability. What is Materials Requirement Planning? What is Just In Time? Which fuel exhibits the property of Aniline point? Why is tetra-ethyl lead added to gasoline? Why did you apply for this particular job? What is your greatest weakness? Are you satisfied with your academic performance till date? Tell me something about yourself. Can you brief us about your hobbies and interests?

GATE

Mayank Jain

Quantitative Questions

Quant questions

GATE

Vaibhav Kumar

All About GATE

GATE(Graduate Aptitude Test in Engineering) is one the most important and in-demand entrance exam for engineering graduates in our country. M.Tech. in Computer Science is one of the most demanding courses at prestigious institutes like IISCs and IITs. GATE(Graduate Aptitude Test in Engineering) is one of the ways to get into these top institutes. Every year around 10 Lakh candidates apply for GATE exam and very few of them manage to ace the exam with good score. So the competition is clearly very tough and simply preparing without any strategy will make it difficult to land you into IISCs and IITs. Let us now concentrate on few Important points : 1) Analyze GATE syllabus: Start with analyzing the GATE syllabus. Start divide and Conquer, try to break the syllabus into sub-categories and do the same with each subject further. It will help you to prioritize subjects and important topics in each subject. After doing this, you will get a clear insight into where you stand and how far is left to cover. Analyzing syllabus will also help you to understand about the important subjects and pattern of GATE exam. 2) Start preparing today : Time is like money, so spend it wisely. The best time to start your GATE preparation is today, just after completing this read. Just pick one of the subjects you feel good and start the preparation. You may start with some easy and scoring subjects like DBMS, Operating Systems or Computer Networks(totally depends on individual). After completing first subject and its GATE questions, you can immediately pick the second subject. As soon as two subjects are completely covered, you will start feeling more confident. After completing one subject, the immediately next task should be solving previously asked GATE questions of that subject. It will help you to uncover weak topics; try to recover those weak topics and resolve those questions. 3) Follow a disciplined schedule : Make a schedule and follow it at any cost, literally. Decide a fixed number of hours for your GATE preparation and complete it daily; remember, consistency is a compulsion here. Maybe print a calendar from starting day to intended course completion day and stick it front of your study table. Every day you completed those hours, mark the date with green pen and do the same with red pen if you missed. 4) Take running notes while studying: Note down the important points in notebook while covering the topics. It will definitely help you in revisions. Decide one day in a week to revise one of your previously completed subjects and use your GATE notes here. 5) Subjects easy to score: There are few subjects which are easier to score, like Digital Logic, Mathematics and Aptitude. These three subjects cover 25-28% of complete GATE paper. Try not to leave these subjects uncovered as they are high scoring and will help to boost your GATE AIR. 6) Track your preparation periodically: Solve previous GATE question for each subject. It will help you to recall and revise the subjects. We highly recommend giving Sudo GATE subject-wise Test series since these tests are build on learning while solving approach. 7) Revise and practice are keys to GATE: After completing each subject, start revising each subject thoroughly. Revise the subject then solve previous year GATE questions and take subject-wise tests. Remember, the only keys to score good AIR is revise and practice more. 8) Take Mock Tests: At this final stage of preparation, practicing quality questions before attempting actual GATE will boost your confidence and improve your problem-solving speed. GeeksforGeeks has specially designed Sudo GATE Mock tests, which will help in boosting your GATE score. Questions in these Mock Test resembles with GATE actual questions and will give the GATE aspirants trailer before the Film. Use short notes : At this crucial stage, don’t try to read any new topic. Just use your Last Minutes Notes to recall only key points in each subject. We highly recommend using these LMNs, specially designed for last minutes preparation.

GATE

Rahul Deswal

Logic Theory —Basic Notation

The origin of logic theory starts at the concept of an argument. The majority of logic textbooks contain an opening, central definition for an argument — one that likely sounds much like the following: An argument contains one or more special statements, called premises , offered as a reason to believe that a further statement, called the conclusion, is true Premises are the atoms of logic theory: everything is built up from them. A premise is a declarative statement that must strictly evaluate to only either true or false. A single premise is referred to as a primitive premise — there are 50 states in the U.S.A (which is true). Connecting multiple premises together form a compound premise — there are 50 states in the U.S.A and it snowed in Miami today (which is false). How does one connect multiple statements? Like you see in the previous example, with operators that you’re already familiar with but that require their own language & syntax. Connectives Similar to other branches of math, premises have their own set of fundamental operators (adding, subtracting, etc…). In logic theory, five basic logical connectors, collectively known as connectives, fill this role. They’re summarized in the table below, assume the letters P & Q represent two primitive premises: If you’ve been exposed to programming at any level, then it’s highly likely that the table above seems at least vaguely familiar. This is because connectives are at the very core of common language syntax & almost always have some special character designated for each connective (&& = and, | = or, etc…). Which of the five connectives is used as a logical connector between two premises determines the overall truth value of the compound statement based on the truth values of the premises being modified. An important principle here that might seem counter-intuitive at first is worth extracting: when analyzing compound statements it’s not necessary to know what parts P & Q actually say, only whether those parts are true or false. Implication Of the five connectives, one is immediately worthy of further inspection — the implication, aka, if-then statements. The implication is a connective with the standard form of P → Q where P is known as the hypothesis (or antecedent), & Q is known as the conclusion (or consequent). While the implication has a standard form defined above, there exists three other common types of conditionals that are worth reviewing. The following four conditionals are simple yet quite common & powerful compound statements made by combining conditionals with the core connectives introduced: A conditional is itself a compound premise, that is, it strictly evaluates to either true or false. For any implication, just like for any other connective, the truth value of the compound premise is determined by the truth values of its two independent premises. Corresponding with the definitions introduced above, for example, an implication is true either when the hypothesis is false, or when the conclusion is true; which leaves only one way for an implication to be false: when the hypothesis is true & the conclusion is false. If that seemed like a lot to track mentally, as it did for me, then breath easy & rest assure that powerful tools lay in the near future that makes analyzing complex conditionals as simple as following a blueprint. The main tool we’ll use is a nifty logic-101 tool by the name of truth tables. Before we get into truth tables, however, let’s make a quick detour to fill one last gap in our knowledge of basic logic theory notation. Inspect a peculiar scenario — is the following statement a premise? x is larger than one hundred Quantifiers Under our strict definition introduced in the opening paragraph, a premise must evaluate to either true or false — the statement cannot be ambiguous or left open-ended. Which means that variables, as we’re used to seeing them since algebra, is a no-no in logic theory; not at least without some modification. The bolded statement above is not considered a premise as x could be 5 or 25, making the statement true or false, but currently neither. This, however, doesn’t mean that we have to delete variables from our tool set altogether. There is a way to make use of variables; the process is called quantifying, a clever way of notating bounds on unknown variables in logic. Take a look at the following, updates statement — is this now a premise? for all x, x is larger than one hundred Now that we’ve defined the universe, or domain, of the variable, the statement is no longer ambigious — it’s now a premise as it evaluates to categorically false. The use of this “for all x” is known in logic theory as applying a quantifier. There are two main types of quantifiers. The first, which we’ve just seen, is aptly named the universal quantifier. Dictated by an upside down “A”, ∀, it’s easy to remember that it stands for All or every possible instance within the universe of the statement made. Inspect this second alteration: there exists an x larger than one hundred Once again without removing the variables we’ve found a way to convert a statement into a premise by applying a quantifier as the statement now evaluates strictly to true. This second type of quantifier is known as the existential quantifier. Notated by a backwards “E”, ∃, it usually reads as “there exists” or “there is.” Both quantifiers are summarized below:

GATE +1 more

Keshav Malik

Deadlock Operating System

Deadlock Detection 1. If resources have single instance: In this case for Deadlock detection we can run an algorithm to check for cycle in the Resource Allocation Graph. Presence of cycle in the graph is the sufficient condition for deadlock. In the above diagram, resource 1 and resource 2 have single instances. There is a cycle R1–>P1–>R2–>P2. So Deadlock is Confirmed. 2. If there are multiple instances of resources: Detection of cycle is necessary but not sufficient condition for deadlock detection, in this case system may or may not be in deadlock varies according to different situations. Deadlock Recovery Traditional operating system such as Windows doesn’t deal with deadlock recovery as it is time and space consuming process. Real time operating systems use Deadlock recovery. Recovery method 1. Killing the process. killing all the process involved in deadlock. Killing process one by one. After killing each process check for deadlock again keep repeating process till system recover from deadlock. 2. Resource Preemption Resources are preempted from the processes involved in deadlock, preempted resources are allocated to other processes, so that their is a possibility of recovering the system from deadlock. In this case system go into starvation.

GATE

Rashmi Jain

Associative Arrays in PHP

<html> <body> <?php /* First method to associate create array. */ $salaries = array("mohammad" => 2000, "qadir" => 1000, "zara" => 500); echo "Salary of mohammad is ". $salaries['mohammad'] . " "; echo "Salary of qadir is ". $salaries['qadir']. " "; echo "Salary of zara is ". $salaries['zara']. " "; /* Second method to create array. */ $salaries['mohammad'] = "high"; $salaries['qadir'] = "medium"; $salaries['zara'] = "low"; echo "Salary of mohammad is ". $salaries['mohammad'] . " "; echo "Salary of qadir is ". $salaries['qadir']. " "; echo "Salary of zara is ". $salaries['zara']. " "; ?> </body> </html>

Programming +2 more

sunil arora