Course Code: (R126)

COMPUTER SCIENCE & ENGINEERING

Syllabus for M.Phil. / Ph.D. Entrance Test (Objective Type Multiple Choice 100 Questions)
C & DATA STRUCTURES : Copyright www.examrace.com Elements of C, Tokens, identifiers, Data types in C, Control Structures in C, Sequence, Selection and iteration (s), Structured data types in C-arrays, struct, union, string, and Pointers.

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. COMPUTER ORGANISATION: Copyright www.examrace.com Propositional (Boolean) Logic, Predicate Logic, Well-formed-formulae (WFF), Satisfiability and Tautology, Logic Families: TTL, ECL and C-MOS gates, Boolean algebra and Minimization of Boolean functions, Flip-flops-types, 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. Database Management Systems: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, Indexing, B and B+ trees), Transactions and Concurrency control. Operating Systems: Main functions of operating systems. Multi Programming, Multiprocessing, and Multitasking. Virtual memory, Paging, Fragmentation, Mutual exclusion, Critical regions, Lock and unlock CPU scheduling, I/O scheduling, Resource scheduling, Deadlocks and their handling. UNIX: The Unix System, File system, Process management, Bourne shell, Shell variables, Command line programming. Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and Sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, Switches, Gateways, and Routers ,Routing algorithms, Congestion control.

MODEL QUESTIONS (Q. No. 1 - 20 Carry One Mark Each)

1. With every use of a memory allocation function, what function should be used to release allocated memory which is no longer needed? a.unalloc() b.free() c.dealloc() d.release() 2. void *ptr; myStruct myArray[10]; ptr = myArray; Which of the following is the correct way to increment the variable "ptr"? a. ptr = ptr + sizeof(myStruct); [Ans] b.++(int*)ptr; c. ptr = ptr + sizeof(myArray); d. ptr = ptr + sizeof(ptr); 3. The indirect change of the values of a variable in one module by another module is called a. internal change b. inter-module change c. side effect d. side-module update 4. Which of the following data structure is not linear data structure? a. Arrays b. Linked lists c. Both of above d. None of above 5. Arrays are best data structures a. for relatively permanent collections of data b. for the size of the structure and the data in the structure are constantly changing c. for both of above situation d. for none of above situation

6. A collection of lines that connects several devices is called .............. a. bus b. peripheral connection wires c. Both a and b d. internal wires 7. The access time of memory is ............... the time required for performing any single CPU operation.

a. Longer than b. Shorter than c. Negligible than d. Same as 8. A low memory can be connected to microprocessor by using a. Inter b. Reset c. Both a and b d. Ready 9. The addressing mode used in an instruction of the form ADD X, Y, is a. Absolute b. Direct c. Indirect d. Relative 10. Which of the following is not the level of data abstraction a. Physical level b. Logical level c. View level d. Critical level 11. The feature that database allows to access only certain records in database is: a. Forms b. Reports c. Queries d. Tables 12. Which filter method lets you filter the records that match the selected field? a. Filter by form b. Filter by selection c. Auto filter d. Advanced filter

13.Which of the following is crucial time while accessing data on the disk? a. Seek time b. Rotational time c. Transmission time d. Waiting time

14.Which of the following memory allocation scheme suffers from External fragmentation?

a. Segmentation b. Pure demand paging c. Swapping d. Paging 15.Which file system does Windows 95 typically use ? a. FAT16 b.FAT32 c.NTFS d.LMFS 16. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________. a. FCFS scheduling algorithm b. Round robin scheduling algorithm c. Shorest job first scheduling algorithm d. None of the above

17. Which of the following is not the layer of TCP/IP protocol? a. Application Layer b. Session Layer c. Transport Layer d. Internetwork layer

18. .......... addresses are reserved for multicasting. a. Class B b. Class C c. Class D d. Class E 19. Devices on one network can communicate with devices on another network via a .... a. File Server b. Utility Server c. Printer Server d. Gateway 20. Which layers of the OSI determines the interface often system with the user? a. Network b. Application c. Data link d. Session ***