2 views

Uploaded by titun8723

save

You are on page 1of 3

General Aptitude (GA)

Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction.

Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation. Engineering Mathematics

Mathematical Logic: Propositional Logic; First Order Logic.

Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.

Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.

Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.

Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

Parsing. Parameter passing. evaluation of definite & improper integrals. Trees. Binary search trees. ALU and datapath. Bisection and Newton-Raphson Methods. Divide-and-conquer. Tree and graph traversals. Asymptotic analysis (best. average cases) of time and space. Shortest paths. Context free languages and Push-down automata. Undecidability. Binding. NP. Spanning trees. Recursively enumerable sets and Turing machines. Scope. Searching. Continuity & differentiability. Numerical integration by trapezoidal and Simpson’s rules. Abstract data types. Sorting. Computer Organization and Architecture: Machine instructions and addressing modes. . Connected components. Arrays. Asymptotic notation. Memory interface. numerical solutions of nonlinear algebraic equations by Secant. NP-complete. Minimization. Mean value Theorems. Intermediate and target code generation. Programming and Data Structures: Programming in C. Queues. Basic concepts of complexity classes P. Recursion. Secondary storage. Notions of space and time complexity. Total derivatives. Cache and main memory. Worst and average case analysis. Stacks. Basics of code optimization. CPU control design. Theory of Computation: Regular languages and finite automata. Runtime environments. Design: Greedy approach. Number representation and computer arithmetic (fixed and floating point). upper and lower bounds. Calculus: Limit.Numerical Methods: LU decomposition for systems of linear equations. Compiler Design: Lexical analysis. worst. Instruction pipelining. Partial derivatives. Computer Science and Information Technology Digital Logic: Logic functions. Dynamic programming. Design and synthesis of combinational and sequential circuits. I/O interface (Interrupt and DMA mode). NP-hard. Theorems of integral calculus. Hashing. Algorithms: Analysis. Syntax directed translation. Functions. maxima & minima. Binary heaps. Linked Lists.

Relational model (relational algebra. TCP/UDP and sockets. Network security basic concepts of public key and private key cryptography. Web technologies: HTML. coding. implementation. basic concepts of client-server computing. Protection and security. pop. Query languages (SQL). Concurrency. smtp. Database design (integrity constraints. File systems. Token ring). process life cycle. File structures (sequential files. testing. Basic concepts of hubs. gateways. Transactions and concurrency control. Threads. Congestion control. process specifications. Computer Networks: ISO/OSI stack. normal forms). design. CPU scheduling. http). input/output design. I/O systems. Memory management and virtual memory. Inter-process communication. dns. Synchronization. Deadlock. and routers. switches. Flow and error control techniques. XML. firewalls. planning and managing the project. ftp. tuple calculus). Information Systems and Software Engineering: information gathering. maintenance. LAN technologies (Ethernet. digital signature. Routing algorithms. indexing.Operating System: Processes. B and B+ trees). Application layer protocols (icmp. data flow diagrams. Databases: ER-model. IP(v4). . requirement and feasibility analysis.

- Research Methodology - KSSEM - SNSUploaded byarun
- Numerical Interpolation, Differentiation and IntegrationUploaded byclinton
- Digital CircuitsUploaded bysrinu247
- Bessel Stirling Formula Numerical AnalysisUploaded byomed
- NumMeths OutlineUploaded bysunnyopg
- CN3421 Lecture Note 1- IntroductionUploaded byKiang Teng Lim
- Logic GatesUploaded byVicky Singh
- SNM R08 AprilMay 10Uploaded byebenesarb
- GATE 2011 SyllabusUploaded bysmart_thinker
- Finite_Element_Metode__FEM_.pdfUploaded byIntan Luruh Larasati
- s5.pdfUploaded byirshad_kt
- KayaUploaded byHiral Patel
- Numerical Solution of 2D Heat EquationUploaded byataghassemi
- Placas.pdfUploaded byJefferson Corredor Nieto
- Introductory Methods Of Numerical Analysis_S. S. Sastry (1).pdfUploaded byrahul singh
- ma8_e.pdfUploaded byJamalMatbouly
- Experiment 3: Boolean Algebra.Uploaded byMOHD MU'IZZ BIN MOHD SHUKRI
- Lax WemdroffUploaded bySantiago Bonilla Rivera
- special productsUploaded byapi-265713032
- Vahl Davis BenchmarkUploaded byAjith Kumar Arumugham
- chapt_01Uploaded byMason
- Steigemann Fulland on the Computation of the Pure Neumann ProblemUploaded byjagomez7896
- CVFD2D Slides 2upUploaded bythanhndb
- Análise Teórico-experimental de Uma Laje Nervurada Em Escala NaturalUploaded byLucas
- MA Numerical AnalysisUploaded byNikhilSharma
- 214_Kruis_J-FTUploaded bycap3000
- SyllabusUploaded bykulniti
- Use of Spreadsheets in Solving Heat Conduction Problems in FinsUploaded byvinod patil
- CM305.13EUploaded byscribd9885343478
- 85895_kuliah9(MU)(1) fixUploaded byInur