RABIA ATTACH

  OPERATION RESEARCH SYLLABUS Unit I : Introduction [4L]  Basic LPP and Applications, Various Components of LP Problem Formulation, Basic Solution, Basic Feasible Solution, Optimum Solution.   Unit II : Solution of Linear Programming Problems [12L]  Solution of LPP using Simultaneous Equations and Graphical Method, by Simplex Method, Charnes’ Big-M Method, Duality Theory.   Unit III : Transportation Problems [12L]  Matrix minima method, North-West corner rule, Vogel Approximation Method.   Unit IV : Assignment Problems and Traveling salesman problem [6L]  Hungarian Method For Solving Assignment Problem, Traveling salesman problem.   Unit V : Network Analysis [6L]  Shortest Path: Floyd Algorithm, Maximal Flow Problem (Ford-Fulkerson), PERT-CPM .   Suggested books: 1. Ghosh and Chakraborty, “Linear Programming and Theory of Games”, Central Book Agency 2. Operation Research,Paneer Selvam,PHI 3.Operations Research, Hillier & Lieberman, TMH 4. J. K. Sharma: Operation Research Th

  How to do a Java program in Google in online? This tutorial shows how to do a Java program in Google online. THERE ARE A SIMPLE STEPS TO RUN JAVA PROGRAMS ONLINE IN GOOGLE THROUGH CODECHEF (RECOMENDED FOR BEGINNERS). STEP 1: OPEN A BROWSER STEP 2: OPEN CODECHEF.COM STEP 3: LOG IN OR CLICK ON "NEW USER" AND CREATE AN ACCOUNT (OPTIONAL) STEP 4: GO TO HOME PAGE, SELECT "PRACTICE & LEARN". STEP 5: CLICK "CODE, COMPILE & RUN (IDE)". STEP 6: WRITE YOUR CODE IN THE EDITOR STEP 7: SELECT "JAVA (HotSpot 8u112)". STEP 8: AFTER CODING, CLICK ON "RUN". STEP 9: AFTER COMPILING, OUTPUT IS GENERATED. STEP 10: DOWNLOAD THE PROGRAM, IF REQUIRED.     -- 0 -- IF YOU CONSIDER GOOGLE CLOUD THEN WATCH FOLLOWING YOUTUBE VIDEOS FOR CREATING A CLOUD ACCOUNT, AND ALL ABOUT VM INSTANSES. IN GOOGLE CLOUD YOU HAVE $300 (INR 22K AROUND ) 1. Create Google Cloud Account free: https://www.youtube.com/watch?v=TsPa3inktpk 2. How to install cpanel on google

 AUTOMATA DEFINITIONS THIS SUBJECT IS FULLY BASED ON EXAMPLES, DEFINITIONS, GRAMMAR RULES, DIAGRAMS AND THEOREMS. IMPORTANT DEFINITIONS:  DFA:    A Deterministic Finite State Automaton (DFSA) is denoted by M and it is a set of 5-tuples i.e. M=(Q, Σ, δ, q 0 , F) where, * Q is a non-empty finite set of states * Σ is a non-empty finite set of input symbols *  q 0 is the initial state or starting state. (q0 ∈ Q) * F is a non-empty finite set of final state. (F ⊆ Q). * δ (pronounce delta) is the transition function. Q x Σ → Q. δ(q,a) = p means, if  the automation is in state q and reading a symbol a, it goes to state p in the next instant, moving the pointer one cell to the right. NDFA:    A Non-Deterministic Finite State Automaton (NFSA) is denoted by M and it is a set of 5-tuples i.e. M=(Q, Σ, δ, q 0 , F) where, * Q is a non-empty finite set of states * Σ is a non-empty finite set of input symbols *  q 0 is the initial s

 Stack Expressions : INFIX TO POSTFIX AND POSTFIX EVALUATION Infix to Postfix Conversion  Infix expression: The expression of the form a op b. When an operator is in-between every pair of operands.  Postfix expression: The expression of the form a b op. When an operator is followed for every pair of operands.  Algorithm: 1. Scan the infix expression from left to right. 2. If the scanned character is an operand, output it. 3. Else,     3.1 If the precedence of the scanned operator is greater than the precedence of the     operator in the stack(or the stack is empty or the stack contains a ‘(‘ ), push it.     3.2 Else, Pop all the operators from the stack which are greater than or equal to in     precedence than that of the scanned operator. After doing that Push the scanned operator     to the stack. (If you encounter parenthesis while popping then stop there and push the     scanned operator in the stack.) 4. If the scanned character is an ‘(‘, push it to the stack. 5. If

    What is Stack Data Structure? Stack is an abstract data type with a bounded(predefined) capacity. It is a simple data structure that allows adding and removing elements in a particular order. Every time an element is added, it goes on the top of the stack and the only element that can be removed is the element that is at the top of the stack, just like a pile of objects.  Basic features of Stack  1. Stack is an ordered list of similar data type. 2. Stack is a LIFO(Last in First out) structure or we can say FILO(First in Last out). 3. push() function is used to insert new elements into the Stack and pop() function is used to remove an element from the stack. Both insertion and removal are allowed at only one end of Stack called Top. 4. Stack is said to be in Overflow state when it is completely full and is said to be in Underflow state if it is completely empty.  Applications of Stack  The simplest application of a stack is to reverse a word. You push a given word to stack - let

  Top PC Software Free Download:   1. FIREFOX BROWSER 2. BRACKET 3. BETA TORRENT 4. FREE DOWNLOAD MANAGER 5. MEGA CLOUD STORAGE 6. PYTHON 7. READER 8. SAND DISK SECURE ACCESS 9. SUBLIME TEXT  10. TELEGRAM 11. VLC MEDIA PLAYER 12. WPS OFFICE 13. WINRAR 14. XAMPP SERVER LINK : https://drive.google.com/drive/folders/13aU0fDSp7m52w5xUQwaMlCyMUruA7o7v?usp=sharing ENJOY.. 

  What is DMA and Why it is used? Direct memory access (DMA) is a mode of data transfer between the memory and I/O devices. This happens without the involvement of the processor. We have two other methods of data transfer, programmed I/O and Interrupt driven I/O. Let’s revise each and get acknowledge with their drawbacks. In programmed I/O, the processor keeps on scanning whether any device is ready for data transfer. If an I/O device is ready, the processor fully dedicates itself in transferring the data between I/O and memory. It transfers data at a high rate, but it can’t get involved in any other activity during data transfer. This is the major drawback of programmed I/O. In Interrupt driven I/O, whenever the device is ready for data transfer, then it raises an interrupt to processor. Processor completes executing its ongoing instruction and saves its current state. It then switches to data transfer which causes a delay. Here, the processor doesn’t keep scanning for peripherals

                                                      1. The only feasible purpose of financial management is   a) Wealth Maximization b) Sales Maximization   c) Profit Maximization d) Assets maximization 2 Capital A/c is a _______ A/c   a) Personal b) Real   c) Nominal d) None of these 3 Finance Function comprises   a) Safe custody of funds only b) Expenditure of funds only   c) Procurement of finance only d) Procurement & effective use of funds 4 Cash A/c is a ________ A/c   a) Personal b) Real   c) Nominal d) None of these 5 Mr. Customer purchased goods from Mr. Seller on credit. This is a/an   a) Event b) Transaction   c) Both Event & Transaction d) None of these 6 Sales – Gross Profit = ________   a) Cost of goods sold b) Net sales   c) Gross Sales d) Liabilities 7 The first step of accountancy is   a) Journal Entry b) Ledger Posting   c) Balancing of Accounts d) Trial Balance 8 Mr. X is a dealer in electronic goods (refrigerator, washing machine, air conditioners, tel

                                .  INTERVIEW QUS ON AUTOMATA 1 There are ________ tuples in the finite state machine.   a)4 b)5   c)6 d)Unlimited 2 Transition function maps.   a)Σ * Q → Σ b)Q * Q→Σ   c)Σ * Σ → Q d)Q * Σ → Q 3 Number of states required to accept string ends with 10.   a)3 b)2   c)1 d)Can’t be determined 4 δ*(q,ya) is equivalent to .   a)δ((q,y),a) b)δ(δ*(q,y),a)   c)δ(q,ya) d)independent from δ notation 5 An automaton that presents output based on previous state or current input is called   a)Acceptor b)Classifier   c)Transducer d)None of the mentioned 6 If NFA of 6 states excluding the initial state is converted into DFA, the maximum possible number of states for the DFA is   a)62 b)32   c)128 d)127 7 NFA, in its name has ’non-deterministic’ because of :   a)The result is undetermined b)The choice of path is non-deterministic   c)The state to be transited next is non-deterministic d)All of the mentioned 8 Which of the following is the correct proposition? State

 INTERVIEW QUS ON DATASTR MOST IMPORTANT QUESTIONS ON DATA STRUCTURE 1. Define O & Ɵ notation. 2. Explain ‘Stack data structure’ with example. (all operations of stack with ex)  3. Explain ‘Queue data structure’ with example.  4. Explain heap sort with example.  5. Write the applications of Array and difference between array and linked list.  6. What are the working principle of Circular queue, circular linked list and double linked list?  7. Write the algorithm for insertion at begin, at between, at end for single linked list.  8. Define Binary search tree and strictly binary tree with example.  9. Write the algorithms of Insertion, bubble, heap, quick, radix, selection sort  10. Write the procedure of Infix to prefix conversion with example.  11. What is the Linear search technique?  12. Explain AVL tree with creating example.  13. Write the algorithm to evaluate postfix expression.  14. Explain different hash functions.  15. Define algorithm and flowchart. Multiple-choic

 INTERVIEW QUS ON MP   Our 50+ Microprocessor questions and answers focus on all areas of Microprocessor subject covering the most important topics in the Microprocessor. These topics are chosen from a collection of most authoritative and best reference books on Microprocessor.   1 What does microprocessor speed depend on?   a)Clock b)Data bus width   c)Address bus width d)Control bus width 2 Why 8085 Processor called an 8-bit processor?   a)Because the 8085 processor has 8-Bit ALU. b)Because the 8085 processor has an 8-Bit data bus.   c)Both because the 8085 processor has 8-Bit ALU and because the 8085 processor has an 8-Bit data bus. d)none of these 3 Which one is not a flag bit   a)Parity b)Cary   c)Sign d)Operand 4 What is the maximum number of memory locations supported by 8085?(Probable duplicate)   a)10000 b)32768   c)65536 d)No limit 5 Name of the program responsible to transfer hex input to binary is   a)System Program b)Application Program   c)Compiler d)Monitor Program 6

  1.   WHAT IS CMD?   2.   DIFFERENCE BETWEEN GUI AND CLI   3.   CMD AND POWERSHELL   SOME BASIC OPERATION AND COMMANDS REGARDING FILES & FOLDER OPEN COMMAND PROMPT.   DIRECTORY RELATED:   CHANGE DIRECTORY   (CD) C:\Users\PC> cd/    [ back to drive] C:\> cd Users [ enter into Directory] C:\Users> cd PC [ enter into Directory] C:\Users\PC> cd .. [ back one step in directory] C:\Users> cd PC C:\Users\PC> cd Desktop   MAKE DIRECTORY(FOLDER) C:\Users\PC\Desktop> mkdir pop [ pop Directory created]   RENAME DIRECTORY C:\Users\PC\Desktop> ren pop hip  [ pop directory renamed as hip] C:\Users\PC\Desktop> cd hip [ enter hip directory]   PPT FILE CREATION C:\Users\PC\Desktop\hip> type nul> fort.pptx [fort is a name of the ppt file]   RENAME FILE C:\Users\PC\Desktop\hip> ren fort.pptx India.pptx [ ren oldFileName NewFileName ] After doing this, Move it to the Desktop and Make a copy of it in hip directory.   COPY C:\Users\PC\Desktop\