Kerala Public Service Commission published notification for Programmer in 2021 under the department of universities in kerala. PATTERN OF EXAM Mode of exam: MCQ(100) Exam contains 100 questions Each correct answers carry one mark and 0.33 mark will deducted for wrong answers. Total time allotted:1hr 15 min PROGRAMMER DETAILED SYLLABUS Module 1 Digital computer principles: Number systems- Binary, Decimal, Octal and Hexadecimal Conversions, Arithmetic Operations, Boolean Algebra, Logic gates, SOP, POS, minterm and maxterms, Boolean expression, Simplifications, postulates and theorems, K-map, Combinational logic circuits- Adder, Subtractor, Multiplexer, Demultiplexer, Encoder, Decoder, Sequential Circuits-SR,JK,T,D flipflops, Shift registers, Asynchronous, Synchronous and Modulo n Counters. Computer Architecture: Multiprocessors and microcomputers, Assembly language, Assembler directives, Seminconductor memory-internal organization, SRAM, DRAM,SDRAM,Rambus memory, ROM technology, Cache memory, virtual memory, working of magnetic disks and tapes, optical disks, instruction sequencing, instruction execution, Hardwired control and microprogrammed control, micro instructions, Pipelining Demo Class : Microprocessors Internal architecture of 05 and 06, interfacing with peripheral devices, microcontrollers. Demo Class : Module 2 Set theory and statistics: Sets, relations, functions, groups, partial orders, lattices, algebraic structures, mathematical induction, The principle of inclusion-Exclusion, Probability theory:Sample spaces, Events and probability, Discrete Probability: Union,Intersection and Compliment of events, Conditional probability, Bayer’s theorem, Linear correlation coefficient, Linear regression, Non linear regression, Multiple correlation and Multiple regression, Theory of sampling and population. Theory of Computation Regular languages and finite automata, Context-free languages and pushdown automata, recursively enumerable sets and Turing machines, Undecidability. System Software and Operating Systems Compiler design, lexical analysis, parsing, syntax directed translation, code generationand optimization, Assemblers, linkers and loaders, macroprocessors, cpu scheduling, Deadlocks, Memory management, file systems, disk scheduling, process, threads and their synchronization, Real time os: clock synchronization and task scheduling, System initialization, booting and handling users accounts, Backup and restore, Bourne shell programming for linux Module 3 Computer Networks: Layered architecture, LAN technologies , wireless LAN, flow and error control, routing algorithms, congestion control, TCP/UDP and sockets, IPv4, IPv6, ICMP, DNS, SMTP, POP, FTP, HTTP, MIME, Hubs, switches, routers and gateways, public key and private key cryptography, digital signature, firewalls, wireless networks, 2G and 3G networks, Bluetooth. Distributed System: Characteristics, inter-process communication, distributed file systems Web technologies Two and three tier client server architecture , web servers, HTML and XML, Style sheets, client side scripting-java script and VB script: server side scripting-php, jsp, and ASP.NET programming for creating dynamic web pages using database, forms and sessions: AJAX and signalR Demo Class : Module 4 Data structures: Data structures: Linked list, stack, queue, priority queues, Hashing, Binary trees, Tree traversal, BST, AVL trees, Graphs-shortest paths, minimum spanning trees, sorting algorithms. Algorithms: Analysis, space and time complexity, Design-greedy approach, Dynamic programming, divide and conquer, sorting and searching , complexity classes-P, NP,NP-hard, NP-complete. Programming Concepts in C : Operators and expressions, control statements, storage structures, functions, arrays, strings, structures, pointers and dynamic memory management, file handling. Module 5 Database management system: Keys, E-R models, Normalization-1NF to 5NF:Relational algebra, SQL, Aggregate functions, Nested sub queries, views, joined Relations, Transaction –ACID properties: concurrency control, triggers, stored procedures. Software Engineering: System modelling, system engineering process, life cycle models, desing and implementation, validation, evolution, automated,process support-software requirements, SRS, feasibility studies-elicitation and analysis-validation-management-system models, context models, behaviour models, data models, object models, object-oriented design evolution, real time software design, critical system specifications-critical system development, software testing. STRATEGIES AND TIPS Know the Exam Pattern and Syllabus thoroughly… Prepare a Timetable to Ease Your Preparations…. Give Utmost Importance to Practices Previous year question Papers…. Never Overwork Yourself…. Refer to the Best Study Materials Available… Is it easy to get a role of computer programmer under government ? Yes. It all starts with a dream , a dream to become a government employee under kerala government with the right preparations, one can clear the exam for programmer in first attempt. Work hard , practice previous year question papers and cover the entire syllabus which makes your steps easier. Will only studying the topics from the syllabus enough to get a government job? NO. In previous years many questions are coming outside the syllabus for various technical exams. So give importance to practice more previous year question papers.
Tag: Kerala PSC
Assistant Professor in COMPUTER SCIENCEÂ ENGINEERING Syllabus Kerala PSC 2022Assistant Professor in COMPUTER SCIENCEÂ ENGINEERING Syllabus Kerala PSC 2022
Assistant professor in government engineering college exam published in 2022. The syllabus comprises of two parts as given below Mode of Exam: MCQ (OMR) Exam contains 100 Questions Each correct answer carry one mark & 0.33 detected for wrong answers Total time allotted : 1hr 15 min Do you believe that all questions comes from the syllabus ? NO, Thorough knowledge of subject is required since question from outside can be expected. In the recent years we can see a trend of deviation in questions in the technical exams conducted by the Kerala PSC. Will only studying topics in syllabus fetch me a GOVT Job? Do not blindly follow the syllabus rather have good technical knowledge of your subjects. If you check the previous year papers you could find out many questions coming outside the syllabus in all technical exams by Kerala PSC. Assistant Professor in COMPUTER SCIENCE ENGINEERING SYLLABUS *Non Technical portions has been omitted from the syllabus  MATHEMATICS   (ENGINEERING) Matrices: Rank, systems of linear equations, consistency, eigen values, eigen vectors, Cayley Hamilton Theorem, diagonalisation, linear dependence and independence of vectors. Demo Class : Click Here Partial Differentiation: Partial derivatives, Euler’s theorem on homogeneous functions, total derivatives, Jacobians, Taylor’s series (one and two variables) – Maxima and minima of functions of two variables – Lagrange’ s method. Vector Differentiation: Scalar and vector functions, differentiation of vector functions – velocity and acceleration – scalar and vector fields – operator Ñ – Gradient – Directional derivative – Divergence – Curl – irrotational and solenoidal fields – scalar potential. Laplace Transforms: Transforms of elementary functions, shifting property – inverse transforms – transforms of derivatives and integrals – transform of functions multiplied by t and divided by t – convolution theorem, solution of ordinary differential equations with constant coefficients using Laplace transforms. Ordinary Differential Equations: First Order ordinary differential equations, systems of linear first order ordinary differential equations, linear ordinary differential equations of higher order with constant coefficients, linear second order ordinary differential equations with variable coefficients (Cauchy and Legendre equations), Method of Laplace transforms for solving ordinary differential equations. Complex Analysis: Analytic functions, conformal mappings, bilinear transformations, complex integration, Cauchy’s integral theorem and formula, Taylor and Laurent’s series, residue theorem. Fourier Series: Fourier series of periodic functions of period 2 Ï€ and 2 â„“, odd and even functions, Half range expansions. BASIC CIVIL  ENGINEEERING Mechanics – statistics – Coplanar forces – conditions of equilibrium. Support reactions – Simply supported and overhanging beams. Friction – Laws of friction – applications. Centre of gravity and moment of inertia of plane areas. Dynamics – rectilinear motion – Newton’s laws of motion – curvilinear motion. Building materials – common building materials – stone, brick, cement, steel, aggregate, concrete, timber – properties, IS specification. Building construction – types and functions of the following structural components of buildings – foundations and superstructure. Surveying – principle of surveying – linear measurements using chain – levelling work – reduction of levels. Demo Class : Click Here      BASIC MECHANICAL ENGINEERING Zeroth, first and second laws of thermodynamics, CI and SI Engines, properties of steam. Centrifugal and reciprocating pumps, hydraulic turbines, refrigeration and air conditioning, hydro-electric, thermal and nuclear power plants, mechanical power transmission systems such as belt, rope, chain and gear, manufacturing process – casting, forging, rolling, brazing, soldering, and welding, machining process – turning, shaping, drilling, grinding and milling. Conic sections and miscellaneous curves, orthographic, isometric and perspective projections. Demo Class : Click Here  BASIC ELECTRICAL ENGINEERING Ohm’s law, Kirchoff’s laws – solution of series and parallel circuits with dc excitation. Magnetic circuits: MMF, field strength, flux density, reluctance, electromagnetic induction, Faraday’s laws, Lenz’s law, statically and dynamically induced emfs, self and mutual induction, co-efficient of coupling. Principle of generation of alternating current – waveforms – frequency, period, average and rms values, form factor. Generation of 3 phase ac voltage, star and delta connections, voltage & current relationships in star and delta (balanced system only). Principle of operation of dc motor & generator, single phase transformer and three phase induction motor. Types of lamps, necessity of earthing. BASIC  ELECTRONICS  ENGINEERING Devices – working principle of PN junction, Zener diode and BJT. Systems – Rectifiers : Half wave, Full wave and Bridge. Filters: Capacitors and Inductors. Amplifiers & Oscillators – Common Emitter RC coupled amplifier and its frequency response. Principles of Wein-bridge oscillator. Op-amps: Basics, inverting and non- inverting amplifier. Communication – Need for modulation, principles of AM and FM. Measurements – Working principles of CRO and Multimeter. BASIC  COMPUTER  SCIENCE Functional units of a computer. Programming in C – control structures, functions. Computer Organization & Architecture Digital Logic: Logic functions, minimization, design and synthesis of combinational and sequential circuits, number representation and computer arithmetic (fixed and floating point). Computer Organization: Machine instructions and addressing modes, ALU, CPU control design, memory interface, I/O interface, DMA, interrupts, pipelining, memory hierarchy, parallel computer models. Microprocessors: Internal architecture of 8085 and 8086, interfacing with peripheral devices, microcontrollers. Demo Class : Click Here Programming Languages & Information Systems Object Oriented Programming: Object oriented design concepts, programming in C++, Java. Databases: ER model, relational algebra, tuple calculus, database design, integrity constraints, normalization, SQL, B-trees, B+ – trees, transactions and concurrency control. Software Engineering: Software process models, planning and managing a software project, design, implementation, software testing, quality models and maintenance. Programming Language Concepts: Parameter passing, binding, scope, recursion, functional and logic languages. Data Structures & Algorithms Data Structures: Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Algorithms: Analysis, space and time complexity. Design – greedy approach, dynamic programming, divide-and-conquer, sorting and searching, complexity classes – P, NP, NP-hard, NP-complete. Graph Theory: Connectivity, covering, colouring, planarity, isomorphism. Computer Graphics: Line drawing, circle drawing, filling, hatching, 2D/3D transformations, projections, hidden surface removal. Demo Class : Click Here Computing and System Software Set Theory: Sets, relations, functions, groups, partial orders, lattice, algebraic structures. Theory of Computation: Regular languages and finite automata, context-free languages & pushdown automata, recursively enumerable sets & Turing machines, undecidability. System