पदों की सूची
Last Updated on मई 12, 2024 by Sonal
गोवा लोक सेवा आयोग में सहायक प्रोफेसर (कम्प्यूटर विज्ञान) पाठ्यक्रम – Goa PSC Assistant Professors (Computer Science) Syllabus
Syllabus For Computer Based Recruitment Test (Cbrt) For The Post Of Assistant Professors In Government College (Computer Science) Under directorate Of Higher Education – (Advt No. 01 Year 2024)
| I. General English including Grammar | 05 marks |
| II.General Knowledge, Current Affairs and Events of National and International Importance | 10 marks |
| III. Logical Reasoning and Analytical Ability | 10 marks |
| IV. Core: | 50 marks |
Computer Organization,Operating Systems and Systems Software
Boolean Algebra and Logic Gates,Simplification of Boolean Function, Sequential Logic, Overview of Register Transfer and Microoperations, Basic Computer Organization and Design , Programming the Basic Computer, Central Processing Unit , Pipeline Processing, Main functions of operating systems, Multi Prograrnming, multiprocessing, and multitasking. Memory Management, Virtual memory, Concurrent Processing, Deadlocks,Scheduling: CPU scheduling, I/O scheduling, Resource scheduling, Linux/UNIX Concepts, commands and system calls Assembly language fundamentals , Assemblers-2-pass and single-pass. Macros and macroprocessors. Loading, linking, relocation, program relocatability. Linkage editing. Text editors. Programming Environments. Debuggers and program generators.
Computer Arithmetic:
Propositional Logic, Predicate Logic, Well-foraiedW formulae (WFF), Satisfiability and Tautology. Logic Families: TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions. Flip-flops-types, race condition and comparison. Design of combinational and sequential circuits. Representation of Integers: Octal, Hex, Decimal, and Binary. 2’ s complement and 1’ s complement arithmetic. Floating point representation.
Discrete Structures:
Sets, Relations, Functions, Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measure (s) for information and Mutual information. Computability: Models of computation-Finite Automata, Pushdown Automata, Non-determinism and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non-computability and Examples of non-computable problems. Graph concepts and connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning trees. Hamiltonian and Eulerian graphs, Planar graphs. Groups: Finite fields and Error correcting/detecting codes.
Programming in C/ C + + and Data Structures:
Elements of C-Tokens, identifiers, data types in C. Control structures in C. Sequence, selection and iteration, Structured data types in C-arrays, struct, union, string, and pointers. O-O Programming Concepts: Class,object, instantiation. Inheritance, polymorphism and overloading. C + + Programming: Elements of C + ± Tokens, identifiers. Variables and constants, Datatypes, Operators, Control statements. Functions parameter passing. Class and objects. Constructors and destructors. Overloading, Inheritance, Templates, Exception handling.Data, Information, Definition of data structure. Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps. File Structures: Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing, inverted lists and multi-lists. B trees and B + trees.
Relational Database Management and SQL:
E-R diagrams and their transformation to relational design, Normalization upto 4NF. SQL –DDL/DML/DCL. Database objects ,Transactions and Concurrency Control, Recovery,Storage and Indexing, Query Optimization Techniques
Software Engineering:
System Development Life Cycle (SDLC): Steps, Water fall model, Prototypes, Spiral model. Software Metrics: Software Project Management. Software Design: System design, detailed design, function oriented design, object oriented design, user interface design. Design level metrics. Coding and Testing: Testing level metrics. Software quality and reliability. Clean room approach, software reengineering
Computer Networks:
Network fundamentals –LAN,MAN,WAN, Wireless Networks, Inter Networks., Topologies, The OSI model, TCP/IP model, Data Communication and Transmission media, Communication satellites, geosynchronous and low-orbit.
Internetworking: Switch/Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls. Routing: Virtual circuits and datagrams. Routing algorithms. Conjestion control. Network Security:
Cryptography-public key, secret key. Domain Name System (DNS) -Electronic Mail and Worldwide Web (WWW). The DNS, Resource Records, Name servers. E-mail-architecture and Serves.
Current Trends and Technologies:
General information on Parallel Computing, Mobile Computing,E-technologies, Data Mining
Note:
Duration for C.B.R.T : 90 Minutes
Maximum Marks for C.B.R.T : 75 Marks
Goa PSC Assistant Professors (Computer Science) Syllabus Pdf
गोवा लोक सेवा आयोग में सहायक प्रोफेसर (सूचना प्रौद्योगिकी) पाठ्यक्रम – Goa PSC Assistant Professors (Information Technology) Syllabus
Syllabus For Cbrt For The Post Of Assistant Professors In Information Technology
Syllabus For Computer Based Recruitment Test (CBRT) For The Post Of Assistant Professors In Information Technology Under Goa College Of Engineering (Advt. No. 08 Year 2019)
| I. General English including Grammar | 05 marks |
| II.General Knowledge, Current Affairs and Events of National and International Importance | 10 marks |
| III. Logical Reasoning and Analytical Ability | 10 marks |
| IV. Core: | 50 marks |
Engineering Mathematics
Discrete Mathematics: Mathematical Logic, Sets and Relations, Counting, Mathematical Induction and Discrete Probability, Group Theory, Boolean Algebra, Combinatorics: counting, recurrence relations, generating functions, Propositional Logic, Algebraic Structures and Morphism, Graphs and Trees.
Calculus: Limits, continuity and differentiability, Maxima and minima, Mean value theorem, Integration.
Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Logic Design
Number System and codes, Computer arithmetic (fixed and floating point), Boolean Algebra and Logic gates, Design and Analysis & implementation of Combinational Circuits and Sequential logic design.
Computer Organization and Architecture
Functional blocks of a computer, Data representation, Machine instructions and addressing modes, Instruction pipelining, x86 architecture, Memory system design: semiconductor memory technologies, Memory organization, Peripheral devices and their characteristics: Input-output subsystems, I/O device interface, I/O transfers, privileged and non-privileged instructions, software interrupts and exceptions. Programs and processes, Pipelining, Parallel Processors, Memory organization.
Programming, Data Structures, Design & Analysis of Algorithms
Programming in C. Object oriented Programming. Asymptotic worst-case time and space complexity. Performance measurements of Algorithm, Design techniques: Greedy, Brute-Force, Dynamic Programming, Branch and-Bound and Backtracking. .Linear and non linear data structures, Arrays, Stacks, Queue, Linked list and Tree, Graph, Recursion, ADT (Abstract Data type); Analysis, Tractable and Intractable Problems, Binary search trees, Binary heaps, Graph and Tree Algorithms, Algorithm dynamic programming and divide-and-conquer, Sorting, Searching, Hashing.
Formal Language & Automata Theory
Alphabet, Languages and grammars, Productions and derivation, Chomsky hierarchy of languages, Regular expressions and finite automata, Context-free grammars and pushdown automata, Context-sensitive languages, Regular and contex-free languages, Pumping lemma. Turing machines and undecidability.
Compiler Design
Lexical analysis, Syntax analysis, Semantic Analysis, Syntax-directed translation, Run-time Environment, Intermediate Code Generation, Code Improvement, Runtime environments, Intermediate code generation. Type systems.
System Software and Operating System
System Software: Machine, Assembly and High-Level Languages, Compilers and Interpreters, Loading, Linking and Relocation, Macros, Debuggers. Basics of Operating Systems: Operating System Structure, Operations and Services, System Calls. Operating System Design and Implementation, System Boot, Processes, Threads, Process Scheduling, Inter-process communication, Concurrency and synchronization. Deadlock, CPU scheduling, Memory management and virtual memory, I/O Hardware, File Management, Disk Management.
Database Management Systems
Database system architecture, Data models: network model, relational and object oriented data models, Integrity constraints, Data manipulation operations, Relational query languages: Relational algebra, Tuple and Domain relational calculus, SQL3, DDL and DML constructs, Open source and Commercial DBMS – MYSQL, ORACLE, DB2, SQL server, Relational database design: Domain and data dependency, Armstrong’s axioms, Normal forms, Dependency
preservation, Lossless design. Query processing and optimization: Evaluation of relational algebra expressions, Query equivalence, Join strategies, Query optimization algorithms. Storage strategies: Indices, B-trees, hashing. Transactions and concurrency control, Database Security,
Object oriented and object relational databases, Distributed databases, Data warehousing and Data mining.
Software Engineering and Design
Software Process Models, Software Requirements, Object oriented design using UML, Software Design, Software Quality, Estimation and Scheduling of Software Projects, Software Testing, Software Configuration Management.
Artificial Intelligence
Approaches to AI, Search-Heuristic, Knowledge Representation and Reasoning, Uncertainty, Learning, Planning, Natural Language Processing, Fuzzy Sets.
Computer Networks
Data communication Components. Representation of data and its flow Networks, Various Connection Topology, Protocols and Standards, OSI model, Transmission Media, Techniques for Bandwidth utilization, Concept of layering: Data Link Layer and Medium Access Sub Layer Flow and error control techniques. Network Layer: switching, IPv4/IPv6, routers and routing algorithms (distance vector, link state). Transport Layer: Process to Process Communication, TCP/UDP and sockets, congestion control. Application layer: Domain Name Space (DNS), DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP, SNMP, Bluetooth, Firewalls, Basic concepts of Cryptography. Basics of Wi-Fi.
Advanced Areas
Neural Networks and Deep Learning, Machine learning, Web Technologies and Internet, Information Theory and coding, Internet-of-Things, Data Analytics, Cloud Computing, Computer Cryptography & Network Security.
Note:
Duration for C.B.R.T : 75 Minutes
Maximum Marks for C.B.R.T : 75 Marks
