UNIVERSITY OF KERALA - Marian Engineering College

More documents

Recommendations

Info

B.Tech Comp. Sc. & Engg., University of Kerala 60 08.702 DESIGN AND ANALYSIS <strong>OF</strong> ALGORITHMS 2 – 1 – 0 Module I (12 hours) Concepts in algorithm analysis – the efficiency of algorithms, average and worst – case analysis, Asymptotic notation, time and space complexity, Recurrences – substitution method, iteration method and master method, Analysis of sorting algorithms – insertion sorting, heaps, maintaining the heap property, building heap, heap sort algorithm, priority queues. Description of quick sort, randomised version of quick sort. Module II (13 hours) Height balanced trees – AVL TREES – Red-Black trees – Steps involved in insertion and deletion – rotations, Definition of B-trees – basic operations on B-trees, Algorithm for sets – Union and Find operations on disjoint sets, Graphs – DFS and BFS traversals, Spanning trees – Minimum Cost Spanning Trees, Kruskal’s and Prim’s algorithms, Shortest paths – single source shortest path algorithms, Topological sorting, strongly connected components. Module III (14 hours) Algorithm Design and analysis Techniques – Divide and Conquer techniques – Merge Sort, Integer multiplication problem, Strassen’s algorithm, Dynamic programming – Matrix multiplication problem, Greedy algorithms – Knapsack problem, Back tracking – 8 Queens problem, Branch and Bound – Travelling Salesman problem. Definitions and Basic concepts of NP-completeness and NP-Hardness. Study of NP- Complete problems. Text Books: 1. Introduction to Algorithms – Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest, PHI. 2. Fundamentals of Computer Algorithms – Horowitz and Sahni, Galgotia Publication. 3. Fundamentals of sequential and parallel algorithms – Kenneth A. Merman and Jerome L. Paul, Vikas Publishing Company Reference Books: 1. The Design and Analysis of Computer Algorithms – A.V Aho, J.E. Hopcroft and J.D. Ullman, Addison Wesley 2. Introduction to the design and analysis of algorithms – A. Levitin, Pearson Education 3. Computer algorithms : Introduction to design and Analysis – Sara Baase, Allen Van Gelder, Addison Wesley 4. Data Structures and Algorithms – A.V. Aho, J.E. Hopcroft and J.D. Ullman, Addison Wesley 5. Foundations of algorithms using C++ Pseudo code, 3 rd Edn – R. Neapolitan and K. Naimipour, Narosa. 6. Beginning Algorithms – S. Harris and J. Ross, Wiley Internal Continuous Assessment (Maximum Marks-50) 25 Marks - Tests (minimum 2) 15 Marks - Assignments (minimum 3) such as home work, problem solving, literature survey, seminar, term-project, software exercises, etc. 10 Marks - Regularity in the class University Examination Pattern PART A: Short answer questions 10 x 4 marks=40 marks All questions are compulsory. There should be at least three questions from each module and not more than four questions from any module. PART B: Descriptive/Analytical/Problem solving questions 3 x 20 marks=60 marks Candidates have to answer one question out of two or two questions out of four from each module. Maximum Total Marks: 100
B.Tech Comp. Sc. & Engg., University of Kerala 61 08.703 COMPUTER NETWORKS 2 – 1 – 0 Module I (12 hours) Introduction – Uses – Network Hardware – LAN –MAN – WAN, Internetworks – Network Software – Protocol hierarchies – Design issues for the layers – Interface & Service – Service Primitives. Reference models – OSI – TCP/IP. Data Link layer Design Issues – Flow Control and ARQ techniques. Data link Protocols – HDLC. DLL in Internet. Module II (13 hours) MAC Sub layer – IEEE 802 FOR LANs & MANs, IEEE 802.3, 802.4, 802.5. Bridges - Switches - High Speed LANs - Gigabit Ethernet. Wireless LANs - 802.11 a/b/g/n, 802.15. Network layer – Routing – Shortest path routing, Flooding, Distance Vector Routing, Link State Routing, RIP, OSPF, Routing for mobile hosts. Congestion control algorithms – QoS. Module III (14 hours) Internetworking – Network layer in internet. IP Addressing – Classless and Classful Addressing. Subnetting, Internet Control Protocols – ICMP, ARP, RARP, BOOTP. Internet Multicasting – IGMP, Exterior Routing Protocols – BGP . IPv6 – Addressing – Issues . Transport Layer – TCP & UDP. Application layer –DNS, Electronic mail, MIME, SNMP. Introduction to World Wide Web. VoIP - H.323, SIP standards, Gatekeeper. Text Books: 1. Computer Networks, 4 th Edn – Andrew S Tanenbaum, PHI. 2. Data Communications and Networking, 4 th Edn – Behrouz A Forouzan, Tata McGraw Hill Reference Books: 1. Data and Computer Communications , 8 th Edn. – William Stallings, PHI. 2. Hand book of Computer Communications Standards, Vol 1 – Willman Stallings, PHI. 3. An <strong>Engineering</strong> Approach to Computer Networks – Keshav, Addison Wesley. Internal Continuous Assessment (Maximum Marks-50) 25 Marks - Tests (minimum 2) 15 Marks - Assignments (minimum 3) such as home work, problem solving, literature survey, seminar, term-project, software exercises, etc. 10 Marks - Regularity in the class University Examination Pattern PART A: Short answer questions 10 x 4 marks=40 marks All questions are compulsory. There should be at least three questions from each module and not more than four questions from any module. PART B: Descriptive/Analytical/Problem solving questions 3 x 20 marks=60 marks Candidates have to answer one question out of two or two questions out of four from each module. Maximum Total Marks: 100
Page 1 and 2:
UNIVERSITY OF KERALA B. TECH. DEGRE
Page 3 and 4:
B.Tech Comp. Sc. & Engg., Universit
Page 5 and 6:
Page 7 and 8:
Page 9 and 10: B.Tech Comp. Sc. & Engg., Universit
Page 59: B.Tech Comp. Sc. & Engg., Universit
Page 103: B.Tech Comp. Sc. & Engg., Universit
show all

UNIVERSITY OF KERALA - Marian Engineering College

Create successful ePaper yourself

Delete template?

Save as template?