CIL Technical Paper(CS) Analysis 2016-2017 |
|||
Easy |
Medium |
Difficult |
|
Operating System |
1. RAID |
1. Shedulers 2. Bankers Theorem 3. SJF 4. CPU Scheduling 5. Cache memory 6. Longest Remaining Time Next 7. Fork() |
1. Binary semaphore variables 2. Binary semaphore |
C and Data Structures |
1. Infix,Pre and Postfix Notations(2) 2. fopen() 3. Double Ended Queue 4. Data Types 5. Two-dimensional array 6. Binary tree(3) 7. Pointers(2) 8. Operators 9. Data structures 10. Code Segment 11. Arithmetic expressions |
1. Code Segment 2. Infix,Pre and Postfix Notations 3. Pointers 4. One-dimensional array 5. Code Segment(2) |
1. Binary-Search |
Algorithms |
1. NP-Complete 2. Greedy techniques 3. TSP 4. Different Techniques 5. Number of spanning tree 6. Floyd’s algorithm 7. Sorting |
1. Matrix Multiplication 2. Huffman’s coding 3. Master theorem 4. MST 5. Radix sort algorithm 6. Huffman coding |
1. DP-Binomial coefficient-Time Complexity |
Computer Networks |
1. IPv6 2. FTP 3. SSH 4. Network Security terminology |
1. Minimum Hamming distance 2. IP Numbers(3) 3. Digital communication 4. Transposition Cipher 5. Network Layer 6. Digital Communication |
— |
Database Management System |
1. Participation & Cardinality(3) 2. Schedulers 3. Entity integrity constraint 4. BCNF 5. Schema types 6. DELETE Command 7. Total Specialization 8. B-Tree 9. Clustering index 10. Attributes |
1. Joins 2. Relational Algebra 3. Nonadditive 4. SQL |
— |
Digital logic Design |
1. Multiplexer 2. Law types 3. Counters 4. Memory parity error 5. Seven-bit code |
1. Number System(2) 2. Flip-Flop |
1. MOD-6 Counter |
Computer Organization |
1. Addressing Modes 2. Non-random-access memory 3. Addressing Mode |
1. Blocking factor 2. Cache-Direct mapping 3. Address and data lines |
— |
Theory of computation |
1. Type of grammar |
1. Regular Expression(2) 2. Regular Grammar |
— |
Compiler Design |
1. Types of Parsers 2. No.of Tokens |
1. Parsers 2. First & Follow |
— |
Discrete Mathematics |
1. Graph Theory 2. Biconnected graph |
1. Complex bipartite graph |
— |