COMPUTER SCIENCE

COMPUTER SCIENCE SYLLABUS

(These syllabus may change from time to time. Please check with the relevant Public Service Commission website for any changes in the syllabus)

Paper-I
1. Computer Organization and Architecture: Number representation and computer arithmetic (fixed and floating point). Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Machine instructions and addressing modes, ALU and data-path, CPU and control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.

2. Computer Programming: Programming in C: Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps, File handling. Object oriented programming: Class, Object, inheritance, polymorphism and overriding, constructors & destructors, overloading, exception handling.

3. Software Engineering: Software development Life Cycle and different models, 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.

4. Operating System: Main functions and different types of OS. Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems. The Unix system: file systems, process Management, Bourne shell, shell variable, command line programming, filters and Unix commands, system calls.

5. Computer Networks: LAN, MAN, WAN, Transmission Media: Guided and unguided, Multiplexing (TDM, FDM, SDM & WDM) and switching techniques, Routing algorithms, Network reference models: OSI Model, TCP/IP Model, TCP/UDP and Sockets, IPv4 / IPv6, DNS , Network Security: Symmetric & Asymmetric Cryptography, Message Digest, Block and Stream Ciphers, One time pad, IP Security, E-Mail Security: PGP, IDS, Firewall.

Paper-II
1. Discrete Mathematical Structures: Counting principles, linear recurrence, mathematical induction, relations and functions, predicate and propositional logic. Graph: Definition and properties, connected graph, cycles & circuits, Tree: rooted tree, spanning trees. Models of Computability: Regular Expressions and Finite Automata. Context free grammars and Push down Automata. Regular and Context free languages, pumping lemma. Turing Machines and undecidability.

2. Data Structures and Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Best,Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and conquer; Tree and graph traversals, Spanning tree algorithms, Shortest paths; Hashing, Sorting, Searching. Basic concepts of complexity classes P, NP, NP-hard, NP-complete.

3. Database Management System: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normalization-1NF, 2NF, 3NF, BCNF and 4NF), Structured Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

4. System Software: Assemblers: one pass & two pass assemblers design, Macros & Macro processors, loaders & linkers, Text editors & debuggers, Program generators, Compiler & Interpreter, Different phases of compilation process.

5. Emerging Trends and Technologies: Concept of Parallel Computing (Parallel Virtual Machine and Message passing Interface) , Mobile Computing: Cellular system, Handoff, Location Management, Pervasive Computing, WLAN, ETechnologies: E-commerce framework and applications, Business models, electronic payment System: Digital Token, Smart Cards, Credit Cards, risks in epayment systems. Data Warehousing and Data Mining

COMPUTER SCIENCE MCQs

1. #define AND &&
#define OR !!
#define LE <=
#define GE >=
main()
{
char ch=‘D’ :
if ((ch GE 65 AND ch LE 90) OR (ch GE 97 AND ch LE 122))
printf(“alphabet”);
else
printf(“not an alphabets”):
}
(A) Compilation error (B) Not an alphabet
(C) Alphabet (D) None of the above
Ans: C

2. main()
{
static char * s[] = {“ice”, “green”, “core”, “please”}:
static char **ptr[] = {s+3, s+2, s+1,s}:
char ***p=ptr;
printf(“%s\n”, **++p);
printf(“%s\n”, *--*++p+3);
printf(“%s\n”, *p[–2]+3);
printf(“%s\n”,p[–1][–1]+1);
}
(A) ice
plea
gr
(B) core
ase
reen
(C) please
core
gr
(D) None
Ans: B

3. If every non key attribute is functionally depend on primary key, then the relation will be :
(A) First normal form (B) Second normal form (C) Third normal form (D) Fourth normal form
Ans: C

4. An attribute of one table is matching the primary key of another table, is known as :
(A) Secondary key (B) Foreign key (C) Candidate key (D) Composite key
Ans: B

5. In relational model, tuple is equivalent to :
(A) Record (B) Table (C) File (D) Field
Ans: A

6. Multiple inheritance in java can be achieved by :
(A) interface (B) polymorphism (C) abstraction (D) encapsulation
Ans: A

7. Which is the base class of all classes in java ?
(A) system.lang (B) class.object (C) java.lang.object (D) none of the above
Ans: C

8. ‘Hibernate’ in Windows XP/Windows 7 means :
(A) Shutdown the computer without closing the running application
(B) Shutdown the computer terminating all running applications
(C) Restart the computer
(D) Restart the computer in safe mode
Ans: A

9. Which of the interface contain all the method used for handling thread related operations in java ?
(A) Runnable interface (B) Math interface (C) System interface (D) Thread handling interface
Ans: D

10. Which of the package contains abstract keyword ?
(A) java.lang (B) java.util (C) java.io (D) java.system
Ans: A

11.What will happen if we press Function key F12 ?
(A) Open Dialog Box (B) Close Dialog Box (C) Exit Dialog Box (D) Save As Dialog Box
Ans: D