Sponsored Links 
#3
 
 
Re: ISRO Syllabus and Paper Pattern for Computer Science Engineer or Scientist
Indian research Organization does not publish the syllabus for the Computer Science or any other exam. But you can prefer the Graduate Aptitude test in Engineering (GATE) Computer Science syllabus. It covers the topic for the exam. And in opinion you should prefer the previous year question paper, so you will have an idea about the exam. And let me clear you one thing also that Engineering mathematics questions are also asked in the exam so you need to prefer for that also, many students have doubt about it. Here, I am giving you GATE Computer Syllabus: 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. Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of nonlinear algebraic equations by Secant, Bisection and NewtonRaphson Methods; Numerical integration by trapezoidal and Simpson's rules. Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima. Computer Science and Information Technology Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point). Computer Organization and Architecture: Machine instructions and addressing modes, ALU and datapath, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage. Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps. Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divideandconquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes P, NP, NPhard, NPcomplete. Theory of Computation: Regular languages and finite automata, Context free languages and Pushdown automata, Recursively enumerable sets and Turing machines, Undecidability. Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization. Operating System: Processes, Threads, Interprocess communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. Databases: ERmodel, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control. Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance. Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security basic concepts of public key and private key cryptography, digital signature, firewalls. Web technologies: HTML, XML, basic concepts of clientserver computing. ISRO Computer Science Examination Pattern: The exam will offline and contains objective type questions. Total questions: 80 Exam Duration: 90 minutes There is negative marking of the one mark for each wrong answer. each correct answer is awarded by the 3 marks. Here, I am forwarding some previous year exam papers ISRO CS papers detail to atteched two pdf files......................
__________________ Answered By StudyChaCha Member 
Other Discussions related to this topic  
Thread  
Civil engineer question papers or syllabus or exam pattern of PWD  
Want to join ISRO as a Scientist or Engineer  
NET Syllabus for Computer Science Paper 1  
ISRO Scientist Recruitment Test Syllabus for Electronics Stream  
ISRO exam for SC (B.Tech) Computer science syllabus  
ISRO Question Paper Pattern  
ECIL Paper Pattern for Computer Science  
BEL Probationary Engineer Computer Science Question Paper  
Qualification & Age Limit for ISRO as Scientist/Engineer  
ISRO Exam Computer Science Syllabus  
ISRO entrance exam in Computer Science syllabus  
ISRO Computer Science syllabus of entrance exam for reserved categories  
BIS Scientist B Computer Engineering Question Paper  
Books for ISRO scientist engineer question with solution  
ISRO Scientist Recruitment test EC Stream syllabus  
ISRO Syllabus for Computer Science exam  
Sail Paper Pattern Computer Science  
ISRO Syllabus for Computer Science  
ISRO Sac Scientist Engineer Vacancy  
ISRO question paper computer science 
Have a Facebook Account? Ask your Question Here 
