Block title
Block content

Programming_12주차2차시_Heap, Priority Queue (1)_ch16-1

admin's picture

{"id":"fSTwa1bLpT4MIRSmAfHdINomErM3z6uf","nid":"39243","type":"dr","drType":"media","title":"Programming_12주차2차시_Heap, Priority Queue (1)_ch16-1","body":"","url":"http://yucc.yu.ac.kr/em/59adcc882c28","info":{"error_return_url":"/?module=xn_commonsi&act=dispXn_commonsiReturnSelec&rt=http%3A%2F%2Fcb.mooc.yu.ac.kr%2Fapi%2Fgetxinicscontents%3FYeongNamDaeHagKyo%253ADongASiAUiIHae%255BPRIME_YU-MOOC%255D%253A12014","act":"dispXn_commonsiReturnSelec","mid":"","vid":"","content_id":"59adcc882c28","content_type":"2","title":"Programming_12주차

과제 1

admin's picture

{"id":"53qhrBNrMTOpOe5AMoLlJzL8hyhN1w57","nid":"39242","type":"dr","drType":"homework","title":"과제 1","body":"

Priority Queue 구현에 사용되는 complete binary tree가 binary search tree와 어떻게 다른가에 대하여 설명하라.

\n

 

","startDate":"2018-01-24T05:19:25.222Z","startTime":"00:00","start_hour":"00","start_minute":"00","endDate":"2018-11-30T15:00:00.000Z","endTime":"23:59","end_hour":"23","end_minute":"59","video":"false","sns":"false","ssz":"false","inputFile":"","score":"","evaluation":"","closed":false,"active":false,"selected":false}

과제 2

admin's picture

{"id":"pcDeILKCpHi1wqN074qPdl9B8EBOHT29","nid":"39241","type":"dr","drType":"homework","title":"과제 2","body":"

Binary search tree의 re-balancing을 위한 rotate_LL, rotate_RR, rotate_RL, rotate_LR에 대하여 각각 설명하라.

\n

 

","startDate":"2018-01-24T05:21:11.035Z","startTime":"00:00","start_hour":"00","start_minute":"00","endDate":"2018-11-30T15:00:00.000Z","endTime":"23:59","end_hour":"23","end_minute":"59","video":"false","sns":"false","ssz":"false","inputFile":"","score":"","evaluation":"","closed":false,"active":false,"selected":false}

Programming_12주차1차시_Generic Binary Tree Rebalancing_ch15-2

admin's picture

{"id":"cnGEMoLduvXhwbJreDm3t6MMao9N5ffZ","nid":"39240","type":"dr","drType":"media","title":"Programming_12주차1차시_Generic Binary Tree Rebalancing_ch15-2","body":"","url":"http://yucc.yu.ac.kr/em/59adc57e2d81c","info":{"error_return_url":"/?module=xn_commonsi&act=dispXn_commonsiReturnSelec&rt=http%3A%2F%2Fcb.mooc.yu.ac.kr%2Fapi%2Fgetxinicscontents%3FYeongNamDaeHagKyo%253ADongASiAUiIHae%255BPRIME_YU-MOOC%255D%253A12014","act":"dispXn_commonsiReturnSelec","mid":"","vid":"","content_id":"59adc57e2d81c","content_type":"2","title":"Progra

과제 1

admin's picture

{"id":"n51WEBFWFTdLBgoUbDLkKyIaWCViBrv6","nid":"39239","type":"dr","drType":"homework","title":"과제 1","body":"

Binary search tree에서 각 트리노드의 height와 height difference가 무엇이며, 어떻게 계산을 하는가?

\n

 

","startDate":"2018-01-24T05:19:25.222Z","startTime":"00:00","start_hour":"00","start_minute":"00","endDate":"2018-11-30T15:00:00.000Z","endTime":"23:59","end_hour":"23","end_minute":"59","video":"false","sns":"false","ssz":"false","inputFile":"","score":"","evaluation":"","closed":false,"active":false,"selected":false}

과제 2

admin's picture

{"id":"ERS5kSURAFXKHctZt4T4ITT3IXzVJSLK","nid":"39237","type":"dr","drType":"homework","title":"과제 2","body":"

Generic binary tree에서 in-order traversal이 어떻게 실행되는가에 대하여 설명하라.

\n

 

","startDate":"2018-01-24T05:21:11.035Z","startTime":"00:00","start_hour":"00","start_minute":"00","endDate":"2018-11-30T15:00:00.000Z","endTime":"23:59","end_hour":"23","end_minute":"59","video":"false","sns":"false","ssz":"false","inputFile":"","score":"","evaluation":"","closed":false,"active":false,"selected":false}

과제 1

admin's picture

{"id":"CZ1IZMWTJRWk3v68VeTDhsRROAAVPut5","nid":"39236","type":"dr","drType":"homework","title":"과제 1","body":"

Generic binary tree 구현을 위한 generic binary tree node class의 데이터 멤버와 멤버 함수에 대하여 설명하라.

\n

 

","startDate":"2018-01-24T05:19:25.222Z","startTime":"00:00","start_hour":"00","start_minute":"00","endDate":"2018-11-30T15:00:00.000Z","endTime":"23:59","end_hour":"23","end_minute":"59","video":"false","sns":"false","ssz":"false","inputFile":"","score":"","evaluation":"","closed":false,"active":false,"selected":false}

Programming_11주차3차시_Generic Binary Tree_ch15-1

admin's picture

{"id":"tPSy9eZvPZIBlCrVtWdm69XnMcMsrCVI","nid":"39234","type":"dr","drType":"media","title":"Programming_11주차3차시_Generic Binary Tree_ch15-1","body":"","url":"http://yucc.yu.ac.kr/em/59adc3ccd03cc","info":{"error_return_url":"/?module=xn_commonsi&act=dispXn_commonsiReturnSelec&rt=http%3A%2F%2Fcb.mooc.yu.ac.kr%2Fapi%2Fgetxinicscontents%3FYeongNamDaeHagKyo%253ADongASiAUiIHae%255BPRIME_YU-MOOC%255D%253A12014","act":"dispXn_commonsiReturnSelec","mid":"","vid":"","content_id":"59adc3ccd03cc","content_type":"2","title":"Programming_11주차3차

과제 2

admin's picture

{"id":"caImXIqUz5D7qyTnQkDBFfPUHshuHsGT","nid":"39233","type":"dr","drType":"homework","title":"과제 2","body":"

Doubly linked list를 기반으로 generic queue가 어떻게 구현될 수 있는가?

\n

 

","startDate":"2018-01-24T05:21:11.035Z","startTime":"00:00","start_hour":"00","start_minute":"00","endDate":"2018-11-30T15:00:00.000Z","endTime":"23:59","end_hour":"23","end_minute":"59","video":"false","sns":"false","ssz":"false","inputFile":"","score":"","evaluation":"","closed":false,"active":false,"selected":false}

과제 1

admin's picture

{"id":"8UVfFPCRT2DrAgTRTFUuoZ000AXNFtDZ","nid":"39232","type":"dr","drType":"homework","title":"과제 1","body":"

Doubly linked list를 기반으로 generic stack이 어떻게 구현될 수 있는가?

\n

 

","startDate":"2018-01-24T05:19:25.222Z","startTime":"00:00","start_hour":"00","start_minute":"00","endDate":"2018-11-30T15:00:00.000Z","endTime":"23:59","end_hour":"23","end_minute":"59","video":"false","sns":"false","ssz":"false","inputFile":"","score":"","evaluation":"","closed":false,"active":false,"selected":false}

top