Computer Organization & Architecture: Number representation and computer arithmetic, Logic functions, Minimization, Design and analysis of combinational and sequential circuits, Machine instructions and addressing modes, ALU and data path, CPU control design, Memory interface, I/O interface, Interrupt and DMA mode, Instruction pipelining, Cache and main memory, Secondary storage.
Programming and Data Structure: Programming in C, Basic data type, Storage classes specifier, Escape sequence, Functions, Recursion, Parameter passing mechanism, Structure & union, storage management, File handling. Abstract data type, Arrays, Stack, Queues, Link lists, Trees, Searching and sorting. Asymptotic notion, Notion of space and time complexity, Greedy approach, Dynamic programming, Divide and conquer, Trees and graph traversals, Spanning trees & shortest paths.
Operating System: Overview and History, Processes and Threads, Thread creation, Manipulation and Synchronization, Deadlock, CPU scheduling, Memory management and Virtual memory, File system, Protection and security. Unix and Linux operating systems
Databases: ER- model, Relational model (relational algebra, tuple calculus), Database design (integrity constrain, normal forms), Query languages (SQL), File structure (sequential file, indexing, B and B+ trees).
Computer Networks and Mobile Communication: LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IPv4 and Ipv6, Application layer protocols (icmp, dns, smtp, pop, ftp, http), Introduction to mobile computing, Consideration of data link layer, Channel allocation, Wireless LAN, Bluetooth, Security on mobile computing.
SAMPLE QUESTION PAPER
Duration: 90 minutes Maximum Marks: 100
Read the following instruction carefully:
i) This question paper contains all objective questions and each question carries 2 marks.
ii) More than one Ldb±ad against a question will be deemed as an incorrect response.
iii) Write your roll number and name at the specified locations.
iv) Use the blank pages given at the end of the question paper for rough work.
v) Calculators are allowed in the examination hall.
vi) Please check all the pages and report, if there is any discrepancy.
1. Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11101011
a) 11100111
b) 11100100
c) 11010111
d) 11011011
2. Which of the following statement is not correct in the context of C Language?
a) Both are procedural languages.
b) Both are based on 2k-calculus.
c) Both are declarative.
d) Both use horn-clauses.